Minimum Delay Data Gathering in Radio Networks
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbours at most one data item. Each device is equipped with a half duplex interface; so a node cannot both receive and transmit simultaneously. During a step only non interfering transmissions can be done. In other words, the non interfering calls done during a step will form a matching. The aim is to minimize the number of steps needed to send to the base station a set of messages generated by the nodes, this completion time is also denoted makespan of the call scheduling. The best known algorithm for open-grids was a multiplicative 1.5-approximation algorithm [Revah, Segal 07]. In such topologies, we give a very simple +2 approximation algorithm and then a more involved +1 approximation algorithm. Moreover, our algorithms work when no buffering is allowed in intermediary nodes, i.e., when a node receives a message at some step, it must transmit it during the next step.
KeywordsSensor Networks gathering makespan grid
Unable to display preview. Download preview PDF.
- 2.Revah, Y., Segal, M.: Improved algorithms for data-gathering time in sensor networks ii: Ring, tree and grid topologies. In: Third International Conference on Networking and Services 2007. ICNS, p. 46 (2007)Google Scholar
- 3.Bermond, J.C., Guinand, F., Nisse, N., Reyes, P., Rivano, H.: Minimum delay data gathering in closed half-duplex grid. On-going work and discussions (June 2009)Google Scholar
- 4.Bonifaci, V., Klasing, R., Korteweg, P., Stougie, L., Marchetti-Spaccamela, A.: Data Gathering in Wireless Networks. In: Graphs and Algorithms in Communication Networks. Springer, Heidelberg (2009)Google Scholar
- 9.Gargano, L., Rescigno, A.A.: Collision-free path coloring with application to minimum-delay gathering in sensor networks. Discrete Applied Maths (in Press)Google Scholar
- 10.Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato routing. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, Portland, Oregon, United States, pp. 278–285. ACM, New York (2000)Google Scholar
- 11.Mansour, Y., Patt-Shamir, B.: Many-to-one packet routing on grids. In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, Las Vegas, Nevada, United States, pp. 258–267. ACM, New York (1995)Google Scholar
- 14.Bermond, J.C., Peters, J.: Efficient gathering in radio grids with interference. In: Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2005), Presqu’île de Giens, pp. 103–106 (2005)Google Scholar
- 15.Gomes, C., Pérennes, S., Reyes, P., Rivano, H.: Bandwidth allocation in radio grid networks. In: 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel 2008) (May 2008)Google Scholar
- 16.Bermond, J.C., Nisse, N., Reyes, P., Rivano, H.: Fast data gathering in radio grid networks. Technical Report RR-6851, INRIA (2009)Google Scholar