Flooding in 3-dimensional mobile ad hoc networks using 1-hop information Online publication date: Thu, 11-Jan-2018
by Xin Bai; Xiaohui Wei; Sen Bai
International Journal of Sensor Networks (IJSNET), Vol. 26, No. 2, 2018
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook