Sciweavers

1551 search results - page 278 / 311
» Network Coding-Based Broadcast in Mobile Ad-hoc Networks
Sort
View
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 2 months ago
Performance Comparison and Analysis of Preemptive-DSR and TORA
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Preemptiv...
V. Ramesh, P. Subbaiah, N. Koteswar Rao, N. Subhas...
SOCIALCOM
2010
13 years 5 months ago
GDC: Group Discovery Using Co-location Traces
Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailab...
Steve Mardenfeld, Daniel Boston, Susan Juan Pan, Q...
ICDCS
2006
IEEE
14 years 1 months ago
Search-and-Discover in Mobile P2P Network Databases
In this paper we propose a novel algorithm called Rank-Based Broadcast (RBB) for discovery of local resources in mobile P2P networks. With RBB, each moving object periodically bro...
Ouri Wolfson, Bo Xu, Huabei Yin, Hu Cao
JSS
2010
208views more  JSS 2010»
13 years 6 months ago
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay–tolerant wireless sensor networks (DTWSN). T...
Abbas Nayebi, Hamid Sarbazi-Azad, Gunnar Karlsson