Loading…

A topology control algorithm based on D-region fault tolerance

In a wireless network, node failure due to either natural disasters or human intervention can cause network partitioning and other communication problems. For this reason, a wireless network should be fault tolerant. At present, most researchers use k-connectivity to measure fault tolerance, which r...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2013-07, Vol.56 (7), p.29-37
Main Authors: Sun, RuoZi, Wang, Yue, Yuan, Jian, Shan, XiuMing, Ren, Yong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3
cites cdi_FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3
container_end_page 37
container_issue 7
container_start_page 29
container_title Science China. Information sciences
container_volume 56
creator Sun, RuoZi
Wang, Yue
Yuan, Jian
Shan, XiuMing
Ren, Yong
description In a wireless network, node failure due to either natural disasters or human intervention can cause network partitioning and other communication problems. For this reason, a wireless network should be fault tolerant. At present, most researchers use k-connectivity to measure fault tolerance, which requires the network to be connected after the failure of any up to k-1 nodes. However~ wireless network node failures are usually spatially related, and particularly in military applications, nodes from the same limited area can fail together. As a metric of fault-tolerance, k-connectivity fails to capture the spatial relativity of faults and hardly satisfies the fault tolerance requirements of a wireless network design. In this paper, a new metric of fault-tolerance, termed D-region fault tolerance, is introduced to measure wireless network fault tolerance. A D-region fault tolerant network means that even after all the nodes have failed in a circular region with diameter D, it still remains connected. Based on D-region fault tolerance, we propose two fault-tolerant topology control algorithms-- the global region fault tolerance algorithm (GRFT) and the localized region fault tolerance algorithm (LRFT). It is theoretically proven that both algorithms are able to generate a network with D-region fault tolerance. Simulation results indicate that with the same fault tolerance capabilities, networks based on both GRFT and LRFT algorithms have a lower transmission radius and lower logical degree.
doi_str_mv 10.1007/s11432-012-4652-1
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1429861908</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>46374580</cqvip_id><sourcerecordid>1429861908</sourcerecordid><originalsourceid>FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3</originalsourceid><addsrcrecordid>eNp9kD1PwzAQhi0EEhX0B7AFsbAYfHZixwtSVT6lSiwgsVlOYqet3Li1k6H_HlepQGLglrvhfe5OD0JXQO6AEHEfAXJGMQGKc15QDCdoAiWXGCTI0zRzkWPB2Nc5msa4JqkYI1SUE_Qwy3q_9c63-6z2XR-8y7RrfVj1y01W6WiazHfZIw6mXaXB6sH1CXEm6K42l-jMahfN9Ngv0Ofz08f8FS_eX97mswWumSh6TCUriNCC0boQlpq8oQYKVgGAFLYQEqCuuebMNpYJYcrKUqAV0bapKNENu0C3495t8LvBxF5tVrE2zunO-CEqyKksOUhSpujNn-jaD6FL3ykqkxUKjJOUgjFVBx9jMFZtw2qjw14BUQepapSqklR1kKogMXRkYsp2rQm_m_-Dro-Hlr5rd4n7uZRzJvKiJOwbmHCC6A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918621360</pqid></control><display><type>article</type><title>A topology control algorithm based on D-region fault tolerance</title><source>Springer Link</source><creator>Sun, RuoZi ; Wang, Yue ; Yuan, Jian ; Shan, XiuMing ; Ren, Yong</creator><creatorcontrib>Sun, RuoZi ; Wang, Yue ; Yuan, Jian ; Shan, XiuMing ; Ren, Yong</creatorcontrib><description>In a wireless network, node failure due to either natural disasters or human intervention can cause network partitioning and other communication problems. For this reason, a wireless network should be fault tolerant. At present, most researchers use k-connectivity to measure fault tolerance, which requires the network to be connected after the failure of any up to k-1 nodes. However~ wireless network node failures are usually spatially related, and particularly in military applications, nodes from the same limited area can fail together. As a metric of fault-tolerance, k-connectivity fails to capture the spatial relativity of faults and hardly satisfies the fault tolerance requirements of a wireless network design. In this paper, a new metric of fault-tolerance, termed D-region fault tolerance, is introduced to measure wireless network fault tolerance. A D-region fault tolerant network means that even after all the nodes have failed in a circular region with diameter D, it still remains connected. Based on D-region fault tolerance, we propose two fault-tolerant topology control algorithms-- the global region fault tolerance algorithm (GRFT) and the localized region fault tolerance algorithm (LRFT). It is theoretically proven that both algorithms are able to generate a network with D-region fault tolerance. Simulation results indicate that with the same fault tolerance capabilities, networks based on both GRFT and LRFT algorithms have a lower transmission radius and lower logical degree.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-012-4652-1</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Computer Science ; Control algorithms ; Control theory ; D region ; Diameters ; Failure ; Fault tolerance ; Fault tolerant ; Information Systems and Communication Service ; Military applications ; Natural disasters ; Network design ; Network topologies ; Networks ; Nodes ; Relativity ; Research Paper ; Topology ; Wireless networks ; 容错算法 ; 容错网络 ; 容错能力 ; 拓扑 ; 控制算法 ; 无线网络 ; 网络连接 ; 节点故障</subject><ispartof>Science China. Information sciences, 2013-07, Vol.56 (7), p.29-37</ispartof><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2012</rights><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2012.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3</citedby><cites>FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Sun, RuoZi</creatorcontrib><creatorcontrib>Wang, Yue</creatorcontrib><creatorcontrib>Yuan, Jian</creatorcontrib><creatorcontrib>Shan, XiuMing</creatorcontrib><creatorcontrib>Ren, Yong</creatorcontrib><title>A topology control algorithm based on D-region fault tolerance</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>In a wireless network, node failure due to either natural disasters or human intervention can cause network partitioning and other communication problems. For this reason, a wireless network should be fault tolerant. At present, most researchers use k-connectivity to measure fault tolerance, which requires the network to be connected after the failure of any up to k-1 nodes. However~ wireless network node failures are usually spatially related, and particularly in military applications, nodes from the same limited area can fail together. As a metric of fault-tolerance, k-connectivity fails to capture the spatial relativity of faults and hardly satisfies the fault tolerance requirements of a wireless network design. In this paper, a new metric of fault-tolerance, termed D-region fault tolerance, is introduced to measure wireless network fault tolerance. A D-region fault tolerant network means that even after all the nodes have failed in a circular region with diameter D, it still remains connected. Based on D-region fault tolerance, we propose two fault-tolerant topology control algorithms-- the global region fault tolerance algorithm (GRFT) and the localized region fault tolerance algorithm (LRFT). It is theoretically proven that both algorithms are able to generate a network with D-region fault tolerance. Simulation results indicate that with the same fault tolerance capabilities, networks based on both GRFT and LRFT algorithms have a lower transmission radius and lower logical degree.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Control algorithms</subject><subject>Control theory</subject><subject>D region</subject><subject>Diameters</subject><subject>Failure</subject><subject>Fault tolerance</subject><subject>Fault tolerant</subject><subject>Information Systems and Communication Service</subject><subject>Military applications</subject><subject>Natural disasters</subject><subject>Network design</subject><subject>Network topologies</subject><subject>Networks</subject><subject>Nodes</subject><subject>Relativity</subject><subject>Research Paper</subject><subject>Topology</subject><subject>Wireless networks</subject><subject>容错算法</subject><subject>容错网络</subject><subject>容错能力</subject><subject>拓扑</subject><subject>控制算法</subject><subject>无线网络</subject><subject>网络连接</subject><subject>节点故障</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kD1PwzAQhi0EEhX0B7AFsbAYfHZixwtSVT6lSiwgsVlOYqet3Li1k6H_HlepQGLglrvhfe5OD0JXQO6AEHEfAXJGMQGKc15QDCdoAiWXGCTI0zRzkWPB2Nc5msa4JqkYI1SUE_Qwy3q_9c63-6z2XR-8y7RrfVj1y01W6WiazHfZIw6mXaXB6sH1CXEm6K42l-jMahfN9Ngv0Ofz08f8FS_eX97mswWumSh6TCUriNCC0boQlpq8oQYKVgGAFLYQEqCuuebMNpYJYcrKUqAV0bapKNENu0C3495t8LvBxF5tVrE2zunO-CEqyKksOUhSpujNn-jaD6FL3ykqkxUKjJOUgjFVBx9jMFZtw2qjw14BUQepapSqklR1kKogMXRkYsp2rQm_m_-Dro-Hlr5rd4n7uZRzJvKiJOwbmHCC6A</recordid><startdate>20130701</startdate><enddate>20130701</enddate><creator>Sun, RuoZi</creator><creator>Wang, Yue</creator><creator>Yuan, Jian</creator><creator>Shan, XiuMing</creator><creator>Ren, Yong</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130701</creationdate><title>A topology control algorithm based on D-region fault tolerance</title><author>Sun, RuoZi ; Wang, Yue ; Yuan, Jian ; Shan, XiuMing ; Ren, Yong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Control algorithms</topic><topic>Control theory</topic><topic>D region</topic><topic>Diameters</topic><topic>Failure</topic><topic>Fault tolerance</topic><topic>Fault tolerant</topic><topic>Information Systems and Communication Service</topic><topic>Military applications</topic><topic>Natural disasters</topic><topic>Network design</topic><topic>Network topologies</topic><topic>Networks</topic><topic>Nodes</topic><topic>Relativity</topic><topic>Research Paper</topic><topic>Topology</topic><topic>Wireless networks</topic><topic>容错算法</topic><topic>容错网络</topic><topic>容错能力</topic><topic>拓扑</topic><topic>控制算法</topic><topic>无线网络</topic><topic>网络连接</topic><topic>节点故障</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sun, RuoZi</creatorcontrib><creatorcontrib>Wang, Yue</creatorcontrib><creatorcontrib>Yuan, Jian</creatorcontrib><creatorcontrib>Shan, XiuMing</creatorcontrib><creatorcontrib>Ren, Yong</creatorcontrib><collection>维普_期刊</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>维普中文期刊数据库</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sun, RuoZi</au><au>Wang, Yue</au><au>Yuan, Jian</au><au>Shan, XiuMing</au><au>Ren, Yong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A topology control algorithm based on D-region fault tolerance</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2013-07-01</date><risdate>2013</risdate><volume>56</volume><issue>7</issue><spage>29</spage><epage>37</epage><pages>29-37</pages><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>In a wireless network, node failure due to either natural disasters or human intervention can cause network partitioning and other communication problems. For this reason, a wireless network should be fault tolerant. At present, most researchers use k-connectivity to measure fault tolerance, which requires the network to be connected after the failure of any up to k-1 nodes. However~ wireless network node failures are usually spatially related, and particularly in military applications, nodes from the same limited area can fail together. As a metric of fault-tolerance, k-connectivity fails to capture the spatial relativity of faults and hardly satisfies the fault tolerance requirements of a wireless network design. In this paper, a new metric of fault-tolerance, termed D-region fault tolerance, is introduced to measure wireless network fault tolerance. A D-region fault tolerant network means that even after all the nodes have failed in a circular region with diameter D, it still remains connected. Based on D-region fault tolerance, we propose two fault-tolerant topology control algorithms-- the global region fault tolerance algorithm (GRFT) and the localized region fault tolerance algorithm (LRFT). It is theoretically proven that both algorithms are able to generate a network with D-region fault tolerance. Simulation results indicate that with the same fault tolerance capabilities, networks based on both GRFT and LRFT algorithms have a lower transmission radius and lower logical degree.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s11432-012-4652-1</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1674-733X
ispartof Science China. Information sciences, 2013-07, Vol.56 (7), p.29-37
issn 1674-733X
1869-1919
language eng
recordid cdi_proquest_miscellaneous_1429861908
source Springer Link
subjects Algorithms
Computer Science
Control algorithms
Control theory
D region
Diameters
Failure
Fault tolerance
Fault tolerant
Information Systems and Communication Service
Military applications
Natural disasters
Network design
Network topologies
Networks
Nodes
Relativity
Research Paper
Topology
Wireless networks
容错算法
容错网络
容错能力
拓扑
控制算法
无线网络
网络连接
节点故障
title A topology control algorithm based on D-region fault tolerance
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T14%3A32%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20topology%20control%20algorithm%20based%20on%20D-region%20fault%20tolerance&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Sun,%20RuoZi&rft.date=2013-07-01&rft.volume=56&rft.issue=7&rft.spage=29&rft.epage=37&rft.pages=29-37&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-012-4652-1&rft_dat=%3Cproquest_cross%3E1429861908%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c375t-293507a732c57f2e4d2e153b11197f57911cc6a63fdf377e8bf212b0afdb20ad3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2918621360&rft_id=info:pmid/&rft_cqvip_id=46374580&rfr_iscdi=true