A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. Verhoeven. Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pages 23--38, 2002. Also available in http://www.mat.uniroma2.it/rossig/. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Range Assignment Problem in Non-Homogeneous.. - Ambühl, Clementi, Di .. (2003) Self-citation (Clementi Rossi) (Correct)
No context found.
A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. Verhoeven. Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pages 23--38, 2002. Also available in http://www.mat.uniroma2.it/rossig/.
On the Approximation Ratio of the MST-based.. - Clementi, Huiban, .. (2003) Self-citation (Clementi Penna Rossi Verhoeven) (Correct)
No context found.
A.E.F. Clementi, G. Huibai, P. Penna, G. Rossi, and Y.C. Verhoeven, \Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks," in Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), 2002, to appear.
Sharing the Cost of Multicast Transmissions in Wireless Networks - Penna, Ventre (2003) Self-citation (Penna) (Correct)
No context found.
A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pages 23--38, 2001.
Energy Consumption in Radio Networks: Selfish Agents .. - Clementi, Penna.. (2003) Self-citation (Clementi Penna Rossi) (Correct)
....broadcast, gossip, etc. can be performed without recomputing each time a range assignment depending on the source(s) and the destination(s) unless the relative position of the stations changes. This optimization problem, usually denoted as the minimum range assignment problem [10] see also [5] for a survey) turns out to be a hard problem because of two factors: The cost for station i in transmitting with range R is (proportional to) R , where 1 is a constant depending on the environmental conditions (e.g. in the ideal condition of empty space = 2) 14] If a station i ....
....the overall power consumption of the network gives rise to interesting algorithmic questions. In particular, these two aspects yield a class of fundamental optimization problems, denoted as range assignment problems, that has been the subject of several works in the area of wireless network theory [10, 7, 5]. 6 In this paper, we study the range assignment problem, denoted as Min Range(SC) in which the required connectivity property is that E must be a strongly connected graph on the station set S. This problem is known to be Np hard even when the connection cost vector C yields a metric ....
[Article contains additional citation context not shown here]
A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pages 23-38, 2002.
Efficient Algorithms for Low-Energy Bounded-Hop.. - Ambühl, Clementi, .. (2003) (Correct)
No context found.
A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), 23-38, 2002.
Energy Consumption in Radio Networks: Selfish.. - Ambühl, Clementi, .. (2003) (Correct)
No context found.
A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In Proceedings of the 3rd ARACNE, pages 23--38, 2002. Also available in http://www.mat.uniroma2.it/rossig/.
Bounded-Hops Power Assignment in Ad-Hoc Wireless Networks - Calinescu, Kapoor, Sarwat (Correct)
No context found.
A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. Verhoeven. Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In 3rd Workshop on ARACNE, 2002.
Network Lifetime and Power Assignment in Ad-Hoc.. - Calinescu, Kapoor.. (2003) (4 citations) (Correct)
No context found.
A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. Verhoeven, \Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks," in Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), 2002.
Range Assignment for High Connectivity in Wireless Ad Hoc.. - Calinescu, Wan (Correct)
No context found.
A. Clementi, G. Huiban, P. Penna, G. Rossi and Y.C. Verhoeven, Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks, 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, 2002.
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