Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Potential function analysis of greedy hot-potato routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Baked potatoes: deadlock prevention via scheduling
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A new model for scheduling packet radio networks
Wireless Networks
Randomized greedy hot-potato routing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
One-to-Many routing on the mesh
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets
IEEE Transactions on Parallel and Distributed Systems
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Optimal Routing Algorithms for Mesh-Connected Processor Arrays
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
Theory of Computing Systems
Properties of a transmission assignment algorithm for multiple-hop packet radio networks
IEEE Transactions on Wireless Communications
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Minimum Delay Data Gathering in Radio Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Optimal time data gathering in wireless networks with omni-directional antennas
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Optimal gathering in radio grids with interference
Theoretical Computer Science
| Hi-index | 0.25 |
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 define our network model and provide improved lower bounds for linear, two-branch, and star (or multi-branch) network topologies. All our algorithms run in polynomial time. Finally, we prove that the problem of Quality of Service (QoS) in our setting for a star network under the same target function is NP-complete by showing a reduction from the 3-Set-Partition problem.