Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23813
Title: Cost-constrained incremental network planning in multi-hop wireless networks
Authors: Zhang, C
Cao, J 
Zhang, J
Zhou, J
Keywords: Multi-hop networks
Network planning
Issue Date: 2011
Source: GLOBECOM - IEEE Global Telecommunications Conference, 2011, 6134374 How to cite?
Abstract: In this paper, we investigate the cost-constrained incremental network planning problem in multi-hop wireless networks. Given an existing wireless network, we study the problem of how to add new wireless links to improve the network performance under the deployment cost constraint. After formulating the problem as COst-constrained Incremental Network (COIN) problem, we introduce a performance metric, which represents the tradeoff between throughput improvement and deployment cost. We then propose a Greedy Link Deployment (GLiD) algorithm using the limited-enumeration and greedy searching methods. Finally, through extensive simulations, we evaluate the performance of our algorithm in comparison with other solutions. The results show that our algorithm can perform much better than random deployment and purely greedy deployment methods.
Description: 54th Annual IEEE Global Telecommunications Conference: Energizing Global Communications"GLOBECOM 2011", Houston, TX, 5-9 December 2011
URI: http://hdl.handle.net/10397/23813
ISBN: 9781424492688
DOI: 10.1109/GLOCOM.2011.6134374
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

38
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.