Sciweavers

279 search results - page 35 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
MOBIHOC
2004
ACM
14 years 7 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
TAMC
2010
Springer
14 years 20 days ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
IDEAL
2007
Springer
14 years 1 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo
PERVASIVE
2008
Springer
13 years 7 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
IJSNET
2007
169views more  IJSNET 2007»
13 years 7 months ago
ART: an asymmetric and reliable transport mechanism for wireless sensor networks
: Many applications developed for wireless sensor networks (WSNs) demand for Reliable communication service, since majority of these applications are event-critical applications. T...
Nurcan Tezcan, Wenye Wang