Sciweavers

1333 search results - page 221 / 267
» Packet Routing on the Grid
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ADHOCNOW
2004
Springer
14 years 1 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
COMCOM
2006
97views more  COMCOM 2006»
13 years 7 months ago
Energy-efficient differentiated directed diffusion (EDDD) in wireless sensor networks
A number of routing protocols [1] have been proposed for wireless sensor networks in recent years. Considering energy-efficiency as the primary objective, most of routing protocol...
Min Chen, Taekyoung Kwon, Yanghee Choi
INFOCOM
2011
IEEE
12 years 11 months ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...

Publication
397views
14 years 9 months ago
Build it but where? A GIS methodology for guiding the planning of new cycling facilities
Concern over climate change, traffic congestion, and the health consequences of sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of urban ...
Larsen, J. & El-Geneidy, M.