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)
On the upper bound of the size of the r-cover-free families
Journal of Combinatorial Theory Series A
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)
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
An adaptive generalized transmission protocol for ad hoc networks
Mobile Networks and Applications
The Existence of Four HMOLS with Equal Sized Holes
Designs, Codes and Cryptography
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
Quality-of-service in ad hoc carrier sense multiple access wireless networks
IEEE Journal on Selected Areas in Communications
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
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 |
We examine the combinatorial requirements of topology-transparent transmission schedules in a mobile ad hoc network (MANET). Specifically, if each of the N nodes has at most D active neighbors, we require the schedule to guarantee a collision-free transmission to each neighbor. This requirement is met by a cover-free family. We show that existing constructions for topology-transparent schedules correspond to an orthogonal array. Moreover, we show that Steiner systems support the largest number of nodes for a given schedule length. Both of these combinatorial objects are special cases of cover-free families. Analytically and numerically, we examine slot guarantees, expected throughput, and normalized expected throughput for systems of small strength, exploring the sensitivity of the response to D. Expected throughput provides a better performance metric than the minimum throughput results obtained earlier. The impact of a more realistic model of acknowledgments is also examined. The extension of the schedule to multiple frames returns us to the orthogonal arrays. The very density of Steiner systems that afforded an improvement over orthogonal arrays in one frame impedes the best extension to more frames.