Secure Routing in Multihop Wireless Ad-Hoc Networks With Decode-and-Forward Relaying

Yao, Jianping; Zhou, Xiangyun; Liu, Yuan

doi:10.1109/tcomm.2015.2514094

Cited by 74 publications

(49 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To study the secure transmission problem without eavesdroppers' channel states, stochastic geometry has been introduced as a powerful tool in many works [28]- [31]. These works usually model the distribution of eavesdroppers as homogenous Poisson point process (PPP) and study the secrecy performance for such networks.…”

Section: A Backgroundmentioning

confidence: 99%

“…The authors in [29] studied the secrecy performance of multi-input multi-output (MIMO) channels with and without artificial noise. The authors in [30] derived the secure connection probability for relay transmission while the authors in [31] obtained the secrecy outage probability for multi-hop transmission. Although the above works have studied both the singleand multi-hop transmission with a single antenna or multiple antennas, the system parameters are all preset as constants and not able to be adapted according to some available channel states.…”

Section: A Backgroundmentioning

confidence: 99%

See 1 more Smart Citation

Security Enhancement for IoT Communications Exposed to Eavesdroppers With Uncertain Locations

et al. 2016

View full text Add to dashboard Cite

The Internet of Things (IoT) depicts a bright future where any devices having sensorial and computing capabilities can interact with each other. Among all existing technologies, the techniques for the fifth generation (5G) systems are the main driving force for the actualization of IoT concept. However, due to the heterogeneous environment in 5G networks and the broadcast nature of radio propagation, the security assurance against eavesdropping is a vital yet challenging task. In this paper, we focus on the transmission design for secure relay communications in IoT networks, where the communication is exposed to eavesdroppers with unknown number and locations. The randomize-and-forward (RF) relay strategy specially designed for secure multi-hop communications is employed in our transmission protocol. First, we consider a single-antenna scenario where all the devices in the network are equipped with the single antenna. We derive the expression for the secrecy outage probability of the two-hop transmission. Following this, a secrecy-rate-maximization problem subject to a secrecyoutage-probability constraint is formulated. The optimal power allocation and codeword rate design are obtained. Furthermore, we generalize the above analyses to a more generic scenario where the relay and eavesdroppers are equipped with multiple antennas. Numerical results show that the proper use of relay transmission can enhance the secrecy throughput and extend the secure coverage range.

show abstract

Section: A Backgroundmentioning

confidence: 99%

Section: A Backgroundmentioning

confidence: 99%

Security Enhancement for IoT Communications Exposed to Eavesdroppers With Uncertain Locations

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Additionally, the appropriately modified Viterbi decoding algorithm [14], [15] has also been utilized for solving single-component routing optimization problems, where the route exploration process can be viewed as a trellis graph and thus the routing problem is transformed into a decoding problem. Explicitly, this transformation is reminiscent of the famous Bellman-Ford algorithm [16].…”

Section: Mo-acomentioning

confidence: 99%

A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks

Alanis

Botsinis

Babar

et al. 2018

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-Wireless Multihop Networks (WMHNs) have to strike a trade-off among diverse and often conflicting Qualityof-Service (QoS) requirements. The resultant solutions may be included by the Pareto Front under the concept of Pareto Optimality. However, the problem of finding all the Pareto-optimal routes in WMHNs is classified as NP-hard, since the number of legitimate routes increases exponentially, as the nodes proliferate. Quantum Computing offers an attractive framework of rendering the Pareto-optimal routing problem tractable. In this context, a pair of quantum-assisted algorithms have been proposed, namely the Non-Dominated Quantum Optimization (NDQO) and the Non-Dominated Quantum Iterative Optimization (NDQIO). However, their complexity is proportional to √ N , where N corresponds to the total number of legitimate routes, thus still failing to find the solutions in "polynomial time". As a remedy, we devise a dynamic programming framework and propose the so-called Evolutionary Quantum Pareto Optimization (EQPO) algorithm. We analytically characterize the complexity imposed by the EQPO algorithm and demonstrate that it succeeds in solving the Pareto-optimal routing problem in polynomial time. Finally, we demonstrate by simulations that the EQPO algorithm achieves a complexity reduction, which is at least an order of magnitude, when compared to its predecessors, albeit at the cost of a modest heuristic accuracy reduction.

show abstract

“…We consider a W × L rectangular monitoring area, within which there are N sensor nodes and one sink node. The set of all nodes is given by S = {s 1 We assume all sensor nodes are initialized with the same amount of energy. -Each sensor node can be either Cluster Header (CH) or Cluster Member (CM), depending on the design of routing protocol.…”

Section: Assumptionmentioning

confidence: 99%

“…Over the last decade, the research on Wireless Sensor Networks (WSNs) or WANETs has been receiving great attention from academic and industrial communities. WSNs generally include a number of sensor nodes and given sink node deployed in an area, mainly for event monitoring and detection, data collection and transmission [1][2][3][4]. However, sensor nodes are inherently batterypowered, and it is also difficult to recharge their energy once being used.…”

Section: Introductionmentioning

confidence: 99%

An improved clustering routing mechanism for wireless Ad hoc network

Wang

Han

2017

IFS

View full text Add to dashboard Cite

Abstract. In Wireless Ad hoc Networks (WANET), to organize sensor nodes for data collection is an important research issue. Clustering is an effective technique for prolonging the network lifetime. However, the Cluster Header (CH) in a cluster always involves a lot of data forwarding tasks, rather than its Cluster Members (CMs). This energy consumption overloading inevitably leads to the "hot spot" problem. With these in mind, an Energy-Balanced and Unequally-Layered Routing Protocol (EBULRP) is proposed in this article. The main emphasis is on balancing the energy consumption among CHs. In our design, the network is decoupled into multiple layers with different width, where the radius of clusters is differentiated at each layer. The core is to organize those CHs closer to the sink node, with more energy for inter-cluster data forwarding. Simulation results show that the proposed EBULRP effectively balances the energy consumption among CHs, and further prolongs the network lifetime.

show abstract

Secure Routing in Multihop Wireless Ad-Hoc Networks With Decode-and-Forward Relaying

Cited by 74 publications

References 30 publications

Security Enhancement for IoT Communications Exposed to Eavesdroppers With Uncertain Locations

Security Enhancement for IoT Communications Exposed to Eavesdroppers With Uncertain Locations

A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks

An improved clustering routing mechanism for wireless Ad hoc network

Contact Info

Product

Resources

About