Skip to main content

Access Scheduling on the Control Channels in TDMA Wireless Mesh Networks

  • Conference paper
Mobile Ad-Hoc and Sensor Networks (MSN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4864))

Included in the following conference series:

  • 992 Accesses

Abstract

The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can transmit a control packet to any one-hop neighbor in the scheduling cycle. The objective is to minimize the total number of different time-slots in the cycle. This paper has taken the large interference range problem into consideration and proposed two algorithms for the scheduling problem, namely, One Neighbor Per Cycle (ONPC) algorithm and All Neighbors Per Cycle (ANPC) algorithm. The number of time-slots by ANPC algorithm is upper-bounded by min(n, 4K – 2) in some special cases, where n is the node numberand K is the maximum node degree. Both centralized and fully distributed versions are given. Simulation results also show that the performance of ONPC is rather better than ANPC.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I., Wang, X., Wang, W.: Wireless Mesh Networks: a Survey. Computer Networks 47, 445–487 (2005)

    Article  MATH  Google Scholar 

  2. Chlamtac, I., Pinter, S.: Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Transactions on Computers C-36(6), 729–737 (1987)

    Article  Google Scholar 

  3. Cheng, H., Jia, X.: Distributed Channel Access Scheduling on the Control Channel in Wireless Mesh Networks (submitted to the WiCOM 2007) (2007)

    Google Scholar 

  4. Kyasanur, P., Chereddi, C., Vaidya, N.: Net-X: System eXtensions for Supporting Multiple Channels, Multiple Radios, and Other Radio Capabilities, Technical Report, Department of Computer Science, University of Illinois at Urbana-Champaign (2006)

    Google Scholar 

  5. Ramanathan, S., Lloyd, E.: Scheduling Algorithms for Multi-hop Radio Networks. IEEE/ACM Transactions on Networking, 166–177 (1993)

    Google Scholar 

  6. Xu, K., Gerla, M., Bae, S.: How Effective is the IEEE 802.11 RTS/CTS Handshake in Ad Hoc Networks. In: Proc. IEEE GLOBECOM 2002, Taipei, Taiwan, pp. 72–76 (November 2002)

    Google Scholar 

  7. Cidon, I., Sidi, M.: Distributed Assignment Algorithm for Multihop Packet Radio Networks. IEEE Transactions on Computers 38(10), 1353–1361 (1989)

    Article  Google Scholar 

  8. Zhu, C., Corson, M.: A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks. Wireless Networks 7, 371–384 (2001)

    Article  MATH  Google Scholar 

  9. Tang, Z., Garcia-Luna-Aceves, J.: A Protocol for Topology-Dependent Transmission Scheduling in Wireless Networks. In: Proc. IEEE Communications and Networking Conference, vol. 3, pp. 1333–1337 (1999)

    Google Scholar 

  10. Cai, Z., Lu, M., Georghiades, C.: Topology-transparent Time Division Multiple Access Broadcast Scheduling in Multihop Packet Radio networks. IEEE Transactions on Vehicular 52(4), 970–984 (2003)

    Article  Google Scholar 

  11. Su, Y., Su, S., Li, J.: Topology-transparent Link Activation Scheduling Schemes for Multihop CDMA Ad Hoc Networks. In: Proc. IEEE GLOBECOM 2004, vol. 6, pp. 3563–3567 (2004)

    Google Scholar 

  12. Ju, J., Li, V.: TDMA Scheduling Design of Multihop Packet Radio Networks Based on Latin Squares. IEEE Journal on Selected Areas in Communications 17(8), 1345–1352 (1999)

    Article  Google Scholar 

  13. Chen, J., Ting, P., Lin, C., Chen, J.: A Novel Broadcast Scheduling Strategy Using Factor Graphs and Sum-product Algorithm. In: Proc. GLOBECOM 2004, vol. 6, pp. 4048–4053 (2004)

    Google Scholar 

  14. Lloyd, E.: Broadcast Scheduling for TDMA in Wireless Multi-Hop Networks. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, pp. 347–370. John Wiley and Sons Inc., England (2002)

    Chapter  Google Scholar 

  15. Ngo, C., Li, V.: Centralized Broadcast Scheduling in Packet Radio Networks via Genetic-fix Algorithms. IEEE Transactions on Communications 51, 1439–1441 (2003)

    Article  Google Scholar 

  16. Maxim 2.4 GHz 802.11b Zero-IF Transceivers, http://pdfserv.maxim-ic.com/en/ds/MAX2820-MAX2821.pdf

  17. Chandra, R., Bahl, P.: MultiNet: Connecting to Multiple IEEE 802.11 Networks Using a Single Wireless Card. In: IEEE INFOCOM (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hongke Zhang Stephan Olariu Jiannong Cao David B. Johnson

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, H., Jia, X., Liu, H. (2007). Access Scheduling on the Control Channels in TDMA Wireless Mesh Networks. In: Zhang, H., Olariu, S., Cao, J., Johnson, D.B. (eds) Mobile Ad-Hoc and Sensor Networks. MSN 2007. Lecture Notes in Computer Science, vol 4864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77024-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77024-4_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77023-7

  • Online ISBN: 978-3-540-77024-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics