Optimal Mobile Relays Positions and Resource Allocation for Multi-Relay Multi-Destination Wireless Networks

Abstract

Deploying relays is a major means to improve the performance of wireless networks. In this paper, multiple mobile relays carried by smart drones are sent by a source to assist the communication to multiple destinations for the Public Safety Wireless Broadband Network, where the sole source is not sufficient to satisfy the quality of service (QoS) requirement of all destinations. With Rician fading between source and relays, and relays and destinations, we study two related questions: The first is where to deploy the relays for minimizing the maximum outage probability of all destinations; the second is where to deploy the relays and how to allocate the resource for maximizing the minimum throughput of all destinations. Efficient algorithms are proposed to compute the optimal solutions, which are shown to be highly effective via simulations. The maximum outage probability decreases and the minimum throughput increases as the number of relays increases. But beyond a certain number, more relays do not provide further improvement in the minimum throughput. Meanwhile, large Rician factor could decrease the maximum outage probability and increase the minimum throughput, except for the cases with very low transmit power. INDEX TERMS Relays positions, resource allocation, maximum outage probability, minimum throughput.

An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment

“…Figure 20 shows the visited-wise comparison among EAMDSP, CDSSSD and MDMSMD as per Table 22. Finally, based on Figures 13,14,19,and 20,and Tables 13,14,21,and 22 it is reported that the proposed EAMDSP demonstrates the outstanding performance on cost and number of visited nodes compared to CDSSSD and MDMSMD.…”

“…The MDMSMD calculates the shortest path from each source to each destination node, the previous destination node is the next source node, and calculates the shortest path from the next source to the next destination node until the last destination node. This algorithm can only calculate the shortest path between one pair at a time [20], it cannot calculate the shortest path between a source node and a set of destination nodes at the same time. The objective of this research is to develop an efficient algorithm for searching the smallest path between a given source and the multi-destination nodes.…”