Improved Lower Bounds for Data-Gathering Time in Sensor Networks

Many-to-one packet routing and scheduling are fundamental operations of sensor networks. It is well known that many sensor network applications rely on data collection from the nodes (the sensors) by a central processing device. There is a wide range of data gathering applications like: target and hazard detection, environmental monitoring, battlefield surveillance, etc. Consequently, efficient data collection solutions are needed to improve the performance of the network. In this paper, we assume a known distribution of sources (each node wants to transmit at most one packet) and one common destination (called base station). We provide via simple mathematical models, a transmission schedule for routing all the messages to the base station, jointly minimizing both the completion time and the average packet delivery time. We present improved lower bounds for linear, two-branch, and star (or multi-branch) network topologies. All our algorithms run in polynomial time.

[1]  Francis C. M. Lau,et al.  Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets , 2002, IEEE Trans. Parallel Distributed Syst..

[2]  J. J. Garcia-Luna-Aceves,et al.  Channel access scheduling in Ad Hoc networks with unidirectional links , 2001, DIALM '01.

[3]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.

[4]  Victor O. K. Li,et al.  Fair spatial TDMA channel access protocols for multihop radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[5]  Maurice Herlihy,et al.  Hard-Potato routing , 2000, STOC '00.

[6]  Errol L. Lloyd,et al.  An incremental algorithm for broadcast scheduling in packet radio networks , 1998, IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201).

[7]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[8]  Rui Liu,et al.  A Distributed Protocol For Adaptive Link Scheduling in Ad-hoc Networks , 2001 .

[9]  Errol L. Lloyd,et al.  Evaluation of a distributed broadcast scheduling protocol for multihop radio networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[10]  Boaz Patt-Shamir,et al.  Many-to-one packet routing on grids , 1995, STOC '95.

[11]  Geppino Pucci,et al.  One-to-Many routing on the mesh , 2001, SPAA '01.

[12]  David W. Krumme,et al.  Gossiping in Minimal Time , 1992, SIAM J. Comput..

[13]  Boaz Patt-Shamir,et al.  Many-to-one packet routing on grids (Extended Abstract). , 1995, STOC 1995.

[14]  Massimo Franceschetti,et al.  Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.

[15]  Bhaskar Krishnamachari,et al.  Max-min fair collision-free scheduling for wireless sensor networks , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[16]  J. Gronkvist.  Traffic controlled spatial reuse TDMA in multi-hop radio networks , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[17]  Gregory J. Pottie,et al.  Development platform for self-organizing wireless sensor networks , 1999, Defense, Security, and Sensing.

[18]  Maurice Herlihy,et al.  Randomized greedy hot-potato routing , 2000, SODA '00.

[19]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[20]  Shai Halevi,et al.  Potential Function Analysis of Greedy Hot-Potato Routing , 1994, PODC '94.

[21]  H. B. Russell,et al.  Distributed and adaptive TDMA algorithms for multiple-hop mobile networks , 2002, MILCOM 2002. Proceedings.

[22]  Harlan B. Russell,et al.  Properties of a transmission assignment algorithm for multiple-hop packet radio networks , 2004, IEEE Transactions on Wireless Communications.

[23]  Nirwan Ansari,et al.  Optimal Broadcast Scheduling in Packet Radio Networks Using Mean Field Annealing , 1997, IEEE J. Sel. Areas Commun..

[24]  Marios Mavronicolas,et al.  Greedy Õ(C +D) Hot-Potato Routing on Trees , 2003 .

[25]  Sanguthevar Rajasekaran,et al.  Optimal routing algorithms for mesh-connected processor arrays , 1988, Algorithmica.

[26]  Shlomi Dolev,et al.  Baked potatoes: deadlock prevention via scheduling , 1996, PODC '96.

[27]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[28]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[29]  Injong Rhee,et al.  Distributed scalable TDMA scheduling algorithm , 2004 .