Reference : Blackbone2, an Efficient Deterministic Algorithm for creating 2-Connected m-dominatin...

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/16931

Title :	Blackbone2, an Efficient Deterministic Algorithm for creating 2-Connected m-dominating Set-based Backbones in Ad Hoc Networks
Language :	English
Author, co-author :	Schleich, Julien [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Danoy, Grégoire [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Bouvry, Pascal [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Le Thi Hoai, An [University Paul-Verlaine, Metz]
Publication date :	2009
Main document title :	MOBIWAC - International Symposium on Mobility Management and Wireless Access
Pages :	91-98
Peer reviewed :	Yes
On invitation :	No
Audience :	International
ISBN :	978-1-60558-617-5
Event name :	MOBIWAC - International Symposium on Mobility Management and Wireless Access
Event date :	2009
Event place (city) :	Tenerife
Event country :	Spain
Abstract :	[en] 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.
Permalink :	http://hdl.handle.net/10993/16931

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access p91-schleich.pdf Publisher postprint 554.87 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map