G. Calinescu, I. Mandoiu, and A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (IFIP-TCS), pages 119--130, 2002.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... in wireless networks includes work by Chen and Huang [7] on the minimum energy strongly connecting problem (i.e. there exists a path between every node pair) for packet radio networks (also proven to be NP Hard) Along the same lines are the minimum energy topology control problems considered in [8, 9, 20], where the minimum energy strongly connecting problem is generalized to variants of the minimum energy kstrongly connecting problem (i.e. there exists k node (link) disjoint paths between every node pair) The distinction between these problems and the disjoint paths problem considered in this ....

....a specific sourcedestination pair. In this regard, finding minimum energy k disjoint paths is the more focused problem, as the energy optimization is done only over pertinent nodes. Furthermore, while most of the minimum energy k strongly connecting problems have been proven to be NP complete [7, 8, 9, 20], we present polynomial time algorithms that optimally solve the minimum energy k node disjoint paths problem, as well as the minimum energy 2 link disjoint paths problem. The problem of finding k node (link) disjoint source destination paths in a network, is a well studied problem in graph ....

[Article contains additional citation context not shown here]

G. Calinescu, I.I. Mandoiu, and A. Zelikovsky, "Symmetric Connectivity with Minimum Power Consumption in Radio Networks", Proc. 2nd IFIP International Conference on Theoretical Computer Science,Montreal, Canada, August 2002.

....problem (SRA) We will also investigate a weaker version of the problem, called weak symmetric range assignment (WSRA) in which the requirement for symmetry applies only to a well de ned subset of the edges. We are aware of only one paper addressing the symmetric range assignment problem [6], where the authors present a (1 ln 2 ) approximation algorithm for a problem equivalent to WSRA. Our interest in studying SRA and WSRA will be clearly motivated in the next section. First, we show that SRA (and, hence, WSRA) remains NP hard in two and three dimensional networks. Hence, ....

G. Calinescu, I.I. Mandoiu, A. Zelikovsky, \Symmetric Connectivity with Minimum Power Consumption in Radio Networks", to appear in Proc. 2nd IFIP Conf. on Theoretical Computer Science, Montreal, August 2002.

....assignment r (S) such that cost(r (S) opt SC (S) where opt SC (S) is the optimal cost. The MstAlg algorithm also works when the input is a generic graph since the quality of the solution relies only on the properties of minimum spanning trees. Strong Connectivity with Symmetry. In [7, 6] another version of the Min Range(SC) problem is proposed. Here, in addition to the strong connectivity property, the communication graph must be symmetric. In the two papers it is observed that the proof of NP hardness in [13] Theorem 3) also holds for the symmetric case. Moreover, in [7] a 15 8 ....

....In [7, 6] another version of the Min Range(SC) problem is proposed. Here, in addition to the strong connectivity property, the communication graph must be symmetric. In the two papers it is observed that the proof of NP hardness in [13] Theorem 3) also holds for the symmetric case. Moreover, in [7] a 15 8 approximation algorithm is given. Open Problems. It is unknown whether Min Range(SC) in the 2 dimensional Euclidean space is APXhard or admits a PTAS. A more sophisticated reduction than those shown in [13, 18] might yield again an APX hardness result. Another challenging goal is to ....

G. Calinescu, I.I. Mandoiu, and A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS), 2002. to appear.

No context found.

G. Calinescu, I.I. Mandoiu, and A.Z. Zelikovsky. Symmetric connectivity with minimum power consumption in radio networks. In 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002.

No context found.

G. Calinescu, I.I. Mandoiu, and A.Z. Zelikovsky. Symmetric connectivity with minimum power consumption in radio networks. In R. Baeza-Yates, U. Montanari, and N. Santoro, editors, Foundations of information technology in the era of network and mobile computing -- Proc. 17th IFIP World Computer Congress, Stream TC1/ 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002.

No context found.

G. Calinescu, I. Mandoiu, and A. Zelikovsky, \Symmetric connectivity with minimum power consumption in radio networks," in Proc. 2nd IFIP International Conference on Theoretical Computer Science,(TCS 2002), R. Baeza-Yates and U. Montaniri and N. Santoro (eds.), Kluwer Academic Publ., August 2002, 119-130.

No context found.

G. Calinescu, I. Mandoiu, and A. Zelikovsky, Symmetric Connectivity with Minimum Power Consumption in Radio Networks, Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002.

No context found.

G. Calinescu, I. Mandoiu, and A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (IFIP-TCS), pages 119--130, 2002.

No context found.

G. Calinescu, I. Mandoiu, A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proc. of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, to appear.

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