On the public citation graph
Least-Latency Routing over Time-Dependent Wireless Sensor Networks
0 signed · 64 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.1002/net.3230210304openalex-snapshot
Minimum weight paths in time‐dependent networks
inferredcites →https://doi.org/10.1006/jagm.1996.0842openalex-snapshot
An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
inferredcites →https://doi.org/10.1007/3-540-36389-0_12openalex-snapshot
FATES: Finding A Time dEpendent Shortest path
inferredcites →https://doi.org/10.1007/978-3-540-77220-0_37openalex-snapshot
DPS-MAC: An Asynchronous MAC Protocol for Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/978-3-540-92221-6_20openalex-snapshot
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/bfb0022448openalex-snapshot
Distributed algorithms for updating shortest paths
inferredcites →https://doi.org/10.1007/s004460050023openalex-snapshot
Distributed shortest-path protocols for time-dependent networks
inferredcites →https://doi.org/10.1016/0022-247x(66)90009-6openalex-snapshot
The shortest route through a network with time-dependent internodal transit times
inferredcites →https://doi.org/10.1016/0196-6774(92)90017-7openalex-snapshot
On finding and updating shortest paths distributively
inferredcites →https://doi.org/10.1016/s0304-3975(02)00619-9openalex-snapshot
A fully dynamic algorithm for distributed shortest paths
inferredcites →https://doi.org/10.1109/90.222913openalex-snapshot
Loop-free routing using diffusing computations
inferredcites →https://doi.org/10.1109/fscs.1990.89570openalex-snapshot
Communication-optimal maintenance of replicated information
inferredcites →https://doi.org/10.1109/iccta.2007.101openalex-snapshot
Partially Dynamic Concurrent Update of Distributed Shortest Paths
inferredcites →https://doi.org/10.1109/icdcs.1997.597862openalex-snapshot
Two new quorum based algorithms for distributed mutual exclusion
inferredcites →https://doi.org/10.1109/icdcs.2010.41openalex-snapshot
Bounding Communication Delay in Energy Harvesting Sensor Networks
inferredcites →https://doi.org/10.1109/icnp.2008.4697046openalex-snapshot
Routing in intermittently connected sensor networks
inferredcites →https://doi.org/10.1109/infcom.2002.1019408openalex-snapshot
An energy-efficient MAC protocol for wireless sensor networks
inferredcites →https://doi.org/10.1109/infcom.2005.1498532openalex-snapshot
Delay efficient sleep scheduling in wireless sensor networks
inferredcites →https://doi.org/10.1109/infcom.2010.5461987openalex-snapshot
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/milcom.2001.985819openalex-snapshot
Energy efficient routing in wireless sensor networks
inferredcites →https://doi.org/10.1109/rtss.2009.12openalex-snapshot
Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks
inferredcites →https://doi.org/10.1109/rttas.2004.1317245openalex-snapshot
A wakeup scheme for sensor networks: achieving balance between energy saving and end-to-end delay
inferredcites →https://doi.org/10.1109/sahcn.2004.1381954openalex-snapshot
Analyzing the transitional region in low power wireless links
inferredcites →https://doi.org/10.1109/sahcn.2007.4292814openalex-snapshot
Adaptive Control of Duty Cycling in Energy-Harvesting Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1109/tmc.2007.1037openalex-snapshot
Adaptive Low Power Listening for Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tnet.2004.828953openalex-snapshot
Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks
inferredcites →https://doi.org/10.1145/1031495.1031508openalex-snapshot
Versatile low power media access for wireless sensor networks
inferredcites →https://doi.org/10.1145/1322263.1322294openalex-snapshot
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
inferredcites →https://doi.org/10.1145/1353343.1353371openalex-snapshot
Finding time-dependent shortest paths over large graphs
inferredcites →https://doi.org/10.1145/190314.190336openalex-snapshot
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
inferredcites →https://doi.org/10.1145/190809.190336openalex-snapshot
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
inferredcites →https://doi.org/10.1145/358690.358717openalex-snapshot
Distributed computation on graphs
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1145/958491.958494openalex-snapshot
Taming the underlying challenges of reliable multihop routing in sensor networks
inferredcites →https://doi.org/10.1145/958491.958512openalex-snapshot
An adaptive energy-efficient MAC protocol for wireless sensor networks
inferredcites →https://doi.org/10.1145/958492.958494openalex-snapshot
Taming the underlying challenges of reliable multihop routing in sensor networks
inferredcites →https://doi.org/10.1145/958511.958512openalex-snapshot
An adaptive energy-efficient MAC protocol for wireless sensor networks
inferredcites →https://doi.org/10.3141/1645-21openalex-snapshot
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
inferredcites →https://doi.org/10.5555/1602165.1602171openalex-snapshot
Gradient clock synchronization in wireless 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-319-59105-6_25openalex-snapshot
Localization based Anti-Void Clustering Approach (LAVCA) for Energy Efficient Routing in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1007/s11277-013-1494-0openalex-snapshot
Optimal Query-Driven Data Forwarding for Delay-Sensitive Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s12083-022-01325-4openalex-snapshot
Systematic study of topology control methods and routing techniques in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.ijleo.2015.04.023openalex-snapshot
Performance Assessment of tree topology sensor network based on scheduling algorithm for overseeing high-rise building structural health information
inferred← citeshttps://doi.org/10.1109/access.2016.2588278openalex-snapshot
FFSC: An Energy Efficiency Communications Ap-proach for Delay Minimizing in Internet of Things
inferred← citeshttps://doi.org/10.1109/access.2019.2937252openalex-snapshot
Rendezvous Cost-Aware Opportunistic Routing in Heterogeneous Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icnp.2015.10openalex-snapshot
A Novel Metric for Opportunistic Routing in Heterogenous Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/lcomm.2016.2539939openalex-snapshot
Energy Efficient Switch-Based Packet Forwarding for Low Duty-Cycle Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tc.2014.2345400openalex-snapshot
By-Passing Infected Areas in Wireless Sensor Networks using BPR
inferred← citeshttps://doi.org/10.1109/tmc.2019.2897998openalex-snapshot
Shortest-Latency Opportunistic Routing in Asynchronous Wireless Sensor Networks with Independent Duty-Cycling
inferred← citeshttps://doi.org/10.1109/wcnc.2014.6952781openalex-snapshot
QoS routing based on parallel elite clonal quantum evolution for multimedia wireless sensor networks
inferred← citeshttps://doi.org/10.1142/s0217732319502353openalex-snapshot
QoS provisioning-based routing protocols using multiple data sink in IoT-based WSN
inferred← citeshttps://doi.org/10.1145/2507924.2507985openalex-snapshot
Optimal radius for connectivity in duty-cycled wireless sensor networks
inferred← citeshttps://doi.org/10.1145/2663353openalex-snapshot
Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.15623/ijret.2014.0303096openalex-snapshot
DISCOVERING ADAPTIVE WIRELESS SENSOR NETWORK USING ?-SYNCHRONIZER
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i38/91416openalex-snapshot
Wireless Sensor Network: A Bibliographical Survey
inferred← citeshttps://doi.org/10.21275/v5i5.nov163841openalex-snapshot
Providing Efficient Energy to By-Pass Infected Areas in WSNs
inferred← citeshttps://doi.org/10.21275/v5i6.nov164335openalex-snapshot
A Survey on By-Passing Techniques in Wireless Sensor Network
inferred← citeshttps://doi.org/10.2174/2210327908666181102122500openalex-snapshot
Comparative Cluster Based Mobile Routing Approach for Energy Efficiency in Optimization of Node location in WSNs
inferred← citeshttps://doi.org/10.2174/2210327909666181204121850openalex-snapshot
Study of Quality of Service Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4304/jnw.9.5.1281-1286openalex-snapshot
Traffic Load Constrained Routing Algorithm for 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.