— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
— In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of l...
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
— We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re...
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
— One of TCP’s critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implem...
— Over the past few years, Peer-to-Peer (P2P) systems have become very popular for constructing overlay networks of many nodes (peers) that allow users geographically distributed...