Reference : Efficient and Resilient Overlay Topologies over Ad Hoc Networks
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/3341
Efficient and Resilient Overlay Topologies over Ad Hoc Networks
English
Calomme, Sandrine [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > >]
Leduc, Guy mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Sep-2007
Lecture Notes in Computer Science
Springer
4725
44-58
Yes
No
International
0302-9743
Berlin
Germany
IWSOS 2007
11-13 Sept. 2007
Lancaster
UK
[en] Ad Hoc Networks ; Overlay ; Topology
[en] We discuss what kind of overlay topology should be pro-actively built before an overlay routing protocol enters a route search process on top of it. The basic overlay structures we study are the K-Nearest Neighbours overlay topologies, connecting every overlay node to its K nearest peers. We introduce a family of optimizations, based on a pruning rule. As flooding is a key component of many route discovery mechanisms in MANETs, our performance study focusses on the delivery percentage, bandwidth consumption and time duration of flooding on the overlay. We also consider the overlay path stretch and the overlay nodes degree as respective indicators for the data transfer transmission time and overlay resilience. We finally recommend to optimize the K-Nearest Neighbours overlay topologies with the most selective pruning rule and, if necessary, to set a minimal bound on the overlay node degree for improving resilience.
EU FP6 ANA
Researchers
http://hdl.handle.net/2268/3341
10.1007/978-3-540-74917-2_6

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Restricted access
IWSOS2007.pdfPublisher postprint461.43 kBRequest copy

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.