Sciweavers

TMC
2010
112views more  TMC 2010»
13 years 2 months ago
Comparison of Data-Driven Link Estimation Methods in Low-Power Wireless Networks
Abstract—Link estimation is a basic element of routing in lowpower wireless networks, and data-driven link estimation using unicast MAC feedback has been shown to outperform broa...
Hongwei Zhang, Lifeng Sang, Anish Arora
TMC
2010
138views more  TMC 2010»
13 years 2 months ago
Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes
—Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes fo...
Tao Shu, Marwan Krunz, Sisi Liu
SWARM
2010
SPRINGER
283views Optimization» more  SWARM 2010»
13 years 2 months ago
Principles and applications of swarm intelligence for adaptive routing in telecommunications networks
In the past few years there has been a lot of research on the application of swarm intelligence to the problem of adaptive routing in telecommunications networks. A large number of...
Frederick Ducatelle, Gianni A. Di Caro, Luca Maria...
SIGCOMM
2010
ACM
13 years 2 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
SAB
2010
Springer
237views Optimization» more  SAB 2010»
13 years 2 months ago
BeeIP: Bee-Inspired Protocol for Routing in Mobile Ad-Hoc Networks
We introduce a new bee-inspired routing protocol for mobile ad hoc networks. Emphasis is given to the ability of bees to evaluate paths by considering several quality factors. In o...
Alexandros Giagkos, Myra S. Wilson
PERCOM
2010
ACM
13 years 2 months ago
Privacy-enhanced social network routing in opportunistic networks
Opportunistic networking - forwarding messages in a disconnected mobile ad hoc network via any encountered nodes - otters a new mechanism for exploiting the mobile devices that man...
Iain Parris, Greg Bigwood, Tristan Henderson
NAS
2010
IEEE
13 years 2 months ago
CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment
—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...
Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu
MST
2010
106views more  MST 2010»
13 years 2 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
LATIN
2010
Springer
13 years 3 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
TRANSCI
2008
94views more  TRANSCI 2008»
13 years 3 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...