Sciweavers

4037 search results - page 34 / 808
» Routing without ordering
Sort
View
ICNP
2005
IEEE
14 years 1 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
MUE
2008
IEEE
218views Multimedia» more  MUE 2008»
14 years 2 months ago
I-SEAD: A Secure Routing Protocol for Mobile Ad Hoc Networks
Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of centralized access point. Secure Efficient Ad hoc...
Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Ch...
HPCC
2007
Springer
14 years 1 months ago
Systolic Routing in an Optical Ring with Logarithmic Shortcuts
Abstract. We present an all-optical ring network architecture with logarithmic shortcuts and a systolic routing protocol for it. An r-dimensional optical ring network with logarith...
Risto Honkanen, Juha-Pekka Liimatainen
SIGCOMM
2010
ACM
13 years 6 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
MOBIHOC
2004
ACM
14 years 7 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...