Secrecy Capacity Scaling of Large-Scale Networks With Social Relationships

Zheng, Kechen; Zhang, Jinbei; Liu, Xiaoying; Fu, Luoyi; Wang, Xinbing; Jiang, Xiaohong; Zhang, Wenjun

doi:10.1109/tvt.2016.2582778

Cited by 20 publications

(11 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the authors in [10], [11] utilized socially-aware paradigm to identify trusted and non-trusted users based on the social relationship/ties strength. In [12], the authors analysed the secure capacity for large-scale networks considering social relationships. In [13], the social reciprocity and social trust was adopted to improve the security by jamming the transmission of eavesdroppers.…”

Section: Introductionmentioning

confidence: 99%

Security Enhanced Content Sharing in Social IoT: A Directed Hypergraph-Based Learning Scheme

Wang

Sun

Duong

et al. 2020

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Security is a critical element to the existing Internet of Things (IoT) deployment, where any user may actively or passively attack the content sharing of others reusing the same channel. As most smart devices are carried by human, we may leverage their owners' social trust to avoid being intercepted by untrusted users, which conforms to the Social Internet of Things (SIoT) paradigm. In this paper, we propose a secure content sharing (SCS) scheme to strike the trade-off between security and quality of experience (QoE) by exploring the social trust. Firstly, to dynamically extract the social trust, the random walk strategy is employed for prediction based on the proposed "User-Content-Social Group" graph which models users' preference over time. Given the social trust value, we propose a hierarchical game model to decouple the optimization problem into two subproblems: user pairing and channel selection. More specifically, the user pairing sub-problem is formulated as a matching subgame with peer effect, and the embedded rotation-swap matching algorithm can accommodate the dynamics caused by mutual interference. The second sub-problem can be formulated as a secure channel selection sub-game with the directed hypergraph being game space, which is proved to be an exact potential game. Then, we design an uncoupled-user concurrent learning algorithm (UUCL) to search for the optimal pure Nash equilibrium, and thereby the global optimum of this sub-game is achieved. Finally, simulation results generated on realistic social dataset verify that our proposed scheme can notably enhance the security without sacrificing users' QoE. Index Terms-Social Internet of Things, directed hypergraph, game theory, machine learning.

show abstract

Section: Introductionmentioning

confidence: 99%

Security Enhanced Content Sharing in Social IoT: A Directed Hypergraph-Based Learning Scheme

Wang

Sun

Duong

et al. 2020

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…Inspired by these works, a lot of researchers have devoted their efforts to exploring the security issues in large-scale wireless networks. For instance, the secure routing protocols were investigated in [14][15][16], the design of effective physical layer authentication schemes was analysed in [17][18][19], the security performances in terms of secrecy throughput capacity and eavesdropper-tolerance capability were explored in [20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Secrecy transmission capacity in mobile ad hoc networks with security‐aware Aloha protocol

Li¹,

Zhang

Shen

et al. 2020

IET Communications

Self Cite

View full text Add to dashboard Cite

Mobile ad hoc networks (MANETs) represent a class of important network models for supporting various critical applications, while the security breach due to eavesdropping attacks has been a critical issue. This study investigates the security issue of MANETs from the perspective of physical layer security (PLS). In particular, by combining PLS techniques [e.g. artificial noise (AN) injection and Secrecy Guard zoNe (SGN)] and the conventional Aloha protocol, the authors first propose an AN-based Aloha protocol and a SGN-based Aloha protocol to ensure secure medium access for legitimate transmitters. In the AN-based Aloha protocol, all potential transmitters are allowed to be active and each active transmitter injects AN into its transmitted signals to confuse eavesdroppers. In the SGN-based protocol, each potential transmitter has an SGN, a circle centred at itself, and only the potential transmitters whose SGN contains no eavesdroppers are allowed to be active. To understand the security performances of the proposed security-aware Aloha protocols, the authors then apply tools from Stochastic Geometry to analyse the secrecy transmission capacity (STC) performances of MANETs under both protocols. Finally, the authors provide simulation/numerical results to corroborate the proposed theoretical analysis and also to show the impacts of network parameters on the STC performances.

show abstract

“…However, they did not consider the data transmission security. In [16]- [18], the authors, considered a large scale wireless networks and analyze the secrecy throughput with ideal control policies. As for the mobile ad hoc networks, Li et al [19] jointly exploited cooperative jamming and secrecy guard zone scheme and derived the exact secrecy throughput based on the physical layer security technology.…”

Section: Introductionmentioning

confidence: 99%

Online Scheduling for Multi-Hops Wireless Networks With Security Constraints

et al. 2019

View full text Add to dashboard Cite

We consider wireless multi-hops networks in which each node desires to securely transmit the message. To guarantee secure transmission, we employ an independent randomization encoding strategy to encode the confidential message. We formulate the problem as network utility maximization. Based on the secure communication strategy, we first propose a simple and provable dynamic control algorithm for the case that the length of secrecy codewords is infinite. The control algorithm not only satisfies end-to-end perfect secrecy constraint, but also keeps the network stability. Next, we further consider the case that a finite length of secrecy codewords is performed, in which the possibility of perfect secrecy is eliminated. For this case, we develop an improved control algorithm, subject to network stability and secrecy outage requirement. On the basis of the Lyapunov optimization method, we obtain the optimal algorithm, which is decomposed into end-to-end secrecy encoding, flow control, and routing schedule. The simulation results show that both of the proposed algorithms can achieve a utility result, arbitrarily close to optimal value. Finally, the performance of the proposed control policies is validated with various network conditions.INDEX TERMS Wireless networks, secrecy encoding, network control, Lyapunov optimization.

show abstract

Secrecy Capacity Scaling of Large-Scale Networks With Social Relationships

Cited by 20 publications

References 31 publications

Security Enhanced Content Sharing in Social IoT: A Directed Hypergraph-Based Learning Scheme

Security Enhanced Content Sharing in Social IoT: A Directed Hypergraph-Based Learning Scheme

Secrecy transmission capacity in mobile ad hoc networks with security‐aware Aloha protocol

Online Scheduling for Multi-Hops Wireless Networks With Security Constraints

Contact Info

Product

Resources

About