Network lifetime and power assignment in ad hoc wireless networks

DOI10.1007/B13632zbMATH Open1266.68022OpenAlexW1827234103MaRDI QIDQ5897239FDOQ5897239

Sanjiv Kapoor, Alex Olshevsky, Alex Zelikovsky, Gruia Calinescu

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

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

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)

Cited In (29)

• On minimum power connectivity problems
• Approximating minimum power covers of intersecting families and directed edge-connectivity problems
• Mobility-aware, adaptive algorithms for wireless power transfer in ad hoc networks
• Improved approximation results for the minimum energy broadcasting problem
• Performance evaluation for energy efficient topologic control in ad hoc wireless networks
• Sharing the cost of multicast transmissions in wireless networks
• Wireless network design via 3-decompositions
• Minimum power assignment in wireless ad hoc networks with spanner property
• Dual-based approximation algorithms for cut-based network connectivity problems
• Improved algorithms in directional wireless sensor networks
• Parameterized complexity of min-power asymmetric connectivity
• An LP-based heuristic algorithm for the node capacitated in-tree packing problem
• Bounded-hops power assignment in ad hoc wireless networks
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View
• Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas
• Greedy approximations for minimum submodular cover with submodular cost
• The polymatroid Steiner problems
• The complexity of the node capacitated in-tree packing problem
• Energy-Efficient Communication in Multi-interface Wireless Networks
• On the complexity of minimizing interference in ad-hoc and sensor networks
• Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas
• Energy-efficient communication in multi-interface wireless networks
• Approximating minimum-power degree and connectivity problems
• Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks
• Improved approximation algorithms for minimum power covering problems
• The complexity of symmetric connectivity in directional wireless sensor networks
• Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
• 1.61-approximation for min-power strong connectivity with two power levels

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)