Abstract

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation.

Highlights

  • A wireless sensor network is composed of a number of collectors and many low-cost, resource-limited sensor nodes

  • This high consumption is because in-degree priority algorithm (IPA) generates routes and selects polling points according to the residual energy of the sensor node; compared to the other two methods, IPA’s routes result in a longer node communication distance, but increase the total network energy consumption

  • The shortest path tree topology is dynamically reconstructed using the residual energies in the sensor nodes as the weights based on an integrated energy model, which considers energy consumed during communications, node sensing and data processing, describing the energy consumption more closely to actual circumstances

Read more

Summary

Introduction

A wireless sensor network is composed of a number of collectors and many low-cost, resource-limited sensor nodes. Network efficiency is increased by optimizing the scheduling policy, aggregate routing [1] and sensor node load balancing [2], but a multiple hop relay will inevitably result in high energy consumption during data transmission. Further research indicates that actuators increase the energy efficiency of wireless networks by reducing the number of relay hops within the network. With meeting the network convergence delay requirements as a prerequisite, this paper aims to increase the network lifetime by proposing a multi-hop routing mobile data collecting algorithm based on dynamic polling point selection under delay constraints. The dynamic selection of polling points will improve the network’s energy efficiency and extend the network lifetime as much as possible; multi-hop communications and an optimized actuator moving path will guarantee the network data collection delay.

Related Work
Problem Description and Formulation
Network Lifetime
In-Degree
Energy Consumption Model
Problem Formulation
In-Degree Priority Algorithm
Dynamic Shortest Path Tree
Polling Point Selection and Actuator Moving Strategy
IPA-MMA
Performance Evaluation
Setting of Simulation Parameters
Network Lifetime Performance
Energy Consumption Performance
Uniform Energy Consumption
Energy Consumption Performance for IPA-MMA
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call