Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Introduction to the theory of complexity
Introduction to the theory of complexity
Offline algorithms for dynamic minimum spanning tree problems
Journal of Algorithms
Wireless information networks
Optimal transmission ranges for mobile communication in linear multihop packet radio networks
Wireless Networks - Special issue on performance evaluation methods for wireless networks
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Power consumption in packet radio networks
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The Power Range Assignment Problem in Radio Networks on the Plane
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
New Results for Energy-Efficient Broadcasting in Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Tighter Bounds for the Minimum Energy Broadcasting Problem
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Iterated Local Optimization for Minimum Energy Broadcast
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Nested Partitioning for the Minimum Energy Broadcast Problem
Learning and Intelligent Optimization
Minimum energy broadcast on rectangular grid wireless networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
MH-TRACE: multi-hop time reservation using adaptive control for energy efficiency
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
The minimum-energy broadcast problem in symmetric wireless ad hoc networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Connectivity guarantees for wireless networks with directional antennas
Computational Geometry: Theory and Applications
Minimum energy broadcast and disk cover in grid wireless networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
3-D minimum energy broadcasting
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
MLMH: a novel energy efficient multicast routing algorithm for WANETs
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Assign ranges in general ad-hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
On broadcast scheduling with limited energy
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Efficient algorithm for energy efficient broadcasting in linear radio networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Range augmentation problems in static ad-hoc wireless networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Equilibria for broadcast range assignment games in ad-hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
On the complexity of minimizing interference in ad-hoc and sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Energy-Efficient broadcast scheduling for speed-controlled transmission channels
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Min-energy broadcast in mobile ad hoc networks with restricted motion
Journal of Combinatorial Optimization
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we consider this problem as a special case of the following more general combinatorial optimization problem, called Minimum Energy Consumption Broadcast Subgraph (in short, MECBS): Given a weighted directed graph and a specified source node, find a minimum cost range assignment to the nodes, whose corresponding transmission graph contains a spanning tree rooted at the source node. We first prove that MECBS is not approximable within a sub-logarithmic factor (unless P=NP). We then consider the restriction of MECBS to wireless networks and we prove several positive and negative results, depending on the geometric space dimension and on the distance-power gradient. The main result is a polynomial-time approximation algorithm for the NP-hard case in which both the dimension and the gradient are equal to 2: This algorithm can be generalized to the case in which the gradient is greater than or equal to the dimension.