K connectivity algorithm based on flow network in wireless sensor networks
Wireless sensor networks(WSN) connectivity is an important way to ensure network fault tolerance.Conventional multi-routing algorithms often have common paths,which will lead to premature connectivity failure of the whole WSN due to node damage,communication link interruption and other faults.Aiming...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
China InfoCom Media Group
2019-09-01
|
| Series: | 物联网学报 |
| Subjects: | |
| Online Access: | http://www.wlwxb.com.cn/zh/article/doi/10.11959/j.issn.2096-3750.2019.00110/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Wireless sensor networks(WSN) connectivity is an important way to ensure network fault tolerance.Conventional multi-routing algorithms often have common paths,which will lead to premature connectivity failure of the whole WSN due to node damage,communication link interruption and other faults.Aiming at the common path problem,a solution was proposed to generate multiple paths on the common path through node splitting to support fault tolerance of WSN and ensure that each sensor node has K disjoint shortest paths of bounded length to the sinks.The simulation results show that the algorithm can provide better fault tolerance and ensure network connectivity. |
|---|---|
| ISSN: | 2096-3750 |