1592 search results - page 91 / 319 » Source-Tree Routing in Wireless Networks |
108
Voted
JSAC
2007
15 years 16 days ago
2007
— A Vehicular Ad Hoc Network (VANET) may exhibit a bipolar behavior, i.e., the network can either be fully connected or sparsely connected depending on the time of day or on the ...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
102
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
114
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
123
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...