Algorithms from P to NP (vol. 1): design and efficiency
Algorithms from P to NP (vol. 1): design and efficiency
Discrete Mathematics - Topics on domination
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Position-based ad hoc routes in ad hoc networks
The handbook of ad hoc wireless networks
Regional gossip routing for wireless ad hoc networks
Mobile Networks and Applications
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Area-based beaconless reliable broadcasting in sensor networks
International Journal of Sensor Networks
Peer-Based Efficient Content Distribution in Ad Hoc Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Rough set based ad-hoc on demand distance vector routing algorithm for MANETs
Proceedings of the 2nd Bangalore Annual Compute Conference
Adaptive partial dominating set algorithm for mobile ad-hoc networks
Proceedings of the 2nd Bangalore Annual Compute Conference
Speed adaptive probabilistic flooding in cooperative emergency warning
Proceedings of the 4th Annual International Conference on Wireless Internet
PTAS for weighted set cover on unit squares
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Scheduling forwarding nodes for two-hop neighborhoods broadcast in wireless ad hoc networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Energy-Aware broadcasting method for wireless sensor network
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Gossiping: adaptive and reliable broadcasting in MANETs
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
International Journal of Mobile Network Design and Innovation
Reduce redundant broadcasting in MANETs using rough sets
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as flooding, is to let every node retransmit the message to all its 1-hop neighbors when receiving the first copy of the message. Despite its simplicity, flooding is very inefficient and can result in high redundancy, contention, and collision. One approach to reducing the redundancy is to let each node forward the message only to a small subset of 1-hop neighbors that cover all of the node's 2-hop neighbors. In this paper, we propose two practical heuristics for selecting the minimum number of forwarding neighbors: an &Ogr;(n log n) time algorithm that selects at most 6 times more forwarding neighbors than the optimum, and an &Ogr;(n2) time algorithm with an improved approximation ratio of 3, where n is the number of 1- and 2-hop neighbors. The best previously known algorithm, due to Bronnimann and Goodrich [2], guarantees &Ogr;(1) approximation in &Ogr;(n3 log n) time.