02-05-2012, 05:20 PM
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 pre-existing 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 behaviours of secure throughput and delay with the common transmission range and the probability of neighbouring nodes having a primary security association are quantified when the network size 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/√log n) packets/time slot, wherein no security requirements are enforced onWANETs. This implies that even when Pf the goes to zero as the network size becomes arbi- trarily 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.
Existing System
In previous work show that the per-flow throughput capacity for static WANETs scales as (refer to Appendix A for the standard asymptotic notation used throughout this paper) under the assumption that nodes with common transmission range are randomly distributed. Note that this work implicitly uses a fluid model for establishing throughput scaling.
Recently, with the percolation theory, show that the perflow throughput of is achievable if each node can adjust its transmission range through power control.
Disadvantage
A drawback common to all the above results is the neglect of security requirements, which are receiving growing attention in recent years because many large scale WANETs are expected to be deployed in hostile scenarios.
Problem Definition
In 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. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure, since more effort needs to be made to harmonize the behavior of different participants and manage distributed network resources to support end-to-end (e2e) communication demands compared to the network with infrastructure.
It is known that security always comes with a price, as securing communications against the adversary typically consumes more network resources in terms of bandwidth and/or hardware capacities. This pricemay be tolerable in small-scale WANETs, but it may dominate the consumption of scarce network resources in large-scaleWANETs. This situation makes the investigation of throughput-delay tradeoffs with security requirements in large-scale WANETs an important open challenge.
Objective
To quantify the asymptotic behaviors of secure throughput and delay with the common transmission range and the probability of neighboring nodes having a primary security association when the network size is sufficiently large. To analyze the costs and benefits of secure-link-augmentation operations on the secure throughput and delay.
Scope of the Project
Based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range and the probability of neighboring nodes having a primary security association are quantified when the network size is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed.
System Requirements
Hardware Requirements
SYSTEM : Pentium IV 2.4 GHz
HARD DISK : 40 GB
MONITOR : 15 VGA colour
RAM : 256 MB
KEYBOARD : 110 keys enhanced.
Software Requirements
Operating system : Windows XP or Above
Front End : Java 6 or above
Back End : MySQL 5.0.41
Connector : MySQLJ connector 5 or above
GUI for Back end : Heidi SQL 3.2
Conclusion
In this project, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range and the probability of neighboring nodes having a primary security association are quantified when the network size is sufficiently large. The costs and benefits of secure link augmentation operations on the secure network performance are also analyzed.