114 search results - page 8 / 23 » Optimal Routing in Binomial Graph Networks |
99
Voted
ISCC
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
129
click to vote
PODC
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
WCNC
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
109
Voted
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
106
click to vote
CDC
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...