Sciweavers

ICOIN
2003
Springer
14 years 4 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
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
14 years 4 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck
FPGA
2003
ACM
123views FPGA» more  FPGA 2003»
14 years 4 months ago
Wire type assignment for FPGA routing
The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently dev...
Seokjin Lee, Hua Xiang, D. F. Wong, Richard Y. Sun
ADHOCNOW
2003
Springer
14 years 4 months ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
WSNA
2003
ACM
14 years 4 months ago
Information-directed routing in ad hoc sensor networks
—In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-dir...
Juan Liu, Feng Zhao, Dragan Petrovic
SIGCOMM
2003
ACM
14 years 4 months ago
A routing underlay for overlay networks
We argue that designing overlay services to independently probe the Internet—with the goal of making informed application-specific routing decisions—is an untenable strategy....
Akihiro Nakao, Larry L. Peterson, Andy C. Bavier
SENSYS
2003
ACM
14 years 4 months ago
Taming the underlying challenges of reliable multihop routing in sensor networks
The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic ...
Alec Woo, Terence Tong, David E. Culler
PODC
2003
ACM
14 years 4 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
PADS
2003
ACM
14 years 4 months ago
Enabling Large-Scale Multicast Simulation by Reducing Memory Requirements
The simulation of large–scale multicast networks often requires a significant amount of memory that can easily exceed the capacity of current computers, both because of the inh...
Donghua Xu, George F. Riley, Mostafa H. Ammar, Ric...
ISPD
2003
ACM
117views Hardware» more  ISPD 2003»
14 years 4 months ago
Fishbone: a block-level placement and routing scheme
A block-level placement and routing scheme called Fishbone is presented. The routing uses a two-layer spine topology. The pin locations are configurable and restricted to certain ...
Fan Mo, Robert K. Brayton