Energy Efficient SEARCH Protocol: Thesis Review Presentation by:-17MIT0001 Utsav Kakkad
The document summarizes an energy efficient SEARCH protocol for wireless sensor networks. It first considers a random topology and compares the average residual energy, number of dead nodes, and packets sent to the base station per round between the SEARCH protocol and a partitioned case where nodes are concentrated in four quadrants. The partitioned case has higher average residual energy, zero dead nodes within 50 rounds, and constant packets sent to the base station each round compared to the non-partitioned case. Future work includes implementing a balanced influential factor and studying other partitioning methods.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
37 views14 pages
Energy Efficient SEARCH Protocol: Thesis Review Presentation by:-17MIT0001 Utsav Kakkad
The document summarizes an energy efficient SEARCH protocol for wireless sensor networks. It first considers a random topology and compares the average residual energy, number of dead nodes, and packets sent to the base station per round between the SEARCH protocol and a partitioned case where nodes are concentrated in four quadrants. The partitioned case has higher average residual energy, zero dead nodes within 50 rounds, and constant packets sent to the base station each round compared to the non-partitioned case. Future work includes implementing a balanced influential factor and studying other partitioning methods.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14
Energy Efficient SEARCH protocol
Thesis review presentation by:-
17MIT0001 Utsav Kakkad Outputs We first consider a random topology and view the average residual energy versus round, number of dead nodes per round and the packets sent to the base station per round It is to be noted that it is the SEARCH protocol that is implemented on a random topology WSN topology Average Residual Energy versus Round Number of Dead nodes per round Packets to Base station per round Partitioned case We now follow a simple partitioning in which the sensor nodes are concentrated in the four quadrants of the area under consideration Changes proposed to CH election procedure followed in SEARCH Only an advanced node is eligible to be a cluster head Since it has a higher initial energy Transmission to base station/sink requires energy & the advanced nodes have a higher initial energy WSN topology Average residual energy per round Number of Dead Nodes per round Packets to Base Station per round Inferences Average residual energy is not zero for the partitioned case by the end of the rounds of operation Number of dead nodes is zero for the partitioned case( in 50 rounds of operation) while they cover the size of the sensor network in the non partitioned case Packets to base station decay to zero in the non-partitioned case after 5- 10 rounds While we get the same value for packets to base station for all rounds of operation in the partitioned case Future work Balanced Influential factor remains to be implemented Use of the threshold and the Cluster head probability Effect of other partitioning methods on the Energy efficiency of SEARCH protocol remains to be seen