We address the stochastic characteristics of a recently-proposed greedy routing scheme. The stochastic behaviour of individual hop advancements is examined to observe the overall ...
For high-density networks, several studies have proposed field-based routing paradigms to uniformly distribute the traffic load throughout the network. However, as network density ...
Goce Trajcevski, Oliviu Ghica, Peter Scheuermann, ...
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
A major task of a wireless sensor network is energy-efficient, timely, and robust dissemination of sensor readings back to the sink node. The AIDA project [1] aims to create a new...
Dimitrios Koutsonikolas, Syed Ali Raza Jafri, Y. C...