Sciweavers

867 search results - page 143 / 174
» Network Robustness and Graph Topology
Sort
View
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
GLOBECOM
2010
IEEE
13 years 5 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
BMCBI
2010
161views more  BMCBI 2010»
13 years 5 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
IMC
2003
ACM
14 years 28 days ago
Constructing internet coordinate system based on delay measurement
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
ICPADS
2005
IEEE
14 years 1 months ago
A Hint-Based Probabilistic Protocol for Unicast Communications in MANETs
Point-to-point transmissions represent a fundamental primitive in any communication network. Despite many proave appeared in the literature, providing an efficient implementation ...
Roberto Beraldi, Leonardo Querzoni, Roberto Baldon...