Sciweavers

1333 search results - page 41 / 267
» Packet Routing on the Grid
Sort
View
PERCOM
2005
ACM
14 years 7 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
ASAP
2006
IEEE
142views Hardware» more  ASAP 2006»
13 years 9 months ago
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
In this paper, a routing model for minimizing hot spots in the network on chip (NOC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Us...
Masoud Daneshtalab, Ashkan Sobhani, Ali Afzali-Kus...
ICWN
2004
13 years 9 months ago
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
Maulin Patel, R. Chandrasekaran, S. Venkatesan
COMCOM
2006
110views more  COMCOM 2006»
13 years 7 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak
ICCCN
2007
IEEE
14 years 2 months ago
Utility-Based Routing in Communication Networks with Unstable Links
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Mingming Lu, Jie Wu