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
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
Selecting forwarding neighbors in wireless Ad Hoc networks
DIALM '01 Proceedings of the 5th 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
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
Geometric Spanners for Wireless Ad Hoc Networks
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
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Flooding in wireless ad hoc networks
Computer Communications
Efficient virtual-backbone routing in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Connected Vertex Covers in Dense Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Optimizing energy consumption of data flow in mobile ad hoc wireless networks
WSEAS Transactions on Computers
Pervasive and Mobile Computing
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Efficient flooding scheme based on regular polygonal tiling in wireless ad hoc networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Routing with adaptive path and limited flooding for mobile ad hoc networks
Computers and Electrical Engineering
Energy-efficient dominating tree construction in wireless ad hoc and sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Triangular tiling-based efficient flooding scheme in wireless ad hoc networks
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Exploring link correlation for efficient flooding in wireless sensor networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Efficient mobile networking for tactical radios
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Improved flooding of broadcast messages using extended multipoint relaying
Journal of Network and Computer Applications
A weight-value algorithm for finding connected dominating sets in a MANET
Journal of Network and Computer Applications
Journal of Network and Computer Applications
On minimizing the broadcast redundancy in duty-cycled wireless sensor networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Achieving efficient flooding by utilizing link correlation in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 15.00 |
Multipoint relays (MPR) [18] provide a localized and optimized way of broadcasting messages in a mobile ad hoc network (MANET). Using partial 2-hop information, each node chooses a small set of forward neighbors to relay messages and this set covers the node's 2-hop neighbor set. These selected forward nodes form a connected dominating set (CDS) to ensure full coverage. Adjih et al. [1] later proposed a novel extension of MPR to construct a small CDS and it is source-independent. In this paper, we provide several extensions to generate a smaller CDS using complete 2-hop information to cover each node's 2-hop neighbor set. We extend the notion of coverage in the original MPR. We prove that the extended MPR has a constant local approximation ratio compared with a logarithmic local ratio in the original MPR. In addition, we show that the extended MPR has a constant global probabilistic approximation ratio, while no such ratio exists in the original MPR and its existing extensions. The effectiveness of our approach is confirmed through a simulation study.