Delay and Lifetime Issues for Wireless Sensor Networks
Girish. R. Deshpande1, Shrinivas. R. Dhotre2, Parutagouda. S. Khangoudar3, Sudhindra. K. Madi4, Mohammad Asif Raibag5
1Girish R. Deshpande, Assistant Professor, Department of Computer Science and Engineering, GIT, Belgaum, India.
2Shrinivas R. Dhotre, Assistant Professor, Department of Computer Science and Engineering, GIT, Belgaum, India.
3Parutagouda S. Khangoudar, Assistant Professor, Department of Computer Science and Engineering, GIT, Belgaum, India.
4Sudhindra K. Madi, Assistant Professor, Department of Computer Science and Engineering, GIT, Belgaum, India.
5Mohammad Asif Raibag, Assistant Professor, Department of Computer Science and Engineering, GIT, Belgaum, India.
Manuscript received on 13 April 2019 | Revised Manuscript received on 20 April 2019 | Manuscript Published on 26 July 2019 | PP: 1199-1203 | Volume-8 Issue-6S4 April 2019 | Retrieval Number: F12470486S419/19©BEIESP | DOI: 10.35940/ijitee.F1247.0486S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The network delay and power consumptions are the two main factors governing the efficiency of wireless sensor networks. In this paper, our goal is to minimize the delay and maximize the lifespan of event-based wireless sensor networks in which activities occur infrequently.In such architectures, most of the power is fed on when the radios are on, ready for a packet to arrive.Sleep–wake scheduling is a highly efficient mechanism to prolong the lifetime of these power-constrained wireless sensor networks. However, sleep–wake scheduling could provide result with considerable delays. This research attempts to limit these delays by developing “anycast” based packet forwarding schemes that places each node opportunistically forwards a packet to the first neighboring node which wakes up amongst more than one candidate nodes. In this paper, we propose to optimize the any cast forwarding schemes by minimizing the anticipated packet delivery delays from the sensor nodes to the sink node. Based on this analysis, we then provide a solution to the joint control problem of how to optimally manage the architecture parameters of the sleep–wake scheduling protocol and the any-cast packet forwarding protocol to maximize the network lifetime, with reference to a constraint on the expected end-to-end packet arriving delay.
Keywords: Architectures, Most of the Power is Fed on When the Radios are on, Ready for a Packet to Arrive. Sleep–Wake Scheduling.
Scope of the Article: Computer Science and Its Applications