On pairwise connectivity of wireless multihop networks

Authors:
Fangting Sun;Mark A. Shayman
Affiliations:
Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA.;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA
Venue:
International Journal of Security and Networks
Year:
2007

Citing 9
Cited 8

Network Resilience: A Measure of Network Fault Tolerance

IEEE Transactions on Computers
A new approach to the design and analysis of peer-to-peer mobile networks

Wireless Networks
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Ad hoc networking: an introduction

Ad hoc networking
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Fault tolerant deployment and topology control in wireless networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Dynamically Restructurable Fault-Tolerant Processor Network Architectures

IEEE Transactions on Computers
Attack-resistant cooperation stimulation in autonomous ad hoc networks

IEEE Journal on Selected Areas in Communications

Security overhead and performance for aggregation with fragment retransmission (AFR) in very high-speed wireless 802.11 LANs

IEEE Transactions on Wireless Communications
On approximation of new optimization methods for assessing network vulnerability

INFOCOM'10 Proceedings of the 29th conference on Information communications
Wireless telemedicine and m-health: technologies, applications and research issues

International Journal of Sensor Networks
The effect of leaders on the consistency of group behaviour

International Journal of Sensor Networks
A survey of cyber crimes

Security and Communication Networks
On new approaches of assessing network vulnerability: hardness and approximation

IEEE/ACM Transactions on Networking (TON)
Exact bounds for average pairwise network reliability

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
On the discovery of critical links and nodes for assessing network vulnerability

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper experimentally investigates the service availabilityof 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-disjointpaths per node pair and the latter is the fraction of node pairsthat are pairwise connected. A theoretical upperbound are derivedfor APC, which can approximate the exact value very well. We alsostudied the fault tolerance and attack resilience and proposed anew resilience metric, α-ρ-resilience, where a network isα-ρ-resilient if at least a portion of nodes pairs remainconnected 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 thatwireless multihop networks are more sensitive to partition andselective removal attacks are a little bit more severe than randomremoval attacks.