Interference-Aware Routing for Difficult Wireless Sensor Network Environment with SWIPT
Shiming He,
Yangning Tang,
Zhuozhou Li,
Feng Li,
Kun Xie,
Hye-jin Kim,
Gwang-jun Kim
Affiliations
Shiming He
School of Computer and Communication Engineering, Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha 410114, China
Yangning Tang
School of Computer and Communication Engineering, Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha 410114, China
Zhuozhou Li
School of Computer and Communication Engineering, Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha 410114, China
Feng Li
School of Computer and Communication Engineering, Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha 410114, China
Kun Xie
College of Computer Science and Electronics Engineering, Hunan University, Changsha 410082, China
Hye-jin Kim
Leader of Research Management Team, Academic Times, Seoul 136170, Korea
Gwang-jun Kim
Department of Computer Engineering, Chonnam National University, Gwangju 61186, Korea
The main challenges of sensing in harsh industrial and biological environments are the limited energy of sensor nodes and the difficulty of charging sensor nodes. Simultaneous wireless information and power transfer (SWIPT) is a non-invasive option to replenish energy. SWIPT harvests energy and decodes information from the same RF signal, which is influencing the design of a wireless sensor network. In multi-hop multi-flow wireless sensor networks, interference generally exists, and the interference has a different influence on SWIPT. Route, interference and SWIPT are dependent. However, existing works consider SWIPT link resource allocation with a given route or only select path for one flow without interference. Therefore, this paper firstly analyzes the influence of interference on SWIPT, and select the SWIPT routing with interference. We design an interference-based information and energy allocation model to maximize the link capacity with SWIPT. Then, we design an interference-aware route metric, formulate SWIPT routing problem, and design an interference-aware SWIPT routing algorithm. The simulation results show that as the number of flows increases, there is more likely to obtain performance gains from interference and SWIPT.
