Issue No. 02 - February (2009 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.94
Majid Khabbazian , University of British Columbia, Vancouver
Vijay K. Bhargava , University of British Columbia, Vancouver
This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.
Wireless communication, Network communications, Mobile environments
V. K. Bhargava and M. Khabbazian, "Efficient Broadcasting in Mobile Ad Hoc Networks," in IEEE Transactions on Mobile Computing, vol. 8, no. , pp. 231-245, 2008.