On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Flooding in wireless ad hoc networks
Computer Communications
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A novel broadcast technique for high-density ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage
IEEE Transactions on Mobile Computing
Clustering wireless ad hoc networks with weakly connected dominating set
Journal of Parallel and Distributed Computing
A near-optimal broadcast technique for vehicular networks
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Localized algorithms and their applications in ad hoc wireless networks
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
| Hi-index | 0.00 |
We propose a generic framework for distributed broadcastingin ad hoc wireless networks. The approach is basedon selecting a small subset of hosts (also called nodes) toform a forward node set to carry out a broadcast process.The status of each node, forwarding or non-forwarding, isdetermined either by itself (self-pruning) or by other nodes(neighbor-designating). Node status can be determinedat different snapshots of network state along time (calledviews) without causing problems in broadcast coverage. Asufficient condition, called coverage condition, is given fora node to take the non-forward status. Such a condition canbe easily checked locally around the node. Several existingbroadcast algorithms can be viewed as special cases of thegeneric framework with k-hop neighborhood information.A comprehensive comparison among existing algorithms isconducted. Simulation results show that new algorithms,which are more efficient than existing ones, can be derivedfrom the generic framework. This work is an extension toan early work in which only self-pruning methods are discussed[16].