Network planning for mobile multi-hop relay networks

Chen, Chi-Yuan; Tseng, Fan‐Hsun; Lai, Chin‐Feng; Chao, Han‐Chieh

doi:10.1002/wcm.2396

Cited by 8 publications

(5 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have previously published similar works 19,20,21,22 to this work. We proposed a tree algorithm 19 for increasing reliability in IEEE 802.16j mobile multi-hop relay (MMR) networks.…”

Section: Related Workmentioning

confidence: 68%

“…The S-Tree algorithm utilized the relay station to connect disconnected subgraphs and constructed the MMR networks easily. The Interference-Aware Tree (IA-Tree) algorithm 22 was proposed to solve the interference problem between two neighbor BSs, and provided the better service quality. However, these proposed algorithms were designed for a MMR network, which is different from the two-hop relaying limitation of a relay network in LTE-Advanced.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Set Cover Problem of Coverage Planning in Lte-Advanced Relay Networks

Tseng

Chou

Chao

et al. 2014

ijecs

Self Cite

View full text Add to dashboard Cite

Various mobile devices are developing rapidly in contemporary society, such as smart phones and tablet PCs. Users are able to acquire different multimedia services through wireless communication anytime and anywhere. However, the increased demand also gives rise to a problem of insufficient bandwidth. Therefore, a fourth generation mobile telecommunications (4G) technology was proposed and widely investigated. One of the popular technologies is Long Term Evolution Advanced (LTE-Advanced), which was proposed by the Third Generation Project Partnership (3GPP). The Evolved Node B (eNB) and Relay Node (RN) are the major components in an LTE-Advanced network. How best to deploy these two components to extend network coverage and expand performance is a vital issue. In this paper, we utilize an integer linear programming model (ILP) to formulate the coverage problem, and refer to a well-known problem called the Set International Journal of Electronic Commerce Studies 182Cover problem. Then we propose a heuristic algorithm named as the Set Covering algorithm to solve it. The ultimate object is achieving the highest network coverage and capacity with the least uncovered mobile user. In the simulation result, we use MATLAB to simulate a network deployment, and evaluate the planning results. According to the simulation results, we accomplished better network capacity and a higher number of covered users.

show abstract

“…We have previously published similar works 19,20,21,22 to this work. We proposed a tree algorithm 19 for increasing reliability in IEEE 802.16j mobile multi-hop relay (MMR) networks.…”

Section: Related Workmentioning

confidence: 68%

Section: Related Workmentioning

confidence: 99%

Set Cover Problem of Coverage Planning in Lte-Advanced Relay Networks

Tseng

Chou

Chao

et al. 2014

ijecs

Self Cite

View full text Add to dashboard Cite

show abstract

“…al. in regard to the IEEE 802.16j design structure [28], [29]. One previous work designed a programming model for integers on IEEE 802.16d networks and suggested solving the issues of creating the lowest cost backhaul wireless network using heuristic algorithms (with BSs) to fulfill the SS requirements with no effect on the capacity limits in BSs [30]. A number of case studies have been presented to determine relay optimal location and to push the system output to the max within the BS-RS cell coverage in 802.16j networks [22].…”

Section: Research Backgroundmentioning

confidence: 99%

Wireless Mesh Networks Based on MBPSO Algorithm to Improvement Throughput

Ameen

Khaleel

2018

IJECE

View full text Add to dashboard Cite

Wireless Mesh Networks can be regarded as a type of communication technology in mesh topology in which wireless nodes interconnect with one another. Wireless Mesh Networks depending on the semi-static configuration in different paths among nodes such as PDR, E2E delay and throughput. This study summarized different types of previous heuristic algorithms in order to adapt with proper algorithm that could solve the issue. Therefore, the main objective of this study is to determine the proper methods, approaches or algorithms that should be adapted to improve the throughput. A Modified Binary Particle Swarm Optimization (MBPSO) approach was adapted to improvements the throughput. Finally, the finding shows that throughput increased by 5.79% from the previous study.

show abstract

“…The papers of [5], [6], [7], and [8] belong to a group of researchers that have contributed to this area, and their contributions shall be described hereinafter. In [5], the authors proposed an enhanced tree (E-tree) algorithm to place the eNB and relay stations (RSs) at the location with the lowest construction cost compared with the tree algorithm; while in [6], a super-graph tree algorithm was proposed to place base stations (BSs) and relay stations at the lowest cost positions, and then the authors proposed another interference aware algorithm (IA) that considers the interference between BSs in the network. In [7], the authors suggested a set covering algorithm to achieve better network coverage and performance for LTE-Advanced relay networks.…”

Section: Introductionmentioning

confidence: 99%

Optimization of the Deployment of Relay Nodes in Cellular Networks

2020

View full text Add to dashboard Cite

Significant and continuous contributions related to 4G/5G cellular networks are still accelerating the investigation of the approaches that can boost the cell characteristics following the new aspirations of the users. The challenge of achieving sufficient coverage at the cell edge; represents a constant concern for both users and operators; in addition to ensuring a reasonable cost, are the most important search fields and in our scope of interest. As relay nodes can provide a solution, a scenario for a plan of relay nodes deployment at the cell edge is proposed, taking into account the interference due to the relay nodes. Since optimization algorithms are effective in terms of planning, an advanced hybrid particle swarm optimization and gravitational search algorithm (PSOGSA) is applied to the proposed scenario to detect the optimum solution. The optimum solution represents the optimum plan that attains the best coverage with the minimum cost. We submit cost analysis depends on three trails of construction cost, power and channel cost efficiency. To highlight that the optimal plan has been revealed, another recently developed optimization algorithm, a simplified adaptive bat algorithm based on frequency (FSABA) and a classic particle swarm optimization (PSO) algorithm are also applied to the suggested scenario. The obtained results are compared with the related findings of the PSOGSA. From the simulations, it is found that the PSOGSA achieves better performance than the other two algorithms with fruitful and promising results, and the optimal plan featuring great coverage at the cell edge and cost-saving is attained. INDEX TERMS A simplified adaptive bat algorithm based on frequency (FSABA), cell edge, particle swarm optimization and gravitational search algorithm (PSOGSA), relay nodes. RANA M. MOKHTAR received the B.Sc. degree in communication and electronics engineering from Suez Canal University, Port Said, Egypt, in 2009. She is currently pursuing the M.Sc. degree in communication engineering with the Faculty of Engineering. Her current research interests include cellular network planning, relaying network, and optimization techniques. DR. HEBA M. Abdel-Atty received the Ph.D. degree in Electronics and Communications Engineering from the Faculty of Engineering-Port Said University, Egypt 2012. She is working as an associate professor at the Electronics and Communications Engineering Department from 2018 until now. She is founder and counselor of IEEE in Port-Said University student branch. She is a member of IoT Egypt Forum She published a lot of papers in international journals and conferences and she is a reviewer at a lot of international journals. Her current

show abstract

Network planning for mobile multi-hop relay networks

Cited by 8 publications

References 25 publications

Set Cover Problem of Coverage Planning in Lte-Advanced Relay Networks

Set Cover Problem of Coverage Planning in Lte-Advanced Relay Networks

Wireless Mesh Networks Based on MBPSO Algorithm to Improvement Throughput

Optimization of the Deployment of Relay Nodes in Cellular Networks

Contact Info

Product

Resources

About