Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, B-
dc.contributor.authorMehrjoo, M-
dc.contributor.authorHo, P-H-
dc.contributor.authorXie, L-L-
dc.contributor.authorShen, X-
dc.identifierIEEE Wireless Communications and Networking Conference, WCNC, 2009-
dc.descriptionTo satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we focus on the problem of capacity enhancement by way of Relay Stations (RSs) placement, which is a critical task of network planning and deployment to achieve an efficient and scalable network design. To fully exploit the performance benefits of cooperative relaying, we develop an optimization framework to maximize the capacity as well as meet the minimal traffic demand for each Subscriber Station (SS). The problem of joint RS placement and bandwidth allocation is formulated into a mixed integer nonlinear program and solved through a heuristic approach based on genetic algorithm (GA). Moreover, an upper bound on the capacity is derived to assist the estimation of system performance given a network configuration. Numerical results are presented to demonstrate the effectiveness of the solution approach and the performance benefits due to RS placement and optimal bandwidth allocation through cooperative relaying. © 2009 IEEE.-
dc.publisherIEEE, Communications Society-
dc.relationIEEE Wireless Communications and Networking Conference, WCNC-
dc.subjectHeuristic Algorithms-
dc.subjectRapid Solidification-
dc.subjectRelay Control Systems-
dc.subjectTelecommunication Repeaters-
dc.subjectWireless Sensor Networks-
dc.titleCapacity enhancement with relay station placement in wireless cooperative networks-
Appears in Collections:Department of Anatomy

Files in This Item:
Click on the URI links for accessing contents.

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