Sciweavers

856 search results - page 108 / 172
» On Randomness Measures for Social Networks.
Sort
View
WIOPT
2011
IEEE
14 years 9 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
WOWMOM
2005
ACM
115views Multimedia» more  WOWMOM 2005»
15 years 11 months ago
Precise Distributed Localization Algorithms for Wireless Networks
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
Saad Biaz, Yiming Ji
IEEEMSP
2002
IEEE
137views Multimedia» more  IEEEMSP 2002»
15 years 11 months ago
On the capacity of the reachback channel in wireless sensor networks
Abstract— We consider the problem of reachback communication in wireless sensor networks: multiple sensors are deployed on a field, and they collect local measurements of some r...
João Barros, Sergio D. Servetto
ISCIS
2004
Springer
15 years 11 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
ICCS
2007
Springer
15 years 10 months ago
Extended Clustering Coefficients of Small-World Networks
The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full conn...
Wenjun Xiao, Yong Qin, Behrooz Parhami