We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
Recent research has shown that multi-hop ad hoc networks suffer from a low capacity and moreover that an individual node’s capacity for long-distance communication decreases the...
The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions neverthe...
In this paper we propose an "on demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on...
—As wireless power charging technology emerges, some basic principles in sensor network design are changed accordingly. Existing sensor node deployment and data routing strategie...