Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Data networks (2nd ed.)
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Solutions to hidden terminal problems in wireless networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Reversing the collision-avoidance handshake in wireless networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
Wireless Networks
The MD4 Message Digest Algorithm
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
IEEE 802.11 Wireless Local Area Networks
IEEE Communications Magazine
An overlay MAC layer for 802.11 networks
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Cross-layer transmission scheduling for direct-sequence spread-spectrum ad hoc networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Joint power control and channel assignment algorithms for wireless ad hoc networks
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
MMM: multi-channel TDMA with MPR capabilities for MANETs
Wireless Networks
| Hi-index | 0.00 |
Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows contending entities to elect one or multiple winners for channel access in any given contention context (e.g., a time slot) in a distributed fashion. The only required information for each entity is the identifiers of its neighbors one and two hops away in the wireless network. The new protocols are shown to be fair and capable of achieving maximal utilization of the channel bandwidth. The delay and throughput characteristics of the contention resolution algorithms are analyzed, and the performance of the three types of channel access protocols is studied by simulations and compared with that of optimal static scheduling algorithms.