Abstract
Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.
Introduction: The Energy Hole Challenge
In typical Wireless Sensor Networks (WSNs), nodes often relay data over multiple hops to reach a central base station. This architecture frequently leads to the "energy hole problem," where nodes located near the base station deplete their batteries rapidly due to the high volume of transit traffic.
Introducing a mobile sink—such as a drone or ground vehicle—mitigates this by moving closer to data sources. However, this introduces a complex "tour planning" problem: visiting every node is inefficient and slow. The solution lies in identifying a subset of nodes, termed Rendezvous Nodes (RNs), to act as temporary data caches.
The RNSRA Framework
The Rendezvous Node Selection and Routing Algorithm (RNSRA) optimizes data collection through a two-phase process: global node selection and bio-inspired routing.
Phase 1: Global Rendezvous Node Selection
RNSRA uses a multi-factor fitness function to select the most suitable RNs. Unlike traditional methods that focus solely on distance, this function evaluates:
- Distance Rate: Ensures RNs are distributed evenly across the field.
- Packet Delivery Rate: Monitors the current storage load of potential nodes.
- Remaining Energy: Prioritizes nodes with higher battery levels to prevent premature failure.
- Neighbor Node Rate: Favors nodes in dense areas to minimize the number of hops required for nearby sensors.
Once the RNs are identified, the mobile sink's path is optimized using a Traveling Salesman Problem (TSP) approach to minimize travel time and energy.
Phase 2: Artificial Bee Colony (ABC) Routing
To transport data from source sensors to the nearest RN, RNSRA employs the Artificial Bee Colony (ABC) algorithm. This metaheuristic mimics the foraging behavior of honeybees to discover optimal multi-hop paths. The "fitness" of a path is determined by signal strength (RSSI), delivery delay, and the battery voltage of relay nodes, ensuring reliable and energy-efficient data delivery.
Performance and Results
The algorithm was rigorously tested via MATLAB simulations in a 3500m × 3500m area with up to 300 nodes. Key findings include:
- Energy Efficiency: RNSRA achieved a 6% to 10% reduction in total network energy consumption compared to existing benchmarks like Weighted Rendezvous Planning (WRP).
- Network Longevity: By balancing the load more effectively, the network lifetime was extended by approximately 5%.
- Scalability: The algorithm demonstrated superior stability as node density increased, making it better suited for large-scale deployments.
Conclusion
RNSRA effectively addresses the energy hole and tour planning challenges in mobile WSNs. By combining holistic node selection with bio-inspired routing, it provides a robust framework for efficient data gathering. Future work will focus on multi-sink scenarios and applications in heterogeneous environments, such as marine monitoring.
Summary updated