Results 1-8 of 8.
Julien Schleich

Bookmark and Share    
Full Text
Peer Reviewed
See detailAn Overlay Approach for Optimising Small-World Properties in VANETs
Schleich, Julien UL; Danoy, Grégoire UL; Dorronsoro, Bernabé UL et al

in Proceedings of the 16th European Conference on Applications of Evolutionary Computation (EvoApplications) (2013)

Detailed reference viewed: 17 (0 UL)
Full Text
Peer Reviewed
See detailMinimising longest path length in communication satellite payloads via metaheuristics
Stathakis, Apostolos UL; Danoy, Grégoire UL; Schleich, Julien UL et al

in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '13 (2013)

Detailed reference viewed: 43 (6 UL)
Full Text
Peer Reviewed
See detailUAV fleet area coverage with network connectivity constraint
Schleich, Julien UL; Panchapakesan, Athithyaa; Danoy, Grégoire UL et al

in Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access (MobiWac'13) (2013)

Detailed reference viewed: 76 (3 UL)
Full Text
Peer Reviewed
See detailOptimising Satellite Payload Reconfiguration: An ILP Approach for Minimising Channel Interruptions
Stathakis, Apostolos UL; Danoy, Grégoire UL; Veneziano, Thomas UL et al

in 2nd ESA Workshop on Advanced Flexible Telecom Payloads (2012)

Detailed reference viewed: 56 (3 UL)
Full Text
See detailRobust Dominating Set based Virtual Backbones for Wireless Ad hoc Networks
Schleich, Julien UL

Doctoral thesis (2010)

Ad hoc networks are infrastructure-less spontaneous networks generally composed of wireless and mobile devices. From a practical point of view, ad hoc technologies offer solutions when infrastructure ... [more ▼]

Ad hoc networks are infrastructure-less spontaneous networks generally composed of wireless and mobile devices. From a practical point of view, ad hoc technologies offer solutions when infrastructure-based network are too costly, damaged or not suitable. Despite a wide panel of scenarios and the huge number of ad hoc capable devices currently in use, this technology is not widely used because of technical considerations mainly related to the lack of a global coordinator. In this thesis, we propose two different approaches to create virtual backbones in order to organize ad hoc networks. In a first time, we propose a centralized algorithm based on DC programming and DCA to solve the Min m-Vertex Dominating Set Problem and in a second part, we develop distributed and asynchronous algorithms, relying on 2-hop knowledge only, to build k-Vertex Connected m-Vertex Dominating Set-based Virtual Backbones. A global overview of the domain is provided through an extensive state-of-the-art and a hierarchical classification. The efficiency of both approaches is demonstrated with a wide panels of simulations, from randomly generated graphs to more realistic scenarios. [less ▲]

Detailed reference viewed: 56 (3 UL)
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: 28 (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: 47 (1 UL)