An energy-saving routing algorithm for opportunity networks based on asynchronous sleeping mode
•The node energy consumption caused by flooding communication mechanism should be solved.•The condition of sleeping state and the time of waking up should be judged reasonably.•Ensure the opportunity to participate in communication while reducing energy consumption of nodes.•Asynchronous sleeping me...
Gespeichert in:
Veröffentlicht in: | Computers & electrical engineering 2021-06, Vol.92, p.107088, Article 107088 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •The node energy consumption caused by flooding communication mechanism should be solved.•The condition of sleeping state and the time of waking up should be judged reasonably.•Ensure the opportunity to participate in communication while reducing energy consumption of nodes.•Asynchronous sleeping mechanism based on the historical encounter information and movement status of the node.
The opportunistic network is based on the idea of "Store-Carry-Forward" between nodes which haven't complete communication links. It uses the encounter opportunity presented by node mobility to establish a route to realize communication. The traditional Epidemic algorithm uses the flooding mechanism which greatly increases the energy consumption of nodes, and it is often unable to supplement the energy of nodes at any time in the application environment of the opportunistic network. Therefore, this paper proposes an asynchronous sleep mechanism, which allows nodes to judge whether to enter the sleep state according to their own energy situation, real-time state and other information. It ensures that the nodes do not miss the possible communication opportunities by dynamically controlling the sleep time and wake-up time. The simulation results show that the proposed EASE algorithm can guarantee the network performance and greatly reduce the energy consumption of nodes compared with the classical opportunistic network routing algorithms.
[Display omitted] |
---|---|
ISSN: | 0045-7906 1879-0755 |
DOI: | 10.1016/j.compeleceng.2021.107088 |