You are on page 1of 12

A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks

Dinesh KV(2811137) Chandrasekar T(2811129)

Copyright Wondershare Software

ABSTRACT

There are performance deficiencies that hamper the deployment of Wireless Sensor Networks (WSNs) in critical monitoring applications. 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 Wondershare Software Copyright in data-

INTRODUCTION

Sensor networks are being deployed for a wide range of application When the applications have high bandwidth needs for data transmission and stringent delay constraints As the example of a DIA that utilizes a WSN infrasteucture
Copyright Wondershare a Wireless sensor observes excitations around Software

EXISTING SYSTEM

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.

Copyright Wondershare Software

PROPOSED SYSTEM

Our approach alleviates transmission collisions by employing virtual grids that adopt Latin Square characteristics to time slot assignments. We Show that our algorithm derives conflict free time slot allocation schedules without incurring global overhead in scheduling. The experiment in the DRAND can efficiently handle sensor mobility with acceptable data loss, low packet delay, and low overhead. But the

Copyright Wondershare Software

ARCHITECTURE-DIAGRAM

Copyright Wondershare Software

EXPECTED OUTCOMES

Our approaches alliviates transmissions collisions by employing virtual grids that adopt latin square characteristics to time slot assignments. We show that our algorithm derivers conflict free time slot allocation schedules without incurring global overhead in scheduling. The experiment in DRAND Copyright Wondershare Software can effectively

HARDWARE REQUIREMENTS

SYSTEM HARD DISK RAM

: Pentium IV 2.4 GHz : 40 GB : 1 GB


Copyright Wondershare Software

SOFTWARE REQUIREMENTS

Operating system XP Professional Front End : -Java.

:- Windows

Coding Language

:- Java Swing
Copyright Wondershare Software

CONCLUSION

The design of a virtual grid network minimizes the protocol complexity and overhead, and subsequently improves the scalability. GLASS provides conflict-free time slots assignments in transmission schedules ,low control messages overhead, and good adaptability in dynamic environments. The results from our analysis and simulations demonstrate the feasibility of our approach in terms of transmission reliability, control overhead, and packet delay. While efficiently eliminating conflicting time slots in transmission schedules

Copyright Wondershare Software

REFERENCES
C.-K. Lin, V. Zadorozhny, and P. Krishnamurthy, Efficient Hybrid Channel Access for Data Intensive Sensor Networks, Proc. IEEE Intl Workshop Heterogeneous Wireless Networks, May 2007. Prashant V. Krishnamurthy is an associate professor in the School of Information Sciences, University of Pittsburgh, where he regularly teaches courses on wireless communication systems and networks, cryptography, and network security. His research interests are in wireless network security, wireless data networks, position location in indoor wireless networks, and radio channel modeling for indoor wireless networks. He also served as the chair of the IEEE Communications Society Pittsburgh Chapter from 2000 to 2005. He is a member of the IEEE.

Copyright Wondershare Software

Thank you !

Copyright Wondershare Software

You might also like