540 search results - page 74 / 108 » Utility-Based Routing in Communication Networks with Unstabl... |
NAS
2010
IEEE
13 years 6 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
IJSNET
2008
13 years 7 months ago
2008
Delivering sensed data to the sink reliably in sensor networks calls for a scalable, energy-efficient, and error-resilient routing solution. In this paper, a reliable energy-effic...
INFOCOM
1999
IEEE
13 years 12 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
CONEXT
2005
ACM
13 years 9 months ago
2005
ACM
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...