Sciweavers

522 search results - page 94 / 105
» Connected k-Hop Clustering in Ad Hoc Networks
Sort
View
INFOCOM
1997
IEEE
13 years 12 months ago
Performance Analysis of Multicast Flow Control Algorithms over Combined Wired/Wireless Networks
Abstract—A multicast flow control framework for data traffic traversing both a wired and wireless network is proposed. Markov-modulated fluid (MMF) models are used for the rec...
Huayan Amy Wang, Mischa Schwartz
PERCOM
2007
ACM
14 years 7 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
WMASH
2004
ACM
14 years 1 months ago
SOWER: self-organizing wireless network for messaging
Short Message Service (SMS) has become extremely popular in many countries, and represents a multibillion dollars market. Yet many consumers consider that the price cellular netwo...
Márk Félegyházi, Srdjan Capku...
PODC
2005
ACM
14 years 1 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
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