References of "Le Thi Hoai, An"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailOn quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks
Schleich, Julien UL; Danoy, Grégoire UL; Bouvry, Pascal UL et al

in ACM International Symposium on Mobility Management and Wireless Access (2010)

We propose to study the quality of CDS-based virtual backbones generated by fully distributed algorithms in mobile environments. As virtual-backbones may be used for different purposes, the importance of ... [more ▼]

We propose to study the quality of CDS-based virtual backbones generated by fully distributed algorithms in mobile environments. As virtual-backbones may be used for different purposes, the importance of a characteristic may vary accordingly. In order to deal with this variety issue, we provide a set of quality criteria quantifying different suitable aspects for virtual backbones in mobile ad hoc net- works. Distributed and localized algorithms are then compared through simulations with respect to these measures and criterion-specific optimizations are proposed for the Blackbone2 algorithm. [less ▲]

Detailed reference viewed: 53 (1 UL)
Full Text
Peer Reviewed
See detailBlackbone2, an Efficient Deterministic Algorithm for creating 2-Connected m-dominating Set-based Backbones in Ad Hoc Networks
Schleich, Julien UL; Danoy, Grégoire UL; Bouvry, Pascal UL et al

in MOBIWAC - International Symposium on Mobility Management and Wireless Access (2009)

This paper introduces Blackbone2, a novel fully decentralized algorithm that aims at creating a robust backbone in ad hoc networks. Backbone robustness is supported by a 2-Connected $m$-dominating Set, $2 ... [more ▼]

This paper introduces Blackbone2, a novel fully decentralized algorithm that aims at creating a robust backbone in ad hoc networks. Backbone robustness is supported by a 2-Connected $m$-dominating Set, $2,m$-CDS, and decentralization relies on the usage of two rules that only require two-hop knowledge in order to reduce the use of bandwidth. Blackbone2 deterministic approach guarantees a density-independent valid solution and is proved correct. The algorithm is also characterized by its efficient theoretical computation time, $\mathcal{O}(\Delta^{2})$ with $\Delta$ the average number of neighbors, which outperforms known solutions. The domination parameter, $m$, can be increased without changing the theoretical computation time. Efficiency of the Blackbone2 algorithm compared to the equivalent literature solutions is illustrated through simulations of a large panel of networks with a wide density range. [less ▲]

Detailed reference viewed: 76 (1 UL)