On the public citation graph

Fault-Tolerant Clustering in Ad Hoc and Sensor Networks

0 signed · 86 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.1006/jagm.1998.0929openalex-snapshot
Fast Distributed Construction of Smallk-Dominating Sets and Applications
inferredcites →https://doi.org/10.1007/978-3-322-80291-0_6openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/bf01200845openalex-snapshot
Multicluster, mobile, multimedia radio network
inferredcites →https://doi.org/10.1007/s00446-002-0078-0openalex-snapshot
An efficient distributed algorithm for constructing small dominating sets
inferredcites →https://doi.org/10.1007/s00446-004-0112-5openalex-snapshot
Constant-time distributed dominating set approximation
inferredcites →https://doi.org/10.1007/s00454-003-2925-6openalex-snapshot
Discrete Mobile Centers
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/s0166-218x(03)00368-8openalex-snapshot
A distributed algorithm to find k-dominating sets
inferredcites →https://doi.org/10.1017/s00446-002-0078-0openalex-snapshot
An efficient distributed algorithm for constructing small dominating sets
inferredcites →https://doi.org/10.1023/a:1013941929408openalex-snapshot
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1023/b:mone.0000013625.87793.13openalex-snapshot
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/infcom.2002.1019411openalex-snapshot
Distributed construction of connected dominating set in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/infocom.2006.295openalex-snapshot
Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks
inferredcites →https://doi.org/10.1109/tcom.1981.1094909openalex-snapshot
The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm
inferredcites →https://doi.org/10.1137/s0097539793260763openalex-snapshot
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
inferredcites →https://doi.org/10.1145/1011767.1011811openalex-snapshot
What cannot be computed locally!
inferredcites →https://doi.org/10.1145/1023720.1023746openalex-snapshot
Initializing newly deployed ad hoc and sensor networks
inferredcites →https://doi.org/10.1145/1073814.1073826openalex-snapshot
On the locality of bounded growth
inferredcites →https://doi.org/10.1145/1109557.1109666openalex-snapshot
The price of being near-sighted
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/313239.313261openalex-snapshot
On calculating connected dominating set for efficient routing in ad hoc wireless networks
inferredcites →https://doi.org/10.1145/378583.378666openalex-snapshot
Discrete mobile centers
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1145/513800.513820openalex-snapshot
Message-optimal connected dominating sets in mobile ad hoc networks
inferredcites →https://doi.org/10.1145/872035.872040openalex-snapshot
Constant-time distributed dominating set approximation
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.2307/2371320openalex-snapshot
The Number of Circles Covering a Set
inferredcites →https://doi.org/10.3929/ethz-a-005092069openalex-snapshot
The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives

What points at this work

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

inferred← citeshttps://doi.org/10.1002/wcm.805openalex-snapshot
Self‐stabilizing minimum connected covers of query regions in sensor networks
inferred← citeshttps://doi.org/10.1007/11945529_15openalex-snapshot
Incremental Construction of k-Dominating Sets in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-1-84800-328-6_2openalex-snapshot
Self-Configuring, Self-Organizing, and Self-Healing Schemes in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-17277-0_11openalex-snapshot
Redundancy as a Measure of Fault-Tolerance for the Internet of Things: A Review
inferred← citeshttps://doi.org/10.1007/978-3-030-39875-0_4openalex-snapshot
Propagating Minimal Messages Using Multi Set-Cover in Wireless Ad-Hoc Network
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_21openalex-snapshot
Algorithms for Minimum m-Connected k-Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_9openalex-snapshot
The Abstract MAC Layer
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_2openalex-snapshot
Local Algorithms: Self-stabilization on Speed
inferred← citeshttps://doi.org/10.1007/978-3-642-14171-3_10openalex-snapshot
DRLC: A New Robust and Dynamically Load Balanced Clustering Scheme for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s00224-010-9303-6openalex-snapshot
Local Approximability of Max-Min and Min-Max Linear Programs
inferred← citeshttps://doi.org/10.1007/s00446-010-0100-xopenalex-snapshot
Fast primal-dual distributed algorithms for scheduling and matching problems
inferred← citeshttps://doi.org/10.1007/s10878-007-9124-yopenalex-snapshot
On minimum m-connected k-dominating set problem in unit disc graphs
inferred← citeshttps://doi.org/10.1007/s11276-014-0819-6openalex-snapshot
An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.03.021openalex-snapshot
Secure and reliable clustering in wireless sensor networks: A critical survey
inferred← citeshttps://doi.org/10.1016/j.jnca.2023.103605openalex-snapshot
Decentralized fault-tolerant controller based on cooperative smart-wireless sensors in large-scale buildings
inferred← citeshttps://doi.org/10.1016/j.protcy.2012.10.081openalex-snapshot
Energy Efficient Target Tracking Mechanism using Rotational Camera Sensor in WMSN
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.035openalex-snapshot
Algorithms for minimum m -connected k -tuple dominating set problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.001openalex-snapshot
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.040openalex-snapshot
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
inferred← citeshttps://doi.org/10.1049/iet-cps.2016.0025openalex-snapshot
Designing CPS/IoT applications for smart buildings and cities
inferred← citeshttps://doi.org/10.1109/codit.2019.8820414openalex-snapshot
Cluster Head Recovery Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2007.222openalex-snapshot
Resource Efficient Survivable Clustering for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2007.230openalex-snapshot
An Agreement-Based Fault Detection Mechanism for Under Water Sensor Networks
inferred← citeshttps://doi.org/10.1109/hicss.2008.170openalex-snapshot
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icc.2008.528openalex-snapshot
An Efficient Fault-Prevention Clustering Protocol for Robust Underwater Sensor Networks
inferred← citeshttps://doi.org/10.1109/icc.2014.6883293openalex-snapshot
CLARET: A Cooperative cLuster-heAd failuRE deTection mechanism for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/icccn.2007.4317831openalex-snapshot
Energy-Efficient Fault-Tolerant Mechanism for Clustered Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icnc.2011.45openalex-snapshot
Fault Tolerant Clustering in Dense Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536235openalex-snapshot
Approximating max-min linear programs with local algorithms
inferred← citeshttps://doi.org/10.1109/iscis.2009.5291806openalex-snapshot
Performance evaluation of cluster-based target tracking protocols for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/isorc.2007.41openalex-snapshot
LSynD: Localized Synopsis Diffusion
inferred← citeshttps://doi.org/10.1109/ngmast.2009.17openalex-snapshot
A Cycle-based Clustering Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/soca.2015.38openalex-snapshot
Supporting Service Adaptation in Fault Tolerant Internet of Things
inferred← citeshttps://doi.org/10.1109/wcica.2008.4593182openalex-snapshot
An energy-efficient routing protocol for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/wd.2016.7461485openalex-snapshot
A clustering algorithm for distributed service registries in heterogeneous wireless networks
inferred← citeshttps://doi.org/10.1109/wf-iot.2015.7389057openalex-snapshot
Device clustering for fault monitoring in Internet of Things systems
inferred← citeshttps://doi.org/10.1109/wicom.2008.902openalex-snapshot
Fault Tolerant Topology Control for Clustered Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/wowmom.2011.5986490openalex-snapshot
New findings on the complexity of cluster head selection algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611973037.4openalex-snapshot
Approximating Fault-Tolerant Domination in General Graphs
inferred← citeshttps://doi.org/10.1142/s1793830909000087openalex-snapshot
MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
inferred← citeshttps://doi.org/10.1145/1810479.1810533openalex-snapshot
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
inferred← citeshttps://doi.org/10.1145/2332432.2332465openalex-snapshot
Lower bounds for local approximation
inferred← citeshttps://doi.org/10.1145/2431211.2431223openalex-snapshot
Survey of local algorithms
inferred← citeshttps://doi.org/10.1145/2528405openalex-snapshot
Lower bounds for local approximation
inferred← citeshttps://doi.org/10.1155/2011/257156openalex-snapshot
Survivable Self-Organization for Prolonged Lifetime in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2014/361543openalex-snapshot
Fault Tolerant Mechanism for Multimedia Flows in Wireless Ad Hoc Networks Based on Fast Switching Paths
inferred← citeshttps://doi.org/10.22215/etd/2008-06271openalex-snapshot
Approximation algorithms for geometric networks
inferred← citeshttps://doi.org/10.2495/978-1-84564-562-5/10openalex-snapshot
Wireless sensor networks for critical infrastructure protection
inferred← citeshttps://doi.org/10.3390/electronics13224334openalex-snapshot
Using DL Models in the Service Layer to Enhance the Fault Tolerance of IoT Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005752807openalex-snapshot
On locality and related problems: Communicating, computing, exploring
inferred← citeshttps://doi.org/10.3929/ethz-b-000379990openalex-snapshot
Robust Global Localization Using GPS and Aircraft Signals
inferred← citeshttps://doi.org/10.48550/arxiv.0806.0282openalex-snapshot
Local approximation algorithms for a class of 0/1 max-min linear programs
inferred← citeshttps://doi.org/10.5120/3578-4948openalex-snapshot
Fault Diagnosis in Wireless Sensor Network using Timed Automata
inferred← citeshttps://doi.org/10.5121/ijcnc.2013.5403openalex-snapshot
Designing Secure Clustering Protocol With The Approach Of Reducing Energy Consumption In Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5220/0004273501330137openalex-snapshot
Fault-tolerant Coverage in Dense Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5815/ijcnis.2017.12.07openalex-snapshot
A Fault-tolerant Improved OLSR Protocol using k-Connected m-Dominating Set
inferred← citeshttps://doi.org/10.7763/ijiee.2012.v2.113openalex-snapshot
Dominating Set & Clustering Based Network Coveragefor Huge Wireless Sensor Networks
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.