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

Authors:
Hee-Tae Roh;Jang-Won Lee
Affiliations:
Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
Wireless Communications & Mobile Computing
Year:
2012

Citing 7
Cited 2

Topology control for wireless sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Towards mobility as a network control primitive

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On Relay Node Placement and Locally Optimal Traffic Allocation in Heterogeneous Wireless Sensor Networks

LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
On the Use of Nodes with Controllable Mobility for Conserving Power in MANETs

ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Enhancing WLAN Capacity by Strategic Placement of Tetherless Relay Points

IEEE Transactions on Mobile Computing
Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks by modified Bender's decomposition

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

CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference

A flow-based optimization model for throughput-oriented relay node placement in wireless sensor networks

Proceedings of the 28th Annual ACM Symposium on Applied Computing
Distributed node placement algorithm utilizing controllable mobility in mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

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. Copyright © 2010 John Wiley & Sons, Ltd.