Documents
Resources
Learning Center
Upload
Plans & pricing Sign in
Sign Out

IEEE 2010 - - Exploiting and Defending Opportunistic Scheduling in Cellular Data Networks

VIEWS: 0 PAGES: 1

Java Projects, Java Final Year Projects, Java IEEE Projects, NCCT Final Year Projects, J2EE Projects, J2ME Projects, IEEE Projects, IEEE Projects 2011, IEEE Projects 2010, IEEE Projects 2009, IEEE Projects 2010-11, Java Project Titles, IEEE Project Titles, Java Project Topics, IEEE Project Topics, IEEE Projects, IEEE Project Titles, IEEE Software Projects, IEEE Java Projects, IEEE DOTNET Projects, IEEE ASP.NET Projects, IEEE VB.NET Projects, IEEE J2EE Projects, IEEE J2ME Projects, IEEE C# Projects, IEEE Final year Projects, IEEE BE Projects, IEEE ME Projects, IEEE MTech Projects, IEEE MCA Projects, IEEE Projects 2010, IEEE Project Titles 2010, IEEE Software Projects 2010, IEEE Java Projects 2010, IEEE DOTNET Projects 2010, IEEE ASP.NET, Projects 2010, IEEE VB.NET Projectgs 2010, IEEE J2EE Projects 2010, IEEE J2ME Projects 2010, IEEE C# Projects 2010, IEEE Final year Projects 2010, IEEE BE Projects 2010, IEEE ME Projects 2010, IEEE MTech Projects 2010, IEEE MCA Projects 2010

More Info
									NCCT                                  IEEE PROJECTS 2010-11
Promise for the Best Projects            JAVA & .NET

IEEE TRANSACTIONS ON MOBILE COMPUTING
VOL. 9, NO. 5, MAY 2010 609

       EXPLOITING AND DEFENDING OPPORTUNISTIC
       SCHEDULING IN CELLULAR DATA NETWORKS

ABSTRACT
Third Generation (3G) cellular networks take advantage of time-varying
and location-dependent channel conditions of mobile users to provide
broadband services. Under fairness and QoS constraints, they use
opportunistic scheduling to efficiently utilize the available spectrum.
Opportunistic scheduling algorithms rely on the collaboration among all
mobile users to achieve their design objectives. However, we
demonstrate that rogue cellular devices can exploit vulnerabilities in
popular opportunistic scheduling algorithms, such as Proportional Fair
(PF) and Temporal Fair (TF), to usurp the majority of time slots in 3G
networks.
Our simulations show that under realistic conditions, only five rogue
device per 50-user cell can capture up to 95 percent of the time slots,
and can cause 2-second end-to-end interpacket transmission delay on
VoIP applications for every user in the same cell, rendering VoIP
applications useless.
To defend against this attack, we propose strengthening the PF and TF
schedulers and a robust handoff scheme.


INDEX TERMS
Security, opportunistic scheduling, proportional fair, temporal fair ,
handoff.




      NCCT, 28235816, 93801 02891, 98411 93224
  www.ncct.in, www.ieeeprojects.net, ncctchennai@gmail.com

								
To top