Improved algorithms for data-gathering time in sensor networks II: Ring, Tree, and Grid topologies

International Journal of Distributed Sensor Networks

Volumn 5, Issue 5, 2009, Pages 463-479

  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

BATTLEFIELD SURVEILLANCE; COMPLETION TIME; DATA COLLECTION; DATA GATHERING; DIRECTIONAL ANTENNA; ENVIRONMENTAL MONITORING; GRID NETWORK; GRID TOPOLOGY; HALF-DUPLEX ONE-PORT MODEL; HAZARD DETECTION; IMPROVED ALGORITHM; NETWORK MODELS; PACKET DELIVERY; POLYNOMIAL-TIME; RETRANSMISSIONS; SENSOR WEB; SHORTEST PATH;

OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS; SENSOR NODES; SENSORS; TELECOMMUNICATION EQUIPMENT; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

SENSOR NETWORKS;

EID: 70449674566     PISSN: 15501329     EISSN: 15501477     Source Type: Journal    
DOI: 10.1080/15501320902876071     Document Type: Article

References (44)

1. J. R. Argy, L. P. Clare, G. J. Potty, and N. P. Romanov, "Development platform for selforganizing wireless sensor networks," Proceedings of SPIE, Unattended Ground Sensor Technologies and Applications, vol. 3713, pp. 257-268, 1999.
2. D. Estrin, L. Girod, G. Pottie, and M. Srivastava, "Instrumenting the world with wireless sensor networks," in Proceedings of ICASSP 2001, Salt Lake City, Utah, May 2001.
3. U. Centintemel, A. Filinders, and Y. Sun, "Power-efficent data dissemination in wireless sensor networks," MobiDE' 03, September 19, 2003, San Diego, California.
4. Y. Revah and M. Segal, "Improved algorithm for data-gathering time in sensor networks," accepted to Elsevier Computer Commuications, 2008.
5. A. Sen and M. Huson, "A new model for scheduling radio packet networks," Wireless Networks, vol. 3, pp. 77-82, 1997.
6. J. Hammond and H. Russell, "Properties of a transmission assignment algorithm for multiplehop packet radio networks," IEEE Transactions Wireless Communications, vol. 3, no. 4, pp. 1048-1052, 2004.
7. I. Rhee and J. Lee, "Distributed scalable TDMA scheduling algorithm", NCSU Tech. Rep. 2004-4-14, Department of Computer Science, North Carolina State University.
8. A. Chou and V. Li, "Fair spatial TDMA channel access protocols for multihop radio networks," Proc. IEEE INFOCOM, pp. 1064-1073, 1991.
9. S. Ramanathan, "A unified framework and algorithm for channel assignment in wireless Networks," Wireless Networks, vol 5, pp. 81-94, 1999.
10. G. Wang and N. Ansari, "Optimal broadcast scheduling in packet radio networks using mean field annealing," IEEE Journal on Selected Areas in Communications, vol. 15, no. 2, pp. 250-260, 1997.
11. X. Ma and E. Lloyd, "An incremental algorithm for broadcast scheduling in packet radio networks," Proc. IEEE MILCOM, 1998.
12. X. Ma and E. Lloyd, "A distributed protocol for adaptive broadcast scheduling in packet radio networks," Proc. ACM/IEEE DIALM for Mobility, 1998.
13. I. Chlamtac and A. Farago, "Making transmission schedules immune to topology changes in multi-hop packet radio networks," IEEE/ACM Transactions on Networking, vol. 2, no. 1, pp. 23-29, 1994.
14. I. Chlamtac and S. Kutten, "A spatial reuse TDMA/FDMA for mobile multi-hop radio networks", Proc. IEEE INFOCOM, vol. 1, pp. 389-394, 1985.
15. F. Ali, P. Appani, J. Hammond, V. Mehta, D. Noneaker and H. Russel, "Distributed and adaptive TDMA algorithms for multi-hop mobile networks," Proc. IEEE MILCOM, pp. 546-551, 2002.
16. A. Ephremides and Truong, "Scheduling broadcast in multihop radio networks," IEEE Transactions on Communications, vol. 38, no. 4, pp. 456-460, 1990.
17. X. Ma and E. Lloyd, " Evaluation of a distributed broadcast scheduling protocol for multihop radio networks," Proc. IEEE MILCOM, pp. 1-7, 2001.
18. I. Chlamtac and A. Lerner, "A Link allocation protocol for mobile multi-hop radio networks," Proc. IEEE INFOCOM, pp. 238-242, 1985.
19. R. Liu and E. Lloyd, "A distributed protocol for adaptive link scheduling in ad-hoc networks," Proc. IASTED International Conf. on Wireless and Optical Communications, pp. 43-48, 2001.
20. S. Ramanathan, and E. Lloyd, "Scheduling Algorithms for Multihop Radio Networks", IEEE/ACM Transactions on Networking, vol. 1, no. 2, pp. 166-177, 1993.
21. L. Bao and J. J. Aceves, "Channel access scheduling in ad-hoc networks with unidirectional links," Proc. ACM/IEEE DIALM for Mobility, 1998.
22. C. Busch,M. Herlihy, and R.Wattenhofer, "Hard-potato routing," Proc. STOC, pp. 278-285, 2000.
23. Y. Mansour and B. Patt-Shamir, "Many to one packet routing on grids," Proc. STOC, pp. 258-267 1995.
24. C. Busch, "O(congestion + dilation) hot-potato routing on leveled networks," Theory of Computing Systems, vol. 37, pp. 371-396, 2004.
25. C. Busch, M. Ismail, M. Mavronicolas, and R. Wattenhofer, "Greedy O(C+D) hot-potato routing on trees", Tech. Rep. TR, 03-07, Rensselaer Computer Science Department, 2003.
26. K. Herlery, A. Pietracaprina, and G. Pucci, "One-to-many routing on the mesh", SPAA, pp. 31-37, 2001.
27. C. Busch, M. Herlihy, and R. Wattenhofer, "Randomized greedy hot-potato routing," Proc. SODA, pp. 458-466, 2000.
28. S. Rajasekaran and T. Tsantilas, "Optimal routing algorithms for mesh-connected processor arrays," VLSI Algorithms and Architectures, pp. 411-422, 1988.
29. S. Dolev, E. Kranakis and D. Krizanc, "Baked potatoes: deadlock prevention via scheduling," Proc. PODC, pp. 210-219, 1996.
30. A. Ben-Dor, S. Halevi and A. Schuster, "Greedy hot-potato routing," Proc. PODC, pp. 225-234, 1994.
31. th Annual ACM Symposium on Principles of Distributed Computing, pp. 169-175, 1991.
32. R. Bansal, "Online algorithm for routing and scheduling on ring networks," Tech Rep., Denison University, 2002.
33. J. T. Havill,"Online packet routing on linear arrays and rings", Proc. 28th ICALP, July 8-12, pp. 773-784, 2001.
34. S. Alstrup and J. Holm,"Direct Routing on Trees"' Proc. SODA, pp. 342-349, 1999.
35. Y. Choi, M. G. Gouda, H. Zhang and A. Arora,"Routing on a Logical Grid in Sensor Networks," UTCS Tech. Rep. TR-04-49.
36. A. Sridhran, and B. Krishnamachari, "Max-min fair collision-free scheduling for wireless sensor networks," Proc. IEEE on Performance, Computing and Communications, pp. 585-590, 2004.
37. Franic C. M Lau And S.H Zhang, "Fast gossiping in squar meshes/tori with bounded-size packet", IEEE Transaction on Parallel and Distributed Systems, vol. 13, no. 4, April 2002.
38. D. W. Krumme and G. Cybenko, and K. N. Venkataraman, "Gossiping in Minimal Time," Tech. Rep. 1027, Center for Supercomputing Research and Development, August, 1990.
39. J. Gronkvist, "Traffic controlled reuse TDMA in multi-hop radio networks," Proc. IEEE PIMRC, pp.1203-1207, 1998.
40. J. C. Bermond, and R. Correa, and Minli, "Gathering algorithms on paths under interferenceinterference constraints," Proc. CIAC 2006, LNCS, pp. 115-126, 2006
41. J. C. Bermond and J. Peters, "Efficient gathering in radio grids with interference," in. Proc. ALGOTEL, 2005.
42. J. C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Perennes,"Gathering in specific radio networks," To appear in ALGOTEL, 2006.
43. J. C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Perennes, "Hardness and approximation of gathering in static radio networks," Proc. PerCOM, 2006.
44. C. Florens, and R. McEliece, "Lower bounds on data collection time in sensory networks," IEEE Journal on Selected Areas in Communications, vol. 22, no. 6, pp. 1110-1120, 2004.