Advances of wireless optical relay communication

2020 ◽  
Author(s):  
Wenwen Liu ◽  
Jupeng Ding ◽  
Jiong Zheng ◽  
Xifeng Chen ◽  
Hongye Mei
Keyword(s):  
Relay Communication

Intercepting a Stealthy Network

2021 ◽  
Vol 17 (2) ◽  
pp. 1-39
Author(s):  
Mai Ben Adar Bessos ◽  
Amir Herzberg
Keyword(s):  
Mobile Devices ◽  
Short Range ◽  
Low Energy ◽  
Expected Number ◽  
Relay Communication

We investigate an understudied threat: networks of stealthy routers (S-Routers) , relaying messages to a hidden destination . The S-Routers relay communication along a path of multiple short-range, low-energy hops, to avoid remote localization by triangulation. Mobile devices called Interceptors can detect communication by an S-Router, but only when the Interceptor is next to the transmitting S-Router. We examine algorithms for a set of mobile Interceptors to find the destination of the communication relayed by the S-Routers. The algorithms are compared according to the number of communicating rounds before the destination is found, i.e., rounds in which data is transmitted from the source to the destination . We evaluate the algorithms analytically and using simulations, including against a parametric, optimized strategy for the S-Routers. Our main result is an Interceptors algorithm that bounds the expected number of communicating rounds by a term quasilinear in the number of S-Routers. For the case where S-Routers transmit at every round (“continuously”), we present an algorithm that improves this bound.

A Relay Selection Algorithm Based on User Trust Degree for D2D Communications

2021 ◽  
Author(s):  
Xiaobin Li ◽  
Haoran Liu
Keyword(s):  
Success Rate ◽  
Social Relationship ◽  
Relay Node ◽  
D2d Communications ◽  
Relay Nodes ◽  
Trust Degree ◽  
Relay Communication ◽  
Relay Selection Algorithm ◽  
User Trust

Abstract The emergence of 5G has promoted the rapid development of the Internet of Things(IOT), the dramatic increasing of mobile equipment has led to the increasing shortage of spectrum resources, D2D(Device-to-Device) communication technology is widely concerned for its ability to improve the utilization of spectrum resources. In order to expand the communication scope, relay nodes are introduced into D2D communications, as the third party of D2D relay communication, the quality of relay nodes directly affects the quality of communication process. In order to make more users willing to participate in relay communication, social relationship is introduced into D2D relay communication, However, as an explicit relationship between people, the function of social relationship in D2D communication is limited by the mobility of users and the variability of communication scenarios. In order to find a more reli­able relay node and upgrade the connection success rate of D2D relay communication, implicit social relationship between the users need to be mined. Aiming at that, user trust degree (UTD) is established in this paper. By combining the explicit relationship which is called the social connectivity degree with the implicit social relationship called the interest similarity degree, and considering the user’s movement, a relay selection algorithm is presented to help sender find a relay node with a deeper user trust, which can increase the user’s willingness to participate in D2D relay communication and upgrade the success rate of communication connection, so this algorithm can ensure the security of the relay node and can improve the throughput performance. Simulation results show that this algorithm can increase the success rate of connection, improve the overall throughput of the system and improve the user's communication expe­rience.

Sign in / Sign up

Export Citation Format

Share Document