Sciweavers

2391 search results - page 26 / 479
» The Complexity of Connectivity in Wireless Networks
Sort
View
MOBIQUITOUS
2007
IEEE
15 years 4 months ago
Diffusion-based Approach to Deploying Wireless Sensors to Satisfy Coverage, Connectivity and Reliability
An important objective of wireless sensor networks (WSNs) is to reliably sense data about the environment in which they are deployed. Reliability in WSNs has been widely studied in...
Renita Machado, Sirin Tekinay
GLOBECOM
2007
IEEE
15 years 4 months ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
IPPS
2005
IEEE
15 years 3 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
ICC
2007
IEEE
138views Communications» more  ICC 2007»
15 years 4 months ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy
94
Voted
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
15 years 2 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...