![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
Sencar Scheduling Algorithm based on Packet Lifetime in WSN’s
Objective: The main scope of this paper is to increase the network life-time and minimizing the data collecting delay in WSNs. Statistical Analysis: The simulation is developed by the simulator which contains libraries to design the communication of multimedia packets between sensor nodes in WSN's. Findings: A PLBC algorithm is proposed for sensors to coordinate with the SenCar's as per schedule to gather information from nodes within their residual lifetimes. In order to existing methods of clustering, our strategy generates a priority based data gathering from multiple rendezvous points instead of Cluster Heads (CHs) in a network to gather data based on lifetime of a node. At cluster head layer, multiple cluster heads in a network drives data to a polling point to reduce the delay. At SenCar layer mobile collector is armed with multiple antennas, which enables rendezvous point to update dual data simultaneously to mobile collector utilizing a MU-MIMO technique at each time. Applications/Improvements: The results of the simulation are obtained and plotted for latency and energy consumption, which can be used to consider the performance.
Keywords
Cluster Heads, PLBC-DDU, Rendezvous Point, Sencar
User
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 227
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0