Sciweavers

1571 search results - page 146 / 315
» Dynamic Routing Selection for Wireless Sensor Networks
Sort
View
MOBIHOC
2001
ACM
16 years 3 months ago
Implicit source routes for on-demand ad hoc network routing
In an ad hoc network, the use of source routing has many advantages, including simplicity, correctness, and flexibility. For example, all routing decisions for a packet are made b...
Yih-Chun Hu, David B. Johnson
136
Voted
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 3 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
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...
Mikhail Nesterenko, Adnan Vora
ICPP
2009
IEEE
15 years 10 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
IJNSEC
2008
132views more  IJNSEC 2008»
15 years 3 months ago
Optimal Energy-Delay Routing Protocol with Trust Levels for Wireless Ad Hoc Networks
This paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivab...
Eyad Taqieddin, S. Jagannathan, Ann Miller
131
Voted
ESAS
2006
Springer
15 years 7 months ago
Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol
We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models...
Baruch Awerbuch, Robert G. Cole, Reza Curtmola, Da...