IJNSEC
2007
13 years 4 months ago
2007
This paper proposes a multipath routing scheme SeReRoM for a multicast group communication with a single source and multiple destinations. SeReRoM provides an environment that tac...
NSDI
2004
13 years 6 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
DCOSS
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
WOWMOM
2005
ACM
13 years 10 months ago
2005
ACM
— In this paper, we propose three interdomain routing schemes for communications between different ad-hoc groups (subnets), namely the implicit foreign degree based (IFD), the ex...
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
SEUS
2007
IEEE
13 years 10 months ago
2007
IEEE
Abstract. Wireless sensor networks (WSNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient ...
NOCS
2007
IEEE
13 years 10 months ago
2007
IEEE
We present a novel network-on-chip-based architecture for future programmable chips (FPGAs). A key challenge for FPGA design is supporting numerous highly variable design instance...
MUE
2007
IEEE
13 years 10 months ago
2007
IEEE
We propose a predictive location based relaying for hybrid cellular and ad-hoc systems that can provide interference minimization to uplink transmission. In the case of dense netw...
WDAG
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
ICDCN
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...