Energy optimization for chain-based data gathering in wireless sensor networks

International Journal of Communication Systems

Volumn 20, Issue 7, 2007, Pages 857-874

  Yen, Li Hsing ^a   Cai, Ming Zhou ^b   Cheng, Yang Min ^b   Yang, Ping Yuan ^b  

^a NATIONAL UNIVERSITY OF KAOHSIUNG   (Taiwan)

^b CHUNG HUA UNIVERSITY   (Taiwan)

Author keywords

Data gathering; Energy consumption; Logical chain; Wireless sensor networks

Indexed keywords

BASE STATIONS; ELECTRIC POWER UTILIZATION; ENERGY EFFICIENCY; OPTIMIZATION; SCHEDULING; TELECOMMUNICATION LINKS;

DATA GATHERING; LOGICAL CHAINS; POWER CONSERVATION; SENSOR COMMUNICATIONS;

WIRELESS SENSOR NETWORKS;

EID: 34547364483     PISSN: 10745351     EISSN: 10991131     Source Type: Journal    
DOI: 10.1002/dac.848     Document Type: Article

References (16)

1. Heinzelman WR, Chandrakasan A. Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks. Proceedings of the 33rd Annual Hawaii International Conference on System Sciences. Hawaii, U.S.A., January 2000.
2. Handy M, Haase M, Timmermann D. Low energy adaptive clustering hierarchy with deterministic cluster-head selection. Proceedings of the 4th International Workshop on Mobile and Wireless Communications Network, Stockholm, Sweden, September 2002; 368-372.
3. Annamalai V, Gupta SKS, Schwiebert L. On tree-based convergecasting in wireless sensor networks. IEEE Wireless Communications and Networking Conference, New Orleans, U.S.A., March 2003.
4. Upadhyayula S, Annamalai V, Gupta SKS. A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks. Proceedings of the Globecom, San Fransisco, December 2003.
5. Lindsey S, Raghavendra C, Sivalingam KM. Data gathering algorithms in sensor networks using energy metrics. IEEE Transactions on Parallel and Distributed Systems 2002; 13(9):924-935.
6. Du K, Wu J, Zhou D. Chain-based protocols for data broadcasting and gathering in the sensor networks. Proceedings of the International Parallel and Distributed Processing Symposium, Nice, France, April 2003.
7. Lindsey S, Raghavendra CS. PEGASIS: Power efficient gathering in sensor information systems. Proceedings of the 2002 IEEE Aerospace Conference, Big Sky, MT, March 2002.
8. Rappaport TS. Wireless Communications: Principles and Practice (2nd edn). Prentice-Hall: Englewood Cliffs, NJ, 2002.
9. Cormen TH, Leiserson CE, Rivest RL. Introduction to Algorithms. MIT Press: Cambridge, MA, 1990.
10. Liu CL. Elements of Discrete Mathematics (2nd edn). McGraw-Hill: New York, 1985; 145-435.
11. Christodes N. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
12. Chang E, Roberts R. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Communications of the ACM 1979; 22(5):281-283.
13. Higham L, Przytycka T. A simple, efficient algorithm for maximum finding on rings. In Distributed Algorithms 7th International Workshop, WDAG '93, Schiper A (ed.). Springer: Berlin, Lausanne, Switzerland, September 1993; 249-263
14. (also published in Lecture Notes in Computer Science, vol. 725).
15. Hirschberg DS, Sinclair JB. Decentralized extrema-finding in circular configurations of processes. Communications of the ACM 1980; 23(11):627-628.
16. Perterson GL. An O(n log n) unidirectional distributed algorithm for the circular extrema problem. ACM Transactions on Programming Languages and Systems 1982; 4(4):758-762.