Modelling trust in random wireless networks

Coon, Justin P.

doi:10.1109/iswcs.2014.6933495

Cited by 20 publications

(13 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In mobile social networks, the trust degree can be measured based on the previous behaviors of nodes [17,19,20]. One node measures the trust degree using either direct information from previous interactions of other nodes or indirect information from the accumulated observations of behaviors at the other nodes.…”

Section: Trust Degreesmentioning

confidence: 99%

Trust Degree-Based MISO Cooperative Communications with Two Relay Nodes

Ryu

Lee

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

In this paper, we propose transmission strategies in multiple-input-single-output (MISO) cooperative communications with two relay nodes in cases when the relay nodes have different trust degrees, where the trust degrees represent how much the relay nodes can be trusted for cooperation. For the given trust degrees and channel conditions, we first derive a relay selection strategy that maximizes the expected achievable rate. We then propose a cooperative transmission strategy of relays with an optimal cooperative beamforming vector that maximizes the expected achievable rate, which is a linear combination of weighted channel vectors. Finally, we derive the optimal transmission strategy, which is a mixed strategy between the relay selection and cooperative transmission strategies with respect to the trust degrees. Our analysis and numerical results show that the proposed transmission strategies increase the expected achievable rate by exploiting the trust degrees of the relay nodes, along with the channel conditions.

show abstract

Section: Trust Degreesmentioning

confidence: 99%

Trust Degree-Based MISO Cooperative Communications with Two Relay Nodes

Ryu

Lee

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…A passive monitoring of forwarded data traffic to estimate the behavior of a node without buffer was proposed in [19]. The proximity based trust and experience-based trust modelings in random wireless networks were proposed in [22]. The selective packet drop behavior in the selfish relay has been studied in [23] for route selection, which ignored the effects of connectivity and delay.…”

Section: B Related Workmentioning

confidence: 99%

Route Selection Based on Connectivity-Delay-Trust in Public Safety Networks

Tang

Chen

Coon

2019

IEEE Systems Journal

Self Cite

View full text Add to dashboard Cite

Recently, the mission-critical push-to-talk (MCPTT) system has emerged as the new broadband technology for public safety networks. In this paper, we propose a route selection method based on the connectivity, delay, and trust in the MCPTT system to offer the best connectivity-delay-trust performance. To begin with, the connection probability between a pair of user equipments (UEs) has been analyzed with the interference from other MCPTT groups. Then, the timeliness probability is studied to capture the level of confidence for the delay requirement. Moreover, the trust probability is calculated by a beta reputation system to prevent potential attacks from malicious nodes and ensure secure interactions among the forwarding UEs. By combining three probabilistic results, we investigate the optimal path route selection method based on the Dijkstra's algorithm to find the path, which can meet the requirement of the MCPTT system. The simulation results validate our models and theoretical analysis. The results provide a useful insight in designing the MCPTT system for 5G public safety and disaster relief networks.

show abstract

“…First, by using the mathematical definition of trusted connection in [26] -specifically, two nodes can establish a trusted connection if they can communicate and trust each other -then the T-CP can be defined as:…”

Section: Trusted Connection Probabilitymentioning

confidence: 99%

Optimal Routing for Multihop Social-Based D2D Communications in the Internet of Things

Chen

Tang

Coon

2018

IEEE Internet Things J.

Self Cite

View full text Add to dashboard Cite

Abstract-With the development of wireless communications and the intellectualization of machines, the Internet of things (IoT) has been of interest to both industry and academia. Multihop routing and relaying are key technologies that will underpin IoT mesh networks in the future. This paper investigates optimal routing based on the trusted connectivity probability (T-CP) for multi-hop, underlay, device-to-device (D2D) communications with decode-and-forward (DF) relaying. Both random and fixed locations for base stations (BSs) are considered, where the former case assumes that the locations of the BSs are modeled as a Poisson point process (PPP). First, we derive two expressions for the connectivity probability (CP): a tight lower bound and an exact closed-form. Analysis is carried out for the cases where the channel state information (CSI) between BSs and the D2D transmitter is known (CSI-aware) and unknown (no-CSI). Interference from active cellular users (CUEs) is characterized by modeling CUE locations as a PPP. Moreover, motivated by results that have shown that social behavior leads to D2D devices communicating with nearby neighbours, we derive the trust probability (TP) for D2D connections by using a rank-based model. Finally, we propose a novel routing algorithm that can achieve the highest T-CP for any pair of D2D devices in a distributed manner. The derived analytical results are verified by Monte Carlo simulations. We show that the proposed routing algorithm achieves almost the same performance as that attained through an exhaustive search. When BSs are located randomly, the optimal path based on the CP is the shortest path between the D2D transmitter and receiver. However, for fixed BSs, the optimal path selection depends on the locations of the BSs, which provides a very useful insight in designing the multi-hop D2D system for 5G IoT.

show abstract

Modelling trust in random wireless networks

Cited by 20 publications

References 15 publications

Trust Degree-Based MISO Cooperative Communications with Two Relay Nodes

Trust Degree-Based MISO Cooperative Communications with Two Relay Nodes

Route Selection Based on Connectivity-Delay-Trust in Public Safety Networks

Optimal Routing for Multihop Social-Based D2D Communications in the Internet of Things

Contact Info

Product

Resources

About