Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
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
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Reliable Multicast in Multi-Access Wireless LANs
Wireless Networks
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Reliable MAC Layer Multicast in IEEE 802.11 Wireless Networks
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A framework for routing and congestion control for multicast information flows
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In multiparty MAC, a sender needs to transmit each packet to a set of receivers within its transmission range. Bandwidth efficiency of wireless multiparty MAC can be improved substantially by exploiting the fact that several receivers can be reached at the MAC layer by a single transmission. Multiparty communication, however, requires new design paradigms since systematic design techniques that have been used effectively in unicast and wireline multicast do not apply. For example, a transmission policy that maximizes the stability region of the network need not maximize the network throughput. Therefore, the objective is to design a policy that maximizes the system throughput subject to maintaining stability. We present a sufficient condition that can be used to establish the throughput optimality of a stable transmission policy. We subsequently design a distributed adaptive stable policy that allows a sender to decide when to transmit using simple computations. The computations are based only on limited information about current transmissions in the sender's neighborhood. Even though the proposed policy does not use any network statistics, it attains the same throughput as an optimal offline stable policy that uses in its decision process past, present, and even future network states. We prove the throughpOut optimality of this policy using the sufficient condition and the large deviation results. We present a MAC protocol for acquiring the local information necessary for executing this policy, and implement it in ns-2. The performance evaluations demonstrate that the optimal policy significantly outperforms the existing multiparty schemes in ad hoc networks.