Title :
Deterministic Energy Conserving Algorithms for Wireless Sensor Networks
Author :
Muhammad, Rashid Bin
Author_Institution :
Dept. of Comput. Sci., Kent State Univ., OH
Abstract :
In this paper we study the problem of maintaining energy efficient topology from the perspective of computational geometry. The paper presented two algorithms that keep the distance small enough among sensors to maintain energy efficient topology. In the design of wireless sensor network, we are given n sensors in the Euclidean plane. The problem is how to increase the network lifetime by choosing the locations of relay sensors such that the distances between sensors are at most some delta i.e., the range of the sensors. The algorithm efficiently combines the classical approach of Steiner tree for 3- and 4-terminals with the concepts based on the Prim´s and Kruskal´s algorithms. The quantitative analysis shows that after the application of the algorithm the network consumes ((1/2)n + O(n3/2)) less energy
Keywords :
computational geometry; energy conservation; telecommunication network routing; telecommunication network topology; wireless sensor networks; Euclidean plane; Kruskal algorithm; Prim algorithm; Steiner tree; computational geometry; deterministic energy conserving algorithms; energy efficient topology; network lifetime; quantitative analysis; relay sensors; wireless sensor networks; Algorithm design and analysis; Computational geometry; Energy efficiency; Military computing; Network topology; Protective relaying; Relays; Sensor phenomena and characterization; Spread spectrum communication; Wireless sensor networks;
Conference_Titel :
Networking, Sensing and Control, 2006. ICNSC '06. Proceedings of the 2006 IEEE International Conference on
Conference_Location :
Ft. Lauderdale, FL
Print_ISBN :
1-4244-0065-1
DOI :
10.1109/ICNSC.2006.1673166