Wireless Networks

, Volume 12, Issue 6, pp 681–690 | Cite as

The effects of synchronization on topology-transparent scheduling

  • Wensong Chu
  • Charles J. Colbourn
  • Violet R. SyrotiukEmail author


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.


Scheduling Synchronization models Ad hoc networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    IEEE standard 802.11: Wireless LAN medium access control and physical layer specifications (1999).Google Scholar
  2. [2]
    R. C. Bose, An affine analogue of Singer’s theorem, Journal of the Indian Mathematical Society 6 (1942) 1–5.zbMATHGoogle Scholar
  3. [3]
    I. Chlamtac and A. Faragó, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE/ACM Transactions on Networking 2(1) (1994) 23–29.CrossRefGoogle Scholar
  4. [4]
    W. Chu, C. J. Colbourn and V. R. Syrotiuk, Slot synchronized topology-transparent scheduling for sensor networks, Computer Communications 29(4) (2006) 421–428.CrossRefGoogle Scholar
  5. [5]
    W. Chu, C. J. Colbourn and V. R. Syrotiuk, Transparent scheduling, synchronization and maximum delay, in Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS’04), (2004) pp. 223–228.Google Scholar
  6. [6]
    W. Chu and S. W. Golomb, A new recursive construction for optical orthogonal codes, IEEE Transactions on Information Theory IT-49 (2003) 3072–3076.Google Scholar
  7. [7]
    C. J. Colbourn and J. H. Dinitz (editors) CRC Handbook of Combinatorial Designs (CRC Press 1996).Google Scholar
  8. [8]
    C. J. Colbourn, J. H. Dinitz and D. R. Stinson, Applications of combinatorial designs to communications, cryptography, and networking, in Surveys in Combinatorics, J. D. Lamb and D. A. Preece, (Eds.), pp. 37–100. London Mathematical Society, Lecture Note Series 267 (1999).Google Scholar
  9. [9]
    C. J. Colbourn, A. C. H. Ling and V. R. Syrotiuk, Cover-free families and topology-transparent scheduling for MANETs, Designs, Codes, and Cryptography 32(1–3) (2004) 35–65.Google Scholar
  10. [10]
    C. J. Colbourn and V. R. Syrotiuk, Scheduled persistence for medium access control in sensor networks, in Proceedings of the First IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’04), (2004) pp. 264–273.Google Scholar
  11. [11]
    C. J. Colbourn, V. R. Syrotiuk and A. C. H. Ling, Steiner systems for topology-transparent access control in MANETs. in Proceedings of the Second International Conference on Ad Hoc Networks and Wireless (AdHoc Now’03) (2003) pp. 247–258.Google Scholar
  12. [12]
    D. -Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, volume 12 of Series on Applied Mathematics. 2nd edition (World Scientific, 2000).Google Scholar
  13. [13]
    Digital Fountain, Inc. Breakthrough reliable transport technology for data and live streaming delivery over imperfect networks, Technology Licensing White Paper, (2004).Google Scholar
  14. [14]
    P. Erdós, P. Frankl and Z. Fúredi, Families of finite sets in which no set is covered by the union others, Israel J. Math. 51 (1985) 79–89.Google Scholar
  15. [15]
    L. Hu, Topology control for multihop packet radio networks, IEEE Transactions on Communications 41(10) (1993) 1471–1481.CrossRefGoogle Scholar
  16. [16]
    J.-H. Ju and V. O. K. Li, An optimal topology-transparent scheduling method in multihop packet radio networks, IEEE/ACM Transactions on Networking 6(3) (1998) 298–306.CrossRefGoogle Scholar
  17. [17]
    W. H. Kautz and R. C. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory IT-10 (1964) 363–377.Google Scholar
  18. [18]
    M. G. Luby. LT Codes, in Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS’02) (2002) pp. 271–280.Google Scholar
  19. [19]
    C. E. Perkins, (ed.), Ad Hoc Networks (Addison-Wesley, Reading, MA, 2000).Google Scholar
  20. [20]
    V. Rajendran, K. Obraczka and J. J. Garcia-Luna-Aceves, Energy-efficient, collision-free medium access control for wireless sensor networks, in Proceedings of the 1st International ACM Conference on Embedded Networked Sensor Systems (SenSys’03), (2003) pp. 181–192.Google Scholar
  21. [21]
    V. R. Syrotiuk, C. J. Colbourn and A. C. H. Ling, Topology-transparent scheduling for MANETs using orthogonal arrays, in Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing (DIAL-M/POMC’03) (2003) pp. 43–49.Google Scholar
  22. [22]
    V. R. Syrotiuk, C. J. Colbourn and S. Yellamraju, Rateless forward error correction for topology-transparent scheduling. Preprint.Google Scholar
  23. [23]
    P. J. Dukes, C. J. Colbourn and V. R. Syrotiuk, Topology-transparent scheduling for energy limited ad hoc networks, in Proceedings of the First IEEE Workshop on Foundations and Algorithms for Wireless Networking (FAWN’06) (March 2006) pp. 85–90.Google Scholar
  24. [24]
    A. Woo and D. E. Culler, A transmission control scheme for media access in sensor networks, in Proceedings of the 7th Annual International ACM Conference on Mobile Networking and Computing (Mobicom’01) (2001) pp. 221–235.Google Scholar
  25. [25]
    R. Zheng, C.-J. Hou and L. Sha, Asynchronous wakeup for ad hoc networks, in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc’03), (2003) pp. 35–45.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Wensong Chu
    • 1
  • Charles J. Colbourn
    • 1
  • Violet R. Syrotiuk
    • 1
    Email author
  1. 1.Department of Computer Science and EngineeringArizona State UniversityTempeU.S.A.

Personalised recommendations