Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Topology-transparent scheduling for MANETs using orthogonal arrays
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Cover-Free Families and Topology-Transparent Scheduling for MANETs
Designs, Codes and Cryptography
The effects of synchronization on topology-transparent scheduling
Wireless Networks
Rateless forward error correction for topology-transparent scheduling
IEEE/ACM Transactions on Networking (TON)
Slot synchronized topology-transparent scheduling for sensor networks
Computer Communications
Apples and oranges: comparing schedule- and contention-based medium access control
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
New optimal variable-weight optical orthogonal codes
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Reed-Solomon and hermitian code-based scheduling protocols for wireless ad hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Optical orthogonal codes: design, analysis and applications
IEEE Transactions on Information Theory
TDMA scheduling design of multihop packet radio networks based on latin squares
IEEE Journal on Selected Areas in Communications
General Constructions of Optimal Variable-Weight Optical Orthogonal Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Scheduling access to a shared channel in mobile ad hoc networks must address numerous competing requirements, for example on throughput, delay, and fairness. It must address disparate and dynamic traffic demands as well as losses due to collisions with neighbouring transmitters. It must address changes in the topology of the network that arise from mobility. Topology transparent scheduling schemes have been proposed as a means to support reasonable delay guarantees, minimum throughput guarantees, and to a lesser extent fairness concerns. Sequences based on codes and combinatorial designs have been explored that support topology transparent scheduling for mobile ad hoc networks. However, all of the schemes proposed provide every node with the same (or essentially the same) channel access, by assigning each node a transmission frame in which the number of transmission slots (‘weight') is the same. In order to mitigate effects of losses due to collision, it is important to limit the set of frame schedules that are permitted; but at the same time, using frames with differing weights can improve throughput without sacrificing fairness. Combinatorial requirements for variable weight frame schedules are determined based on these observations.