Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Wireless information networks
Scattering and Gathering Messages in Networks of Processors
IEEE Transactions on Computers
Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems
Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems
Communication protocols for sensor networks
Wireless sensor networks
Fundamentals of wireless communication
Fundamentals of wireless communication
Hardness and approximation of Gathering in static radio networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Ad Hoc Networking
The Distributed Wireless Gathering Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Minimizing Average Flow Time in Sensor Data Gathering
Algorithmic Aspects of Wireless Sensor Networks
Efficient Scheduling of Data-Harvesting Trees
Algorithmic Aspects of Wireless Sensor Networks
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations
Trustworthy Global Computing
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Time optimal gathering in sensor networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Framework for optimizing the capacity of wireless mesh networks
Computer Communications
Hi-index | 0.00 |
The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network. The problem is to gather a set of messages from the nodes in the network at which they originate to a central node, representing a powerful base station. The objective is to minimize the time to gather all messages. The sending pattern or schedule should avoid interference of radio signals, which distinguishes the problem from wired networks We study the Wireless Gathering Problem from a combinatorial optimization point of view in a centralized setting. This problem is known to be NP-hard when messages have no release time. We consider the more general case in which messages may be released over time. For this problem we present a polynomial-time on-line algorithm which gives a 4-approximation. We also show that within the class of shortest path following algorithms no algorithm can have approximation ratio better than 4. We also formulate some challenging open problems concerning complexity and approximability for variations of the problem