Sciweavers

3009 search results - page 43 / 602
» On Communication Security in Wireless Ad-Hoc Sensor Networks
Sort
View
ICDCS
2008
IEEE
15 years 7 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
AINA
2006
IEEE
15 years 5 months ago
Secure and Continuous Management of Heterogeneous Ad Hoc Networks
Addition of new nodes to a Sensor Network is a fundamental requirement for their continuity operation over time. We analyze the weakening of security due to node capture when addi...
Arjan Durresi, Vijay Bulusu, Vamsi Paruchuri, Leon...
POLICY
2004
Springer
15 years 6 months ago
Policy-Based Mobile Ad Hoc Network Management
Ad hoc networking is the basis of the future military network-centric warfare architecture. Such networks are highly dynamic in nature, as mobile ad hoc networks are formed over w...
Ritu Chadha, Hong Cheng, Yuu-Heng Cheng, Cho-Yu Ja...
INFOCOM
2006
IEEE
15 years 7 months ago
Modeling Wireless Ad Hoc Networks with Directional Antennas
Marcelo M. Carvalho, J. J. Garcia-Luna-Aceves
JPDC
2006
187views more  JPDC 2006»
15 years 1 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu