An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

Jin Wang, Bin Li, Feng Xia, Chang-Seob Kim, Jeong-Uk Kim

TL;DR

This paper introduces a novel energy-efficient routing algorithm for wireless sensor networks (WSNs) that utilizes multiple mobile sinks to collect data. By strategically moving multiple sinks along the network boundary and employing a distance-aware link cost metric, the algorithm significantly extends network lifetime and reduces energy consumption compared to traditional methods and single-sink approaches.

What Problem Does This Paper Address?

Wireless Sensor Networks (WSNs) are composed of numerous low-power sensor nodes that collect and transmit data to a central sink. A major challenge in WSNs is energy depletion, particularly for nodes close to a static sink, which become "hot spots" due to the high traffic load. This leads to premature network partitioning and a shortened network lifetime. While mobile sinks have been proposed to alleviate this issue by distributing the data collection load, existing solutions often focus on single mobile sinks or lack detailed strategies for optimizing the movement and coordination of multiple sinks. This paper addresses the problem of efficiently managing energy consumption and prolonging the lifetime of WSNs by proposing a routing algorithm that leverages the benefits of multiple mobile sinks.

Methods

The proposed algorithm, "An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks," operates in three phases:

  • Route Setup Phase: Mobile sink nodes move along the network periphery and stop at predefined "parking positions." At these positions, they broadcast arrival messages. Neighboring sensor nodes are identified based on distance. If a sensor node is within the sink's direct transmission range, it communicates directly. Otherwise, a multi-hop approach is used. Relay nodes are selected based on a link cost metric that considers both the distance factor (minimizing transmission distance) and an energy factor (prioritizing nodes with higher residual energy). This ensures load balancing and efficient energy usage.
  • Route Steady Phase: Sensor nodes monitor the environment and transmit data to their chosen relay nodes, which then forward it towards the mobile sink. Data fusion can be employed at neighbor nodes to reduce redundant data. The algorithm dynamically adjusts to the sink's current position.
  • Route Maintenance Phase: The algorithm includes mechanisms to handle transmission link failures. If a sensor node's residual energy is insufficient or its hardware fails, it sends a rejection message. An adjacent node with sufficient residual energy and the lowest link cost is elected as a substitute forwarding node to maintain network connectivity.

A key novelty is the distance-aware routing that considers both the distance to the sink and the residual energy of sensor nodes. The algorithm also defines a systematic approach for selecting parking positions for mobile sinks along the network boundary, considering node distribution and transmission range.

Datasets

Not discussed in the paper. The authors rely on simulations for evaluation.

Key Insights and Ideas

  • Multiple Mobile Sinks are Superior: The study demonstrates that using multiple mobile sinks significantly improves network lifetime and energy efficiency compared to a single mobile sink. This is attributed to a more distributed data collection load.
  • Strategic Sojourn Locations Matter: The choice of parking positions for mobile sinks is crucial. The paper finds that an interval of two parking positions for each sink leads to the best network performance and lifetime, suggesting a balance between continuous movement and extended data collection periods.
  • Distance and Energy are Key Routing Factors: The proposed distance-aware routing algorithm, which balances transmission distance and residual energy for relay node selection, effectively mitigates the "hot spot" problem and prolongs network life.
  • Boundary Movement is Effective: Moving mobile sinks along the network boundary is shown to be more effective than internal movement, likely due to better coverage and simpler trajectory planning.

Key Results

  • Energy Efficiency: The proposed algorithm shows significantly lower energy consumption compared to the LEACH protocol, especially after the initial rounds. Residual energy drains much slower, indicating a longer network lifetime.
  • Network Lifetime: With three mobile sinks, the network lifetime is approximately twice as long as with a single mobile sink. The best performance was achieved with an interval of two parking positions for each sink, resulting in a network lifetime about 2.5 times longer than continuous movement.
  • Node Failure: The first sensor node dies much later in scenarios with multiple mobile sinks and optimized parking positions. For instance, with three mobile sinks, the first node died at round 4004, compared to round 2490 with one mobile sink.

Limitations and Future Work

  • Ideal Environment: The experiments were conducted in an ideal simulation environment, lacking real-world complexities like obstacles or unpredictable network conditions.
  • Limited Algorithm Comparison: The paper primarily focuses on comparing its proposed algorithm with LEACH and single-sink scenarios. A broader comparison with other existing mobile sink routing algorithms is suggested for future work.
  • NP-Hard Problem: The joint optimization of sink movement strategy and routing algorithm is acknowledged as an NP-hard problem.
  • Future Research Directions: The authors propose to investigate:
  • The influence of different sink moving speeds and movement trajectories on packet delivery delay and energy consumption.
  • Combining clustering technology with sink mobility for further performance improvements.
  • Exploring more complex scenarios and comparing with a wider range of existing algorithms.

Summary updated

Abstract

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited ...
BibTeX
@inproceedings{wang2014energy,
  author = {Jin Wang and Bin Li and Feng Xia and Chang-Seob Kim and Jeong-Uk Kim},
  title = {{An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks}},
  booktitle = {Sensors},
  year = {2014},
  url = {https://openreview.net/forum?id=ce9LXrXyaX},
}
Figure