Title: Flooding in 3-dimensional mobile ad hoc networks using 1-hop information

Authors: Xin Bai; Xiaohui Wei; Sen Bai

Addresses: College of Computer Science and Technology, Jilin University, Changchun, 130012, China ' College of Computer Science and Technology, Jilin University, Changchun, 130012, China ' School of Software, Tsinghua University, Beijing, 100084, China

Abstract: Flooding is a fundamental problem in mobile ad hoc networks (MANETs). In traditional pure flooding, a node retransmits a flooding message to all its neighbours when it firstly receives the message. The pure flooding suffers from excessive redundancy of transmissions, which causes high overhead and severe interference of the network. Therefore, many flooding algorithms have been proposed to reduce the redundancy of messages. However, former works mostly focus on 2-dimensional MANETs, and their approaches are hard to be extended to 3-dimensional wireless networks. In this paper, we consider the flooding problem for 3-dimensional MANETs. We propose an efficient flooding algorithm using only 1-hop neighbours information to optimise running time of the algorithm. Under the premise of ensuring full delivery, the proposed algorithm selects a minimum set of neighbours for each node to forward messages for reducing redundant transmissions. Simulations have been conducted and the results have shown that the proposed algorithm significantly decreases required transmissions for a flooding.

Keywords: flooding; mobile ad hoc network; MANET; 3-dimensional wireless network.

DOI: 10.1504/IJSNET.2018.089274

International Journal of Sensor Networks, 2018 Vol.26 No.2, pp.69 - 80

Received: 07 Apr 2017
Accepted: 28 May 2017
Published online: 11 Jan 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article