OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Opportunistic Communications in WSN Using UAV

Ma, Xiaoyan and Chisiu, Simona and Kacimi, Rahim and Dhaou, Riadh Opportunistic Communications in WSN Using UAV. (2017) In: 14th IEEE Consumer Communications and Networking Conference (CCNC 2017), 8 January 2017 - 11 January 2017 (Las Vegas, United States).

[img]
Preview
(Document in English)

PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
599kB

Official URL: https://doi.org/10.1109/CCNC.2017.7983160

Abstract

This paper studies the opportunistic routing (OR) in unmanned aerial vehicle (UAV) assisted wireless sensor networks (WSNs). We consider the scenario where a UAV collects data from randomly deployed mobile sensors that are moving with different velocities along a predefined route. Due to the dynamic topology, mobile sensors have different opportunities to communicate with the UAV. This paper proposes the All Neighbors Opportunistic Routing (ANOR) and Highest Velocity Opportunistic Routing (HVOR) protocols. In essence, ANOR forwards packets to all neighbors and HVOR forwards them to one neighbor with highest velocity. HVOR is a new OR protocol which dynamically selects route on a pre-transmission basis in multi-hop network. HVOR helps the sensor which has little opportunity to communicate with the UAV to determine which sensor, among all the sensors that are within its range, is the forwarder. The selected node forwards the packet. As a result, in each hop, the packet moves to the sensor that has higher opportunity to communicate with the UAV. In addition, we focus on various performance metrics, including Packets Delivery Ratio (PDR), Routing Overhead Ratio (ROR), Average Latency (AL) and Average Hop Count (AHC), to evaluate the proposed algorithms and compare them with a Direct Communication (DC) protocol. Through extensive simulations, we have shown that both HVOR and ANOR algorithms work better than DC. Moreover, the HVOR algorithm outperforms the other two algorithms in terms of the average overhead.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Thanks to IEEE editor. The definitive version is available at http://ieeexplore.ieee.org This papers appears in Proceedings of CCNC 2017. Electronic ISSN: 2331-9860 The original PDF of the article can be found at: https://ieeexplore.ieee.org/document/7983160 Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
HAL Id:hal-02871326
Audience (conference):International conference proceedings
Uncontrolled Keywords:
Institution:Université de Toulouse > Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE)
Université de Toulouse > Université Toulouse III - Paul Sabatier - UT3 (FRANCE)
Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE)
Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE)
Laboratory name:
Statistics:download
Deposited On:09 Jun 2020 13:06

Repository Staff Only: item control page