Shortest hop multipath algorithm for wireless sensor networks

DOI10.1016/J.CAMWA.2011.10.070zbMath1238.90133OpenAlexW2064006044MaRDI QIDQ418284

Onur Yilmaz, Serkan Ergun, Sercan Demirci, Yagiz Kaymak, Ahmet Yildirim

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

zbMATH Keywords

routing\(\beta \) synchronizerbraided multipathdata disseminationdistributed spanning tree algorithmsshortest hop path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (3)

A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of things (IOT) ⋮ 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

Cites Work

• Unnamed Item
• Linear superposition principle applying to Hirota bilinear equations
• 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
• Unit disk graphs
• 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
• Distributed Computing: A Locality-Sensitive Approach
• The diameter of sparse random graphs

This page was built for publication: Shortest hop multipath algorithm for wireless sensor networks