Improving on HEED Protocol of Wireless Sensor Networks with Sleep Scheduling Algorithm

2015 ◽  
Vol 12 (13) ◽  
pp. 5163-5173 ◽  
Author(s):  
Yabo Duan
2012 ◽  
Vol 4 ◽  
pp. 32-37
Author(s):  
Jin Song Chen

This paper introduces the basics of wireless sensor networks, focusing on the concept of sensor network data collection, data collection mechanisms, data collection in-network data aggregation, data collection and data collection applications Research. This paper presents the data collection in WSN node scheduling concept, analyzed the two data collection in WSN scheduling mechanism, which is based on data collection interval node scheduling mechanism and turn the data based on perceived probability of node sleep scheduling mechanism.


Author(s):  
Govind P. Gupta

Software-defined networking (SDN) is an emerging network design and management paradigm that offers a flexible way for reducing the complexity of the network management and configuration. SDN-based wireless sensor networks (SDWSNs) consist of a set of software-defined sensor nodes equipped with different types of sensors. In SDWSN, sensor node is able to conduct different sensing tasks according to the programs injected into it and functionalities of these nodes can also be dynamically configured by injecting different application-specific programs. SDWSNs adopt the characteristics of SDN and can provide energy efficient solutions for various problems such as topology management, sleep scheduling, routing, and localization, etc. This chapter discusses how to apply SDN model in the design of an energy-efficient protocol for wireless sensor networks and also presents an overview of SDN model proposed for wireless sensor networks and SDN-based resource management, routing, sleep scheduling algorithm, localization for SDWSNs. Finally, open research challenges are summarized.


2013 ◽  
Vol 846-847 ◽  
pp. 446-451
Author(s):  
Dong Qing Zhang ◽  
Deng Li

The high-density randomly deployment of nodes in Wireless Sensor Networks results in a large number of redundant nodes due to the overlap of sensing areas. A scheduling algorithm for redundant nodes is proposed to effectively prolong the lifetime of WSN. The algorithm focuses on employing different scheduling strategies on border nodes and internal nodes to avoid contraction of the network boundary by judging whether a node is on the network boundary according to the number of working nodes in its neighbor table. The simulation results show that the algorithm can effectively prolong the lifetime of the network.


Sign in / Sign up

Export Citation Format

Share Document