Joint relay node placement and node scheduling in wireless networks with a relay node with controllable mobility

Hee Tae Roh, Jang Won Lee

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

In this paper, we propose an algorithm for joint relay node placement and node scheduling in wireless networks. We consider a system that consists of a relay node with controllable mobility and multiple nodes that communicate with each other via the relay node. Each node communicates with the relay node according to its schedule. The objective of our algorithm is to maximize the lowest weighted throughput among those of all nodes. To this end, we consider a problem to optimally place the relay node and optimally schedule all nodes in the network. We develop three algorithms for relay node placement and node scheduling considering three different cases: when the location of the relay node is controllable while the node scheduling is fixed, when the node scheduling is controllable while the location of the relay node is fixed, and when both the location of the relay node and node scheduling are controllable. The simulation results show that by jointly optimizing relay node placement and node scheduling, we can improve system performance significantly in many cases.

Original languageEnglish
Pages (from-to)699-712
Number of pages14
JournalWireless Communications and Mobile Computing
Volume12
Issue number8
DOIs
Publication statusPublished - 2012 Jun 10

Fingerprint

Wireless networks
Scheduling
Throughput

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{a6ac888241a44d0fa434d5e625b1b24a,
title = "Joint relay node placement and node scheduling in wireless networks with a relay node with controllable mobility",
abstract = "In this paper, we propose an algorithm for joint relay node placement and node scheduling in wireless networks. We consider a system that consists of a relay node with controllable mobility and multiple nodes that communicate with each other via the relay node. Each node communicates with the relay node according to its schedule. The objective of our algorithm is to maximize the lowest weighted throughput among those of all nodes. To this end, we consider a problem to optimally place the relay node and optimally schedule all nodes in the network. We develop three algorithms for relay node placement and node scheduling considering three different cases: when the location of the relay node is controllable while the node scheduling is fixed, when the node scheduling is controllable while the location of the relay node is fixed, and when both the location of the relay node and node scheduling are controllable. The simulation results show that by jointly optimizing relay node placement and node scheduling, we can improve system performance significantly in many cases.",
author = "Roh, {Hee Tae} and Lee, {Jang Won}",
year = "2012",
month = "6",
day = "10",
doi = "10.1002/wcm.1007",
language = "English",
volume = "12",
pages = "699--712",
journal = "Wireless Communications and Mobile Computing",
issn = "1530-8669",
publisher = "John Wiley and Sons Ltd",
number = "8",

}

TY - JOUR

T1 - Joint relay node placement and node scheduling in wireless networks with a relay node with controllable mobility

AU - Roh, Hee Tae

AU - Lee, Jang Won

PY - 2012/6/10

Y1 - 2012/6/10

N2 - In this paper, we propose an algorithm for joint relay node placement and node scheduling in wireless networks. We consider a system that consists of a relay node with controllable mobility and multiple nodes that communicate with each other via the relay node. Each node communicates with the relay node according to its schedule. The objective of our algorithm is to maximize the lowest weighted throughput among those of all nodes. To this end, we consider a problem to optimally place the relay node and optimally schedule all nodes in the network. We develop three algorithms for relay node placement and node scheduling considering three different cases: when the location of the relay node is controllable while the node scheduling is fixed, when the node scheduling is controllable while the location of the relay node is fixed, and when both the location of the relay node and node scheduling are controllable. The simulation results show that by jointly optimizing relay node placement and node scheduling, we can improve system performance significantly in many cases.

AB - In this paper, we propose an algorithm for joint relay node placement and node scheduling in wireless networks. We consider a system that consists of a relay node with controllable mobility and multiple nodes that communicate with each other via the relay node. Each node communicates with the relay node according to its schedule. The objective of our algorithm is to maximize the lowest weighted throughput among those of all nodes. To this end, we consider a problem to optimally place the relay node and optimally schedule all nodes in the network. We develop three algorithms for relay node placement and node scheduling considering three different cases: when the location of the relay node is controllable while the node scheduling is fixed, when the node scheduling is controllable while the location of the relay node is fixed, and when both the location of the relay node and node scheduling are controllable. The simulation results show that by jointly optimizing relay node placement and node scheduling, we can improve system performance significantly in many cases.

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

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

U2 - 10.1002/wcm.1007

DO - 10.1002/wcm.1007

M3 - Article

AN - SCOPUS:84861069415

VL - 12

SP - 699

EP - 712

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 8

ER -