Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Improved bounds for data-gathering time in sensor networks
Computer Communications
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
Time optimal gathering in sensor networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
From balls and bins to points and vertices
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Optimally fast data gathering in sensor networks
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An approximation algorithm for the wireless gathering problem
Operations Research Letters
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Framework for optimizing the capacity of wireless mesh networks
Computer Communications
Scheduling of vehicles in transportation networks
Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles
Optimal gathering in radio grids with interference
Theoretical Computer Science
| Hi-index | 0.00 |
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.