Sciweavers

1008 search results - page 26 / 202
» Routing in intermittent network topologies
Sort
View
INFOCOM
2003
IEEE
15 years 7 months ago
Optimizing Route-Cache Lifetime in Ad Hoc Networks
—On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determinatio...
Ben Liang, Zygmunt J. Haas
WICON
2008
15 years 3 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
MOBIHOC
2004
ACM
16 years 1 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
IWSOS
2009
Springer
15 years 6 months ago
Self-management of Routing on Human Proximity Networks
Abstract. Many modern network applications, including sensor networks and MANETs, have dynamic topologies that reflect processes occurring in the outside world. These dynamic proc...
Graham Williamson, Davide Cellai, Simon A. Dobson,...
WD
2010
14 years 11 months ago
Centrality-based routing for Wireless Sensor Networks
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
Eduardo M. R. Oliveira, Heitor S. Ramos, Antonio A...