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
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & 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
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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Flooding in wireless ad hoc networks
Computer Communications
Reduce redundant broadcasting in MANETs using rough sets
International Journal of Wireless and Mobile Computing
| Hi-index | 0.00 |
In Mobile Ad-hoc Networks (MANETs) each node has a transmission radius and is able to send message to all of its neighbors that are located with in its radius. In reactive based routing algorithms such as Ad-hoc on demand Routing Algorithm (AODV) and Dynamic Source Routing Algorithm (DSR) a node broadcasts control information (Route Request, Route Reply, and Route Error) to all its neighbor nodes. In this paper we modify the existing Partial Dominant Pruning algorithm to find adaptive dominating set by reducing the coverage area of a node which desires to send control information. It does not require any communication over head to reduce the coverage area.