Sciweavers

1812 search results - page 138 / 363
» Stateless Routing in Network Simulations
Sort
View
KIVS
2011
Springer
14 years 7 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
ICNP
1999
IEEE
15 years 8 months ago
Effect of Unreliable Nodes on QoS Routing
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
Swapna S. Gokhale, Satish K. Tripathi
NSDI
2004
15 years 5 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
ADHOC
2010
317views more  ADHOC 2010»
15 years 1 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
ICCCN
2008
IEEE
15 years 10 months ago
A Distributed Routing Algorithm for Networks with Data-Path Services
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
Xin Huang, Sivakumar Ganapathy, Tilman Wolf