Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
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)
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Cover-Free Families and Topology-Transparent Scheduling for MANETs
Designs, Codes and Cryptography
Topology-Transparent Schedules for Energy Limited Ad hoc Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Slot synchronized topology-transparent scheduling for sensor networks
Computer Communications
A new recursive construction for optical orthogonal codes
IEEE Transactions on Information Theory
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Maximizing the number of broadcast operations in static random geometric ad-hoc networks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Video surveillance with PTZ cameras: the problem of maximizing effective monitoring time
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
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 |
Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the active neighbourhood is not too dense. Most of the existing work on topology-transparent scheduling assumes that the nodes are synchronized on frame boundaries. Synchronization is a challenging problem in MANETs and in WSNs. Hence, we study the relationships among topology-transparent schedules, expected delay, and maximum delay, for successively weaker models of synchronization: frame-synchronized, slot-synchronized, and asynchronous transmission. For each synchronization model, we give constructive proofs of existence of topology-transparent schedules, and bound the least maximum delay. Perhaps surprisingly, the construction for the asynchronous model is a simple variant of the slot synchronized model. While it is foreseen that the maximum delay increases as the synchronization model is weakened, the bound is too pessimistic. The results on expected delay show that topology-transparent schedules are very robust to node density higher than the construction is designed to support, allowing the nodes to cope well with mobility, and irregularities of their deployment.