On the public citation graph

DECK: A distributed, asynchronous and exact k-connectivity detection algorithm for Wireless Sensor Networks

0 signed · 83 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/wcm.887openalex-snapshot
Coverage and connectivity guaranteed topology control algorithm for cluster‐based wireless sensor networks
inferredcites →https://doi.org/10.1006/jagm.1999.1055openalex-snapshot
Computing Vertex Connectivity: New Bounds from Old Techniques
inferredcites →https://doi.org/10.1007/978-3-540-69384-0_57openalex-snapshot
Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/978-3-642-00312-7_3openalex-snapshot
Mobile Wireless Sensor Network Connectivity Repair with K-Redundancy
inferredcites →https://doi.org/10.1007/978-81-322-2517-1_69openalex-snapshot
Genetic Algorithm for k-Connected Relay Node Placement in Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/978-81-322-2523-2openalex-snapshot
Proceedings of the Second International Conference on Computer and Communication Technologies
inferredcites →https://doi.org/10.1007/s10878-005-6858-2openalex-snapshot
Power Assignment for k-Connectivity in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1007/s10878-015-9845-2openalex-snapshot
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
inferredcites →https://doi.org/10.1007/s11276-005-1765-0openalex-snapshot
Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks
inferredcites →https://doi.org/10.1007/s11276-009-0179-9openalex-snapshot
Connectivity properties of large-scale sensor networks
inferredcites →https://doi.org/10.1016/j.adhoc.2004.03.001openalex-snapshot
Connectivity maintenance and coverage preservation in wireless sensor networks
inferredcites →https://doi.org/10.1016/j.adhoc.2007.05.003openalex-snapshot
Strategies and techniques for node placement in wireless sensor networks: A survey
inferredcites →https://doi.org/10.1016/j.adhoc.2008.03.008openalex-snapshot
On construction of minimum energy k-fault resistant topologies
inferredcites →https://doi.org/10.1016/j.adhoc.2016.02.018openalex-snapshot
An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks
inferredcites →https://doi.org/10.1016/j.comcom.2007.05.028openalex-snapshot
Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks
inferredcites →https://doi.org/10.1016/j.comcom.2010.08.011openalex-snapshot
Multi-objective K-connected Deployment and Power Assignment in WSNs using a problem-specific constrained evolutionary algorithm based on decomposition
inferredcites →https://doi.org/10.1016/j.comcom.2015.07.022openalex-snapshot
Exploiting skeletonization to restore connectivity in a wireless sensor network
inferredcites →https://doi.org/10.1016/j.comcom.2016.06.003openalex-snapshot
Deployment strategies in the wireless sensor network: A comprehensive review
inferredcites →https://doi.org/10.1016/j.comnet.2013.08.021openalex-snapshot
Topology management techniques for tolerating node failures in wireless sensor networks: A survey
inferredcites →https://doi.org/10.1016/j.jnca.2011.03.022openalex-snapshot
Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks
inferredcites →https://doi.org/10.1016/j.jnca.2011.12.002openalex-snapshot
Localized motion-based connectivity restoration algorithms for wireless sensor and actor networks
inferredcites →https://doi.org/10.1016/j.jnca.2013.09.002openalex-snapshot
Localization-free and energy-efficient hole bypassing techniques for fault-tolerant sensor networks
inferredcites →https://doi.org/10.1016/j.orl.2014.12.014openalex-snapshot
Topological optimization of reliable networks under dependent failures
inferredcites →https://doi.org/10.1093/comjnl/bxt128openalex-snapshot
An Energy-Efficient Distributed Cut Vertex Detection Algorithm for Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/cdc18905.2014openalex-snapshot
53rd IEEE Conference on Decision and Control
inferredcites →https://doi.org/10.1109/euc.2011.29openalex-snapshot
Destination-Based Cut Detection in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/globecom10443.2007openalex-snapshot
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference
inferredcites →https://doi.org/10.1109/glocom.2007.249openalex-snapshot
Minimum Node Degree and k-Connectivity of a Wireless Multihop Network in Bounded Area
inferredcites →https://doi.org/10.1109/icc.2009.5199257openalex-snapshot
On the Minimum k-Connectivity Repair in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/icccn.2007.4317793openalex-snapshot
Localized detection of k-connectivity in wireless ad hoc, actuator and sensor networks
inferredcites →https://doi.org/10.1109/infcom.2005.1497915openalex-snapshot
On the critical total power for asymptotic k-connectivity in wireless networks
inferredcites →https://doi.org/10.1109/isit.2014.6874832openalex-snapshot
Minimum node degree and k-connectivity in wireless networks with unreliable links
inferredcites →https://doi.org/10.1109/isit.2014.6875260openalex-snapshot
On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution scheme
inferredcites →https://doi.org/10.1109/isit19248.2014openalex-snapshot
2014 IEEE International Symposium on Information Theory
inferredcites →https://doi.org/10.1109/jproc.2013.2257631openalex-snapshot
A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues
inferredcites →https://doi.org/10.1109/sahcn.2004.1381952openalex-snapshot
On connectivity properties of large-scale sensor networks
inferredcites →https://doi.org/10.1109/sas.2015.7133609openalex-snapshot
The impact of elimination of the most critical node on Wireless Sensor Network lifetime
inferredcites →https://doi.org/10.1109/sose.2013.11openalex-snapshot
On the k-Connectivity of Ad-Hoc Wireless Networks
inferredcites →https://doi.org/10.1109/tnet.2010.2040191openalex-snapshot
Optimal Deployment Patterns for Full Coverage and $k$-Connectivity $(k \leq 6)$ Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tpds.2010.102openalex-snapshot
On “Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks”
inferredcites →https://doi.org/10.1109/tpds.2014.2316142openalex-snapshot
A Distributed Fault-Tolerant Topology Control Algorithm for Heterogeneous Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/wons.2012.6152244openalex-snapshot
DKM: Distributed k-connectivity maintenance in Wireless Sensor Networks
inferredcites →https://doi.org/10.1137/0204034openalex-snapshot
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/1.9781611973761.1openalex-snapshot
On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs
inferredcites →https://doi.org/10.1145/1023720.1023747openalex-snapshot
FLSS
inferredcites →https://doi.org/10.1145/115992.115998openalex-snapshot
Finding disjoint paths in networks
inferredcites →https://doi.org/10.1145/115994.115998openalex-snapshot
Finding disjoint paths in networks
inferredcites →https://doi.org/10.1145/1374618openalex-snapshot
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
inferredcites →https://doi.org/10.1145/1374618.1374672openalex-snapshot
Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks
inferredcites →https://doi.org/10.1145/2484239openalex-snapshot
Proceedings of the 2013 ACM symposium on Principles of distributed computing
inferredcites →https://doi.org/10.1145/2611462.2611491openalex-snapshot
Distributed connectivity decomposition
inferredcites →https://doi.org/10.1145/989459openalex-snapshot
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
inferredcites →https://doi.org/10.1145/989459.989461openalex-snapshot
Asymptotic critical transmission radius and critical neighbor number for k -connectivity in wireless ad hoc networks
inferredcites →https://doi.org/10.1155/2014/258959openalex-snapshot
DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee
inferredcites →https://doi.org/10.1209/0295-5075/103/28006openalex-snapshot
k-connectivity for confined random networks
inferredcites →https://doi.org/10.5121/jgraphoc.2010.2301openalex-snapshot
On the Probability of K-Connectivity in Wireless Ad Hoc Networks Under Different Mobility Models

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-40305-8_21openalex-snapshot
Detection and Tracking of Mobile Intruder in Harsh Geographical Terrains Using Surveillance Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-79357-9_37openalex-snapshot
Analysis of Movement-Based Connectivity Restoration Problem in Wireless Ad-Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.10.001openalex-snapshot
A distributed and asynchronous approach for optimizing weighted graph matchings in wireless network services
inferred← citeshttps://doi.org/10.1016/j.ijin.2023.08.005openalex-snapshot
Priority based k -coverage hole restoration and m -connectivity using whale optimization scheme for underwater wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2018.10.009openalex-snapshot
A Distributed Evolutionary algorithm for detecting minimum vertex cuts for wireless ad hoc and sensor networks
inferred← citeshttps://doi.org/10.1109/blackseacom.2018.8433713openalex-snapshot
On Hardness of Connectivity Maintenance Problem in Drone Networks
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00022openalex-snapshot
Partition Detection in Byzantine Networks
inferred← citeshttps://doi.org/10.1109/isncc.2019.8909162openalex-snapshot
The Effect of Random Node Distribution and Transmission Ranges on Connectivity Robustness in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/jiot.2022.3188558openalex-snapshot
On the Tradeoff Between Network Lifetime and k-Connectivity-Based Reliability in UWSNs
inferred← citeshttps://doi.org/10.1109/jiot.2025.3603829openalex-snapshot
Mitigating Energy Cost of Connection Reliability in UWSNs Through Nonuniform k -Connectivity
inferred← citeshttps://doi.org/10.1109/mnet.124.2100767openalex-snapshot
k-Connectivity in Wireless Sensor Networks: Overview and Future Research Directions
inferred← citeshttps://doi.org/10.1109/nmitcon58196.2023.10276106openalex-snapshot
DCBD: An Efficient Design of Dynamic Compromise Black Hole Attack Detection (DCBD) in WSN
inferred← citeshttps://doi.org/10.1109/siu.2019.8806508openalex-snapshot
Experimental Evaluation of Synchronous Distributed Dominating Set Algorithms
inferred← citeshttps://doi.org/10.1109/siu49456.2020.9302076openalex-snapshot
Localized Identification of Malicious Nodes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/siu49456.2020.9302117openalex-snapshot
Holistic Analysis of Reliability and Lifetime Tradeoff in Sensor Networks
inferred← citeshttps://doi.org/10.1109/telfor.2018.8611852openalex-snapshot
Analysis of the Tradeoff Between Network Lifetime and $\mathbf{k}$-Connectivity in WSNs
inferred← citeshttps://doi.org/10.1109/tnet.2021.3104356openalex-snapshot
A Coverage-Aware Distributed k -Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks
inferred← citeshttps://doi.org/10.1109/tr.2020.2970268openalex-snapshot
Distributed $k$-Connectivity Restoration for Fault Tolerant Wireless Sensor and Actuator Networks: Algorithm Design and Experimental Evaluations
inferred← citeshttps://doi.org/10.1109/wispnet51692.2021.9419391openalex-snapshot
Deployment of Sensor Nodes for Connectivity Restoration and Coverage Maximization in WSNs
inferred← citeshttps://doi.org/10.15439/2021f102openalex-snapshot
Connectivity Maintenance in IoT-based Mobile Networks: Approaches and Challenges
inferred← citeshttps://doi.org/10.15439/978-83-959183-9-1openalex-snapshot
Position and Communication Papers of the 16th Conference on Computer Science and Intelligence Systems
inferred← citeshttps://doi.org/10.23919/cnsm50824.2020.9269062openalex-snapshot
A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation
inferred← citeshttps://doi.org/10.3390/s21196418openalex-snapshot
PINC: Pickup Non-Critical Node Based k-Connectivity Restoration in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4018/978-1-7998-4186-9.ch006openalex-snapshot
Connectivity Estimation Approaches for Internet of Things-Enabled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2104.02783openalex-snapshot
A Coverage-Aware Distributed k-Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks
inferred← citeshttps://doi.org/10.5815/ijcnis.2021.06.04openalex-snapshot
A Node Confident based IDS to Avoid Packet Drop Attacks for Wireless Sensor Network
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.