Sciweavers

612 search results - page 90 / 123
» Locality in structured peer-to-peer networks
Sort
View
PODC
2009
ACM
14 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
PERCOM
2007
ACM
14 years 9 months ago
A Scalable Geographic Service Provision Framework for Mobile Ad Hoc Networks
Supporting scalable and efficient routing and service provision in Mobile Ad Hoc Networks (MANET) has been a big research challenge. Conventional topology-based unicast and multic...
Xiaojing Xiang, Xin Wang
JCDL
2010
ACM
187views Education» more  JCDL 2010»
14 years 9 hour ago
Social network document ranking
In search engines, ranking algorithms measure the importance and relevance of documents mainly based on the contents and relationships between documents. User attributes are usual...
Liang Gou, Xiaolong Zhang, Hung-Hsuan Chen, Jung-H...
CONEXT
2009
ACM
13 years 11 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
ICNP
2006
IEEE
14 years 4 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...