Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Time-spread multiple-access (TSMA) protocols for multihop mobile 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)
Quality-of-service in ad hoc carrier sense multiple access wireless networks
IEEE Journal on Selected Areas in Communications
Cover-Free Families and Topology-Transparent Scheduling for MANETs
Designs, Codes and Cryptography
MAC coding for QoS guarantees in multi-hop mobile wireless networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Wireless ad hoc lattice computers (WAdL)
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
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
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
Variable weight sequences for adaptive scheduled access in MANETs
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
In this paper, we generalize the known topology-transparent medium access control protocols for mobile ad hoc networks by observing that their transmission schedule corresponds to an orthogonal array. Some new results on throughput are obtained as a consequence. We also show how to compute the probability of successful transmission if the actual node degree in the network exceeds the design parameter related to maximum node degree, showing the sensitivity of the schedule to this parameter. The selection of orthogonal array to provide the best throughput is also examined, and combinatorial generalizations are explored. Finally we outline schemes that combine the delay guarantees of current approaches to handle exceeding the stipulated maximum node degree.