Sciweavers

1333 search results - page 70 / 267
» Packet Routing on the Grid
Sort
View
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
13 years 11 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
INFOCOM
2010
IEEE
13 years 8 months ago
Non-Preemptive Buffer Management for Latency Sensitive Packets
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
Moran Feldman, Joseph Naor
INFOCOM
2007
IEEE
14 years 4 months ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff
INFOCOM
2005
IEEE
14 years 3 months ago
Asymptotically optimal power-aware routing for multihop wireless networks with renewable energy sources
— In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize th...
Xiaojun Lin, Ness B. Shroff, R. Srikant
MSWIM
2005
ACM
14 years 3 months ago
Towards resilient geographic routing in WSNs
In this paper, we consider the security of geographical forwarding (GF) – a class of algorithms widely used in ad hoc and sensor networks. In GF, neighbors exchange their locati...
Nael B. Abu-Ghazaleh, Kyoung-Don Kang, Ke Liu