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

Roh, Hee-Tae; Lee, Jang-Won

doi:10.1002/wcm.1007

Cited by 10 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the position should be far away from obstacle. (3).the position should be in the middle of VOR. (4).…”

Section: Node Combinationmentioning

confidence: 99%

Visibility Overlap Region Based Relay Node Optimal Placement Algorithm in Mobile Robot Networks

Wu¹,

Li²,

Wei³

et al. 2017

dtetr

View full text Add to dashboard Cite

Abstract. In this paper, we consider a problem of relay node optimal placement in mobile robot network. The task needs to deploy a group of robots as relay nodes building connectivity between target node and base station in environment containing obstacle. We model the task as a constrained optimization problem, and decision variables are the number of robots and the positions of them. To address this issue, we propose a visibility overlap region based relay node optimal placement algorithm, which is efficient heuristic method. The algorithm divides the problem into three sub-problems, which are path-planning between target node and base station, line-of-sight based relay node positions determined, and visibility overlap region based relay nodes combined and position optimization. We justify our algorithm's correctness by simulation experiment.

show abstract

“…the position should be far away from obstacle. (3).the position should be in the middle of VOR. (4).…”

Section: Node Combinationmentioning

confidence: 99%

Visibility Overlap Region Based Relay Node Optimal Placement Algorithm in Mobile Robot Networks

Wu¹,

Li²,

Wei³

et al. 2017

dtetr

View full text Add to dashboard Cite

show abstract

“…Since relay technologies have been studied in recent years, various approaches to RN placement have been proposed in relevant papers [20,21]. In IEEE 802.16j, the mobile multi-hop relay (MMR) network is studied.…”

Section: Related Workmentioning

confidence: 99%

Network planning for Type 1 and Type 1a relay nodes in LTE‐Advanced networks

Tseng

Chou

Chao

2015

Wireless Communications

View full text Add to dashboard Cite

In this paper, the planning problem of multiple evolved Node Bs (eNBs) and two types of relay nodes is defined base on linear programming. Type 1 relay nodes are placed in the center of eNB, and Type 1a relay nodes are deployed at cell edge. Three algorithms are proposed to investigate the Type 1a relay node placement and communication interference. All algorithms are designed on the basis of graph theory and analyzed in planning case and simulation results. The ultimate goal is to maximize the average throughput of all served users with minimum communication interference. Results showed that the proposed interference coordination algorithm not only provides the lowest construction cost with slightly fewer numbers of served users but also eliminates the communication interference with the highest average throughput. Most importantly, it achieves the best communication quality for next generation mobile networks.

show abstract

“…First, we consider a network with multiple nodes with controllable mobility in a mesh topology in a two-dimensional space. In fact, the extension from a single node with controllable mobility [16,17,19,20] or from the chained topology [18,21] to multiple nodes with controllable mobility in a mesh topology is not straightforward.…”

Section: Issn: 2302-4046mentioning

confidence: 99%

Optimal Placement of Sensors in Mission-specific Mobile Sensor Networks

Ouchitachen

Haïr

Idrissi

2015

TIJEE

View full text Add to dashboard Cite

Placement of nodes has been the major challenge in wireless sensor networks. The data reported from a sensor is only useful when the position of that sensor is found. In this context, several techniques have been proposed to conserve power consumption and to prolong the lifetime of the wireless sensor networks. In this paper, we propose a new algorithm that accurately finds the best locations of sensors while minimizing the average energy consumed in the network. More precisely, we consider a critical network in each sensor satisfying its own missions and depending on its locations. In addition to fulfill their mission, the sensor tries to maintain a good neighboring nodes quality. we determine the location of node by using two criteria: the cost and the quality of communication. The aim of this work is to develop a new algorithm so as to solve the complicated optimization problem posed in this case while minimize the total energy consumption. Our simulation results demonstrate that our algorithm is very advantageous in terms of convergence to the appropriate locations.

show abstract

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

Cited by 10 publications

References 3 publications

Visibility Overlap Region Based Relay Node Optimal Placement Algorithm in Mobile Robot Networks

Visibility Overlap Region Based Relay Node Optimal Placement Algorithm in Mobile Robot Networks

Network planning for Type 1 and Type 1a relay nodes in LTE‐Advanced networks

Optimal Placement of Sensors in Mission-specific Mobile Sensor Networks

Contact Info

Product

Resources

About