J.-H. Chang and L. Tassiulas, "Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks," in NETWORKING '00: Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks. Springer-Verlag, 2000, pp. 702--713. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Energy Efficient Routing in Ad Hoc Disaster Recovery Networks - Zussman, Segall (2003) (1 citation) (Correct)
....They proposed heuristic routing protocols for the solution of the problem and evaluated their performance by simulation. The work of Chang and Tassiulas [7] has been extended in several different directions. In [8] they have extended their model for the case of multicommodity flow and in [9], they have proposed algorithms for obtaining an approximate solu tion of the routing problera Moreover, in [22] approximate online algorithms for the case in which the message sequence is not known have been proposed. The problem of finding a flow control strategy that maximizes the sources ....
J.H. Chang and L. Tassiulas, "Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks", Proc. IFIP-TC6 Networking 2000.
Routing for Network Capacity Maximization in.. - Kar, Kodialam.. (2003) (5 citations) Self-citation (Tassiulas) (Correct)
....In [1] the authors consider the scenario where messages are generated at the sensor nodes at a known fixed rate, and formulate the lifetime maximization problem as a linear program. The authors propose some distributed heuristics that can be used to solve this linear program approximately. In [2], the authors observe that the structure of the linear program resemble that of a maximum concurrent flow problem, and use this fact to develop an algorithm that can solve the problem to any arbitrary degree of accuracy. The algorithms in [1] 2] can be used to determine how the traffic ....
....used to solve this linear program approximately. In [2] the authors observe that the structure of the linear program resemble that of a maximum concurrent flow problem, and use this fact to develop an algorithm that can solve the problem to any arbitrary degree of accuracy. The algorithms in [1] [2] can be used to determine how the traffic (generated at a constant rate) should be split amongst the different routes so as to maximize the lifetime of the network. Therefore in this case, the ad hoc sensor network can solve the lifetime maximizing traffic splitting problem once at the beginning, ....
[Article contains additional citation context not shown here]
J-H. Chang, L. Tassiulas, "Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks", Proc. of Networking 2000.
Utility-based Sensor Selection - Fang Bian David (Correct)
No context found.
J.-H. Chang and L. Tassiulas, "Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks," in NETWORKING '00: Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks. Springer-Verlag, 2000, pp. 702--713.
Communication-assisted Localization and Navigation for.. - Corke, Peterson, Rus (2004) (Correct)
No context found.
Jae-Hwan Chang and Leandros Tassiulas. Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. In NETWORKING 2000.
Power-aware Base Station Positioning for Sensor Networks - Bogdanov, Maneva, Riesenfeld (2004) (Correct)
No context found.
Jae-Hwan Chang and Leandros Tassiulas, "Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks," in NETWORKING 2000.
Maximizing Data Extraction in Energy-Limited - Sensor Networks Narayanan (2004) (Correct)
No context found.
J. H. Chang and L. Tassiulas. Fast Approximate Algorithm for Maximum Lifetime Routing in Wireless Ad-hoc Networks. Networking 2000.
Finding Optimal Paths in MREP Routing - Rudolf Fleischer Mordecai (Correct)
No context found.
J.-H. Chang and L. Tassiulas. Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. In Networking, vol. 1815 of Springer LNCS, pp. 702--713, 2000.
Maximizing Data Extraction in Energy-Limited - Sensor Networks Narayanan (Correct)
No context found.
J. H. Chang and L. Tassiulas. Fast Approximate Algorithm for Maximum Lifetime Routing in Wireless Ad-hoc Networks. Networking 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC