Data collection in wireless sensor networks using UAV and compressive data gathering
Fifth generation wireless networks are expected to provide advanced capabilities and create new markets spanning a wide range of use cases. Among these, massive IoT is standing out with the proliferation of sensors and wearable devices that continuously monitor and transmit data for further processi...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | conferenceObject |
| منشور في: |
2019
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/10575 https://doi.org/10.1109/GLOCOM.2018.8647924 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/8647924/references#references |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Fifth generation wireless networks are expected to provide advanced capabilities and create new markets spanning a wide range of use cases. Among these, massive IoT is standing out with the proliferation of sensors and wearable devices that continuously monitor and transmit data for further processing. This paper proposes a novel data collection technique using Unmanned Aerial Vehicles (UAVs) in dense wireless sensor networks (WSNs) using projection-based Compressive Data Gathering (CDG) as a solution methodology. CDG is utilized to aggregate data en route from sets of sensor nodes to a set of projection nodes (heads) in order to notably reduce the number of transmissions leading to energy savings and extended WSN lifetime. The UAVs forward the gathered data from heads to a remote sink to enhance efficiency by avoiding long range transmissions from heads to the sink or multi-hop communications among sensors to the sink. We formulate a joint optimization problem that captures clustering, heads selection, routing trees construction, and UAV trajectory planning. In order to overcome the complexity of the joint optimization problem, we decompose the problem into separate parts and propose a heuristic to solve each subproblem for large-scale network scenarios. |
|---|