Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies
Authors:
- 1 October 2009
- journal article
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 5 (5) , 463-479
Abstract
Subscription and open access journals from SAGE Publishing, the world's leading independent academic publisher.Keywords
This publication has 12 references indexed in Scilit:
- Gathering Algorithms on Paths Under Interference ConstraintsLecture Notes in Computer Science, 2006
- Lower Bounds on Data Collection Time in Sensory NetworksIEEE Journal on Selected Areas in Communications, 2004
- Properties of a transmission assignment algorithm for multiple-hop packet radio networksIEEE Transactions on Wireless Communications, 2004
- Õ(Congestion + Dilation) Hot-Potato Routing on Leveled NetworksTheory of Computing Systems, 2004
- Fast gossiping in square meshes/tori with bounded-size packetsIEEE Transactions on Parallel and Distributed Systems, 2002
- Development platform for self-organizing wireless sensor networks1999
- Optimal broadcast scheduling in packet radio networks using mean field annealingIEEE Journal on Selected Areas in Communications, 1997
- Making transmission schedules immune to topology changes in multi-hop packet radio networksIEEE/ACM Transactions on Networking, 1994
- Scheduling algorithms for multihop radio networksIEEE/ACM Transactions on Networking, 1993
- Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications, 1990