Research Article
Simplicial Complex Reduction Algorithm for Simplifying WSN’s Topology
121 downloads
@INPROCEEDINGS{10.1007/978-3-030-05888-3_3, author={Wenyu Ma and Feng Yan and Xuzhou Zuo and Jin Hu and Weiwei Xia and Lianfeng Shen}, title={Simplicial Complex Reduction Algorithm for Simplifying WSN’s Topology}, proceedings={Ad Hoc Networks. 10th EAI International Conference, ADHOCNETS 2018, Cairns, Australia, September 20-23, 2018, Proceedings}, proceedings_a={ADHOCNETS}, year={2018}, month={12}, keywords={Simplicial complex Reduction algorithm Wireless sensor networks}, doi={10.1007/978-3-030-05888-3_3} }
- Wenyu Ma
Feng Yan
Xuzhou Zuo
Jin Hu
Weiwei Xia
Lianfeng Shen
Year: 2018
Simplicial Complex Reduction Algorithm for Simplifying WSN’s Topology
ADHOCNETS
Springer
DOI: 10.1007/978-3-030-05888-3_3
Abstract
In this paper, a reduction algorithm aiming at simplifying the topology of wireless sensor networks (WSNs) is proposed. First, we use simplicial complex as the tool to represent the topology of the WSNs. Then, we present a reduction algorithm which recurrently deletes redundant vertices and edges while keeping the homology of the network invariant. By reducing the number of simplexes, we make the simplicial complex graph nearly planar and easy for computation. Finally, the performance of the proposed scheme is investigated. Simulations under different node intensities are presented and the results indicate that the proposed algorithm performs well in reducing the number of simplexes under various situations.
Copyright © 2018–2024 ICST