Wireless information networks
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximum Lifetime Broadcasting in Wireless Networks
IEEE Transactions on Computers
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series)
A survey on real-world implementations of mobile ad-hoc networks
Ad Hoc Networks
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fast algorithm for multicast and data gathering in wireless networks
Information Processing Letters
Proceedings of the fifth international workshop on Foundations of mobile computing
Approximating Directed Weighted-Degree Constrained Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Survivable Network Design with Degree or Order Constraints
SIAM Journal on Computing
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Novel algorithms for the network lifetime problem in wireless settings
Wireless Networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Optimal information extraction in energy-limited wireless sensor networks
IEEE Journal on Selected Areas in Communications
Hi-index | 5.23 |
A wireless ad-hoc network consists of a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is reduced after each transmission, depending on the transmission distance. One of the major problems in wireless network design is to route network traffic efficiently, so as to maximize the network lifetime, i.e., the number of successful transmission rounds. In this paper, we consider Rooted Maximum Lifetime Broadcast/Convergecast problems in wireless settings. The instance consists of a directed graph G=(V,E) with edge-weight w(e) (the power needed to transmit a message along e) for every e@?E, node capacity b(v) (the battery charge of v) for every v@?V, and a root r. The goal is to find a maximum size collection {T"1,...,T"k} of Broadcast/Convergecast trees rooted at r such that @?"i"="1^kw(@d"T"""i(v))@?b(v), where @d"T(v) is the set of edges leaving v in T. In the Single Topology version, the same tree is used to transmit all the messages, namely, all the Broadcast/Convergecast trees T"i are identical. Using recent work on degree constrained network design problems (Nutov, 2008) [26], we give constant ratio approximation algorithms for various broadcast and convergecast problems, improving the previously best known approximation @W(@?1/logn@?) by Elkin et al. (2011) [12]. Similar results are shown for the more general Rooted Maximum Lifetime Mixedcast problem, where in addition we are given an integer @c=0, and the goal is to find the maximum integer k so that k Broadcast and @ck Convergecast rounds can be performed. We also consider the model with partial level aggregation.