Efficient flooding scheme based on regular polygonal tiling in wireless ad hoc networks

Authors:
In Hur;Trong Due Le;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Korea
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Year:
2009

Citing 5
Cited 0

Flooding for reliable multicast in multi-hop ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs

IEEE Transactions on Computers
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flooding in wireless ad hoc networks is one of the most fundamental operations to propagate control messages in entire network. The traditional flooding scheme generates excessive packet retransmissions, resource contention, and collisions since every node forwards the packet at least once. Recently, several flooding schemes have been proposed to avoid these problems; however, these unnecessary forwarding nodes still remain in these flooding schemes. In this paper, we propose a novel flooding scheme to efficiently minimize the number of forwarding nodes by employing a regular polygonal tiling method. Using location information of I-hop neighbor nodes, our proposed scheme selects nodes which are located closest to vertices of regular polygons as forwarding nodes. We also provide an ideal model to minimize the number of forwarding nodes and prove that our scheme approached the ideal model through a detailed analysis. Simulation results show that the performance of our scheme outperforms recent noteworthy flooding schemes in terms of the number of forwarding nodes, number of collisions, and the delivery ratio.