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.
Supported by National Science Foundation of China (NSFC) with contract number (60502036).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shah, R.C., Rabaey, J.M.: Energy aware routing for low energy ad hoc sensor networks. In: Proc. IEEE Wireless Commun. Netw. Conf., Orlando, FL, pp. 350–355 (2001)
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking 11(1), 2–16 (2003)
Stojmenovic, I., Lin, X.: Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans. Parallel Distrib. Syst. 12(10), 1023–1032 (2001)
Karp, B., Kung, H.T.: Greedy perimeter stateless routing for wireless networks. In: Proc. MobiCom, Boston, MA, pp. 243–254 (2000)
Manyika, J., Durrant-Whyte, H.: Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach. Ellis Horwood, New York (1994)
Feng, Z., Jaewon, S., Reich, J.: Information-driven dynamic sensor collaboration. IEEE Signal Processing Magazine 19(2), 61–72 (2002)
Liu, J., Feng, Z., Petrovic, D.: Information-directed routing in ad hoc sensor networks. IEEE Journal on Selected Areas in Communications 23(4), 851–861 (2005)
Liu, J., Reich, J.E., Feng, Z.: Collaborative in-network processing for target tracking. EURASIP, J. Appl. Signal Process 2003, 378–391 (2003)
Haykin, S.: Adaptive Filter Theory, 4th edn. Prentice Hall Inc., Englewood Cliffs (2002)
Chu, M., Haussecker, H., Feng, Z.: Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks. Int. J. High-Performance Comput. Appl. 16(3), 293–313 (2002)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Wang, Y., Zhang, L., Youn, Ch. (2006). Information-Driven Task Routing for Network Management in Wireless Sensor Networks. In: Kim, YT., Takano, M. (eds) Management of Convergence Networks and Services. APNOMS 2006. Lecture Notes in Computer Science, vol 4238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11876601_3
Download citation
DOI: https://doi.org/10.1007/11876601_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45776-3
Online ISBN: 978-3-540-46233-0
eBook Packages: Computer ScienceComputer Science (R0)