Sciweavers

109 search results - page 7 / 22
» Faulty Random Geometric Networks
Sort
View
TC
2008
13 years 9 months ago
A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks
This paper presents a new coverage formulation addressing the quality of service of sensor networks that cooperatively detect targets traversing a region of interest. The problem o...
Kelli Baumgartner, Silvia Ferrari
WCNC
2010
IEEE
14 years 1 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 10 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 3 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
PAM
2004
Springer
14 years 3 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella