Paper Info
Title
A Hierarchical Adaptive Routing Algorithm Of Wireless Sensor Network Based On Software-Defined Network
Abstract
The target tracking issue has always been the hotspot in wireless sensor network, and with the emergence of new application in multimedia and real-time transmission, new requirements are proposed for transmission performance of target tracking routing; therefore, a software-defined network-based hierarchical adaptive routing algorithm of wireless sensor network is proposed in this article. The algorithm takes into account both network energy and throughput, uses Hopfield neural network algorithm to calculate the optimal path among adjacent clusters as a local routing (LR), and builds the Multi-choice Knapsack Problem model based on local paths to realize end-to-end global routing, in order to realize the routing of tracking target information under multi-objective conditions. The test bed includes physical and simulation tests. Experimental results show that the proposed algorithm is superior to low energy adaptive clustering hierarchy (LEACH) and Sequential Assignment Routing under different test scenarios.
Year
DOI
Venue
2018
10.1177/1550147718794617
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS
Keywords
Field
DocType
Adaptive routing algorithm, wireless sensor network, software-defined network, target tracking
Adaptive routing algorithm,Computer science,Scenario testing,Knapsack problem,Throughput,Software-defined networking,Artificial neural network,Wireless sensor network,Hotspot (Wi-Fi),Distributed computing
Journal
Volume
Issue
ISSN
14
8
1550-1477
Citations 
PageRank 
References 
0
0.34
20
Authors
3
Name
Order
Citations
PageRank
Zhong-Nan Zhao101.01
Jian Wang217973.08
Hong-Wei Guo300.34