![GLOBALSOFT TECHNOLOGIES
Asymptotic Analysis on Secrecy Capacity in Large-Scale
Wireless Networks
Abstract
Since wireless channel is vulnerable to eavesdroppers, the secrecy during message delivery is a major
concern in many applications such as commercial, governmental, and military networks. This paper
investigates information-theoretic secrecy in large-scale networks and studies how capacity is affected
by the secrecy constraint where the locations and channel state information (CSI) of eavesdroppers are
both unknown. We consider two scenarios: 1) noncolluding case where eavesdroppers can only decode
messages individually; and 2) colluding case where eavesdroppers can collude to decode a message. For
the noncolluding case, we show that the network secrecy capacity is not affected in order-sense by the
presence of eavesdroppers. For the colluding case, the per-node secrecy capacity of Θ([1/(√n)]) can be
achieved when the eavesdropper density ψe(n) is O(n-β), for any constant β > 0 and decreases
monotonously as the density of eavesdroppers increases. The upper bounds on network secrecy
capacity are derived for both cases and shown to be achievable by our scheme when ψe(n)=O(n-β) or
ψe(n)=Ω(log[(α-2)/(α)]n), where α is the path-loss gain. We show that there is a clear tradeoff between the
security constraints and the achievable capacity. Furthermore, we also investigate the impact of secrecy
constraint on the capacity of dense network, the impact of active attacks and other traffic patterns, as
well as mobility models in the context.
Existing system
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com](https://image.slidesharecdn.com/asymptoticanalysisonsecrecycapacityinlarge-scalewirelessnetworks-140920024040-phpapp01/85/IEEE-2014-NS2-NETWORKING-PROJECTS-Asymptotic-analysis-on-secrecy-capacity-in-large-scale-wireless-networks-1-320.jpg)
![Since wireless channel is vulnerable to eavesdroppers, the secrecy during message delivery is a major
concern in many applications such as commercial, governmental, and military networks. This paper
investigates information-theoretic secrecy in large-scale networks and studies how capacity is affected
by the secrecy constraint where the locations and channel state information (CSI) of eavesdroppers are
both unknown. We consider two scenarios: 1) noncolluding case where eavesdroppers can only decode
messages individually; and 2) colluding case where eavesdroppers can collude to decode a message. For
the noncolluding case, we show that the network secrecy capacity is not affected in order-sense by the
presence of eavesdroppers. For the colluding case, the per-node secrecy capacity of Θ([1/(√n)]) can be
achieved when the eavesdropper density ψe(n) is O(n-β), for any constant β > 0 and decreases
monotonously as the density of eavesdroppers increases. The upper bounds on network secrecy
capacity are derived for both cases and shown to be achievable by our scheme when ψe(n)=O(n-β) or
ψe(n)=Ω(log[(α-2)/(α)]n), where α is the path-loss gain.
Proposed system
. We show that there is a clear tradeoff between the security constraints and the achievable capacity.
Furthermore, we also investigate the impact of secrecy constraint on the capacity of dense network, the
impact of active attacks and other traffic patterns, as well as mobility models in the context.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
Processor - Pentium –IV
Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
SOFTWARE CONFIGURATION:-](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Recommended
More Related Content
What's hot
What's hot (18)
Similar to IEEE 2014 NS2 NETWORKING PROJECTS Asymptotic analysis on secrecy capacity in large scale wireless networks
Similar to IEEE 2014 NS2 NETWORKING PROJECTS Asymptotic analysis on secrecy capacity in large scale wireless networks (20)
More from IEEEBEBTECHSTUDENTPROJECTS
More from IEEEBEBTECHSTUDENTPROJECTS (20)
Recently uploaded
Recently uploaded (20)
IEEE 2014 NS2 NETWORKING PROJECTS Asymptotic analysis on secrecy capacity in large scale wireless networks
- 1. GLOBALSOFT TECHNOLOGIES Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks Abstract Since wireless channel is vulnerable to eavesdroppers, the secrecy during message delivery is a major concern in many applications such as commercial, governmental, and military networks. This paper investigates information-theoretic secrecy in large-scale networks and studies how capacity is affected by the secrecy constraint where the locations and channel state information (CSI) of eavesdroppers are both unknown. We consider two scenarios: 1) noncolluding case where eavesdroppers can only decode messages individually; and 2) colluding case where eavesdroppers can collude to decode a message. For the noncolluding case, we show that the network secrecy capacity is not affected in order-sense by the presence of eavesdroppers. For the colluding case, the per-node secrecy capacity of Θ([1/(√n)]) can be achieved when the eavesdropper density ψe(n) is O(n-β), for any constant β > 0 and decreases monotonously as the density of eavesdroppers increases. The upper bounds on network secrecy capacity are derived for both cases and shown to be achievable by our scheme when ψe(n)=O(n-β) or ψe(n)=Ω(log[(α-2)/(α)]n), where α is the path-loss gain. We show that there is a clear tradeoff between the security constraints and the achievable capacity. Furthermore, we also investigate the impact of secrecy constraint on the capacity of dense network, the impact of active attacks and other traffic patterns, as well as mobility models in the context. Existing system IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
- 2. Since wireless channel is vulnerable to eavesdroppers, the secrecy during message delivery is a major concern in many applications such as commercial, governmental, and military networks. This paper investigates information-theoretic secrecy in large-scale networks and studies how capacity is affected by the secrecy constraint where the locations and channel state information (CSI) of eavesdroppers are both unknown. We consider two scenarios: 1) noncolluding case where eavesdroppers can only decode messages individually; and 2) colluding case where eavesdroppers can collude to decode a message. For the noncolluding case, we show that the network secrecy capacity is not affected in order-sense by the presence of eavesdroppers. For the colluding case, the per-node secrecy capacity of Θ([1/(√n)]) can be achieved when the eavesdropper density ψe(n) is O(n-β), for any constant β > 0 and decreases monotonously as the density of eavesdroppers increases. The upper bounds on network secrecy capacity are derived for both cases and shown to be achievable by our scheme when ψe(n)=O(n-β) or ψe(n)=Ω(log[(α-2)/(α)]n), where α is the path-loss gain. Proposed system . We show that there is a clear tradeoff between the security constraints and the achievable capacity. Furthermore, we also investigate the impact of secrecy constraint on the capacity of dense network, the impact of active attacks and other traffic patterns, as well as mobility models in the context. SYSTEM CONFIGURATION:- HARDWARE CONFIGURATION:- Processor - Pentium –IV Speed - 1.1 Ghz RAM - 256 MB(min) Hard Disk - 20 GB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGA SOFTWARE CONFIGURATION:-
- 3. Operating System : Windows XP Programming Language : JAVA Java Version : JDK 1.6 & above.