# Energy-Efficient Secrecy in Wireless Networks Based on Random Jamming

**Authors:** Azadeh Sheikholeslami, Majid Ghaderi, Hossein Pishro-Nik, Dennis, Goeckel

arXiv: 1703.05194 · 2017-03-16

## TL;DR

This paper introduces an energy-efficient routing algorithm for wireless networks that guarantees secrecy without knowing eavesdropper locations, using random jamming to exploit receiver non-idealities and outperform existing methods in challenging environments.

## Contribution

The paper presents a novel secrecy routing algorithm that does not require eavesdropper location or CSI, employing random jamming to ensure security in uncertain wireless environments.

## Key findings

- Outperforms existing algorithms in energy efficiency and secrecy in high-uncertainty scenarios.
- Effective even with multiple passive eavesdroppers and directional antennas.
- Suitable for both single-hop and multi-hop wireless networks.

## Abstract

This paper considers secure energy-efficient routing in the presence of multiple passive eavesdroppers. Previous work in this area has considered secure routing assuming probabilistic or exact knowledge of the location and channel-state-information (CSI) of each eavesdropper. In wireless networks, however, the locations and CSIs of passive eavesdroppers are not known, making it challenging to guarantee secrecy for any routing algorithm.   We develop an efficient (in terms of energy consumption and computational complexity) routing algorithm that does not rely on any information about the locations and CSIs of the eavesdroppers. Our algorithm guarantees secrecy even in disadvantaged wireless environments, where multiple eavesdroppers try to eavesdrop each message, are equipped with directional antennas, or can get arbitrarily close to the transmitter. The key is to employ additive random jamming to exploit inherent non-idealities of the eavesdropper's receiver, which makes the eavesdroppers incapable of recording the messages. We have simulated our proposed algorithm and compared it with existing secrecy routing algorithms in both single-hop and multi-hop networks. Our results indicate that when the uncertainty in the locations of eavesdroppers is high and/or in disadvantaged wireless environments, our algorithm outperforms existing algorithms in terms of energy consumption and secrecy.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.05194/full.md

## Figures

11 figures with captions in the complete paper: https://tomesphere.com/paper/1703.05194/full.md

## References

46 references — full list in the complete paper: https://tomesphere.com/paper/1703.05194/full.md

---
Source: https://tomesphere.com/paper/1703.05194