Sciweavers

Share
WIOPT
2010
IEEE
8 years 8 months ago
Cooperative diversity routing in wireless networks
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
Mostafa Dehghan, Majid Ghaderi, Dennis Goeckel
TWC
2008
80views more  TWC 2008»
8 years 10 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
CN
2007
104views more  CN 2007»
8 years 10 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
CAL
2007
8 years 10 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
CAL
2008
8 years 10 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin
PDPTA
2003
8 years 11 months ago
The Performance of Routing Algorithms under Bursty Traffic Loads
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
Jeonghee Shin, Timothy Mark Pinkston
PDCN
2004
8 years 11 months ago
Consistency-based routing in overlay networks
This paper introduces GRACE
Anne-Marie Bosneag, Monica Brockmeyer
APPINF
2003
8 years 11 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
APPINF
2003
8 years 11 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
8 years 11 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
books