Sciweavers

482 search results - page 33 / 97
» On routing table growth
Sort
View
SAINT
2008
IEEE
14 years 2 months ago
Matrix Routing -- An Interference Range Insensitive Routing Protocol for Wireless Sensor Networks
Interference ranges can dramatically affect the throughput in wireless sensor networks. While the transmission range defines the maximum physical range of a radio signal the inter...
Monty Beuster, Michael Beigl, Daniel Röhr, Ti...
GLOBECOM
2007
IEEE
14 years 2 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
ICN
2005
Springer
14 years 1 months ago
Reliable Mobile Ad Hoc P2P Data Sharing
Abstract. We developed a reliable mobile Peer-to-Peer (P2P) data sharing system and performed some experiments for verifying our routing scheme using our real testbed. Our method f...
Mee Young Sung, Jong Hyuk Lee, Jong Seung Park, Se...
CF
2008
ACM
13 years 9 months ago
Multi-terabit ip lookup using parallel bidirectional pipelines
To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi...
Weirong Jiang, Viktor K. Prasanna
ICC
2008
IEEE
128views Communications» more  ICC 2008»
14 years 2 months ago
Quality-of-Service Routing with Two Concave Constraints
—Routing is a process of finding a network path from a source node to a destination node. A good routing protocol should find the “best path” from a source to a destination...
Ka-Chung Leung, King-Shan Lui, Ka-Cheong Leung, Fr...