An Optimal Channel Access Protocol with Multiple Reception Capacity
IEEE Transactions on Computers
Distributed dynamic channel access scheduling for ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
The capacity of wireless ad hoc networks with multi-packet reception
IEEE Transactions on Communications
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
Many Ad-hoc networks for military and public safety environments are characterized by: large number of nodes in the same area (that means that frequency spatial reuse is less applicable), crucial situation awareness (which implies periodically frequent location updates, mission status, etc.), or high propagation delay (for example, acoustic or airborne networks). In order to support such networks, an efficient medium access control broadcast protocol is essential. Obviously, using one shared channel with only one packet reception at a time is not scalable and therefore multi-packet reception techniques are more suitable. Recent technological developments (patent pending) enable nodes to receive messages simultaneously in many, even hundreds of channels. In this paper we study the impact of the new multi packet reception capabilities. In order to compute close upper and lower bounds on the maximum delay, we consider the best scenario that is, the simple case of full mesh. We then propose algorithms that achieve a close to the best possible maximum delay between updates over all pairs of nodes. This is done by providing close upper and lower bounds on the maximum delay and giving simple algorithms that meet the upper bound. For theoretical completeness we study bounds for all possible relations between the number of nodes and the number of channels.