ACM Home Page
Please provide us with feedback. Feedback
Energy efficient topology control in wireless sensor networks
Full text PdfPdf (81 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 44th annual Southeast regional conference table of contents
Melbourne, Florida
SESSION: Regular posters (non-student) table of contents
Pages: 784 - 785  
Year of Publication: 2006
ISBN:1-59593-315-8
Author
Rashid Bin Muhmmad  Kent State University, Kent, OH
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1185448.1185635
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

Due to the limited resources available to the nodes (hosts) in the ad hoc wireless networks, the network lifetime is crucial for network operations. One effective approach is to keep the distance small enough among nodes to maintain the efficient network topology. This paper concentrates on the problem of choosing locations for relay node (relay hosts) such that the distance between nodes is at most δ i.e., the range of nodes. The main contribution of this paper is an optimal algorithm for maximize network lifetime by computing the locations for additional nodes and to increase the network lifetime in terms of connectivity. The quantitative analysis showed that after the application of the algorithm, the network consumes ((1/2)n + O(n3/2)) less energy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
J. Chang and L. Tassiulas. Energy conserving routing in wireless ad-hoc networks. Proc. IEEE INFOCOM 2000.
 
3
D. Lee, J. S. Liebman, and J. Smith. An O(n log n) heuristic for Steiner minimal tree problems on the Euclidean metric. Networks, vol. 11, pp. 23--39, 1981.
 
4
P. Winter and M. Zachariasen. Concatenation-based greedy heuristic for the Euclidean Steiner tree problem. Algorithmica, vol. 25, pp. 418--437, 1999.
 
5
 
6
F. Hwang. D. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete Mathematics 53. Elsevier, Amsterdam, 1992.