Information-Driven task routing for network management in wireless sensor networks

Authors:
Yu Liu;Yumei Wang;Lin Zhang;Chan-hyun Youn
Affiliations:
School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;Information and Communications University, Republic of Korea
Venue:
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
Year:
2006

Citing 7
Cited 0

Elements of information theory

Elements of information theory
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach

Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
Directed diffusion for wireless sensor networking

IEEE/ACM Transactions on Networking (TON)
Collaborative in-network processing for target tracking

EURASIP Journal on Applied Signal Processing
Information-directed routing in ad hoc sensor networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks (WSNs) consist of a large collection of small nodes providing collaborative and distributed sensing ability in unpredictable environments. Given their unattended nature, it is important for the routing algorithm in WSN to deal well with the node failures, resource depletion, and other abnormality. In this paper, an information-driven task routing (IDTR) is introduced for WSN with their specific application to network management. In WSN, a query for the location of the target may be launched from a proxy, which requires the network to collect and transfer the information to an exit node, while keeping the whole communication cost small. The proposed IDTR-based heuristic search algorithm evaluates the expected mutual information of the neighbor nodes, and selects the one that has the maximum information contribution and satisfies the constraint of communication cost as the next hop. In order to avoid the effects of any possible sensor holes, it will calculate the information contribution of all the M hop neighbor nodes to bypass the holes. Simulation results show that IDTR-based heuristic search algorithm achieves the tradeoff between the data communication cost and the information aggregation gain.