On pairwise connectivity of wireless multihop networks Online publication date: Fri, 16-Mar-2007
by Fangting Sun, Mark A. Shayman
International Journal of Security and Networks (IJSN), Vol. 2, No. 1/2, 2007
Abstract: This paper experimentally investigates the service availability of wireless multihop networks based on the following two metrics: Average Pairwise Connectivity (APC) and Pairwise Connected Ratio (PCR), where the former denotes the average number of node-disjoint paths per node pair and the latter is the fraction of node pairs that are pairwise connected. A theoretical upperbound are derived for APC, which can approximate the exact value very well. We also studied the fault tolerance and attack resilience and proposed a new resilience metric, α-ρ-resilience, where a network is α-ρ-resilient if at least a portion of nodes pairs remain connected as long as no more than p percentage nodes are removed. Three different node removal patterns are studied: random removal, selective removal and partition. The experimental studies show that wireless multihop networks are more sensitive to partition and selective removal attacks are a little bit more severe than random removal attacks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook