Sciweavers

315 search results - page 8 / 63
» Dynamic vs. Oblivious Routing in Network Design
Sort
View
WICON
2008
15 years 2 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
166
Voted
ICOIN
2003
Springer
15 years 6 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
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...
Nianjun Zhou, Alhussein A. Abouzeid
ICS
2009
Tsinghua U.
15 years 5 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
PDCAT
2005
Springer
15 years 6 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
AINA
2008
IEEE
15 years 7 months ago
Secure Routing Protocol with Malicious Nodes Detection for Ad Hoc Networks
An ad hoc network is a highly dynamic routing network cooperated by a set of wireless mobile nodes without any assistance of centralized access point. ARIADNE is a well-known secu...
Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Ch...