An analysis of stochastic shortest path problems
Mathematics of Operations Research
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Scalable reliable multicast using multiple multicast channels
IEEE/ACM Transactions on Networking (TON)
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Introduction to Algorithms
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 10th annual international conference on Mobile computing and networking
The dynamic behavior of a data dissemination protocol for network programming at scale
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
MNP: Multihop Network Reprogramming Service for Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Exploiting multi-Channel diversity to speed up over-the-air programming of wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Analysis of Contention-Based Multi-Channel Wireless MAC for Point-to-Multipoint Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Gappa: gossip based multi-channel reprogramming for sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Building multicluster 802.15.4 networks: issues and open problems
IEEE Wireless Communications
Extreme value FEC for reliable broadcasting in wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Reliable rateless wireless broadcasting with near-zero feedback
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We analyze the performance limits of data dissemination with multichannel, single radio sensors under random packet loss. We formulate the problem of minimizing the average delay of data dissemination as a stochastic shortest path problem and show that, for an arbitrary topology network, an optimal control policy can be found in a finite number of steps, using value iteration or Dijkstra's algorithm. However, the computational complexity of this solution is generally prohibitive. We thus focus on two special classes of network topologies of practical interest, namely single-hop clusters and multihop cluster chains. For these topologies, we derive the structure of policies that achieve an asymptotically optimal average delay, in networks with large number of nodes. Our analysis reveals that a single radio in each node suffices to achieve performance gain directly proportional to the total number of channels available. Through simulation, we show that the derived policies perform close to optimal even for networks with small and moderate numbers of nodes and can be implemented with limited overhead.