ACM Home Page
Please provide us with feedback. Feedback
Energy efficient real-time data aggregation in wireless sensor networks
Full text PdfPdf (350 KB)
Source International Conference On Communications And Mobile Computing archive
Proceedings of the 2006 international conference on Wireless communications and mobile computing table of contents
Vancouver, British Columbia, Canada
SESSION: W1-A: medium access control #1 table of contents
Pages: 803 - 808  
Year of Publication: 2006
ISBN:1-59593-306-9
Authors
Yi Hu  City University of Hong Kong, Kowloon, Hong Kong
Nuo Yu  City University of Hong Kong, Kowloon, Hong Kong
Xiaohua Jia  City University of Hong Kong, Kowloon, Hong Kong
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 149,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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/1143549.1143710
What is a DOI?

ABSTRACT

This paper studies the energy efficient routing for data aggregation in wireless sensor networks. The data aggregation tree is a tree where the root of the tree is the data center called the sink node and the other nodes are sensor nodes. The sensor nodes sense the data and pass the data back to the data center along the data aggregation tree. We consider a real-time scenario where the data aggregation must be performed within a specified latency constraint. The objective is to minimize the overall energy cost of the sensor nodes for data aggregation subject to the latency constraint. The original contributions of the paper include: 1) Development of an analytic model for IEEE Standard 802.15.4 CSMA-CA to compute the worst case delay for a sensor node to aggregate the data from all its child nodes in the aggregation tree; 2) Proposal of a heuristic algorithm for constructing data aggregation trees that minimize total energy cost under the latency bound obtained from our analytical model. Extensive simulations have been conducted and the results verify the validity of the proposed analytical model and the superior performance of the proposed algorithm for constructing aggregation trees.


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
3
4
5
 
6
Standard for part 15.4: Wireless medium access control (MAC) and physical layer (PHY) specification for low rate wireless personal area networks (WPANS). IEEE Standard 802.15.4, IEEE, New York, NY, 2003.
 
7
 
8
J. Mišic, and V. B. Mišic, "Queuing analysis of sleep management in an 802.15.4 beacon enabled PAN", in IEEE/ACM First International Workshop on Broadband Wireless Services and Applications BroadWISE, (San Jose, CA), October 2004.
 
9
Y. Yu, B. Krishnamachari, and V. K. Prasanna, "Energy-latency tradeoffs for data gathering in wireless sensor networks", The 23rd Conference of IEEE Communication Society (INFOCOM), Hong Kong, SAR China, Mar 2004.
10
 
11
B. Prabhakar, E. Uysal-Biyikoglu, and A. E. Gamal, "Energy-efficient transmission over a wireless link via lazy packet scheduling", The 20th Conference of IEEE Communication Society (INFOCOM), Anchorage, Alaska, April 2001.
 
12
 
13
 
14
K. Akkaya, M. Younis, and M. Youssef, "Efficient aggregation for delay-constrained data in wireless sensor networks", The Proceedings of Internet Compatible QoS in Ad Hoc Wireless Networks, 2005.
 
15
L. J. Kleinrock, Queuing System, volume 1: Theory, Wiley, New York, 1972.
 
16
X. Cheng, A. Thaeler, G. Xue, and D. Chen, "TPS: a time-based positioning scheme for outdoor sensor networks", The 23rd Conference of IEEE Communication Society (INFOCOM), Hong Kong, SAR China, Mar 2004.
 
17
 
18
X. Cheng, X. Huang, D. Y. Li, W. L. Wu, and D. Z. Du, "A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks", Networks, Vol. 42, No. 4, pp. 202--208, 2003.
 
19
 
20
S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning trees and shortest-path trees", Algorithmica, Vol. 14, No. 4, pp. 305--321, 1995.
 
21
K. B. Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks", IEEE Transactions on Communication, Vol. 31, No. 3, pp. 343--351, 1983.
 
22
J. Misic and V. B. Misic, "Access delay for nodes with finite buffers in IEEE 802.15.4 beacon enabled PAN with uplink transmissions", Computer Communications J urnal, 2005.