Improved bounds for data-gathering time in sensor networks

Computer Communications

Volumn 31, Issue 17, 2008, Pages 4026-4034

  Revah, Yoram ^a   Segal, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Half duplex one port model; Optimization problems; Scheduling algorithms

Indexed keywords

BASE STATIONS; COMPUTER NETWORKS; CONTROL THEORY; DATA ACQUISITION; DATA STORAGE EQUIPMENT; ELECTRIC NETWORK TOPOLOGY; KETONES; MATHEMATICAL MODELS; NETWORK PROTOCOLS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; SCHEDULING; SENSORS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

BATTLEFIELD SURVEILLANCES; COMPLETION TIMES; DATA COLLECTIONS; DATA GATHERINGS; EFFICIENT; ENVIRONMENTAL MONITORING; FUNDAMENTAL OPERATIONS; HALF-DUPLEX ONE-PORT MODEL; HAZARD DETECTIONS; LOWER BOUNDS; NETWORK MODELS; NETWORK TOPOLOGIES; OPTIMIZATION PROBLEMS; PACKET DELIVERIES; PACKET ROUTING; PARTITION PROBLEMS; POLYNOMIAL TIMES; ROUTING; SENSOR NETWORK APPLICATIONS; STAR NETWORKS; TARGET FUNCTIONS; TRANSMISSION SCHEDULES;

SENSOR NETWORKS;

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

References (35)

1. J.R. Argy, L.P. Clare, G.J. Potty, N.P. Romanov, Development platform for self-organizing wireless sensor networks, in: Proceedings of SPIE, Unattended Ground Sensor Technologies and Applications, vol. 3713, 1999, pp. 257-268.
2. Sen A., and Huson M. A new model for scheduling radio packet networks. Wireless Networks 3 (1997) 77-82
3. Hammond J., and Russell H. Properties of a transmission assignment algorithm for multiple-hop packet radio networks. IEEE Transactions Wireless Communications 3 4 (2004) 1048-1052
4. I. Rhee, J. Lee, Distributed scalable TDMA scheduling algorithm, NCSU Technical Report 2004-4-14, Department of Computer Science, North Carolina State University.
5. A. Chou, V. Li, Fair spatial TDMA channel access protocols for multihop radio networks, in: Proc. IEEE INFOCOM, 1991, pp. 1064-1073.
6. Ramanathan S. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5 (1999) 81-94
7. Wang G., and Ansari N. Optimal broadcast scheduling in packet radio networks using mean field annealing. IEEE Journal on Selected Areas in Communications 15 2 (1997) 250-260
8. X. Ma, E. Lloyd, An incremental algorithm for broadcast scheduling in packet radio networks, Proc. IEEE MILCOM, 1998.
9. X. Ma, E. Lloyd, A distributed protocol for adaptive broadcast scheduling in packet radio networks, Proc. ACM/IEEE DIALM for mobility, 1998.
10. Chlamtac I., and Farago A. Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Transactions on Networking 2 1 (1994) 23-29
11. I. Chlamtac, S. Kutten, A spatial reuse TDMA/FDMA for mobile multi-hop radio networks, in: Proc. IEEE INFOCOM, vol. 1, 1985, pp. 389-394.
12. F. Ali, P. Appani, J. Hammond, V. Mehta, D. Noneaker, H. Russel, Distributed and adaptive TDMA algorithms for multi-hop mobile networks, in: Proc. IEEE MILCOM, 2002, pp. 546-551.
13. Ephremides A., and Truong. Scheduling broadcast in multihop radio networks. IEEE Transactions on Communications 38 4 (1990) 456-460
14. X. Ma, E. Lloyd, Evaluation of a distributed broadcast scheduling protocol for multihop radio networks, in: Proc. IEEE MILCOM, 2001, pp. 1-7.
15. I. Chlamtac, A. Lerner, Link allocation protocol for mobile multi-hop radio networks, in: Proc. IEEE NFOCOM, 1985, pp. 238-242.
16. R. Liu, E. Lloyd, A distributed protocol for adaptive link scheduling in ad-hoc networks, in: Proc. IASTED International Conf. on Wireless and Optical Communications, 2001, pp. 43-48.
17. Ramanathan S., and Lloyd E. Scheduling algorithms for multihop radio networks. IEEE/ACM Transactions on Networking 1 2 (1993) 166-177
18. L. Bao, J.J. Aceves, Channel access scheduling in ad-hoc networks with unidirectional links, in: Proc. ACM/IEEE DIALM for mobility, 1998.
19. C. Busch, M. Herlihy, R. Wattenhofer, Hard-potato routing, in: Proc. STOC, 2000, pp. 278-285.
20. Y. Mansour, B. Patt-Shamir, Many to one packet routing on grids, in: Proc. STOC, 1995, pp. 258-267.
21. Busch C. O(Congestion + Dilation) hot-potato routing on leveled networks. Theory of Computing Systems 37 (2004) 371-396
22. C. Busch, M. Ismail, M. Mavronicolas, R. Wattenhofer, Greedy O(C+D) hot-potato routing on trees, Technical report TR, 03-07, Rensselaer Computer Science Department, 2003.
23. Herlery K., Pietracaprina A., and Pucci G. One-to-many routing on the mesh. SPAA (2001) 31-37
24. C. Busch, M. Herlihy, R. Wattenhofer, Randomized greedy hot-potato routing, in: Proc. SODA, 2000, pp. 458-466.
25. Rajasekaran S., and Tsantilas T. Optimal routing algorithms for mesh-connected processor arrays. VLSI Algorithms and Architectures (1988) 411-422
26. S. Dolev, E. Kranakis, D. Krizanc, Baked potatoes: deadlock prevention via scheduling, in: Proc. PODC, 1996, pp. 210-219.
27. A. Ben-Dor, S. Halevi, A. Schuster, Greedy hot-potato routing, in: Proc. PODC, 1994, pp. 225-234.
28. A. Sridhran, B. Krishnamachari, Max-Min fair collision-free scheduling for wireless sensor networks, in: Proc. IEEE on Performance, Computing and Communications, 2004, pp. 585-590.
29. Lau F.C.M., and Zhang S.H. Fast gossiping in Squar meshes/Tori with bounded-size packet. IEEE Transaction on Parallel and Distributed Systems 13 4 (2002)
30. D.W. Krumme, G. Cybenko, K.N. Venkataraman, Gossiping in minimal time, Technical Report 1027, Center for Supercomputing Research and Development, August, 1990.
31. J. Gronkvist, Traffic controlled reuse TDMA in multi-hop radio networks, in: Proc. IEEE PIMRC, 1998, pp. 1203-1207.
32. Florens C., and McEliece R. Lower bounds on data collection time in sensory networks. IEEE Journal on Selected Areas in Communications 22 6 (2004) 1110-1120
33. Rappaport T.S. Wireless Communications, Principles and Practices (1996), Prentice-Hall, Upper Saddle River, NJ
34. Garey M.R., and Johnson D.V. Computers and Intractability (1979), Freenam, New York
35. N. Naaman, Scheduling and packing problems in centralized access networks, Ph.D. Dissertation, Electrical Engr. Dept, Technion, 2002.