Shortest hop multipath algorithm for wireless sensor networks
DOI10.1016/J.CAMWA.2011.10.070zbMATH Open1238.90133OpenAlexW2064006044MaRDI QIDQ418284FDOQ418284
Authors: Onur Yilmaz, Sercan Demirci, Yagiz Kaymak, Serkan Ergun, Ahmet Yıldırım 
Publication date: 28 May 2012
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.10.070
Recommendations
routing\(\beta \) synchronizerbraided multipathdata disseminationdistributed spanning tree algorithmsshortest hop path
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Unit disk graphs
- Distributed Computing: A Locality-Sensitive Approach
- Linear superposition principle applying to Hirota bilinear equations
- Negotiation-based protocols for disseminating information in wireless sensor networks
- Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments
- Distributed computation on graphs
- The diameter of sparse random graphs
- Enhancing data security in ad hoc networks based on multipath routing
- Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information
Cited In (4)
- A modeling framework for supporting and evaluating performance of multi-hop paths in mobile ad-hoc wireless networks
- Energy-balanced sampling workload allocation in wireless sensor networks
- A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of Things (IOT)
- Distance estimating algorithm in WSN based on minimum hop routing
This page was built for publication: Shortest hop multipath algorithm for wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418284)
