Wyniki wyszukiwania - BazTech

1

RIS-aided Multi-hop Backhauling for 5G/6G UAV-assisted Access Points

Janji Salim, Sroka Paweł

Journal of Telecommunications and Information Technology

|

2023

|

nr 2

63--69

EN

Drones are considered to be an important part of future 6G telecommunication systems. Thanks to their quick deployment potential, they provide additional connectivity options in the form of a ﬂying hotspot. However, in such use cases, they typically require a wireless backhaul link to facilitate their proper operation, which might be a challenging task in dense urban environments. One of the potential methods that may be relied upon to connect such nodes is the integrated access and backhaul (IAB) approach, where part of the spectrum allocated to users accessing the base station is used for wireless backhauling. Thus, in this work, we consider the problem of establishing a multi-hop wireless backhaul link following the IAB concept, with the aid of drone relay stations (DRSs) and reconﬁgurable intelligent surfaces (RISs). We formulate the problem of coverage improvement with a ﬁxed number of relays, assuming certain throughput requirements for the backhaul link. The simulations show that the use of RISs oﬀers a coverage improvement in such a scenario or a reduction in the number of nodes involved in ensuring the required backhaul performance.

2

Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks

Chalopin J., Métivier Y., Morsellino T.

Fundamenta Informaticae

|

2012

|

Vol. 120, nr 1

1-27

EN

We address the enumeration and the leader election problems over partially anonymous and multi-hop broadcast networks. We consider an asynchronous communication model where each process broadcasts a message and all its neighbours receive this message after arbitrary and unpredictable time. In this paper, we present necessary conditions that must be satisfied by any graph to solve these problems and we show that these conditions are sufficient by providing an enumeration algorithm on the one hand and a leader election algorithm on the other hand. For both problems, we highlight the importance of the initial knowledge. Considering the enumeration problem, each process only knows the size of the graph and, contrary to related works, the number of its neighbouring processes is unknown. Whereas for the election problem, we show that this combination of knowledge is not sufficient. Our algorithm assumes that each process initially knows a map of the network (without knowing its position in this map). From the complexity viewpoint, our algorithms offer polynomial complexities (memory at each process, number and size of exchanged messages).

3

Route Availability Model for Inter-working Multi-hop Wireless Networks

Salami O., Bagula A., Chan H. A.

International Journal of Electronics and Telecommunications

|

2010

|

Vol. 56, No. 2

185-190

EN

In order to link a source-destination node pair in inter-working multi-hop wireless networks, links or routes must first be available. It is only after establishing the availability of links and routes between nodes that factors which affect connectivity e.g. interference can be considered. Connectivity in multi-hop wireless networks has been studied. However, the studies focused on network connectivity in ad-hoc networks. Since the next generation of wireless networks will be inter-working, an understanding of connectivity as it applies to such networks is needed. Specifically, this paper emphasizes that an analysis of route connectivity rather than network connectivity is needed for inter-working multi-hop wireless networks. With a focus on route connectivity, a route availability model for inter-working multi-hop wireless networks is presented.