Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
In this paper, we describe the design and implementation of a tuple-based distributed memory realized with the use of RFID technology. The key idea – rooted in a more general sc...
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
The recent emergence of dramatically large computational power, spanning desktops with multicore processors and multiple graphics cards to supercomputers with 105 processor cores,...