Communication - Aware position control for mobile nodes in vehicular networks

Hee Tae Roh, Jang Won Lee

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

In this paper, we study a communication-aware position control problem for mobile nodes in vehicular networks, in which the positions of some nodes can be controlled considering the network performance. We model the average achievable data rate of a link between two nodes as a function of the distance between the two nodes, i.e., as a function of positions of the two nodes. We then try to find the positions of some nodes whose positions can be controlled so as to maximize the minimum weighted average data rate among those of all links in the network. To tackle this problem, we take two approaches: optimization and game theoretic approaches. In the optimization theoretic approach, even though the optimization problem is formulated as non-convex optimization, we can develop algorithms for the optimal solution. However, since those algorithms are centralized algorithms, which may not be applicable to some cases such as vehicular ad-hoc networks (VANETs), we also use the game theoretic approach to develop distributed algorithms. In addition to developing algorithms, we also analyze and compare the performances of our algorithms, showing that the game theoretic approach could provide not only distributed algorithms but also efficient algorithms in our problem.

Original language English 5678792 173-186 14 IEEE Journal on Selected Areas in Communications 29 1 https://doi.org/10.1109/JSAC.2011.110117 Published - 2011 Jan 1

Fingerprint

Position control
Communication
Parallel algorithms
Vehicular ad hoc networks
Network performance

All Science Journal Classification (ASJC) codes

• Computer Networks and Communications
• Electrical and Electronic Engineering

Cite this

@article{f3af589aec8d4f86842da47ce44fdd60,
title = "Communication - Aware position control for mobile nodes in vehicular networks",
abstract = "In this paper, we study a communication-aware position control problem for mobile nodes in vehicular networks, in which the positions of some nodes can be controlled considering the network performance. We model the average achievable data rate of a link between two nodes as a function of the distance between the two nodes, i.e., as a function of positions of the two nodes. We then try to find the positions of some nodes whose positions can be controlled so as to maximize the minimum weighted average data rate among those of all links in the network. To tackle this problem, we take two approaches: optimization and game theoretic approaches. In the optimization theoretic approach, even though the optimization problem is formulated as non-convex optimization, we can develop algorithms for the optimal solution. However, since those algorithms are centralized algorithms, which may not be applicable to some cases such as vehicular ad-hoc networks (VANETs), we also use the game theoretic approach to develop distributed algorithms. In addition to developing algorithms, we also analyze and compare the performances of our algorithms, showing that the game theoretic approach could provide not only distributed algorithms but also efficient algorithms in our problem.",
author = "Roh, {Hee Tae} and Lee, {Jang Won}",
year = "2011",
month = "1",
day = "1",
doi = "10.1109/JSAC.2011.110117",
language = "English",
volume = "29",
pages = "173--186",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

In: IEEE Journal on Selected Areas in Communications, Vol. 29, No. 1, 5678792, 01.01.2011, p. 173-186.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Communication - Aware position control for mobile nodes in vehicular networks

AU - Roh, Hee Tae

AU - Lee, Jang Won

PY - 2011/1/1

Y1 - 2011/1/1

N2 - In this paper, we study a communication-aware position control problem for mobile nodes in vehicular networks, in which the positions of some nodes can be controlled considering the network performance. We model the average achievable data rate of a link between two nodes as a function of the distance between the two nodes, i.e., as a function of positions of the two nodes. We then try to find the positions of some nodes whose positions can be controlled so as to maximize the minimum weighted average data rate among those of all links in the network. To tackle this problem, we take two approaches: optimization and game theoretic approaches. In the optimization theoretic approach, even though the optimization problem is formulated as non-convex optimization, we can develop algorithms for the optimal solution. However, since those algorithms are centralized algorithms, which may not be applicable to some cases such as vehicular ad-hoc networks (VANETs), we also use the game theoretic approach to develop distributed algorithms. In addition to developing algorithms, we also analyze and compare the performances of our algorithms, showing that the game theoretic approach could provide not only distributed algorithms but also efficient algorithms in our problem.

AB - In this paper, we study a communication-aware position control problem for mobile nodes in vehicular networks, in which the positions of some nodes can be controlled considering the network performance. We model the average achievable data rate of a link between two nodes as a function of the distance between the two nodes, i.e., as a function of positions of the two nodes. We then try to find the positions of some nodes whose positions can be controlled so as to maximize the minimum weighted average data rate among those of all links in the network. To tackle this problem, we take two approaches: optimization and game theoretic approaches. In the optimization theoretic approach, even though the optimization problem is formulated as non-convex optimization, we can develop algorithms for the optimal solution. However, since those algorithms are centralized algorithms, which may not be applicable to some cases such as vehicular ad-hoc networks (VANETs), we also use the game theoretic approach to develop distributed algorithms. In addition to developing algorithms, we also analyze and compare the performances of our algorithms, showing that the game theoretic approach could provide not only distributed algorithms but also efficient algorithms in our problem.

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

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

U2 - 10.1109/JSAC.2011.110117

DO - 10.1109/JSAC.2011.110117

M3 - Article

VL - 29

SP - 173

EP - 186

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 1

M1 - 5678792

ER -