Sciweavers

375 search results - page 43 / 75
» Probabilistic quorum systems in wireless ad hoc networks
Sort
View
MOBIHOC
2002
ACM
14 years 8 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
HASE
2008
IEEE
14 years 3 months ago
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R...
MOBIHOC
2006
ACM
14 years 8 months ago
Message ferry route design for sparse ad hoc networks with mobile nodes
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deploy...
Muhammad Mukarram Bin Tariq, Mostafa H. Ammar, Ell...
MOBIHOC
2003
ACM
14 years 8 months ago
Mobility helps security in ad hoc networks
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
Jean-Pierre Hubaux, Levente Buttyán, Srdjan...
MOBIHOC
2003
ACM
14 years 8 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra