Sciweavers

1014 search results - page 139 / 203
» Distributed Algorithms for Attack Localization in All-Optica...
Sort
View
ICPP
2005
IEEE
14 years 2 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao

Presentation
945views
12 years 2 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
PKDD
2009
Springer
146views Data Mining» more  PKDD 2009»
14 years 1 months ago
Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding prob...
Eva Besada-Portas, Sergey M. Plis, Jesús Ma...
ICPP
2006
IEEE
14 years 3 months ago
Social Welfare Based Routing in Ad hoc Networks
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
Mingming Lu, Jie Wu
MOBIHOC
2010
ACM
13 years 7 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...