Exact secrecy throughput capacity study in mobile ad hoc networks

Li, Xiaochen; Zhang, Yuanyu; Zhao, Shuangrui; Shen, Yulong; Jiang, Xiaohong

doi:10.1016/j.adhoc.2018.01.012

Cited by 13 publications

(12 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the Lyapunov optimization theorem [22] and substituting (18) to (19), the upper bound of ∆ U (Θ(t)) can be expressed as:…”

Section: Algorithm Performancementioning

confidence: 99%

“…After that, Zheng et al [17] extended the infinite secure encoding blocklength to the finite case and revealed the relation of secrecy outage probability to the length of codewords. As for the mobile ad hoc networks, Li et al [18] jointly exploited cooperative jamming and secrecy guard zone scheme and derived the exact secrecy throughput based on the physical layer security technology. To enhance security, Zhu et al [19] employed directional antennas and evaluated the secure secrecy performance in millimeter wave ad hoc networks.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Secrecy Control of Wireless Networks with Finite Encoding Blocklength

Liu

Zeng

et al. 2019

Algorithms

View full text Add to dashboard Cite

We consider wireless multi-hop networks in which each node aims to securely transmit a message. To guarantee the secure transmission, we employ an independent randomization encoding strategy to encode the confidential message. We aim to maximize the network utility. Based on the finite length of a secrecy codewords strategy, we develop an improved control algorithm, subject to network stability and secrecy outage requirements. On the basis of the Lyapunov optimization method, we design an control algorithm, which is decomposed into end-to-end secrecy encoding, flow control and routing scheduling. The simulation results show that the proposed algorithm can achieve a utility result that is arbitrarily close to the optimal value. Finally, the performance of the proposed control policy is validated with various network conditions.

show abstract

“…According to the Lyapunov optimization theorem [22] and substituting (18) to (19), the upper bound of ∆ U (Θ(t)) can be expressed as:…”

Section: Algorithm Performancementioning

confidence: 99%

mentioning

confidence: 99%

Secrecy Control of Wireless Networks with Finite Encoding Blocklength

Liu

Zeng

et al. 2019

Algorithms

View full text Add to dashboard Cite

show abstract

“…Various studies have been carried out to analyse and further enhance the traffic carrying capacity of different types of wireless ad hoc networks, from different aspects [6,22,23]. The RF spectrum is considered the most precious ingredient in setting up of a wireless network and a huge amount of work has been done to efficiently utilise this resource for different networks, especially for ad hoc and cognitive radio networks [24,25], which shows the benefits of effective scheduling and spectrum sharing techniques.…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, the M2M communication is maturing to enhance the network's energy and spectral efficiency through a large number of devices with shorter communication links [3,4]. Therefore, these networks have been the key area of research for the last few years [5][6][7][8][9]. In addition, the design of medium access control (MAC) protocol for these distributed wireless networks is a crucial element for their transmission handling capacity owing to the randomly distributed transceivers with simultaneous transmissions in the same frequency channel [5,[10][11][12][13].…”

Section: Introductionmentioning

confidence: 99%

Proactive channel access scheme for wireless ad hoc networks

et al. 2019

View full text Add to dashboard Cite

“…Hence, ad hoc networks have been the leading area of investigation for the last few years [5,[8][9][10].…”

Section: Introductionmentioning

confidence: 99%

An adaptive scheduling scheme for inhomogeneously distributed wireless ad hoc networks

Fazil¹,

Hasan²,

Rehman³

et al. 2019

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

An efficient scheduling strategy guarantees the simultaneous transmission and successful reception by the scheduled nodes even inside a congested wireless ad hoc network. Owing to the dispersed nature of ad hoc networks, the node packing algorithm needs to be implementable without having network-wide channel state information and should additionally be able to pack the optimum number of successful transmissions. The proposed algorithm, for a network with nonhomogeneously distributed nodes, makes the decision to either inhibit or permit an active interferer around an active receiver based on the interferer's transmission power. The analysis evidenced that the suggested scheme provides an estimated 100 times superior transmission capacity when equated to the random aloha scheme. Moreover, the proposed strategy proved its vitality by demonstrating substantial improvement in transmission and transport capacity in comparison to the preexisting renowned scheduling schemes for distributed networks. The final results present a closed-form formula for the best possible exclusion-zone size multiplier factor in terms of the network parameters, i.e. the network's path-loss exponent, spreading gain, SINR threshold, outage constraint, and Tx-Rx separation.

show abstract

Exact secrecy throughput capacity study in mobile ad hoc networks

Cited by 13 publications

References 30 publications

Secrecy Control of Wireless Networks with Finite Encoding Blocklength

Secrecy Control of Wireless Networks with Finite Encoding Blocklength

Proactive channel access scheme for wireless ad hoc networks

An adaptive scheduling scheme for inhomogeneously distributed wireless ad hoc networks

Contact Info

Product

Resources

About