57 search results - page 2 / 12 » On random walks in direction-aware network problems |
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
WOWMOM
2009
ACM
13 years 11 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
ICDM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...