Sciweavers

1265 search results - page 188 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
ICDM
2009
IEEE
211views Data Mining» more  ICDM 2009»
14 years 3 months ago
Discovering Organizational Structure in Dynamic Social Network
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
Jiangtao Qiu, Zhangxi Lin, Changjie Tang, Shaojie ...
SENSYS
2006
ACM
14 years 2 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
AHSWN
2008
92views more  AHSWN 2008»
13 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
ICNP
2002
IEEE
14 years 1 months ago
Hybrid Channel Access Scheduling in Ad Hoc Networks
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...
Lichun Bao, J. J. Garcia-Luna-Aceves
RAID
2004
Springer
14 years 2 months ago
Attack Analysis and Detection for Ad Hoc Routing Protocols
Abstract. Attack analysis is a challenging problem, especially in emerging environments where there are few known attack cases. One such new environment is the Mobile Ad hoc Networ...
Yi-an Huang, Wenke Lee