Sciweavers

IPCCC
2005
IEEE
14 years 5 months ago
A tree-based reliable multicast scheme exploiting the temporal locality of transmission errors
Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes keep in their buffers all packets t...
Jinsuk Baek, Jehan-François Pâris
INFOCOM
2005
IEEE
14 years 5 months ago
HADOF: defense against routing disruptions in mobile ad hoc networks
— HADOF is a set of mechanisms to defend against routing disruptions in mobile ad hoc networks. Based on the observed behavior and the history record of each node, HADOF aims to ...
Wei Yu, Yan Sun, K. J. Ray Liu
INFOCOM
2005
IEEE
14 years 5 months ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— 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...
ICW
2005
IEEE
143views Communications» more  ICW 2005»
14 years 5 months ago
Distributed Mobility Control for Fault-Tolerant Mobile Networks
Large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be foreseeable in the near future. Since nodes in such a system commun...
Jie Lin
WOWMOM
2006
ACM
109views Multimedia» more  WOWMOM 2006»
14 years 5 months ago
A Flow Control Framework for Improving Throughput and Energy Efficiency in CSMA/CA based Wireless Multihop Networks
— In multihop wireless networks where a random access MAC scheme such as CSMA/CA is used, nodes greedily compete in a distributed manner and are unaware of the interference they ...
Jaya Shankar Pathmasuntharam, Amitabha Das, Prasan...
PPOPP
2006
ACM
14 years 5 months ago
Collective communication on architectures that support simultaneous communication over multiple links
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
Ernie Chan, Robert A. van de Geijn, William Gropp,...
INFOCOM
2006
IEEE
14 years 5 months ago
Eclipse Attacks on Overlay Networks: Threats and Defenses
Abstract— Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains connections with a nu...
Atul Singh, Tsuen-Wan Ngan, Peter Druschel, Dan S....
INFOCOM
2006
IEEE
14 years 5 months ago
On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
Vivek Vishnumurthy, Paul Francis
ICDCS
2006
IEEE
14 years 6 months ago
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...
Shashidhar Gandham, Ying Zhang, Qingfeng Huang
GLOBECOM
2006
IEEE
14 years 6 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...