Deterministic Energy Conserving Algorithms for Wireless Sensor Networks
Bin Muhammad, R.
Networking, Sensing and Control, 2006. ICNSC apos;06. Proceedings of the 2006 IEEE International Conference on
Volume , Issue , 0-0 0 Page(s):324 - 329
Digital Object Identifier   10.1109/ICNSC.2006.1673166
Summary: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(n^3/2)) less energy

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.