Skip to main content

2023 | OriginalPaper | Buchkapitel

5. Secure Routing

verfasst von : Yulong Shen, Yuanyu Zhang, Xiaohong Jiang

Erschienen in: Secrecy, Covertness and Authentication in Wireless Communications

Verlag: Springer Nature Switzerland

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

search-config
loading …

Abstract

Due to the advantages of low computational complexity, easy implementation in a distributed manner and no need to distribute/manage secret keys, applying the PLS technology to protect transmission security in various wireless communication systems has been attracting considerable academic attention recently. Existing studies on the design of PLS-based schemes mainly focus on either the single-hop (point-to-point) or two-hop relay communication systems. Although these studies have made great progress, they are not applicable to multi-hop network scenarios. In many cases, wireless nodes (devices) adopt short-range communication due to power limitations. Hence, data of a source may need to be forwarded by several intermediate nodes to reach its destination when the distance between the source and destination is far. In this context, it is essential to leverage a routing scheme to establish the route (path) for end-to-end data delivery. However, the PLS-oriented routing design for multi-hop wireless communication systems still remains largely uninvestigated and needs to be addressed carefully. This chapter introduces the PLS-based secure routing design. In Sect. 5.1, we present a security/QoS-aware route selection mechanism in multi-hop wireless ad hoc networks under different forwarding strategies. In Sect. 5.2, we show the PLS-based secure routing schemes that can achieve optimal security-QoS tradeoffs. In Sect. 5.3, we investigate the secure routing design taking into account the selfishness of cooperative jammers. The common performance metrics used in this chapter include SOP and connection outage probability (COP), where the former defines the probability that the SINR at one or more eavesdroppers is above a fixed threshold and the latter represents the probability that the SINR at the intended receiver is below a required threshold. SOP and COP serve as the metrics of security and QoS of the communication, respectively.

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 Amarasuriya G, Tellambura C, Ardakani M (2011) Asymptotically-exact performance bounds of af multi-hop relaying over nakagami fading. IEEE Trans Commun 59(4):962–967CrossRef Amarasuriya G, Tellambura C, Ardakani M (2011) Asymptotically-exact performance bounds of af multi-hop relaying over nakagami fading. IEEE Trans Commun 59(4):962–967CrossRef
2.
Zurück zum Zitat Gradshteyn I, Ryzhik I (2000) Table of integrals, series, and products, 7th edn. Academic PressMATH Gradshteyn I, Ryzhik I (2000) Table of integrals, series, and products, 7th edn. Academic PressMATH
3.
Zurück zum Zitat Abolhasan M, Wysocki T, Dutkiewicz E (2004) A review of routing protocols for mobile ad hoc networks. Ad Hoc Netw 2(1):1–22CrossRef Abolhasan M, Wysocki T, Dutkiewicz E (2004) A review of routing protocols for mobile ad hoc networks. Ad Hoc Netw 2(1):1–22CrossRef
4.
Zurück zum Zitat Zhou X, Ganti RK, Andrews JG, Hjorungnes A (2011) On the throughput cost of physical layer security in decentralized wireless networks. IEEE Trans Wireless Commun 10(8):2764–2775CrossRef Zhou X, Ganti RK, Andrews JG, Hjorungnes A (2011) On the throughput cost of physical layer security in decentralized wireless networks. IEEE Trans Wireless Commun 10(8):2764–2775CrossRef
5.
Zurück zum Zitat Weber S, Andrews JG, Jindal N (2010) An overview of the transmission capacity of wireless networks. IEEE Trans Commun 58(12):3593–3604CrossRef Weber S, Andrews JG, Jindal N (2010) An overview of the transmission capacity of wireless networks. IEEE Trans Commun 58(12):3593–3604CrossRef
7.
Zurück zum Zitat Medhi D (2010) Network routing: algorithms, protocols, and architectures. Morgan Kaufmann Medhi D (2010) Network routing: algorithms, protocols, and architectures. Morgan Kaufmann
8.
Zurück zum Zitat Caleffi M, Paura L (2011) M-dart: multi-path dynamic address routing. Wireless Commun Mobile Comput 11(3):392–409CrossRef Caleffi M, Paura L (2011) M-dart: multi-path dynamic address routing. Wireless Commun Mobile Comput 11(3):392–409CrossRef
9.
Zurück zum Zitat Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. IETF Netw. Working Group, RFC 3561 Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. IETF Netw. Working Group, RFC 3561
10.
Zurück zum Zitat Von Stackelberg H (1952) The theory of the market economy. Oxford University Press, London, UK Von Stackelberg H (1952) The theory of the market economy. Oxford University Press, London, UK
11.
Zurück zum Zitat Han Z, Niyato D, Saad W, Başar T, Hjørungnes A (2012) Game theory in wireless and communication networks: theory, models, and applications. Cambridge University Press, Cambridge, UKMATH Han Z, Niyato D, Saad W, Başar T, Hjørungnes A (2012) Game theory in wireless and communication networks: theory, models, and applications. Cambridge University Press, Cambridge, UKMATH
13.
14.
Zurück zum Zitat Yates RD (1995) A framework for uplink power control in cellular radio systems. IEEE J Sel Areas Commun 13(7):1341–1347CrossRef Yates RD (1995) A framework for uplink power control in cellular radio systems. IEEE J Sel Areas Commun 13(7):1341–1347CrossRef
15.
Zurück zum Zitat Medhi D, Ramasamy K (2017) Network routing: algorithms, protocols, and architectures. Morgan Kaufmann, San Mateo, CA, USA Medhi D, Ramasamy K (2017) Network routing: algorithms, protocols, and architectures. Morgan Kaufmann, San Mateo, CA, USA
16.
Zurück zum Zitat Clausen T, Jacquet P (2003) Optimized link state routing protocol (OLSR). IETF Netw. Working Group, RFC 3626 Clausen T, Jacquet P (2003) Optimized link state routing protocol (OLSR). IETF Netw. Working Group, RFC 3626
Metadaten
Titel
Secure Routing
verfasst von
Yulong Shen
Yuanyu Zhang
Xiaohong Jiang
Copyright-Jahr
2023
DOI
https://doi.org/10.1007/978-3-031-38465-3_5

Premium Partner