Optimal routing and one hop routing for D2D communications in the presence of mutual interference

Halima, Nadhir Ben; Boujemâa, Hatem

doi:10.1007/s11235-018-0512-7

Cited by 7 publications

(5 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Research [4] discusses the multipath routing protocol that ensures stability of information transmission in cognitive radio networks. Paper [5] deals with specific features of occurrence of mutual interference at optimal single-step routing for the organization of the D2D connection. Study [6] focuses on considering the optimal routing strategy for transport networks in order to ensure the constant cost of information transfer and high throughput of a network.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

“…In known studies [1][2][3][4][5][6], when solving the problem of routing in communications networks, the scalar approach based on taking into consideration only one quality indicator is used. This determines the relevance of the studies aimed at the solution of the problem of optimal routing in communications networks, taking into consideration the totality of quality indicators by using the methods for multicriterial optimization.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Methods for multicriterial selection of optimal routes in communication networks

Guo

Semenets

Bezruk

et al. 2019

EEJET

View full text Add to dashboard Cite

Традиційно задачі маршрутизації у мережах зв'язку вирішуються на основі скалярного підходу, при якому враховуються тільки один показник якості. Однак передача інформації у мережах зв'язку характеризується сукупністю показників якості. Тому для отримання оптимального рішення задачі маршрутизації у мережах зв'язку повинен бути використаний багатокритеріальний підхід. Це визначає актуальність розв'язання проблеми маршрутизації у мережах зв'язку з урахуванням сукупності показників якості, що характеризують якість передачі інформації. Для розв'язання цієї проблеми в даній роботі використані методи багатокритеріальної оптимізації. Запропоновано методи дискретного вибору підмножини Парето-оптимальних варіантів маршрутизації з урахуванням сукупності показників якості. При цьому виключаються безумовно гірші варіанти маршрутизації і забезпечуються потенціально можливі значення сукупності показників якості. Також це дає можливість організації багатошляхової маршрутизації, при якій забезпечується рівномірна загрузка усіх ліній зв'язку. Досліджені практичні особливості застосування вибраних методів багатокритеріальної оптимізації для вибору оптимальних маршрутів у мережах зв'язку з урахуванням сукупності показників якості. Показані переваги і обмеження багатокритеріального підходу до розв'язання проблеми маршрутизації у мережах зв'язку. Результати роботи корисні для фахівців, які займаються плануванням і проектуванням оптимальних мереж зв'язку Ключові слова: передача інформації, мережа зв'язку, проектування, оптимальна маршрутизація, сукупність показників якості, багатокритеріальна оптимізація

show abstract

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Methods for multicriterial selection of optimal routes in communication networks

Guo

Semenets

Bezruk

et al. 2019

EEJET

View full text Add to dashboard Cite

show abstract

“…Finally, the authors of [28] composed cellular networks of D2D pairs where relays are arranged in clusters. They investigate D2D communication optimal routing in the existence of interference.…”

Section: Introductionmentioning

confidence: 99%

Optimal resource allocation for route selection in ad-hoc networks

Farhan¹,

Croock²

2021

TELKOMNIKA

View full text Add to dashboard Cite

Nowadays, the selection of the optimum path in mobile ad hoc networks (MANETS) is being an important issue that should be solved smartly. In this paper, an optimal path selection method is proposed for MANET using the Lagrange multiplier approach. The optimization problem considers the objective function of maximizing bit rate, under the constraints of minimizing the packet loss, and latency. The obtained simulation results show that the proposed Lagrange optimization of rate, delay, and packet loss algorithm (LORDP) improves the selection of optimal path in comparison to ad-hoc ondemand distance vector protocol (AODV). We increased the performance of the system by 10.6 Mbps for bit rate and 0.133 ms for latency.

show abstract

“…A novel joint routing and wireless allocation in D2D communications was introduced in [21] that is based on the branch-and-cut method. Finally, authors of [22] composed cellular networks of D2D pair where relays arranged in clusters. They investigate D2D communication optimal and suboptimal routing in the interference presence.…”

Section: Introductionmentioning

confidence: 99%

Optimized routing algorithm for maximizing transmission rate in D2D network

Farhan¹,

Croock²

2021

IJEECS

View full text Add to dashboard Cite

Wireless devices have been equiping extensive services over recent years. Since most of these devices are randomly distributed, a fundamental trade-off to be addressed is the transmission rate, latency, and packet loss of the ad hoc route selection in device to device (D2D) networks. Therefore, this paper introduces a notion of weighted transmission rate and total delay, as well as the probability of packet loss. By designing optimal transmission algorithms, this proposed algorithm aims to select the best path for device-to-device communication that maximizes the transmission rate while maintaining minimum delay and packet loss. Using the Lagrange optimization method, the lagrangian optimization of rate, delay, and the probability of packet loss algorithm (LORDP) is modeled. For practical designation, we consider the fading effect of the wireless channels scenario. The proposed optimal algorithm is modeled to compute the optimal cost objective function and represents the best possible solution for the corresponding path. Moreover, a simulation for the optimized algorithm is presented based on optimal cost objective function. Simulation results establish the efficiency of the proposed LORDP algorithm.Wireless devices have been equiping extensive services over recent years. Since most of these devices are randomly distributed, a fundamental trade-off to be addressed is the transmission rate, latency, and packet loss of the ad hoc route selection in device to device (D2D) networks. Therefore, this paper introduces a notion of weighted transmission rate and total delay, as well as the probability of packet loss. By designing optimal transmission algorithms, this proposed algorithm aims to select the best path for device-to-device communication that maximizes the transmission rate while maintaining minimum delay and packet loss. Using the Lagrange optimization method, the lagrangian optimization of rate, delay, and the probability of packet loss algorithm (LORDP) is modeled. For practical designation, we consider the fading effect of the wireless channels scenario. The proposed optimal algorithm is modeled to compute the optimal cost objective function and represents the best possible solution for the corresponding path. Moreover, a simulation for the optimized algorithm is presented based on optimal cost objective function. Simulation results establish the efficiency of the proposed LORDP algorithm

show abstract

Optimal routing and one hop routing for D2D communications in the presence of mutual interference

Cited by 7 publications

References 36 publications

Methods for multicriterial selection of optimal routes in communication networks

Methods for multicriterial selection of optimal routes in communication networks

Optimal resource allocation for route selection in ad-hoc networks

Optimized routing algorithm for maximizing transmission rate in D2D network

Contact Info

Product

Resources

About