Optimal placement of a relay node with controllable mobility in wireless networks considering fairness

Hee Tae Roh, Jang Won Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Since the capacity of a wireless link depends on the distance between its transmitter and receiver nodes, the optimal placement of nodes in the wireless network is important to improve the system efficiency. We study this issue in this paper considering a wireless network that consists of multiple nodes that do not have controllable mobility and a relay node that has controllable mobility. We model the capacity of a wireless link between node and relay node as a function of the distance between them. We then formulate the optimization problem that aims at maximizing the weighted throughput of a node that achieves the lowest weighted throughput among all nodes. Unfortunately, the problem is inherently non-convex, which is in general difficult to solve. However, in this paper, we develop the algorithm for the optimal placement of the relay node based on duality theories in optimization. We also show that the optimal position of the relay node obtained by our algorithm is in fact the weighted max-min fair position.

Original languageEnglish
Title of host publication2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010
DOIs
Publication statusPublished - 2010 Apr 29
Event2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010 - Las Vegas, NV, United States
Duration: 2010 Jan 92010 Jan 12

Publication series

Name2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010

Other

Other2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010
CountryUnited States
CityLas Vegas, NV
Period10/1/910/1/12

Fingerprint

Telecommunication links
Wireless networks
Throughput
Transmitters

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Roh, H. T., & Lee, J. W. (2010). Optimal placement of a relay node with controllable mobility in wireless networks considering fairness. In 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010 [5421793] (2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010). https://doi.org/10.1109/CCNC.2010.5421793
Roh, Hee Tae ; Lee, Jang Won. / Optimal placement of a relay node with controllable mobility in wireless networks considering fairness. 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010. 2010. (2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010).
@inproceedings{1275a4a6b8234859bc6c0dc192747d9a,
title = "Optimal placement of a relay node with controllable mobility in wireless networks considering fairness",
abstract = "Since the capacity of a wireless link depends on the distance between its transmitter and receiver nodes, the optimal placement of nodes in the wireless network is important to improve the system efficiency. We study this issue in this paper considering a wireless network that consists of multiple nodes that do not have controllable mobility and a relay node that has controllable mobility. We model the capacity of a wireless link between node and relay node as a function of the distance between them. We then formulate the optimization problem that aims at maximizing the weighted throughput of a node that achieves the lowest weighted throughput among all nodes. Unfortunately, the problem is inherently non-convex, which is in general difficult to solve. However, in this paper, we develop the algorithm for the optimal placement of the relay node based on duality theories in optimization. We also show that the optimal position of the relay node obtained by our algorithm is in fact the weighted max-min fair position.",
author = "Roh, {Hee Tae} and Lee, {Jang Won}",
year = "2010",
month = "4",
day = "29",
doi = "10.1109/CCNC.2010.5421793",
language = "English",
isbn = "9781424451760",
series = "2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010",
booktitle = "2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010",

}

Roh, HT & Lee, JW 2010, Optimal placement of a relay node with controllable mobility in wireless networks considering fairness. in 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010., 5421793, 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010, 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010, Las Vegas, NV, United States, 10/1/9. https://doi.org/10.1109/CCNC.2010.5421793

Optimal placement of a relay node with controllable mobility in wireless networks considering fairness. / Roh, Hee Tae; Lee, Jang Won.

2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010. 2010. 5421793 (2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Optimal placement of a relay node with controllable mobility in wireless networks considering fairness

AU - Roh, Hee Tae

AU - Lee, Jang Won

PY - 2010/4/29

Y1 - 2010/4/29

N2 - Since the capacity of a wireless link depends on the distance between its transmitter and receiver nodes, the optimal placement of nodes in the wireless network is important to improve the system efficiency. We study this issue in this paper considering a wireless network that consists of multiple nodes that do not have controllable mobility and a relay node that has controllable mobility. We model the capacity of a wireless link between node and relay node as a function of the distance between them. We then formulate the optimization problem that aims at maximizing the weighted throughput of a node that achieves the lowest weighted throughput among all nodes. Unfortunately, the problem is inherently non-convex, which is in general difficult to solve. However, in this paper, we develop the algorithm for the optimal placement of the relay node based on duality theories in optimization. We also show that the optimal position of the relay node obtained by our algorithm is in fact the weighted max-min fair position.

AB - Since the capacity of a wireless link depends on the distance between its transmitter and receiver nodes, the optimal placement of nodes in the wireless network is important to improve the system efficiency. We study this issue in this paper considering a wireless network that consists of multiple nodes that do not have controllable mobility and a relay node that has controllable mobility. We model the capacity of a wireless link between node and relay node as a function of the distance between them. We then formulate the optimization problem that aims at maximizing the weighted throughput of a node that achieves the lowest weighted throughput among all nodes. Unfortunately, the problem is inherently non-convex, which is in general difficult to solve. However, in this paper, we develop the algorithm for the optimal placement of the relay node based on duality theories in optimization. We also show that the optimal position of the relay node obtained by our algorithm is in fact the weighted max-min fair position.

UR - http://www.scopus.com/inward/record.url?scp=77951278142&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951278142&partnerID=8YFLogxK

U2 - 10.1109/CCNC.2010.5421793

DO - 10.1109/CCNC.2010.5421793

M3 - Conference contribution

AN - SCOPUS:77951278142

SN - 9781424451760

T3 - 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010

BT - 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010

ER -

Roh HT, Lee JW. Optimal placement of a relay node with controllable mobility in wireless networks considering fairness. In 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010. 2010. 5421793. (2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010). https://doi.org/10.1109/CCNC.2010.5421793