Sciweavers

1265 search results - page 230 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 13 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
MOBICOM
2003
ACM
14 years 27 days ago
Manycast: exploring the space between anycast and multicast in ad hoc networks
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
Casey Carter, Seung Yi, Prashant Ratanchandani, Ro...
MOBICOM
2003
ACM
14 years 27 days ago
MiSer: an optimal low-energy transmission strategy for IEEE 802.11a/h
Reducing the energy consumption by wireless communication devices is perhaps the most important issue in the widely-deployed and exponentially-growing IEEE 802.11 Wireless LANs (W...
Daji Qiao, Sunghyun Choi, Amit Jain, Kang G. Shin
SPIN
2010
Springer
13 years 6 months ago
Combining SPIN with ns-2 for Protocol Optimization
In the field of communication networks, protocol engineers usually employ several tools focused on specific kinds of analysis, such as performance or correctness. This paper pres...
Pedro Merino, Alberto Salmeron
SASN
2006
ACM
14 years 1 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia