A unified approach to domination problems on interval graphs
Information Processing Letters
Introduction to algorithms
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)
Combinatorial optimization
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
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
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
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
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
IEEE Transactions on Mobile Computing
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks
IEEE Transactions on Mobile Computing
Computational Geometry: Theory and Applications
Homogeneous 2-hop broadcast in 2D
Computational Geometry: Theory and Applications
Directional Geometric Routing on Mobile Ad Hoc Networks
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Scheme for Computing Minimum Covers within Simple Regions
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Dynamic counter-based broadcast in MANETs
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Covering points by unit disks of fixed location
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Polynomial time approximation schemes for minimum disk cover problems
Journal of Combinatorial Optimization
Optimal cover of points by disks in a simple polygon
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Improved flooding of broadcast messages using extended multipoint relaying
Journal of Network and Computer Applications
On the discrete unit disk cover problem
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Flow admission control for multi-channel multi-radio wireless networks
Wireless Networks
Minimum-cost linear coverage by sensors with adjustable ranges
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless coverage via dynamic programming
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Towards optimal broadcast in wireless networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An efficient distributed broadcasting algorithm for ad hoc networks
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Wireless coverage with disparate ranges
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Optimal Cover of Points by Disks in a Simple Polygon
SIAM Journal on Computing
Domatic partition in homogeneous wireless sensor networks
Journal of Network and Computer Applications
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 O(n log n)time algorithm that selects at most 6 times more forwarding neighbors than the optimum, and an O(n log2 n) 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 O(1) approximation in O(n3 log n)time.