Skip to main content
Erschienen in: Wireless Networks 2/2013

01.02.2013

The impact of network topology on delay bound in wireless Ad Hoc networks

verfasst von: Ali Ghiasian, Hossein Saidi, Behnaz Omoomi, Soodeh Amiri

Erschienen in: Wireless Networks | Ausgabe 2/2013

Einloggen

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

search-config
loading …

Abstract

We consider single channel wireless networks with interference constraint among the links that can be activated simultaneously. The traffic flows are assumed to be single hop. Delay performance of the well known throughput optimal maximum weight link scheduling algorithm has been studied recently. In this paper, we study the relation between network topology and delay of maximum weight link scheduling algorithm. First, we consider 1-hop interference model. Under this interference model, an upper bound for the average delay of packets is derived analytically in terms of edge chromatic number of the network graph. Then the results have been extended to the case of general interference model. Under this model of interference, an upper bound for delay as a function of chromatic number of conflict graph is derived. Since chromatic number and edge chromatic number are network topology parameters, the results show that how the upper bound of delay is affected by network topology. Simulation results confirm our analytical relations.

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!

Literatur
1.
Zurück zum Zitat Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transaction on Automatic Control, 37(12), 1936–1948MathSciNetMATHCrossRef Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transaction on Automatic Control, 37(12), 1936–1948MathSciNetMATHCrossRef
2.
Zurück zum Zitat Sharma, G., Mazumdar, R. R., Shroff, N. B. (2006). On the complexity of scheduling in wireless networks. In Proceedings ACM MobiCom (pp. 227–238). NY, USA Sharma, G., Mazumdar, R. R., Shroff, N. B. (2006). On the complexity of scheduling in wireless networks. In Proceedings ACM MobiCom (pp. 227–238). NY, USA
3.
Zurück zum Zitat Tassiulas L. (1998). Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE INFOCOM, vol. 2, pp. 533–539 Tassiulas L. (1998). Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE INFOCOM, vol. 2, pp. 533–539
4.
Zurück zum Zitat Modiano, Eytan, Shah, Devavrat, Zussman, Gil (2006). Maximizing throughput in wireless networks via gossiping. In Proceedings of ACM SIGMETRICS, 34, vol. 34, no. 1, pp. 27–38. Modiano, Eytan, Shah, Devavrat, Zussman, Gil (2006). Maximizing throughput in wireless networks via gossiping. In Proceedings of ACM SIGMETRICS, 34, vol. 34, no. 1, pp. 27–38.
5.
Zurück zum Zitat Sanghavi, S., Bui, L., & Srikant, R. (2007). Distributed link scheduling with constant overhead. Proceedings of ACM SIGMETRICS, 35(1), 313–324.CrossRef Sanghavi, S., Bui, L., & Srikant, R. (2007). Distributed link scheduling with constant overhead. Proceedings of ACM SIGMETRICS, 35(1), 313–324.CrossRef
6.
Zurück zum Zitat Bui, L. X., Sanghavi, S., Srikant, R. (2009). Distributed link scheduling with constant overhead. IEEE/ACM Transaction on Networking, 17, 1467–1480.CrossRef Bui, L. X., Sanghavi, S., Srikant, R. (2009). Distributed link scheduling with constant overhead. IEEE/ACM Transaction on Networking, 17, 1467–1480.CrossRef
7.
Zurück zum Zitat Yi, Y., & Chiang, M. (2008). Wireless scheduling algorithms with o(1) overhead for m-hop interference model. In Proceedings of IEEE ICC, pp. 3105–3109. Yi, Y., & Chiang, M. (2008). Wireless scheduling algorithms with o(1) overhead for m-hop interference model. In Proceedings of IEEE ICC, pp. 3105–3109.
8.
Zurück zum Zitat Gupta, A., Lin, X., Srikant, R. (2009). Low-complexity distributed scheduling algorithms for wireless networks. IEEE/ACM Transaction on Networking, 17, 1846–1859.CrossRef Gupta, A., Lin, X., Srikant, R. (2009). Low-complexity distributed scheduling algorithms for wireless networks. IEEE/ACM Transaction on Networking, 17, 1846–1859.CrossRef
9.
Zurück zum Zitat David, A. (1983). A survey of heuristics for the weighted matching problem. Networks 13(4), 475–493.MATH David, A. (1983). A survey of heuristics for the weighted matching problem. Networks 13(4), 475–493.MATH
10.
Zurück zum Zitat Hoepman, J. H. (2004). Simple distributed weighted matchings. In In eprint cs.DC/0410047 Hoepman, J. H. (2004). Simple distributed weighted matchings. In In eprint cs.DC/0410047
11.
Zurück zum Zitat Preis, R. (1998). Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In In general graphs, symposium on theoretical aspects of computer science, STACS 99 (pp. 259–269). Springer: Berlin Preis, R. (1998). Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In In general graphs, symposium on theoretical aspects of computer science, STACS 99 (pp. 259–269). Springer: Berlin
12.
Zurück zum Zitat Vinkemeier, D. E. D., & Hougardy, S. (2005). A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms 1, 107–122.MathSciNetCrossRef Vinkemeier, D. E. D., & Hougardy, S. (2005). A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms 1, 107–122.MathSciNetCrossRef
13.
Zurück zum Zitat Chaporkar, P., Kar, K., Luo, Xiang., & Sarkar, S. (2008). Throughput and fairness guarantees through maximal scheduling in wireless networks. IEEE Transactions on Information Theory, 54(2), 572–594.MathSciNetCrossRef Chaporkar, P., Kar, K., Luo, Xiang., & Sarkar, S. (2008). Throughput and fairness guarantees through maximal scheduling in wireless networks. IEEE Transactions on Information Theory, 54(2), 572–594.MathSciNetCrossRef
14.
Zurück zum Zitat Wu, X., Srikant, R., Perkins., & James R. (2007). Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Transactions on Mobile Computing 6, 595–605.CrossRef Wu, X., Srikant, R., Perkins., & James R. (2007). Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Transactions on Mobile Computing 6, 595–605.CrossRef
15.
Zurück zum Zitat Abbas, A. M., & Kure, O. (2010) Quality of service in mobile ad hoc networks: A survey. International Journal of Ad Hoc and Ubiquitous Computing, 6, 75–98CrossRef Abbas, A. M., & Kure, O. (2010) Quality of service in mobile ad hoc networks: A survey. International Journal of Ad Hoc and Ubiquitous Computing, 6, 75–98CrossRef
16.
Zurück zum Zitat Neely, M. J. (2008a). Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks. IEEE/ACM Transaction on Networking 16(5), 1188–1199.MathSciNetCrossRef Neely, M. J. (2008a). Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks. IEEE/ACM Transaction on Networking 16(5), 1188–1199.MathSciNetCrossRef
17.
Zurück zum Zitat Neely, M. J. (2008b). Delay analysis for max weight opportunistic scheduling in wireless systems. In Communication, Control, and Computing, 2008 46th Annual Allerton Conference on, pp. 683–691. Neely, M. J. (2008b). Delay analysis for max weight opportunistic scheduling in wireless systems. In Communication, Control, and Computing, 2008 46th Annual Allerton Conference on, pp. 683–691.
18.
Zurück zum Zitat Le, L. B., Jagannathan, K., & Modiano, E. (2009). Delay analysis of maximum weight scheduling in wireless ad hoc networks. In Information sciences and systems, 2009. CISS 2009. 43rd annual conference on, pp. 389–394. Le, L. B., Jagannathan, K., & Modiano, E. (2009). Delay analysis of maximum weight scheduling in wireless ad hoc networks. In Information sciences and systems, 2009. CISS 2009. 43rd annual conference on, pp. 389–394.
19.
Zurück zum Zitat Neely, M. J. (2009). Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic. IEEE/ACM Transaction Networking, 17(4), 1146–1159, ISSN 1063–6692. Neely, M. J. (2009). Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic. IEEE/ACM Transaction Networking, 17(4), 1146–1159, ISSN 1063–6692.
20.
Zurück zum Zitat Gupta, G. R., & Shroff, N. B. (2010). Delay analysis for wireless networks with single hop traffic and general interference constraints. IEEE/ACM Transaction on Networking, 18, 393–405.MATHCrossRef Gupta, G. R., & Shroff, N. B. (2010). Delay analysis for wireless networks with single hop traffic and general interference constraints. IEEE/ACM Transaction on Networking, 18, 393–405.MATHCrossRef
21.
Zurück zum Zitat Gupta, G. R., & Shroff, N. B. (2011). Delay analysis and optimality of scheduling policies for multihop wireless networks. IEEE/ACM Transaction on Networking, 19, 129–141.MATHCrossRef Gupta, G. R., & Shroff, N. B. (2011). Delay analysis and optimality of scheduling policies for multihop wireless networks. IEEE/ACM Transaction on Networking, 19, 129–141.MATHCrossRef
22.
Zurück zum Zitat Michelle, X. G., Son, I. K., Mao, S., & Li, Y. (2012). On frame-based scheduling for directional mmwave wpans. In INFOCOM 2012 Michelle, X. G., Son, I. K., Mao, S., & Li, Y. (2012). On frame-based scheduling for directional mmwave wpans. In INFOCOM 2012
23.
Zurück zum Zitat Georgiadis, L., Neely, M. J., Tassiulas, L. (2006). Resource allocation and cross-layer control in wireless networks. Foundation Trends on Network 1(1), 1–144.CrossRef Georgiadis, L., Neely, M. J., Tassiulas, L. (2006). Resource allocation and cross-layer control in wireless networks. Foundation Trends on Network 1(1), 1–144.CrossRef
24.
Zurück zum Zitat West, D. (2000). Introduction to graph theory, 2nd ed. Prentice Hall: Upper Saddle River, NJ West, D. (2000). Introduction to graph theory, 2nd ed. Prentice Hall: Upper Saddle River, NJ
Metadaten
Titel
The impact of network topology on delay bound in wireless Ad Hoc networks
verfasst von
Ali Ghiasian
Hossein Saidi
Behnaz Omoomi
Soodeh Amiri
Publikationsdatum
01.02.2013
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 2/2013
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-012-0462-z

Weitere Artikel der Ausgabe 2/2013

Wireless Networks 2/2013 Zur Ausgabe

Neuer Inhalt