Sciweavers

COST
2009
Springer
184views Multimedia» more  COST 2009»
14 years 2 months ago
Cross-Layer Optimization Issues for Realizing Transparent Mesh Optical Networks
In transparent optical networks as the signal propagates through a transparent network it experiences the impact of a variety of quality degrading phenomena that are introduced by ...
Siamak Azodolmolky, Tibor Cinkler, Dimitrios Kloni...
WADS
2009
Springer
262views Algorithms» more  WADS 2009»
14 years 2 months ago
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
Chenyu Yan, Yang Xiang, Feodor F. Dragan
APNOMS
2009
Springer
14 years 2 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
ISCA
2009
IEEE
192views Hardware» more  ISCA 2009»
14 years 2 months ago
A case for bufferless routing in on-chip networks
Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip in...
Thomas Moscibroda, Onur Mutlu
INFOCOM
2009
IEEE
14 years 2 months ago
Routing Fairness in Chord: Analysis and Enhancement
—In Peer-to-Peer (P2P) systems where stored objects are small, routing dominates the cost of publishing and retrieving an object. In such systems, the issue of fairly balancing t...
Rubén Cuevas Rumín, Manuel Urue&ntil...
INFOCOM
2009
IEEE
14 years 2 months ago
Spatial Distribution in Routing Table Design for Sensor Networks
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Rik Sarkar, Xianjin Zhu, Jie Gao
INFOCOM
2009
IEEE
14 years 2 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
INFOCOM
2009
IEEE
14 years 2 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
INFOCOM
2009
IEEE
14 years 2 months ago
Multirate Anypath Routing in Wireless Mesh Networks
—In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of nex...
Rafael P. Laufer, Henri Dubois-Ferrière, Le...
INFOCOM
2009
IEEE
14 years 2 months ago
Routing Over Multi-Hop Wireless Networks with Non-Ergodic Mobility
—Routing to mobile nodes in a wireless network is conventionally performed by associating a static IP address (or a geographic location) to each node, and routing to that address...
Chris Milling, Sundar Subramanian, Sanjay Shakkott...