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

Authors:
Hee-Tae Roh;Jang-Won Lee
Affiliations:
Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Year:
2010

Citing 6
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

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

Wireless Communications & Mobile Computing
Distributed node placement algorithm utilizing controllable mobility in mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

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.