Node Scheduling Scheme for Wireless Sensor Networks with Partial Coverage

Abstract

Sensor nodes in a wireless sensor network are distributed across an area for data collection. These nodes have basic capabilities in terms of interfaces and components, and they often operate in dynamic, hostile environments. Sensor networks present numerous challenges: they are dispersed, generate constant high rates data streams, function in dynamic and time-changing situations; and may involve a large number of sensors. Sensor nodes have enough power to transmit their readings to a central high-performance computing unit for processing. Sensor networks generate data streams, which are sequences of real-time data records characterized by their high data rates that consume significant network computing resources. However, only a few studies address the issue of collecting highly redundant data, leading to nodes wasting energy by sending redundant information to a central high-performance computing unit. Improved scheduling tactics can help reduce energy consumption in sensor nodes. This research developed a Node Scheduling Scheme for Wireless Sensor Networks with Partial Coverage (NSPC). Partial coverage can be obtained by dividing the area of interest into smaller sub-regions and determining the monitoring intensity for each sub-region by sensor nodes. Various strategies, such as clustering and scheduling, can be employed to accomplish partial coverage. Considering partial coverage when designing a WSN is crucial, as it can enhance network stability and reliability while reducing the cost and energy consumption of each sensor nodes.