An Asynchronous Distributed Algorithm for Minimum s−t Cut Detection in Wireless Multi-hop Networks
Stable communication is a vital and challenging requirement in wireless multi-hop networks because nodes failure may disconnect other active nodes. Minimum s-t cuts can help to measure the reliability of a network regarding the nodes or links failure. A minimum s-t cut is the smallest subset of link...
Gespeichert in:
| Veröffentlicht in: | Ad hoc networks Jg. 101; S. 102092 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
15.04.2020
|
| Schlagworte: | |
| ISSN: | 1570-8705, 1570-8713 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Stable communication is a vital and challenging requirement in wireless multi-hop networks because nodes failure may disconnect other active nodes. Minimum s-t cuts can help to measure the reliability of a network regarding the nodes or links failure. A minimum s-t cut is the smallest subset of links that their failure disconnects all communication paths between nodes s and t. Minimum s-t cuts can also reveal the bottlenecks, bridges, and clusters in the network. This paper proposes an asynchronous distributed algorithm for finding minimum s-t cuts in wireless multi-hop networks. The proposed algorithm iteratively finds link-disjoint paths from s to t and changes the direction of the selected edges to ignore them in the next iteration. After finding all paths, the undiscovered nodes in the last search determine the minimum s-t cut. The comprehensive simulation results on different networks with up to 500 nodes show that the proposed algorithm finds minimum s-t cuts in reasonable time with up to 64% and 39% lower energy consumption than the existing central and distributed algorithms, respectively. |
|---|---|
| AbstractList | Stable communication is a vital and challenging requirement in wireless multi-hop networks because nodes failure may disconnect other active nodes. Minimum s-t cuts can help to measure the reliability of a network regarding the nodes or links failure. A minimum s-t cut is the smallest subset of links that their failure disconnects all communication paths between nodes s and t. Minimum s-t cuts can also reveal the bottlenecks, bridges, and clusters in the network. This paper proposes an asynchronous distributed algorithm for finding minimum s-t cuts in wireless multi-hop networks. The proposed algorithm iteratively finds link-disjoint paths from s to t and changes the direction of the selected edges to ignore them in the next iteration. After finding all paths, the undiscovered nodes in the last search determine the minimum s-t cut. The comprehensive simulation results on different networks with up to 500 nodes show that the proposed algorithm finds minimum s-t cuts in reasonable time with up to 64% and 39% lower energy consumption than the existing central and distributed algorithms, respectively. |
| ArticleNumber | 102092 |
| Author | Akram, Vahid Khalilpour |
| Author_xml | – sequence: 1 givenname: Vahid Khalilpour surname: Akram fullname: Akram, Vahid Khalilpour email: vahid.akram@bakircay.edu.tr organization: Department of Computer Engineering, Izmir Bakircay University, Izmir, Turkey |
| BookMark | eNqFkE1OwzAQRi1UJNrCCdj4AimOHdfOgkXV8ie1sAGxtBLHJi6JXdkOqDdgzRE5CQ1FLFjAakYjvdH3vREYWGcVAKcpmqQonZ6tJ0VVOznBCPcXjHJ8AIYpZSjhLCWDnx3RIzAKYY0QzjFKh6CaWTgLWytr76zrAlyYEL0pu6gqOGuenDexbqF2Hq6MNW3XwvDx9h7hvItwoaKS0TgLjYWPxqtGhQBXXRNNUrsNvFXx1fnncAwOddEEdfI9x-Dh8uJ-fp0s765u5rNlIgkiMWGqynhGeVFpnvNpppAuEEGYlQWlOssR5YimjBFN-ZSoPNOa5JiysmSScF2SMcj3f6V3IXilhTSx6ANGX5hGpEj0usRafOkSvS6x17VjyS92401b-O0_1PmeUrtaL0Z5EaRRVqpqZ0NGUTnzJ_8Jue2IhA |
| CitedBy_id | crossref_primary_10_3390_electronics14142904 crossref_primary_10_1109_TC_2021_3065527 crossref_primary_10_1016_j_comnet_2023_109703 |
| Cites_doi | 10.1007/BF01582226 10.1080/17445760.2012.660694 10.1007/s00224-007-2010-2 10.1145/234533.234534 10.1016/S1389-1286(01)00302-4 10.1016/j.adhoc.2003.09.010 10.1093/comjnl/bxt128 10.23919/JCC.2019.07.015 10.1016/j.neucom.2016.07.056 10.1016/j.comnet.2013.06.003 10.1155/2013/867903 10.3390/s130708786 10.1016/j.jnca.2018.10.009 10.1145/263867.263872 10.1007/s11263-012-0571-2 10.1006/jagm.1994.1043 10.1109/TPDS.2011.178 10.1145/48014.61051 10.1109/JIOT.2016.2613111 10.1016/j.adhoc.2015.08.026 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.adhoc.2020.102092 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1570-8713 |
| ExternalDocumentID | 10_1016_j_adhoc_2020_102092 S1570870519308376 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABJNI ABMAC ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 EBS EFJIC EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SDP SES SPC SPCBC SST SSV SSZ T5K ~G- 9DU AATTM AAXKI AAYWO AAYXX ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG EJD HZ~ SEW UHS ~HD |
| ID | FETCH-LOGICAL-c303t-7ed48458adf89864e0fa03027ba55f49058051773f5863e94ff39257bb7c38fb3 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000527928800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1570-8705 |
| IngestDate | Tue Nov 18 22:18:51 EST 2025 Sat Nov 29 07:02:25 EST 2025 Tue Jul 16 04:31:28 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Minimum s-t Cut Asynchronous Distributed Algorithms Cut Edge Wireless Multi-hop Networks Fault Tolerance |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c303t-7ed48458adf89864e0fa03027ba55f49058051773f5863e94ff39257bb7c38fb3 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_adhoc_2020_102092 crossref_primary_10_1016_j_adhoc_2020_102092 elsevier_sciencedirect_doi_10_1016_j_adhoc_2020_102092 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-04-15 |
| PublicationDateYYYYMMDD | 2020-04-15 |
| PublicationDate_xml | – month: 04 year: 2020 text: 2020-04-15 day: 15 |
| PublicationDecade | 2020 |
| PublicationTitle | Ad hoc networks |
| PublicationYear | 2020 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Goldberg, Tarjan (bib0012) 1988; 35 Hao, Orlin (bib0004) 1994; 17 Edmonds, Karp (bib0003) 2003 Ford, Fulkerson (bib0011) 2009 Zhang, Xiao, Tan (bib0032) 2013; 57 M. Inc, Xm2110cb iris datasheet Stoer, Wagner (bib0006) 1997; 44 Karger, Stein (bib0008) 1996; 43 Su (bib0017) 2014 Dantzig, Fulkerson (bib0010) 2003; 38 Akyildiz, Su, Sankarasubramaniam, Cayirci (bib0001) 2002; 38 Akram, Dagdeviren (bib0021) 2013; 13 Jiang, Li, Lv (bib0030) 2017; 220 Nagamochi, Ono, Ibaraki (bib0005) 1994; 67 Yildiz, Bicakci, Tavli, Gultekin, Incebacak (bib0002) 2016; 37 Milic, Malek (bib0024) 2007 Dagdeviren, Akram (bib0026) 2013; 9 Brinkmeier (bib0007) 2007; 41 Wang, Jiang, Qi (bib0029) 2019; 16 Turau (bib0025) 2006 Dagdeviren, Akram (bib0023) 2014; 57 Nanongkai, Su (bib0016) 2014 Benczúr, Karger (bib0009) 1996 Barooah (bib0020) 2008 Milic, Milanovic, Malek (bib0022) 2005 . Delong, Boykov (bib0014) 2008 Jiang, Wang, Shi, Song (bib0033) 2018 Shekhovtsov, Hlaváč (bib0013) 2013; 104 Dagdeviren, Akram, Farzan (bib0027) 2019; 127 Won, Stoleru (bib0018) 2013; 28 Ghaffari, Kuhn (bib0015) 2013 Barooah, Chenji, Stoleru, Kalmar-Nagy (bib0019) 2012; 23 Akkaya, Younis (bib0028) 2005; 3 Jiang, Zhang, Lv, Song (bib0031) 2016; 3 Barooah (10.1016/j.adhoc.2020.102092_bib0019) 2012; 23 Milic (10.1016/j.adhoc.2020.102092_sbref0022) 2005 Akkaya (10.1016/j.adhoc.2020.102092_bib0028) 2005; 3 Hao (10.1016/j.adhoc.2020.102092_bib0004) 1994; 17 Ghaffari (10.1016/j.adhoc.2020.102092_bib0015) 2013 Karger (10.1016/j.adhoc.2020.102092_bib0008) 1996; 43 Delong (10.1016/j.adhoc.2020.102092_bib0014) 2008 Dagdeviren (10.1016/j.adhoc.2020.102092_bib0023) 2014; 57 Barooah (10.1016/j.adhoc.2020.102092_bib0020) 2008 Brinkmeier (10.1016/j.adhoc.2020.102092_bib0007) 2007; 41 Dagdeviren (10.1016/j.adhoc.2020.102092_bib0027) 2019; 127 Nagamochi (10.1016/j.adhoc.2020.102092_bib0005) 1994; 67 Akram (10.1016/j.adhoc.2020.102092_bib0021) 2013; 13 Akyildiz (10.1016/j.adhoc.2020.102092_bib0001) 2002; 38 Shekhovtsov (10.1016/j.adhoc.2020.102092_bib0013) 2013; 104 Nanongkai (10.1016/j.adhoc.2020.102092_bib0016) 2014 Won (10.1016/j.adhoc.2020.102092_bib0018) 2013; 28 Zhang (10.1016/j.adhoc.2020.102092_bib0032) 2013; 57 Turau (10.1016/j.adhoc.2020.102092_bib0025) 2006 Dagdeviren (10.1016/j.adhoc.2020.102092_bib0026) 2013; 9 Dantzig (10.1016/j.adhoc.2020.102092_bib0010) 2003; 38 Jiang (10.1016/j.adhoc.2020.102092_bib0033) 2018 Edmonds (10.1016/j.adhoc.2020.102092_bib0003) 2003 Goldberg (10.1016/j.adhoc.2020.102092_bib0012) 1988; 35 Milic (10.1016/j.adhoc.2020.102092_bib0024) 2007 Jiang (10.1016/j.adhoc.2020.102092_bib0031) 2016; 3 Wang (10.1016/j.adhoc.2020.102092_bib0029) 2019; 16 10.1016/j.adhoc.2020.102092_bib0034 Su (10.1016/j.adhoc.2020.102092_bib0017) 2014 Stoer (10.1016/j.adhoc.2020.102092_bib0006) 1997; 44 Ford (10.1016/j.adhoc.2020.102092_bib0011) 2009 Jiang (10.1016/j.adhoc.2020.102092_bib0030) 2017; 220 Yildiz (10.1016/j.adhoc.2020.102092_bib0002) 2016; 37 Benczúr (10.1016/j.adhoc.2020.102092_bib0009) 1996 |
| References_xml | – volume: 43 start-page: 601 year: 1996 end-page: 640 ident: bib0008 article-title: A new approach to the minimum cut problem publication-title: Journal of the ACM (JACM) – year: 2005 ident: bib0022 article-title: Prediction of partitioning in location-aware mobile ad hoc networks publication-title: Proceedings of the 38th Annual Hawaii International Conference on System Sciences – year: 2014 ident: bib0017 article-title: A distributed minimum cut approximation scheme publication-title: arXiv preprint arXiv:1401.5316 – volume: 44 start-page: 585 year: 1997 end-page: 591 ident: bib0006 article-title: A simple min-cut algorithm publication-title: Journal of the ACM (JACM) – start-page: 439 year: 2014 end-page: 453 ident: bib0016 article-title: Almost-tight distributed minimum cut algorithms publication-title: Int. Symp on Distributed Computing – start-page: 243 year: 2009 end-page: 248 ident: bib0011 article-title: Maximal flow through a network publication-title: Classic papers in combinatorics – start-page: 47 year: 1996 end-page: 55 ident: bib0009 article-title: Approximating st minimum cuts in õ (n 2) time publication-title: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing – start-page: 377 year: 2007 end-page: 386 ident: bib0024 article-title: Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks publication-title: Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems – volume: 35 start-page: 921 year: 1988 end-page: 940 ident: bib0012 article-title: A new approach to the maximum-flow problem publication-title: Journal of the ACM (JACM) – volume: 127 start-page: 70 year: 2019 end-page: 81 ident: bib0027 article-title: A distributed evolutionary algorithm for detecting minimum vertex cuts for wireless ad hoc and sensor networks publication-title: Journal of Network and Computer Applications – volume: 3 start-page: 1437 year: 2016 end-page: 1447 ident: bib0031 article-title: Energy-efficient multi-constraint routing algorithm with load balancing for smart city applications publication-title: IEEE Internet of Things Journal – volume: 16 start-page: 195 year: 2019 end-page: 206 ident: bib0029 article-title: An adaptive routing algorithm for integrated information networks publication-title: China Communications – volume: 38 start-page: 225 year: 2003 end-page: 231 ident: bib0010 article-title: On the max flow min cut theorem of networks publication-title: Linear inequalities and related systems – volume: 38 start-page: 393 year: 2002 end-page: 422 ident: bib0001 article-title: Wireless sensor networks: a survey publication-title: Computer networks – volume: 104 start-page: 315 year: 2013 end-page: 342 ident: bib0013 article-title: A distributed mincut/maxflow algorithm combining path augmentation and push-relabel publication-title: International journal of computer vision – volume: 57 start-page: 1852 year: 2014 end-page: 1869 ident: bib0023 article-title: An energy-efficient distributed cut vertex detection algorithm for wireless sensor networks publication-title: The Computer Journal – start-page: 164 year: 2006 end-page: 175 ident: bib0025 article-title: Computing bridges, articulations, and 2-connected components in wireless sensor networks publication-title: International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics – volume: 41 start-page: 369 year: 2007 end-page: 380 ident: bib0007 article-title: A simple and fast min-cut algorithm publication-title: Theory of Computing Systems – start-page: 1097 year: 2008 end-page: 1102 ident: bib0020 article-title: Distributed cut detection in sensor networks publication-title: Decision and Control, 2008. CDC 2008. 47th IEEE Conference on – volume: 17 start-page: 424 year: 1994 end-page: 446 ident: bib0004 article-title: A faster algorithm for finding the minimum cut in a directed graph publication-title: Journal of Algorithms – volume: 67 start-page: 325 year: 1994 end-page: 341 ident: bib0005 article-title: Implementing an efficient minimum capacity cut algorithm publication-title: Mathematical Programming – start-page: 1 year: 2008 end-page: 8 ident: bib0014 article-title: A scalable graph-cut algorithm for nd grids publication-title: Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on – start-page: 1 year: 2013 end-page: 15 ident: bib0015 article-title: Distributed minimum cut approximation publication-title: International Symposium on Distributed Computing – volume: 28 start-page: 266 year: 2013 end-page: 288 ident: bib0018 article-title: A destination-based approach for cut detection in wireless sensor networks publication-title: International Journal of Parallel, Emergent and Distributed Systems – reference: . – volume: 220 start-page: 160 year: 2017 end-page: 169 ident: bib0030 article-title: An energy-efficient cooperative multicast routing in multi-hop wireless networks for smart medical applications publication-title: Neurocomputing – reference: M. Inc, Xm2110cb iris datasheet, – volume: 13 start-page: 8786 year: 2013 end-page: 8813 ident: bib0021 article-title: Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks publication-title: Sensors – volume: 3 start-page: 325 year: 2005 end-page: 349 ident: bib0028 article-title: A survey on routing protocols for wireless sensor networks publication-title: Ad hoc networks – volume: 9 start-page: 867903 year: 2013 ident: bib0026 article-title: Energy-efficient bridge detection algorithms for wireless sensor networks publication-title: International Journal of Distributed Sensor Networks – volume: 57 start-page: 2689 year: 2013 end-page: 2704 ident: bib0032 article-title: Clustering algorithms for maximizing the lifetime of wireless sensor networks with energy-harvesting sensors publication-title: Computer Networks – start-page: 31 year: 2003 end-page: 33 ident: bib0003 article-title: Theoretical improvements in algorithmic efficiency for network flow problems publication-title: Combinatorial Optimization Eureka, You Shrink! – volume: 23 start-page: 483 year: 2012 end-page: 490 ident: bib0019 article-title: Cut detection in wireless sensor networks publication-title: IEEE transactions on parallel and distributed systems – volume: 37 start-page: 301 year: 2016 end-page: 323 ident: bib0002 article-title: Maximizing wireless sensor network lifetime by communication/computation energy optimization of non-repudiation security service: Node level versus network level strategies publication-title: Ad Hoc Networks – year: 2018 ident: bib0033 article-title: A compressive sensing-based approach to end-to-end network traffic reconstruction publication-title: IEEE Transactions on Network Science and Engineering – volume: 67 start-page: 325 year: 1994 ident: 10.1016/j.adhoc.2020.102092_bib0005 article-title: Implementing an efficient minimum capacity cut algorithm publication-title: Mathematical Programming doi: 10.1007/BF01582226 – volume: 28 start-page: 266 issue: 3 year: 2013 ident: 10.1016/j.adhoc.2020.102092_bib0018 article-title: A destination-based approach for cut detection in wireless sensor networks publication-title: International Journal of Parallel, Emergent and Distributed Systems doi: 10.1080/17445760.2012.660694 – volume: 41 start-page: 369 issue: 2 year: 2007 ident: 10.1016/j.adhoc.2020.102092_bib0007 article-title: A simple and fast min-cut algorithm publication-title: Theory of Computing Systems doi: 10.1007/s00224-007-2010-2 – volume: 43 start-page: 601 issue: 4 year: 1996 ident: 10.1016/j.adhoc.2020.102092_bib0008 article-title: A new approach to the minimum cut problem publication-title: Journal of the ACM (JACM) doi: 10.1145/234533.234534 – volume: 38 start-page: 393 issue: 4 year: 2002 ident: 10.1016/j.adhoc.2020.102092_bib0001 article-title: Wireless sensor networks: a survey publication-title: Computer networks doi: 10.1016/S1389-1286(01)00302-4 – volume: 3 start-page: 325 issue: 3 year: 2005 ident: 10.1016/j.adhoc.2020.102092_bib0028 article-title: A survey on routing protocols for wireless sensor networks publication-title: Ad hoc networks doi: 10.1016/j.adhoc.2003.09.010 – volume: 57 start-page: 1852 issue: 12 year: 2014 ident: 10.1016/j.adhoc.2020.102092_bib0023 article-title: An energy-efficient distributed cut vertex detection algorithm for wireless sensor networks publication-title: The Computer Journal doi: 10.1093/comjnl/bxt128 – start-page: 31 year: 2003 ident: 10.1016/j.adhoc.2020.102092_bib0003 article-title: Theoretical improvements in algorithmic efficiency for network flow problems – volume: 16 start-page: 195 issue: 7 year: 2019 ident: 10.1016/j.adhoc.2020.102092_bib0029 article-title: An adaptive routing algorithm for integrated information networks publication-title: China Communications doi: 10.23919/JCC.2019.07.015 – volume: 220 start-page: 160 year: 2017 ident: 10.1016/j.adhoc.2020.102092_bib0030 article-title: An energy-efficient cooperative multicast routing in multi-hop wireless networks for smart medical applications publication-title: Neurocomputing doi: 10.1016/j.neucom.2016.07.056 – volume: 38 start-page: 225 year: 2003 ident: 10.1016/j.adhoc.2020.102092_bib0010 article-title: On the max flow min cut theorem of networks publication-title: Linear inequalities and related systems – start-page: 47 year: 1996 ident: 10.1016/j.adhoc.2020.102092_bib0009 article-title: Approximating st minimum cuts in õ (n 2) time – start-page: 377 year: 2007 ident: 10.1016/j.adhoc.2020.102092_bib0024 article-title: Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks – year: 2005 ident: 10.1016/j.adhoc.2020.102092_sbref0022 article-title: Prediction of partitioning in location-aware mobile ad hoc networks – volume: 57 start-page: 2689 issue: 14 year: 2013 ident: 10.1016/j.adhoc.2020.102092_bib0032 article-title: Clustering algorithms for maximizing the lifetime of wireless sensor networks with energy-harvesting sensors publication-title: Computer Networks doi: 10.1016/j.comnet.2013.06.003 – start-page: 1 year: 2013 ident: 10.1016/j.adhoc.2020.102092_bib0015 article-title: Distributed minimum cut approximation – start-page: 1097 year: 2008 ident: 10.1016/j.adhoc.2020.102092_bib0020 article-title: Distributed cut detection in sensor networks – start-page: 243 year: 2009 ident: 10.1016/j.adhoc.2020.102092_bib0011 article-title: Maximal flow through a network – start-page: 439 year: 2014 ident: 10.1016/j.adhoc.2020.102092_bib0016 article-title: Almost-tight distributed minimum cut algorithms – volume: 9 start-page: 867903 issue: 4 year: 2013 ident: 10.1016/j.adhoc.2020.102092_bib0026 article-title: Energy-efficient bridge detection algorithms for wireless sensor networks publication-title: International Journal of Distributed Sensor Networks doi: 10.1155/2013/867903 – year: 2014 ident: 10.1016/j.adhoc.2020.102092_bib0017 article-title: A distributed minimum cut approximation scheme publication-title: arXiv preprint arXiv:1401.5316 – volume: 13 start-page: 8786 issue: 7 year: 2013 ident: 10.1016/j.adhoc.2020.102092_bib0021 article-title: Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks publication-title: Sensors doi: 10.3390/s130708786 – ident: 10.1016/j.adhoc.2020.102092_bib0034 – volume: 127 start-page: 70 year: 2019 ident: 10.1016/j.adhoc.2020.102092_bib0027 article-title: A distributed evolutionary algorithm for detecting minimum vertex cuts for wireless ad hoc and sensor networks publication-title: Journal of Network and Computer Applications doi: 10.1016/j.jnca.2018.10.009 – year: 2018 ident: 10.1016/j.adhoc.2020.102092_bib0033 article-title: A compressive sensing-based approach to end-to-end network traffic reconstruction publication-title: IEEE Transactions on Network Science and Engineering – volume: 44 start-page: 585 issue: 4 year: 1997 ident: 10.1016/j.adhoc.2020.102092_bib0006 article-title: A simple min-cut algorithm publication-title: Journal of the ACM (JACM) doi: 10.1145/263867.263872 – volume: 104 start-page: 315 issue: 3 year: 2013 ident: 10.1016/j.adhoc.2020.102092_bib0013 article-title: A distributed mincut/maxflow algorithm combining path augmentation and push-relabel publication-title: International journal of computer vision doi: 10.1007/s11263-012-0571-2 – volume: 17 start-page: 424 issue: 3 year: 1994 ident: 10.1016/j.adhoc.2020.102092_bib0004 article-title: A faster algorithm for finding the minimum cut in a directed graph publication-title: Journal of Algorithms doi: 10.1006/jagm.1994.1043 – volume: 23 start-page: 483 issue: 3 year: 2012 ident: 10.1016/j.adhoc.2020.102092_bib0019 article-title: Cut detection in wireless sensor networks publication-title: IEEE transactions on parallel and distributed systems doi: 10.1109/TPDS.2011.178 – volume: 35 start-page: 921 issue: 4 year: 1988 ident: 10.1016/j.adhoc.2020.102092_bib0012 article-title: A new approach to the maximum-flow problem publication-title: Journal of the ACM (JACM) doi: 10.1145/48014.61051 – start-page: 164 year: 2006 ident: 10.1016/j.adhoc.2020.102092_bib0025 article-title: Computing bridges, articulations, and 2-connected components in wireless sensor networks – volume: 3 start-page: 1437 issue: 6 year: 2016 ident: 10.1016/j.adhoc.2020.102092_bib0031 article-title: Energy-efficient multi-constraint routing algorithm with load balancing for smart city applications publication-title: IEEE Internet of Things Journal doi: 10.1109/JIOT.2016.2613111 – volume: 37 start-page: 301 year: 2016 ident: 10.1016/j.adhoc.2020.102092_bib0002 article-title: Maximizing wireless sensor network lifetime by communication/computation energy optimization of non-repudiation security service: Node level versus network level strategies publication-title: Ad Hoc Networks doi: 10.1016/j.adhoc.2015.08.026 – start-page: 1 year: 2008 ident: 10.1016/j.adhoc.2020.102092_bib0014 article-title: A scalable graph-cut algorithm for nd grids |
| SSID | ssj0029201 |
| Score | 2.278595 |
| Snippet | Stable communication is a vital and challenging requirement in wireless multi-hop networks because nodes failure may disconnect other active nodes. Minimum s-t... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 102092 |
| SubjectTerms | Asynchronous Distributed Algorithms Cut Edge Fault Tolerance Minimum s-t Cut Wireless Multi-hop Networks |
| Title | An Asynchronous Distributed Algorithm for Minimum s−t Cut Detection in Wireless Multi-hop Networks |
| URI | https://dx.doi.org/10.1016/j.adhoc.2020.102092 |
| Volume | 101 |
| WOSCitedRecordID | wos000527928800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1570-8713 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0029201 issn: 1570-8705 databaseCode: AIEXJ dateStart: 20030701 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWg5QAHxKcoBeQDnJZU3iSO7WNUivgQFRIF7S1KnLhJ2fWuNtmq_APO_ER-CTNxEiIWVYDEJYq8sZ2dZ01enJk3hDydZiwy03DqpYEWXpjLwFM6izztcym0ZkZq1habEMfHcjZT77syd3VbTkBYKy8u1Oq_Qg1tADamzv4F3MOg0ADnADocAXY4_hHwsQWbf7EaVW8xvvUFSuNiVSuglvH8dLmumnLRRhe-q2y12CwmdRvxIJ8pv5kcbhrwQU2h-yBIDI-doztsU3W9crnCJGEM56rHxDbOJ-VST-z4J1xHn9duxX1KyyqfvC2B9s9X8DfGuw0-hn56Lt_SbYFtpcE4rykYuFXmrivGbS7RdHC1buNiy227HYSzgzSHWz3AeVFSgrkqeb_oYX_AkXEyoJ7AH0V0lez6givwyrvx66PZm-F9W_nMyeV2d9eLTrXhfVtT_Z6YjMjGyS1ys3tLoLFD9za5Utg75MZIO_IuyWNLxzjTEc50wJkCzrTDmdbfv35rKCBMB4RpZWmPMB0Qpj3C98jHl0cnh6-8rmSGp4GLNJ4o8lCGXKa5kSi8XzCTMvw0naWcm1AxLlGUTQSGyygoVGgMEGQuskzoQJosuE927NIWDwgVyuQZT7Ocw5hMZSqFp0Gk81REClUT94jf2yvRnZ48ljWZJ33g4FnSGjlBIyfOyHvk-dBp5eRULr886oFIOkbomF4CK-eyjg__teM-uf5z2T8iO816Uzwm1_R5U9XrJ90K-wEnXYW5 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Asynchronous+Distributed+Algorithm+for+Minimum+s%E2%88%92t+Cut+Detection+in+Wireless+Multi-hop+Networks&rft.jtitle=Ad+hoc+networks&rft.au=Akram%2C+Vahid+Khalilpour&rft.date=2020-04-15&rft.pub=Elsevier+B.V&rft.issn=1570-8705&rft.eissn=1570-8713&rft.volume=101&rft_id=info:doi/10.1016%2Fj.adhoc.2020.102092&rft.externalDocID=S1570870519308376 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1570-8705&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1570-8705&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1570-8705&client=summon |