![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)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
An Optimal Wake–up Scheduling Algorithm for Minimizing Energy Consumption While Limiting Maximum Delay in Mesh Sensor Network
Subscribe/Renew Journal
A sensor network may contain huge number of simple sensor nodes that forms a mesh structure. The sensors also act as routers, forwarding packets from one of their neighbours to another. Sensors turn their communication hardware on and off to minimize energy consumption. In order for two neighbouring sensors to communicate, both must be in active mode. The wake-up frequency of a sensor depends on its location in the routing path. The optimum Wakeup frequency is calculated and controlled by an upper bound value and it must not exceed the threshold value. So that energy is minimized. The wake-up scheduling algorithm significantly increases the lifetime of the network and sensor while guaranteeing a maximum on the end to end delay. To transfer the packet without loss the beacon node is used. Using simulations, we show that the proposed algorithm significantly increases the lifetime of the network, while guaranteeing a maximum on the end-to-end delay.
Keywords
Scheduling in Wireless Networks, Sensor Networks, Energy Consumption, Wakeup Frequency.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 213
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 1