Premium
An efficient communication relay placement algorithm for content‐centric wireless mesh networks
Author(s) -
Wang Jin,
Lu Kejie,
Zhang Shukui,
Fan Jianxi,
Zhu Yanqin,
Cheng Baolei
Publication year - 2013
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2666
Subject(s) - computer science , wireless mesh network , relay , throughput , computer network , integer programming , linear programming , wireless , wireless network , linear programming relaxation , distributed computing , mesh networking , algorithm , telecommunications , power (physics) , physics , quantum mechanics
SUMMARY In this paper, we investigate a communication relay placement problem to optimize the network throughput in a content‐centric wireless mesh networks (WMN), in which the WMN is enhanced by including a small set of communication relays and a subset of wireless mesh routers serving as storage nodes. Specifically, we first define the communication relay placement problem in content‐centric WMNs. We then model the problem as a mathematical programming and propose a linear programming approach for calculating the achievable network throughput when the positions of communication relays are fixed. Next, to optimally placing the communication relays, we formulate an integer linear programming problem and we develop an efficient near‐optimal approximation algorithm based on linear programming relaxation. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms. Copyright © 2013 John Wiley & Sons, Ltd.