To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
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
Sleep Scheduling for Geographic Routing in Duty-Cycled
Mobile Sensor Networks
Recently, the research focus on geographic routing, a promising routing scheme in wireless
sensor networks (WSNs), is shifting toward duty-cycled WSNs in which sensors are sleep
scheduled to reduce energy consumption. However, except the connected-k neighborhood
(CKN) sleep scheduling algorithm and the geographic routing oriented sleep scheduling
(GSS) algorithm, nearly all research work about geographic routing in duty -cycled WSNs
has focused on the geographic forwarding mechanism; further, most of the existing work
has ignored the fact that sensors can be mobile. In this paper, we focus on sleep scheduling
for geographic routing in duty-cycled WSNs with mobile sensors and propose two
geographic-distance-based connected-k neighborhood (GCKN) sleep scheduling
algorithms. The first one is the geographic-distance-based connected-kneighborhood for
first path (GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based
connected-kneighborhood for all paths (GCKNA) sleep scheduling algorithm. By
theoretical analysis and simulations, we show that when there are mobile sensors,
geographic routing can achieve much shorter average lengths for the first transmission
path explored in WSNs employing GCKNF sleep scheduling and all transmission paths
searched in WSNs employing GCKNA sleep scheduling compared with those in WSNs
employing CKN and GSS sleep scheduling.
Existing system
Recently, the research focus on geographic routing, a promising routing scheme in wireless
sensor networks (WSNs), is shifting toward duty-cycled WSNs in which sensors are sleep
scheduled to reduce energy consumption. However, except the connected-k neighborhood
(CKN) sleep scheduling algorithm and the geographic routing oriented sleep scheduling
(GSS) algorithm, nearly all research work about geographic routing in duty -cycled WSNs

2. has focused on the geographic forwarding mechanism; further, most of the existing work
has ignored the fact that sensors can be mobile.
Proposed system
In this paper, we focus on sleep scheduling for geographic routing in duty -cycled WSNs
with mobile sensors and propose two geographic-distance-based connected-k neighborhood
(GCKN) sleep scheduling algorithms. The first one is the geographic -distance-based
connected-kneighborhood for first path (GCKNF) sleep scheduling algorithm. The second
one is the geographic-distance-based connected-kneighborhood for all paths (GCKNA)
sleep scheduling algorithm. By theoretical analysis and simulations, we show that when
there are mobile sensors, geographic routing can achieve much shorter average lengths for
the first transmission path explored in WSNs employing GCKNF sleep scheduling and all
transmission paths searched in WSNs employing GCKNA sleep scheduling compared with
those in WSNs employing CKN and GSS sleep scheduling.
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:-
 Operating System : Windows XP
 Programming Language : JAVA

3.  Java Version : JDK 1.6 & above.