Sciweavers

995 search results - page 134 / 199
» Gossip-based ad hoc routing
Sort
View
MOBIHOC
2002
ACM
15 years 11 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
ICC
2007
IEEE
155views Communications» more  ICC 2007»
15 years 5 months ago
On Supporting Robust Voice Multicasting Over Ad Hoc Wireless Networks
Abstract— In this paper, we address the problem of voice multicasting in ad hoc wireless networks. The unique characteristics of voice traffic (viz. small packet size, high pack...
G. Venkat Raju, Tamma Bheemarjuna Reddy, C. Siva R...
MSWIM
2006
ACM
15 years 5 months ago
The effect of the radio wave propagation model in mobile ad hoc networks
The simulation of wireless networks has been an important tool for researchers and the industry in the last years. Especially in the field of Mobile Ad Hoc Networking, most curre...
Arne Schmitz, Martin Wenig
ISCC
2005
IEEE
132views Communications» more  ISCC 2005»
15 years 5 months ago
A Reputation-Based Trust Mechanism for Ad Hoc Networks
— The main characterisrics of ad hoc networks are the lack of predefined infrastructure and the dynamic topology. These characteristics present some new security vulnerabilities...
Yacine Rebahi, Vicente E. Mujica V, Dorgham Sisale...
IWDC
2004
Springer
161views Communications» more  IWDC 2004»
15 years 4 months ago
Distributed Mobility Tracking for Ad Hoc Networks Based on an Autoregressive Model
Abstract. In ad hoc networks, node mobility causes the network topology to change dynamically over time, which complicates important tasks such as routing and flow control. We pro...
Zainab R. Zaidi, Brian L. Mark