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 neighbors 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 all messages to the base station, a.k.a. makespan or completion time.

• Type: Conference
• Year: 2009
• Where: ADHOCNOW
• Authors: Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano
• Keywords: ADHOCNOW 2009, Base Station, Efficient Gathering Algorithms, Non Interfering, Wireless Networks