Skip to main content
SpringerLink
Log in

The effects of synchronization on topology-transparent scheduling

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. IEEE standard 802.11: Wireless LAN medium access control and physical layer specifications (1999).

  2. R. C. Bose, An affine analogue of Singer’s theorem, Journal of the Indian Mathematical Society 6 (1942) 1–5.

    MATH  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

  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.

  7. C. J. Colbourn and J. H. Dinitz (editors) CRC Handbook of Combinatorial Designs (CRC Press 1996).

  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).

  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.

  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.

  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.

  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).

  13. Digital Fountain, Inc. Breakthrough reliable transport technology for data and live streaming delivery over imperfect networks, Technology Licensing White Paper, (2004).

  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. L. Hu, Topology control for multihop packet radio networks, IEEE Transactions on Communications 41(10) (1993) 1471–1481.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  17. W. H. Kautz and R. C. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory IT-10 (1964) 363–377.

  18. M. G. Luby. LT Codes, in Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS’02) (2002) pp. 271–280.

  19. C. E. Perkins, (ed.), Ad Hoc Networks (Addison-Wesley, Reading, MA, 2000).

    Google Scholar 

  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.

  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.

  22. V. R. Syrotiuk, C. J. Colbourn and S. Yellamraju, Rateless forward error correction for topology-transparent scheduling. Preprint.

  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.

  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.

  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.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Arizona State University, P.O. Box 878809, Tempe, Arizona, U.S.A., 85287-8809

    Wensong Chu, Charles J. Colbourn & Violet R. Syrotiuk

Authors
  1. Wensong Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Charles J. Colbourn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Violet R. Syrotiuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Violet R. Syrotiuk.

Additional information

Wensong Chu received his M.S. in Applied Mathematics from Shanghai Jiao Tong University, China, in 1993; received his M.S. in Computer Networks (Electrical Engineering) from the University of Southern California in 2000; received his Ph.D. in Mathematics from the University of Southern California in 2002. He was with the Department of Computer Science and Engineering at Arizona State University as a post-doctoral fellow from 2002 to 2003. Currently he is doing research at the CMS Bondedge in California. His research interests include sequence designs for communications, combinatorial coding methods, mobile ad hoc networks and sensor networks, financial engineering and combinatorial design theory.

Charles J. Colbourn was born in Toronto, Canada in 1953. He completed his B.Sc. degree at the University of Toronto in 1976, M.Math. at the University of Waterloo in 1978, and Ph.D. at the University of Toronto in 1980, all in computer science. He has held faculty positions at the University of Saskatchewan, the University of Waterloo, and the University of Vermont, and is now Professor of Computer Science and Engineering at Arizona State University. He is co-editor of the CRC Handbook of Combinatorial Designs and author of Triple Systems and The Combinatorics of Network Reliability, both from Oxford University Press. He is editor-in-chief of the Journal of Combinatorial Designs. His research concerns applications of combinatorial designs in networking, computing, and communications.

Violet R. Syrotiuk earned the Ph.D. degree in Computer Science from the University of Waterloo (Canada) in 1992. She joined Arizona State University in 2002 and is currently an Assistant Professor of Computer Science and Engineering. Dr. Syrotiuk’s research is currently supported by three grants from the National Science Foundation, and contracts from Los Alamos National Laboratory, and the Defence Science and Technology Organisation in Australia. She serves on the Editorial Board of Computer Networks, and on the Technical Program Committee of several major conferences including MobiCom and Infocom. Her research interests include mobile ad hoc and sensor networks, in particular MAC protocols with an emphasis on adaptation, topology-transparency, and energy efficiency, dynamic spectrum utilization, mobile network models, and protocol interaction and cross-layer design. She is a member of the ACM and the IEEE.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chu, W., Colbourn, C.J. & Syrotiuk, V.R. The effects of synchronization on topology-transparent scheduling. Wireless Netw 12, 681–690 (2006). https://doi.org/10.1007/s11276-006-6528-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-6528-z

Keywords

Search

Navigation