A Distributed and Scalable Time Slot Allocation
Protocol for Wireless Sensor Networks
ABSTRACT:
There are performance deficiencies that hamper the deployment of Wireless Sensor Networks (WSNs) in critical monitoring applications. Such applications are characterized by considerable network load generated as a result of sensing some characteristics of the monitored system. Excessive packet collisions lead to packet losses and retransmissions, resulting in significant overhead costs and latency. In order to address this issue, we introduce a distributed and scalable scheduling access scheme that mitigates high data loss in data-intensive sensor networks and can also handle some mobility. Our approach alleviates transmission collisions by employing virtual grids that adopt Latin Squares characteristics to time slot assignments. We show that our algorithm derives conflict free time slot allocation schedules without incurring global overhead in scheduling. Furthermore, we verify the effectiveness of our protocol by simulation experiments. The results demonstrate that our technique can efficiently handle sensor mobility with acceptable data loss, low packet delay, and low overhead.
Hardware Requirements:
• SYSTEM : Pentium IV 2.4 GHz
• HARD DISK : 40 GB
• FLOPPY DRIVE : 1.44 MB
• MONITOR : 15 VGA colour
• MOUSE : Logitech.
• RAM : 256 MB
• KEYBOARD : 110 keys enhanced.
Software Requirements:
• Operating system :- Windows XP Professional
• Front End :- Microsoft Visual Studio .Net 2005
• Coding Language :- C# 2.0
Modules:
· Client
· Server
· Energy Maps For Mobile Wirless Networks
REFERENCE:
Chih-Kuang Lin, Vladimir I.Zadorozhny, Prashant V. Krishnamurthy, Ho-Hyun Park, and Chan-Gun Lee, “A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks”, IEEE Transactions on Mobile Computing, Vol.10, No.5, April 2011.
