Skip to main content
Erschienen in: Wireless Networks 3/2011

01.04.2011

Flow admission control for multi-channel multi-radio wireless networks

verfasst von: XuFei Mao, Xiang-Yang Li, GuoJun Dai

Erschienen in: Wireless Networks | Ausgabe 3/2011

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Providing Quality of Service (QoS) is a major challenge in wireless networks. In this paper we propose a distributed call admission control protocol (DCAC) to do both bandwidth and delay guaranteed call admission for multihop wireless mesh backbone networks, by exploiting the multi-channel multi-radio (mc-mr) feature. We propose a novel routing metric for route setup, and present an efficient distributed algorithm for link reservation that satisfies the required bandwidth and reduces the delay by a local scheduling that minimizes one hop delay. To the best of our knowledge, this is the first distributed protocol that embeds mc-mr feature in Time Division Medium Access (TDMA) to do QoS call admission in wireless backbone networks. Extensive simulation studies show that our protocol significantly improves network performance on supporting QoS sessions compared with some widely used protocols.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
We just consider one direction traffic reservation here. It is easy to extend this to the bidirectional reservation. Also only 3 time-slots are required for the two end-nodes of each link to do both forward and backward traffic reservations.
 
Literatur
1.
Zurück zum Zitat Akyildiz, I., Wang, X., & Wang, W. (2005). Wireless mesh networks: A survey. Computer Networks, 47(4), 445–487.CrossRefMATH Akyildiz, I., Wang, X., & Wang, W. (2005). Wireless mesh networks: A survey. Computer Networks, 47(4), 445–487.CrossRefMATH
2.
Zurück zum Zitat IEEE 802.11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, std., 1999. IEEE 802.11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, std., 1999.
4.
Zurück zum Zitat Bahl, P., Chandra, R., & Dunagan, J. (2004). SSCH: Slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks. In Proceedings of ACM MobiCom, pp. 216–230. Bahl, P., Chandra, R., & Dunagan, J. (2004). SSCH: Slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks. In Proceedings of ACM MobiCom, pp. 216–230.
5.
Zurück zum Zitat Lee, S., Narlikar, G., Pál, M., Wilfong, G., & Zhang, L. (2006). Admission control for multihop wireless backhaul networks with QoS support. In Proceedings of IEEE WCNC, 92–97. Lee, S., Narlikar, G., Pál, M., Wilfong, G., & Zhang, L. (2006). Admission control for multihop wireless backhaul networks with QoS support. In Proceedings of IEEE WCNC, 92–97.
6.
Zurück zum Zitat Sriram, S., Reddy, T. B., Manoj, B. S., & Murthy, C. S. R. (2005). On the end-to-end call acceptance and the possibility of deterministic QoS guarantees in ad hoc wireless networks. In Proceeding of ACM Mobihoc, pp. 169–180. Sriram, S., Reddy, T. B., Manoj, B. S., & Murthy, C. S. R. (2005). On the end-to-end call acceptance and the possibility of deterministic QoS guarantees in ad hoc wireless networks. In Proceeding of ACM Mobihoc, pp. 169–180.
7.
Zurück zum Zitat Tang, J., Xue, G., & Zhang, W. (2005). Interference-aware topology control and QoS routing in multi-channel wireless mesh networks. In Proceedings of ACM Mobihoc, pp. 68–77. Tang, J., Xue, G., & Zhang, W. (2005). Interference-aware topology control and QoS routing in multi-channel wireless mesh networks. In Proceedings of ACM Mobihoc, pp. 68–77.
8.
Zurück zum Zitat Parekh, A. K., & Gallager, R. G. (1993). A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transaction on Networking, 1(3), 344–357.CrossRef Parekh, A. K., & Gallager, R. G. (1993). A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transaction on Networking, 1(3), 344–357.CrossRef
9.
Zurück zum Zitat Demers, A., Keshav, S., & Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. In Proceedings of ACM SIGCOMM, pp. 1–12 Demers, A., Keshav, S., & Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. In Proceedings of ACM SIGCOMM, pp. 1–12
10.
Zurück zum Zitat Yaron, O., & Sidi, M. (1994). Generalized processor sharing networks with exponentially bounded burstiness arrivals. In Proceedings of IEEE INFOCOM, 628–634. Yaron, O., & Sidi, M. (1994). Generalized processor sharing networks with exponentially bounded burstiness arrivals. In Proceedings of IEEE INFOCOM, 628–634.
11.
Zurück zum Zitat Zhang, Z. L., Liu, Z., & Towsley, D. (1998). Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline. Journal of Combinatorial Optimization, 1(4), 457–481.CrossRefMATHMathSciNet Zhang, Z. L., Liu, Z., & Towsley, D. (1998). Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline. Journal of Combinatorial Optimization, 1(4), 457–481.CrossRefMATHMathSciNet
12.
Zurück zum Zitat Zhang, Z. L., Towsley, D., & Kurose, J. (1995). Statistical analysis of the generalized processor sharing scheduling discipline. IEEE Journal on Selected Areas in Communications, 13(6), 1071–1080.CrossRef Zhang, Z. L., Towsley, D., & Kurose, J. (1995). Statistical analysis of the generalized processor sharing scheduling discipline. IEEE Journal on Selected Areas in Communications, 13(6), 1071–1080.CrossRef
13.
Zurück zum Zitat Kurose, J., Zhang, Z. L., Liu, Z., & Towsley, D. (1997). Call admission control schemes under generalized processor sharing scheduling. Telecommunication Systems, 7(1), 125–152.CrossRef Kurose, J., Zhang, Z. L., Liu, Z., & Towsley, D. (1997). Call admission control schemes under generalized processor sharing scheduling. Telecommunication Systems, 7(1), 125–152.CrossRef
14.
Zurück zum Zitat Szabó, R., Barta, P., Nemeth, F., Biro, J., & Perntz, C. (2000). Call admission control in generalized processor sharing schedulers using non-rate proportional weighting of sessions. In Proceedings of IEEE INFOCOM, pp. 1243–1252. Szabó, R., Barta, P., Nemeth, F., Biro, J., & Perntz, C. (2000). Call admission control in generalized processor sharing schedulers using non-rate proportional weighting of sessions. In Proceedings of IEEE INFOCOM, pp. 1243–1252.
15.
Zurück zum Zitat Nandita, D., Kuri, J., & Jamadagni, H. S. (2001). Optimal call admission control in generalized processor sharing (GPS) schedulers. In Proceedings of IEEE INFOCOM, pp. 468–477. Nandita, D., Kuri, J., & Jamadagni, H. S. (2001). Optimal call admission control in generalized processor sharing (GPS) schedulers. In Proceedings of IEEE INFOCOM, pp. 468–477.
16.
Zurück zum Zitat Jamin, S., Danzig, P. B., Shenker, S. J., & Zhang, L. (1997). A measurement based admission control algorithm for integrated service packet networks. IEEE/ACM Transaction on Networking, 5(1), 56–70.CrossRef Jamin, S., Danzig, P. B., Shenker, S. J., & Zhang, L. (1997). A measurement based admission control algorithm for integrated service packet networks. IEEE/ACM Transaction on Networking, 5(1), 56–70.CrossRef
17.
Zurück zum Zitat Jamin, S. (1996). A measurement based admission control algorithm for integrated services packet network. Ph.D. dissertation, USC. Jamin, S. (1996). A measurement based admission control algorithm for integrated services packet network. Ph.D. dissertation, USC.
18.
Zurück zum Zitat Abedi, S. (2004). Improved stability of QoS provisioning for 3G systems and beyond: Optimum and automatic strategy selection for packet schedulers. In Proceedings of IEEE ICC, pp. 1979–1985. Abedi, S. (2004). Improved stability of QoS provisioning for 3G systems and beyond: Optimum and automatic strategy selection for packet schedulers. In Proceedings of IEEE ICC, pp. 1979–1985.
19.
Zurück zum Zitat Srinivasan, R., & Baras, J. S. (2004). Understanding the trade-off between multiuser diversity gain and delay—an analytical approach. In Proceedings of IEEE VTC, pp. 2543–2547. Srinivasan, R., & Baras, J. S. (2004). Understanding the trade-off between multiuser diversity gain and delay—an analytical approach. In Proceedings of IEEE VTC, pp. 2543–2547.
20.
Zurück zum Zitat Wu, D., & Negi, R. (2004). Downlink scheduling in a cellular network for quality-of-service assurance. IEEE Transaction on Vehicular Technology, 53(5), 1547–1557.CrossRef Wu, D., & Negi, R. (2004). Downlink scheduling in a cellular network for quality-of-service assurance. IEEE Transaction on Vehicular Technology, 53(5), 1547–1557.CrossRef
21.
Zurück zum Zitat Kanodia, V., Li, C., Sabharwal, A., Sadeghi, B., & Knightly, E. (2001). Distributed multi-hop scheduling and medium access with delay and throughput constraints. In Proceedings of ACM MobiCom, pp. 200–209. Kanodia, V., Li, C., Sabharwal, A., Sadeghi, B., & Knightly, E. (2001). Distributed multi-hop scheduling and medium access with delay and throughput constraints. In Proceedings of ACM MobiCom, pp. 200–209.
22.
Zurück zum Zitat Narlikar, G., Wilfong, G., & Zhang, L. (2006). Designing multihop wireless backhaul networks with delay guarantees. In Proceedings of IEEE INFOCOM, pp. 1–12. Narlikar, G., Wilfong, G., & Zhang, L. (2006). Designing multihop wireless backhaul networks with delay guarantees. In Proceedings of IEEE INFOCOM, pp. 1–12.
23.
Zurück zum Zitat Lim, H., Lim, C., & Hou, J. C. (2006). Improving throughput through spatial diversity in wireless mesh networks: a coordinate-based approach. In Proceeding of ACM Mobicom, pp. 14–25. Lim, H., Lim, C., & Hou, J. C. (2006). Improving throughput through spatial diversity in wireless mesh networks: a coordinate-based approach. In Proceeding of ACM Mobicom, pp. 14–25.
24.
Zurück zum Zitat Raniwala, A., Gopalan, K., & Chiueh, T. (2004). Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. ACM Mobile Computing and Communication Review, 8(2), 50–65.CrossRef Raniwala, A., Gopalan, K., & Chiueh, T. (2004). Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. ACM Mobile Computing and Communication Review, 8(2), 50–65.CrossRef
25.
Zurück zum Zitat Lin, C. R., & Liu, J. S. (1999). Qos routing in ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, 17(8), 1426–1438.CrossRef Lin, C. R., & Liu, J. S. (1999). Qos routing in ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, 17(8), 1426–1438.CrossRef
26.
Zurück zum Zitat Lin, C. R. (2001). Admission control in time-slotted multihop mobile networks. IEEE Journal on Selected Areas in Communications, 19(10), 1974–1983.CrossRef Lin, C. R. (2001). Admission control in time-slotted multihop mobile networks. IEEE Journal on Selected Areas in Communications, 19(10), 1974–1983.CrossRef
27.
Zurück zum Zitat Raniwala, A., & Chiueh, T. (2005). Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In Proceedings of IEEE INFOCOM, pp. 2223–2234. Raniwala, A., & Chiueh, T. (2005). Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In Proceedings of IEEE INFOCOM, pp. 2223–2234.
28.
Zurück zum Zitat Kodialam, M., & Nandagopal, T. (2004). The effect of interference on the capacity of multi-hop wireless networks. In Proceedings of IEEE Symposium on Information Theory, p. 472. Kodialam, M., & Nandagopal, T. (2004). The effect of interference on the capacity of multi-hop wireless networks. In Proceedings of IEEE Symposium on Information Theory, p. 472.
29.
Zurück zum Zitat Kodialam, M., & Nandagopal, T. (2003). Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. In Proceedings of ACM MobiCom, pp. 42–54. Kodialam, M., & Nandagopal, T. (2003). Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. In Proceedings of ACM MobiCom, pp. 42–54.
30.
Zurück zum Zitat Kodialam, M., & Nandagopal, T. (2005). Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In Proceedings of ACM MobiCom, pp. 73–87. Kodialam, M., & Nandagopal, T. (2005). Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In Proceedings of ACM MobiCom, pp. 73–87.
31.
Zurück zum Zitat Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2005). Algorithmic aspects of capacity in wireless networks. SIGMETRICS Performance Evaluation Review, 33(1), 133–144.CrossRef Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2005). Algorithmic aspects of capacity in wireless networks. SIGMETRICS Performance Evaluation Review, 33(1), 133–144.CrossRef
32.
Zurück zum Zitat Wang, W. Z., Wang, Y., Li, X. Y., Song, W. Z., & Frieder, O. (2006). Efficient interference-aware TDMA link scheduling for static wireless networks. In Proceeding of ACM MobiCom, pp. 262–273. Wang, W. Z., Wang, Y., Li, X. Y., Song, W. Z., & Frieder, O. (2006). Efficient interference-aware TDMA link scheduling for static wireless networks. In Proceeding of ACM MobiCom, pp. 262–273.
33.
Zurück zum Zitat Alicherry, M., Bhatia, R., & Li, L. (2005). Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In Proceedings of ACM MobiCom, pp. 58–72. Alicherry, M., Bhatia, R., & Li, L. (2005). Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In Proceedings of ACM MobiCom, pp. 58–72.
34.
Zurück zum Zitat Ramaswami, R., & Sivarajan, K. (1995). Routing and wavelength assignment in all-optical networks. IEEE/ACM Transactions on Networking, 3(5), 489–500.CrossRef Ramaswami, R., & Sivarajan, K. (1995). Routing and wavelength assignment in all-optical networks. IEEE/ACM Transactions on Networking, 3(5), 489–500.CrossRef
35.
Zurück zum Zitat Zang, H., Jue, J., & Mukherjee, B. (2000). A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine, 1(1), 47–60. Zang, H., Jue, J., & Mukherjee, B. (2000). A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine, 1(1), 47–60.
36.
Zurück zum Zitat Lee, T., Lee, K., & Park, S. (2000). Optimal routing and wavelength assignment in WDM ring networks. IEEE Journal on Selected Areas in Communications, 18(10), 2146–2154.CrossRef Lee, T., Lee, K., & Park, S. (2000). Optimal routing and wavelength assignment in WDM ring networks. IEEE Journal on Selected Areas in Communications, 18(10), 2146–2154.CrossRef
37.
Zurück zum Zitat Calinescu, G. (2003). Computing 2-hop neighborhoods in ad hoc wireless networks. in Proceedings of AdHoc-Now, 175–186. Calinescu, G. (2003). Computing 2-hop neighborhoods in ad hoc wireless networks. in Proceedings of AdHoc-Now, 175–186.
38.
Zurück zum Zitat Calinescu, G., Mandoiu, I., Wan, P., & Zelikovsky, A. (2004). Selecting forwarding neighbors in wireless ad hoc networks. ACM/Baltzer Mobile Networks and Applications, 9(2), 101–112.CrossRef Calinescu, G., Mandoiu, I., Wan, P., & Zelikovsky, A. (2004). Selecting forwarding neighbors in wireless ad hoc networks. ACM/Baltzer Mobile Networks and Applications, 9(2), 101–112.CrossRef
39.
Zurück zum Zitat Baysan, M., Sarac, K., Chandrasekaran, R., & Bereg, S. (2009). A polynomial time solution to minimum forwarding set problem in wireless networks under unit disk coverage model. to appear. Baysan, M., Sarac, K., Chandrasekaran, R., & Bereg, S. (2009). A polynomial time solution to minimum forwarding set problem in wireless networks under unit disk coverage model. to appear.
40.
Zurück zum Zitat Vazirani, V. V. (2003). Approximation Alogrithm (2nd ed.). Berlin, Germany: Springer. Vazirani, V. V. (2003). Approximation Alogrithm (2nd ed.). Berlin, Germany: Springer.
41.
Zurück zum Zitat Gupta, A., & Ying, L. (1999). On algorithms for finding maximum matchings in bipartite graphs. IBM T. J. Watson Research Center, Tech. Rep. 21576(97320). Gupta, A., & Ying, L. (1999). On algorithms for finding maximum matchings in bipartite graphs. IBM T. J. Watson Research Center, Tech. Rep. 21576(97320).
Metadaten
Titel
Flow admission control for multi-channel multi-radio wireless networks
verfasst von
XuFei Mao
Xiang-Yang Li
GuoJun Dai
Publikationsdatum
01.04.2011
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 3/2011
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-010-0314-7

Weitere Artikel der Ausgabe 3/2011

Wireless Networks 3/2011 Zur Ausgabe

Neuer Inhalt