A Novel Energy-Efficient Backbone for Sensor Networks
The construction of backbone is a fundamental problem in sensor networks. As being critical to routing, data fusion and query broadcasting, the backbone should contain as fewer nodes as possible. Meanwhile, it also should be power-efficient in order to prolong its lifetime. In this paper, we propose a novel design of backbone for sensor networks by minimizing its total transmission cost. We term this kind of backbone Minimum-Weight Backbone (simply MWB). The construction of MWB is proved to be NP-Complete. Two heuristic algorithms (one is centralized and the other is distributed) are developed for constructing such backbone. The centralized algorithm, executed at the base station, is to find an optimal backbone by using the information of all nodes and links in the network. The distributed algorithm run at each node, however, uses the information of its neighbors and two-hop neighbors to determine whether it should be included in the backbone. Simulated experiments are conducted to evaluate the novel backbone, and performance comparisons are also done with the existing schemes.
KeywordsSensor Network Sensor Node Span Tree Network Lifetime Centralize Algorithm
Unable to display preview. Download preview PDF.
- 3.Adjih, C., Jacquet, P., Viennot, L.: Computing connected dominated sets with multipoint relays. Ad Hoc and Sensor Wireless Networks 1 (January 2005)Google Scholar
- 5.Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (2000)Google Scholar
- 6.Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications (2002)Google Scholar
- 7.Manjeshwar, A., Agrawal, D.: Teen: A routing protocol for enhanced efficiency in wireless sensor networks. In: Proc. First Int. Workshop Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing (2001)Google Scholar
- 8.Cheng, X., Ding, M., Chen, D.: An approximation algorithm for connected dominating set in ad hoc networks. In: Proc. of International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor, and Peer-to-Peer Networks (2004)Google Scholar
- 9.Chen, X., Shen, J.: Reducing connected dominating set size with multipoint relays in ad hoc wireless networks. In: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (2004)Google Scholar
- 10.Laouiti, A., Qayyum, A., Viennot., L.: An efficient technique for flooding in mobile wireless networks. In: 35th Annual Hawaii International Conference on System Sciences (HICSS 2001) (2001)Google Scholar
- 11.Garey, M.R., Johnson, D.S.: Computer and intractability: A guide to the theory of np-completeness. W. H. Freeman, New York (1979)Google Scholar