| Autor: |
Kumar, Naween, Edla, D. Reddy, Dash, Dinesh, Swain, Gandharba, Shankar, T. N. |
| Předmět: |
|
| Zdroj: |
Wireless Networks (10220038); Jan2024, Vol. 30 Issue 1, p77-95, 19p |
| Abstrakt: |
In path-constrained multi-hop sensor networks (M-WSNs), maximizing data collection with minimal energy consumption is critical, especially for delay-sensitive applications. Because a mobile element (ME) moving at a constant speed along a constrained-path must receive data from sensor nodes (SNs) within a given time bound. This issue can be addressed by efficiently scheduling the SNs' data transmission. The shortest path data transmission (SPT) or its variations are a simple and energy-efficient technique for scheduling data transmission from SNs. Although this method considerably minimizes total energy spent, it does not enhance data collection efficiency due to uneven data forwarding load. To solve this issue, this paper proposes a novel efficient heuristic method. The proposed method first computes a set of discrete sub-paths on a given path based on the start and end distance points of nearby SNs, the speed of ME, and the given time delay. Then, for each sub-path and SN-communication model, a network flow graph is used to schedule and optimize SN data transmission to ME. Finally, a sub-path is chosen among those which return maximum data with minimum energy consumption. The network flow graphs are created by considering two distinct SN-communication models: (1) energy-unrestricted SN-model and (2) energy-restricted SN-model. Finally, the simulation reports demonstrate the proposed method's efficacy over baseline schemes in terms of data collected, energy usage efficiency, and success-delivery ratio. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink