Maximizing packet delivery ratio in stochastic routing: An analytical perspective
| Autor: | Udara Wijetunge, Sylvie Perreau, Andre Pollok, Ramanan Subramanian |
|---|---|
| Přispěvatelé: | Wijetunge, Udara Sadathana, Subramanian, Ramanan, Pollok, Andre, Perreau, Sylvie Luce, Ad-hoc and Sensor Networking Symposium Sydney, Australia 2014-06-10 |
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: |
Routing protocol
Mathematical optimization Dynamic Source Routing deterministic routing Equal-cost multi-path routing Computer science Routing table Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol theoretical framework Geographic routing La-grangian approaches Routing Information Protocol packet delivery ratio Computer Science::Networking and Internet Architecture Destination-Sequenced Distance Vector routing performance comparison Hierarchical routing Triangular routing Stochastic geometry models of wireless networks degree of randomness Static routing Zone Routing Protocol iterative algorithm Network packet Policy-based routing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS acyclic networks Deterministic routing Distance-vector routing protocol Link-state routing protocol Optimized Link State Routing Protocol Multipath routing Wireless sensor network |
| Zdroj: | ICC |
| Popis: | Stochastic routing offers a promising substitute to deterministic routing in wireless sensor networks, mainly due to its randomized nature. Still, most of the stochastic routing algorithms are heuristic, while the optimality for a given degree of randomness is difficult to find. In this paper, we propose a theoretical framework to find the optimal stochastic routing policy that maximizes the packet delivery ratio for a given degree of randomness in routing. Our model consists of directed acyclic networks with unreliable communication links. The degree of randomness is quantified by the global entropy of routing. By employing the Lagrangian approach, a simple iterative algorithm to find the optimal stochastic routing policy is proposed. This can be used as a benchmark for performance comparison of stochastic routing algorithms. Refereed/Peer-reviewed |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|