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...
—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...
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...
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...
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...
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...
—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...
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...
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...
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...