On the price of security in large-scale wireless ad hoc networks

Chi Zhang, Yang Song, Yuguang Fang, Yanchao Zhang

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Security always comes with a price in terms of performance degradation, which should be carefully quantified. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure. Forming end-to-end secure paths in such WANETs is more challenging than in conventional networks due to the lack of central authorities, and its impact on network performance is largely untouched in the literature. In this paper, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. In general, security has a cost: Since we require all the communications operate on secure links, there is a degradation in the network performance when pf<1. However, one important exception is that when pf is Ω(1/log n), the secure throughput remains at the Gupta and Kumar bound of Θ(1/√n log n) packets/time slot, wherein no security requirements are enforced on WANETs. This implies that even when the pf goes to zero as the network size becomes arbitrarily large, it is still possible to build throughput-order-optimal secure WANETs, which is of practical interest since pf is very small in many practical large-scale WANETs.

Original languageEnglish (US)
Article number5710020
Pages (from-to)319-332
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume19
Issue number2
DOIs
StatePublished - Apr 2011

Fingerprint

Wireless ad hoc networks
Throughput
Network performance
Degradation
Communication
Costs
Association reactions

Keywords

  • Ad hoc networks
  • network performance
  • network security
  • wireless networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

On the price of security in large-scale wireless ad hoc networks. / Zhang, Chi; Song, Yang; Fang, Yuguang; Zhang, Yanchao.

In: IEEE/ACM Transactions on Networking, Vol. 19, No. 2, 5710020, 04.2011, p. 319-332.

Research output: Contribution to journalArticle

Zhang, Chi ; Song, Yang ; Fang, Yuguang ; Zhang, Yanchao. / On the price of security in large-scale wireless ad hoc networks. In: IEEE/ACM Transactions on Networking. 2011 ; Vol. 19, No. 2. pp. 319-332.
@article{ff07e6a96e494490a7c3a7b0d7a0e98d,
title = "On the price of security in large-scale wireless ad hoc networks",
abstract = "Security always comes with a price in terms of performance degradation, which should be carefully quantified. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure. Forming end-to-end secure paths in such WANETs is more challenging than in conventional networks due to the lack of central authorities, and its impact on network performance is largely untouched in the literature. In this paper, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. In general, security has a cost: Since we require all the communications operate on secure links, there is a degradation in the network performance when pf<1. However, one important exception is that when pf is Ω(1/log n), the secure throughput remains at the Gupta and Kumar bound of Θ(1/√n log n) packets/time slot, wherein no security requirements are enforced on WANETs. This implies that even when the pf goes to zero as the network size becomes arbitrarily large, it is still possible to build throughput-order-optimal secure WANETs, which is of practical interest since pf is very small in many practical large-scale WANETs.",
keywords = "Ad hoc networks, network performance, network security, wireless networks",
author = "Chi Zhang and Yang Song and Yuguang Fang and Yanchao Zhang",
year = "2011",
month = "4",
doi = "10.1109/TNET.2011.2106162",
language = "English (US)",
volume = "19",
pages = "319--332",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - On the price of security in large-scale wireless ad hoc networks

AU - Zhang, Chi

AU - Song, Yang

AU - Fang, Yuguang

AU - Zhang, Yanchao

PY - 2011/4

Y1 - 2011/4

N2 - Security always comes with a price in terms of performance degradation, which should be carefully quantified. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure. Forming end-to-end secure paths in such WANETs is more challenging than in conventional networks due to the lack of central authorities, and its impact on network performance is largely untouched in the literature. In this paper, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. In general, security has a cost: Since we require all the communications operate on secure links, there is a degradation in the network performance when pf<1. However, one important exception is that when pf is Ω(1/log n), the secure throughput remains at the Gupta and Kumar bound of Θ(1/√n log n) packets/time slot, wherein no security requirements are enforced on WANETs. This implies that even when the pf goes to zero as the network size becomes arbitrarily large, it is still possible to build throughput-order-optimal secure WANETs, which is of practical interest since pf is very small in many practical large-scale WANETs.

AB - Security always comes with a price in terms of performance degradation, which should be carefully quantified. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure. Forming end-to-end secure paths in such WANETs is more challenging than in conventional networks due to the lack of central authorities, and its impact on network performance is largely untouched in the literature. In this paper, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. In general, security has a cost: Since we require all the communications operate on secure links, there is a degradation in the network performance when pf<1. However, one important exception is that when pf is Ω(1/log n), the secure throughput remains at the Gupta and Kumar bound of Θ(1/√n log n) packets/time slot, wherein no security requirements are enforced on WANETs. This implies that even when the pf goes to zero as the network size becomes arbitrarily large, it is still possible to build throughput-order-optimal secure WANETs, which is of practical interest since pf is very small in many practical large-scale WANETs.

KW - Ad hoc networks

KW - network performance

KW - network security

KW - wireless networks

UR - http://www.scopus.com/inward/record.url?scp=79955482990&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955482990&partnerID=8YFLogxK

U2 - 10.1109/TNET.2011.2106162

DO - 10.1109/TNET.2011.2106162

M3 - Article

AN - SCOPUS:79955482990

VL - 19

SP - 319

EP - 332

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

M1 - 5710020

ER -