On the public citation graph
Random Scheduling for Wireless Sensor Networks
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11422778_77openalex-snapshot
Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/978-1-4020-7884-2_1openalex-snapshot
Sensor Networks: A Bridge to the Physical World
inferredcites →https://doi.org/10.1016/j.adhoc.2007.10.003openalex-snapshot
Location-unaware coverage in wireless sensor networks
inferredcites →https://doi.org/10.1016/s1389-1286(01)00302-4openalex-snapshot
Wireless sensor networks: a survey
inferredcites →https://doi.org/10.1109/icc.2001.936985openalex-snapshot
Power efficient organization of wireless sensor networks
inferredcites →https://doi.org/10.1109/icc.2004.1313228openalex-snapshot
Grid-based approach for working node selection in wireless sensor networks
inferredcites →https://doi.org/10.1109/icdcs.2003.1203449openalex-snapshot
PEAS: a robust energy conserving protocol for long-lived sensor networks
inferredcites →https://doi.org/10.1109/icnp.2002.1181406openalex-snapshot
PEAS: a robust energy conserving protocol for long-lived sensor networks
inferredcites →https://doi.org/10.1109/infcom.2007.284openalex-snapshot
Randomized k-Coverage Algorithms For Dense Sensor Networks
inferredcites →https://doi.org/10.1109/mahss.2004.1392188openalex-snapshot
A study of the coverage of large-scale sensor networks
inferredcites →https://doi.org/10.1109/sahcn.2004.1381939openalex-snapshot
Coverage preserving redundancy elimination in sensor networks
inferredcites →https://doi.org/10.1109/sahcn.2006.288437openalex-snapshot
Sacrificing a Little Coverage Can Substantially Increase Network Lifetime
inferredcites →https://doi.org/10.1109/sahcn.2007.4292830openalex-snapshot
Coverage Protocol for Wireless Sensor Networks Using Distance Estimates
inferredcites →https://doi.org/10.1109/tnet.2005.863478openalex-snapshot
Connected sensor cover: self-organization of sensor networks for efficient query execution
inferredcites →https://doi.org/10.1145/1023720.1023735openalex-snapshot
On k-coverage in a mostly sleeping sensor network
inferredcites →https://doi.org/10.1145/570738.570744openalex-snapshot
A coverage-preserving node scheduling scheme for large wireless sensor networks
inferredcites →https://doi.org/10.1145/958491.958496openalex-snapshot
Integrated coverage and connectivity configuration in wireless sensor networks
inferredcites →https://doi.org/10.1145/958491.958498openalex-snapshot
Differentiated surveillance for sensor networks
inferredcites →https://doi.org/10.1145/984622.984684openalex-snapshot
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
inferredcites →https://doi.org/10.1145/989459.989475openalex-snapshot
On deriving the upper bound of α-lifetime for large sensor networks
inferredcites →https://doi.org/10.1201/9780203323687.ch28openalex-snapshot
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks
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-642-41674-3_123openalex-snapshot
Lower Bound Estimation for Required Number of Nodes in the Opportunistic Communication – Based Wireless Sensor Network
inferred← citeshttps://doi.org/10.1007/s13369-015-1745-3openalex-snapshot
Efficient Cluster-Based Sleep Scheduling for M2M Communication Network
inferred← citeshttps://doi.org/10.1088/1742-6596/1976/1/012038openalex-snapshot
Wireless sensor network node sleep scheduling algorithm
inferred← citeshttps://doi.org/10.1109/iccisci.2012.6297131openalex-snapshot
Impact of Gaussian deployment strategies on the performance of wireless sensor network
inferred← citeshttps://doi.org/10.1109/icps59941.2024.10639950openalex-snapshot
Task Scheduling Strategy Based on Resource Constraint in Edge Computing System
inferred← citeshttps://doi.org/10.1109/isads.2013.6513443openalex-snapshot
Cluster-based coverage-aware node scheduling scheme for mobile wireless sensor network
inferred← citeshttps://doi.org/10.3390/s100302064openalex-snapshot
Coverage-Guaranteed Sensor Node Deployment Strategies for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4304/jcp.8.6.1610-1617openalex-snapshot
Optimal Sleep Scheduling Scheme for Wireless Sensor Networks Based on Balanced Energy Consumption
inferred← citeshttps://doi.org/10.5121/csit.2014.4200openalex-snapshot
Computer Science & Information Technology ( CS & IT )
inferred← citeshttps://doi.org/10.5121/csit.2014.4201openalex-snapshot
ECSM: Energy Efficient Clustering Scheme for Mobile M2M Communication 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.