The range assignment problem in non-homogeneous static ad-hoc networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 3099-3106

  Ambühl, Christoph ^a   Clementi, Andrea E F ^b   Ianni, Miriam Di ^b   Rossi, Gianluca ^b   Monti, Angelo ^c   Silvestri, Riccardo ^c  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COST ACCOUNTING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

AD-HOC NETWORKS; ENERGY COST; RANGE ASSIGNMENT; TRANSMISSION RANGE;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 12444295467     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. C. Ambühl, A. Clementi, P. Penna, G. Rossi, and R. Silvestri. Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. In Proceedings of the 10th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2003.
2. D. Blough, M. Leoncini, G. Resta, and P. Santi. On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (IFIP-TCS), pages 71-82, 2002.
3. G. Calinescu, S. Kapoor, A. Olshevsky, and A. Zelikovsky. Network Lifetime and Power Assignment in ad hoc Wireless Networks. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA), pages 114-126, 2003.
4. 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.
5. I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Energy-Efficient Wireless Network Design. In Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC), pages 585-594, 2003.
6. I. Caragiannis, C. Kaklamanis, and P. Kannellopoulos. New Results for Energy-Efficient Broadcasting in Wireless Networks. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), pages 332-343, 2002.
7. G. Cǎlinescu, X. Li, O. Frieder, and P. Wan. Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1162-1171, 2001.
8. E. Clarke. Multipart Pricing of Public Goods. Public Choice, pages 17-33, 1971.
9. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient
10. Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome 'Tor Vergata", Math Department, 2001. Available at http://www.mat.uniroma2.it/~penna/papers/stacs01-TR.ps.gz (Extended version of [10]).
11. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2010 of LNCS, pages 121-131, 2001.
12. A. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. Algoritmica, 35:95-110, 2003.
13. 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/.
14. A. Clementi, M. D. lanni, and R. Silvestri. The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks. Theoretical Computer Science, 299:751-761, 2003.
15. A. Clementi, P. Penna, and R. Silvestri. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 1671 of Lecture Notes in Computer Science, pages 197-208. Springer-Verlag, 1999.
16. A. Ephremides, G. Nguyen, and J. Wieselthier. On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 585-594, 2000.
17. T. Groves. Incentive in Teams. Econometrica, 41:617-631, 1973.
18. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science, 243:289-305, 2000.
19. N. Nisan and A. Ronen. Algorithmic Mechanism Design. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pages 129-140, 1999.
20. N. Nisan and A. Ronen. Computationally Feasible VCG Mechanisms. In Proceedings of the 2nd ACM Conference on Electronic Commerce (EC), pages 242-252, 2000.
21. K. Pahlavan and A. Levesque. Wireless Information Networks. Wiley-Interscience, 1995.
22. W. Vickrey. Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, pages 8-37, 1961.