Scheduling for information gathering on sensor network

Wireless Networks

Volumn 15, Issue 1, 2009, Pages 127-140

  Choi, Hongsik ^a   Wang, Ju ^a   Hughes, Esther A ^a  

^a Virginia Commonwealth University   (United States)

Author keywords

All to one information gathering; Hybrid network; Scheduling; Sensor network

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; METROPOLITAN AREA NETWORKS; PARALLEL ALGORITHMS; PIPELINES; PORTALS; SCHEDULING; SENSOR NETWORKS; SENSORS; TOPOLOGY; TRANSMISSIONS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ALL-TO-ONE INFORMATION GATHERING; DISTRIBUTED ALGORITHMS; GRAPH REPRESENTATIONS; HYBRID NETWORK; MINIMUM TIMES; NODE TRANSMISSIONS; NP-HARD; OPTIMAL TRANSMISSION SCHEDULES; PARALLEL TRANSMISSIONS; RTS/CTS; SCHEDULING PROBLEMS; SIMULATED RESULTS; SINK NODES; TRANSMISSION TIMES; TREE TOPOLOGIES;

SCHEDULING ALGORITHMS;

EID: 58149479493     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-007-0050-9     Document Type: Article

References (10)

1. Younis, O., & Fahmy, S. (2004). Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach. In Proceedings of IEEE INFOCOM, Vol. 1, Hong Kong, March 2004.
2. Gandham, S., Zhang, Y., & Huang, Q. (2006). Distributed minimal time convergecast scheduling in wireless sensor networks. In ICDCS'06, Lisboa, Portugal, July 4-7, 2006.
3. Nguyen, G. D., Wieselthier, J. E., & Ephremides, A. (2003). Multiple-access for multiple destinations in ad-hoc networks. In Proceedings WiOpt 03, Sophia-Antipolis, France, March 2003.
4. A. Ephremides T. Truong 1990 Scheduling broadcasts in multihop radio networks IEEE Transactions on Communications 38 4 456 460
5. P. Gupta P. R. Kumar 2000 The capacity of wireless networks IEEE Transactions on Information Theory 46 2 388 404
6. Song, W.-Z., Yuani, F., & LaHusen, R. (2006). Time-optimum packet scheduling for many-to-one routing in wireless sensor networks. IEEE MASS, Vancouver, Canada, October 9-12, 2006.
7. Y. C. Tay K. Jamieson H. Balakrishnan 2004 Collision-minimizing CSMA and its applications to wireless sensor networks IEEE Journal on Selected Areas in Communications 22 6 1048 1057
8. Y. E. Sagduyu A. Ephremides 2004 The problem of medium access control in wireless sensor networks IEEE Wireless Communications 11 6 44 53
9. Garey, M. A., & Johnson, D. S. (1979). Computer and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman and Company.
10. S. Khuller B. Raghavachari N. Young 1995 Balancing minimum spanning and shortest path trees Algorithmica 14 4 305 321