Energy efficient routing and scheduling for real-time data aggregation in WSNs

Computer Communications

Volumn 29, Issue 17, 2006, Pages 3527-3535

  Du, Hongwei ^a   Hu, Xiaodong ^b   Jia, Xiaohua ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Data aggregation; Energy efficiency; Wireless sensor network

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ENERGY EFFICIENCY; ROUTERS; SCHEDULING; WIRELESS TELECOMMUNICATION SYSTEMS;

DATA AGGREGATION; DATA AGGREGATION TREE; LATENCY CONSTRAINT; WIRELESS SENSOR NETWORK;

TELECOMMUNICATION NETWORKS;

EID: 33750299008     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2006.01.032     Document Type: Article

References (17)

1. Culler D., Estrin D., and Srivastava M. Overview of sensor networks. Computer 37 8 (2004) 41-49
2. A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, J. Anderson, Wireless sensor networks for habitat monitoring, in: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, USA, 2002, pp. 88-97.
3. C. Intanagonwiwat, R. Govindan, D. Estrin, 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 (MOBICOM), Boston, MA, August 2000.
4. Pottie G., and Kaiser W. Wireless sensor networks. Communications of the ACM 43 5 (2000) 51-58
5. S. Ganeriwal, R. Kumar, M. Srivastava, Timing-sync protocol for sensor networks, in: Proceeding of the 1st ACM Conference on Embedded Networked Sensor Systems (ACM SENSYS), Los Angeles, CA, November 2003.
6. Yang Yu, B. Krishnamachari, V.K. Prasanna, Energy-latency tradeoffs for data gathering in wireless sensor networks, in: Proceedings of the 23rd Conference of IEEE Communication Society (INFOCOM), Hong Kong, SAR China, March 2004.
7. C. Schurgers, O. Aberhorne, M.B. Srivastava, Modulation scaling for energy-aware communication systems, in: Proceedings of International Symposium on Low Power Electronics and Design (ISLPED), Huntington Beach, CA, August 2001.
8. B. Prabhakar, E. Uysal-Biyikoglu, A.E. Gamal, Energy-efficient transmission over a wireless link via lazy packet scheduling, in: Proceedings of the 20th Conference of IEEE Communication Society (INFOCOM), Anchorage, Alaska, April 2001.
9. C. Intanagonwiwat, D. Estrin, R. Govindan, J. Heidemann, Impact of network density on data aggregation in wireless sensor networks, in: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), Austria, July 2002.
10. C.-Y. Lu, B.M. Blum, T.F. Abdelzaher, J.A. Stankovic, T. He, RAP: a real-time communication architecture for large-scale wireless sensor networks, in: Proceedings of the 8th IEEE Real-Time and Embedded Technology and Application Symposium (RTAS), San Jose, CA, September 2002.
11. K. Kalpakis, K. Dasgupta, P. Namjoshi, Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks, in: Proceedings of the International Journal of Computer and Telecommunications Networking, vol. 42, No. 6, 2003, pp. 697-716.
12. X. Cheng, A. Thaeler, G. Xue, D. Chen, TPS: a time-based positioning scheme for outdoor sensor networks, in: Proceedings of the 23rd Conference of IEEE Communication Society (INFOCOM), Hong Kong, SAR China, March 2004.
13. W. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocols for wireless microsensor networks, in: Proceedings of the 34th Hawaiian International Conference on Systems Science (HICSS), Island of Maui, Hawaiian, January 2000.
14. Cheng X.-Z., Huang X., Li D.-Y., Wu W.-L., and Du D.-Z. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42 4 (2003) 202-208
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
16. Khuller S., Raghavachari B., and Young N. Balancing minimum spanning trees and shortest-path trees. Algorithmica 14 4 (1995) 305-321
17. Bharath-Kumar K., and Jaffe J.M. Routing to multiple destinations in computer networks. IEEE Transactions on Communication 31 3 (1983) 343-351