Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Tree multicast strategies in mobile, multishop wireless networks
Mobile Networks and Applications
Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Independent-tree ad hoc multicast routing (ITAMAR)
Mobile Networks and Applications
An adaptive strategy for maximizing throughput in MAC layer wireless multicast
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Towards minimum delay broadcasting and multicasting in multihop wireless networks
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Minimum delay routing in multihop wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
| Hi-index | 0.01 |
Many real-time applications require one to many (multicast) communication. Real time applications can gracefully accommodate some loss but require low delay. We minimize the delay in real-time MAC layer multicast by exploiting the broadcast nature of wireless medium and limited loss tolerance of the applications. We show that multiple transmissions of a packet at the MAC layer significantly reduces the delay than that when only one transmission is allowed. But each additional transmission consumes additional power and increases network load. Therefore, our goal is to design a policy that judiciously uses the limited transmission opportunities so as to deliver each packet in minimum possible time to the required number of group members. We show that the problem is an instance of the stochastic shortest path problem, and using this formulation obtain a computationally simple, closed form transmission strategy in important special cases. Numerical computations show that only a small number of transmissions, if used judiciously, are sufficient to minimize the delay subject to loss constraint.