Distributed node placement algorithm utilizing controllable mobility in mobile ad hoc networks

Hee Tae Roh, Jang-Won Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we study a node placement problem in mobile ad hoc networks with controllable mobility. Especially, we consider mission-critical networks in which nodes have their own specific mission whose degree of satisfaction depends on their locations. In addition to accomplish their mission, nodes want to maintain a good communication quality with their neighbor nodes that also depends on their locations. In general, the best location of a node for its mission is not coincident with that for its communication quality, and thus it is important to control the mobility of a node to find its appropriate location jointly considering both its mission and communication quality. Hence, in this paper, we study a joint mission and communication aware node placement problem. We formulate the problem as a potential game and develop a distributed algorithm that converges to the Nash equilibrium. In addition, we also show that if some minor conditions are satisfied, our algorithm provides a global optimal solution that minimizes the weighted sum of costs for mission and communication.

Original languageEnglish
Pages (from-to)67-77
Number of pages11
JournalAd Hoc Networks
Volume15
DOIs
Publication statusPublished - 2014 Apr 1

Fingerprint

Mobile ad hoc networks
Communication
Parallel algorithms
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{64d0ffd6b09e4314990092465d75767e,
title = "Distributed node placement algorithm utilizing controllable mobility in mobile ad hoc networks",
abstract = "In this paper, we study a node placement problem in mobile ad hoc networks with controllable mobility. Especially, we consider mission-critical networks in which nodes have their own specific mission whose degree of satisfaction depends on their locations. In addition to accomplish their mission, nodes want to maintain a good communication quality with their neighbor nodes that also depends on their locations. In general, the best location of a node for its mission is not coincident with that for its communication quality, and thus it is important to control the mobility of a node to find its appropriate location jointly considering both its mission and communication quality. Hence, in this paper, we study a joint mission and communication aware node placement problem. We formulate the problem as a potential game and develop a distributed algorithm that converges to the Nash equilibrium. In addition, we also show that if some minor conditions are satisfied, our algorithm provides a global optimal solution that minimizes the weighted sum of costs for mission and communication.",
author = "Roh, {Hee Tae} and Jang-Won Lee",
year = "2014",
month = "4",
day = "1",
doi = "10.1016/j.adhoc.2013.06.010",
language = "English",
volume = "15",
pages = "67--77",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",

}

Distributed node placement algorithm utilizing controllable mobility in mobile ad hoc networks. / Roh, Hee Tae; Lee, Jang-Won.

In: Ad Hoc Networks, Vol. 15, 01.04.2014, p. 67-77.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Distributed node placement algorithm utilizing controllable mobility in mobile ad hoc networks

AU - Roh, Hee Tae

AU - Lee, Jang-Won

PY - 2014/4/1

Y1 - 2014/4/1

N2 - In this paper, we study a node placement problem in mobile ad hoc networks with controllable mobility. Especially, we consider mission-critical networks in which nodes have their own specific mission whose degree of satisfaction depends on their locations. In addition to accomplish their mission, nodes want to maintain a good communication quality with their neighbor nodes that also depends on their locations. In general, the best location of a node for its mission is not coincident with that for its communication quality, and thus it is important to control the mobility of a node to find its appropriate location jointly considering both its mission and communication quality. Hence, in this paper, we study a joint mission and communication aware node placement problem. We formulate the problem as a potential game and develop a distributed algorithm that converges to the Nash equilibrium. In addition, we also show that if some minor conditions are satisfied, our algorithm provides a global optimal solution that minimizes the weighted sum of costs for mission and communication.

AB - In this paper, we study a node placement problem in mobile ad hoc networks with controllable mobility. Especially, we consider mission-critical networks in which nodes have their own specific mission whose degree of satisfaction depends on their locations. In addition to accomplish their mission, nodes want to maintain a good communication quality with their neighbor nodes that also depends on their locations. In general, the best location of a node for its mission is not coincident with that for its communication quality, and thus it is important to control the mobility of a node to find its appropriate location jointly considering both its mission and communication quality. Hence, in this paper, we study a joint mission and communication aware node placement problem. We formulate the problem as a potential game and develop a distributed algorithm that converges to the Nash equilibrium. In addition, we also show that if some minor conditions are satisfied, our algorithm provides a global optimal solution that minimizes the weighted sum of costs for mission and communication.

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

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

U2 - 10.1016/j.adhoc.2013.06.010

DO - 10.1016/j.adhoc.2013.06.010

M3 - Article

AN - SCOPUS:84893927078

VL - 15

SP - 67

EP - 77

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

ER -