Channel‐aware repetitive data collection in wireless sensor networks

Summary Wireless sensor networking technology has been applied in practice to a variety of information‐gathering infrastructures, where sensing data are repetitively delivered to a data collector within a session period. For efficient energy conservation, each sensor node can wait for a higher chann...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of communication systems 2017-05, Vol.30 (7), p.np-n/a
Hauptverfasser: Kim, Ryangsoo, Choi, Jinho, Lim, Hyuk
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Summary Wireless sensor networking technology has been applied in practice to a variety of information‐gathering infrastructures, where sensing data are repetitively delivered to a data collector within a session period. For efficient energy conservation, each sensor node can wait for a higher channel gain before it begins the transmission of sensing data and transmits them with a power that is inversely proportional to the channel gain. However, if the node waits for higher channel gain, switching to the sleeping mode takes a longer time. We formulate this channel‐aware data transmission problem using an optimization problem with linear constraints. The numerical simulations indicate that the proposed method significantly reduces the energy consumption compared with other heuristic methods. Copyright © 2015 John Wiley & Sons, Ltd. This paper proposes a channel gain threshold‐based transmission policy for repetitive data collection in wireless sensor networks, which minimizes energy consumption during data session by enabling the sensor nodes to transmit data packets to the data collector only when the channel gain is larger than a certain threshold. Our numerical simulations show that significant reduction in energy consumption was realized using our proposed method.
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.2999