Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
Wireless Networks
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Research note: A distance-vector routing protocol for networks with unidirectional links
Computer Communications
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
A simulation study of a MAC layer protocol for wireless networks with asymmetric links
Proceedings of the 2006 international conference on Wireless communications and mobile computing
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A MAC layer protocol for wireless networks with asymmetric links
Ad Hoc Networks
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Novel algorithms for the network lifetime problem in wireless settings
Wireless Networks
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
A new family of collision-free channel access protocols for ad hoc networks with unidirectional links is introduced. These protocols are based on a distributed contention resolution algorithm that operates at each node based on the list of direct contenders (one-hop neighbors or incident links) and indirect interferences (two-hop neighbors and related links). Depending on the activation scheme (node activation or link activation), a network node uses the identifiers of its neighbors one and two hops away to elect deterministically one or multiple winners for channel access in each contention context (e.g., a time slot or a frequency band). The protocols are shown to be fair and capable of achieving maximum utilization of the channel bandwidth. The delay and throughput characteristics of the channel access protocols is studied by simulations.