1473 search results - page 182 / 295 » On Performance Modeling of Ad Hoc Routing Protocols |
174
click to vote
CORR
2008
Springer
15 years 6 months 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...
162
click to vote
ICNP
2006
IEEE
16 years 13 days ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
164
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--A novel cluster-head selection and update algorithm "Typebased Cluster-forming Algorithm (TCA)" is proposed, which outperforms both the lowest node ID (LID) and...
232
click to vote
ICOIN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
164
click to vote
ISCC
2009
IEEE
16 years 1 months ago
2009
IEEE
We investigate the problem of spreading information contents in a wireless ad hoc network. In our vision, information dissemination should satisfy the following requirements: (i) ...