Minimizing broadcast latency in ad hoc wireless networks
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Broadcast routing based on new link cost model for ad-hoc networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Energy-Aware broadcasting method for wireless sensor network
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
| Hi-index | 0.00 |
Unlike in a wired network, a packet transmitted bya node in an ad hoc wireless network can reach all neighbors.Therefore, the total number of transmissions (forward nodes) isgenerally used as the cost criterion for broadcasting. The problemof finding the minimum number of forward nodes is NP-complete.Among various approximation approaches, dominantpruning [7] utilizes 2-hop neighborhood information to reduce redundanttransmissions. In this paper, we analyze some deficienciesof the dominant pruning algorithm and propose two betterapproximation algorithms: total dominant pruning and partialdominant pruning. Both algorithms utilize 2-hop neighborhoodinformation more effectively to reduce redundant transmissions.Simulation results of applying these two algorithms show performanceimprovements compared with the original dominant pruning.In addition, two termination criteria are discussed and comparedthrough simulation.