This document discusses designing, analyzing, and implementing wireless sensor networks for performance. It begins with an introduction to wireless sensor networks and their applications. It then discusses various routing protocols for wireless sensor networks, including location-based, hierarchical, and data-centric protocols. It defines some problems with existing approaches, such as excessive delay and energy consumption. It proposes a new system with phases for initialization, chain leader selection, chain head selection, data transmission, and dead node analysis. It discusses how this system would work and evaluates it based on energy consumption, network lifetime, packet delivery ratio, packet drop ratio, and dead node ratio. It also provides some application examples and references related work.

1. Design Analyze And Implement WSN
Performance
By :
Dakshata Mishra

2. CONTENT
 WSN INTRODUCTION
i. WSN
ii. APPLICATION
iii. CLASSIFICATION OF ROUTING PROTOCOL
 PROBLEM DEFINITION
 PROPOSED SYSTEM
 GRAPHS
 APPLICATION
 FUTURE SCOPE
 REFERENCES

3. INTRODUCTION
WSN
• Sensor and Base Station
• Sensor: sensing, communications, and computation
Applications
• General Engineering
• Military Application
• Health Monitoring & Surgery

4. Routing
Protocols
Location Based
Hierarchical
Based
LEACH
LEACH-C
PEGASIS
APTEEN
E-PEGASIS
Data Centric
Protocol

5. PROBLEM DEFINITION
• Excessive delay – chain long
• Energy Consumption
• Chain Leader— bottleneck

7. PROPOSED SYSTEM

8. Phase 1
• Initialization Phase
Phase 2
• Chain Leader Selection Phase
Phase 3
• Chain Head Selection Phase
Phase 4
• Data Transmission Phase
Phase 5
• Dead Node analysis

9. INITIALIZATION
• Base station broadcast packets to all nodes and get’s aware about the energy of the entire node
within vicinity.

10. CHAIN LEADER SELECTION
• The base station gets aware of energy level of all nodes & selects the chain leader which has the
highest energy.
• node 8 gets selected as chain leader because it has highest energy among all the node
Node 8 = 91.86 j

11. Sorting
for {set i 1} {$i < $val(nn)} { incr i } {
for {set j 1} {$j < $val(nn)} { incr j } {
if { $REnergy($i) > $REnergy($j) } {
set swap $REnergy($i)
set REnergy($i) $REnergy($j)
set REnergy($j) $swap
}}}

12. CHAIN HEAD SELECTION
• Each node broadcast and get’s aware about its neighbor which lies within 250 m of range.

13. Distance Formula
The Euclidean distance between point’s p and q is the length of the line segment connecting them ( ).
In Cartesian coordinates, if p = (p1, p2,..., pn) and q = (q1, q2,..., qn) are two points in Euclidean n-space,
then the distance (d) from p to q, or from q to p is given by the Pythagorean formula:

14. DATA TRANSMISSION
• Data transmission takes place from the leaf node to the base station .
• No other node can transmit data directly to the base station. Apart from the chain leader.

15. DEAD NODE
• Node 7 is about to die because its energy is 0.11 J.
• Base station broad cast the message to all other node that node 7 is about to die.

16. Energy Consumption
• Energy consumption is the energy calculated before transmission of packets and after the end of
simulation.
• Energy consumption = Final energy – Initial energy (joules)

17. Network Lifetime
• Network lifetime α Energy consumption
• Network lifetime is time till the nodes remains active for a specific simulation time.

18. Packet Delivery
• Packet delivery ratio is the number of packets delivered within a specific transmission time.
• Packet delivery ratio = number of packets delivered / total number of packets * 100 (%)

19. Packet Drop Ratio
• Packet drop ratio is ratio of number of packets drop during the transmission of packets within a specific
simulation time.
• Packet drop ratio = 100 – packet delivery ratio (%)

20. Dead Node Ratio
• Dead node ratio is the ratio of number of nodes dead over a particular simulation time.
• Dead node ratio= number of dead nodes/ total number of nodes *100 (%)

21. APPLICATIONS

22. Car parking system

23. Greenhouse monitoring system

24. REFERENCES

25. [1] Kaur, Navdeep, Deepika Sharma, and Prabhdeep Singh. "Classification of Hierarchical Routing Protocols in
Wireless Sensor Network: A Survey."International Journal of P2P Network Trends and Technology 3.1 (2013):
56-6.
[2] Heinzelman, Wendi Rabiner, Anantha Chandrakasan, and Hari Balakrishnan. "Energy-efficient
communication protocol for wireless microsensor networks."System sciences, 2000. Proceedings of the 33rd
annual Hawaii international conference on. IEEE, 2000.
[3] Heinzelman, Wendi B., Anantha P. Chandrakasan, and Hari Balakrishnan. "An application-specific protocol
architecture for wireless microsensor networks." IEEE Transactions on wireless communications 1.4 (2002):
660-670.
[4] Lindsey, Stephanie, and Cauligi S. Raghavendra. "PEGASIS: Power-efficient gathering in sensor information
systems." Aerospace conference proceedings, 2002. IEEE. Vol. 3. IEEE, 2002.
[5] Manjeshwar, Arati, and Dharma P. Agrawal. "APTEEN: A Hybrid Protocol for Efficient Routing and
Comprehensive Information Retrieval in Wireless Sensor Networks." Ipdps. Vol. 2. 2002.
[6] Mahakud, Rina, et al. "Energy Management in Wireless Sensor Network Using PEGASIS." Procedia Computer
Science 92 (2016): 207-212.

26. THANK YOU