Cost-constrained incremental network planning in multi-hop wireless networks

Chisheng Zhang, Jiannong Cao, Jun Zhang, Jie Zhou

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

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.
Original languageEnglish
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
Publication statusPublished - 1 Dec 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: 5 Dec 20119 Dec 2011

Conference

Conference54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Country/TerritoryUnited States
CityHouston, TX
Period5/12/119/12/11

Keywords

  • Multi-hop networks
  • Network planning

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this