Please use this identifier to cite or link to this item:
Title: Clique partition based relay placement in WiMAX mesh networks
Authors: Liao, Z
Wang, J
Zhang, C
Cao, J 
Issue Date: 2012
Source: 54th Annual IEEE Global Telecommunications Conference (IEEE Globecom'2012), Anaheim, California, USA, 3-7 December, 2012, p.2566-2571
Abstract: In WiMAX mesh networks based on IEEE 802.16j, when transmission power of the base station (BS) and the number of radios and channels are settled, data rate at the subscriber (SS) is decided by the distance between the SS and its uplink relay station (RS). In this paper, we study the problem of deploying a minimum number of RSs to satisfy all SSs' distance requirements. Firstly, we translate it into a minimum clique partition problem, which is NP-complete. Based on SSs' neighbor information and location information, we then propose two heuristic algorithms based on clique partition, named as MAXDCP and GEOCP, respectively. Simulation results show that, compared with the state-of-the-art MIS and HS algorithms, MAXDCP uses 23.8% fewer relays than MIS with the same time complexity, and GEOCP uses 35% fewer relays than MIS in the same time and 18.5% fewer relays than HS in much less time.
Keywords: Placement
WiMAX mesh network
Multi-hop relay
Publisher: Institute of Electrical and Electronics Engineers
ISBN: 978-1-4673-0921-9 (electronic)
978-1-4673-0920-2 (print)
978-1-4673-0919-6 (online)
ISSN: 1930-529X
EISSN: 1930-529X
DOI: 10.1109/GLOCOM.2012.6503503
Appears in Collections:Conference Paper

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


Last Week
Last month
Citations as of Jan 31, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 23, 2020

Google ScholarTM



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