Network lifetime and power assignment in ad hoc wireless networks

DOI10.1007/B13632MaRDI QIDQ5897239zbMATH OpenOpenAlexFDO

Authors Gruia Calinescu, Sanjiv Kapoor, Alex Olshevsky, Alex Zelikovsky

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Bounded-hops power assignment in ad hoc wireless networks
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• Power consumption in packet radio networks (extended abstract)
• Probabilistic analysis of power assignments
• Probabilistic analysis of power assignments

Cited in

(35)

• Greedy approximations for minimum submodular cover with submodular cost
• The complexity of the node capacitated in-tree packing problem
• Approximation bounds on the number of mixedcast rounds in wireless ad-hoc networks
• On the complexity of minimizing interference in ad-hoc and sensor networks
• Energy consumption minimization in ad hoc wireless and multi-interface networks
• Approximating minimum-power degree and connectivity problems
• Wireless network design via 3-decompositions
• The polymatroid Steiner problems
• Energy-Efficient Communication in Multi-interface Wireless Networks
• Bounded-hops power assignment in ad hoc wireless networks
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• Energy-efficient communication in multi-interface wireless networks
• On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
• Improved approximation results for the minimum energy broadcasting problem
• Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas
• Minimum power assignment in wireless ad hoc networks with spanner property
• Mobility-aware, adaptive algorithms for wireless power transfer in ad hoc networks
• Improved approximation algorithms for minimum power covering problems
• Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
• The complexity of symmetric connectivity in directional wireless sensor networks
• An LP-based heuristic algorithm for the node capacitated in-tree packing problem
• Improved approximation algorithms for maximum lifetime problems in wireless networks
• Dual-based approximation algorithms for cut-based network connectivity problems
• On minimum power connectivity problems
• The min-power multicast problems in wireless ad hoc networks: a parameterized view
• Approximating minimum power covers of intersecting families and directed edge-connectivity problems
• Performance evaluation for energy efficient topologic control in ad hoc wireless networks
• On dual power assignment optimization for biconnectivity
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements
• Sharing the cost of multicast transmissions in wireless networks
• Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements
• 1.61-approximation for min-power strong connectivity with two power levels
• Improved algorithms in directional wireless sensor networks
• Probabilistic analysis of power assignments
• Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas

This page was built for publication: Network lifetime and power assignment in ad hoc wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897239)