Routage dans les réseaux mobiles ad hoc

Authors: Molo, Badji
Advisor: Beaubrun, Ronald
Abstract: A mobile ad hoc network is a set of mobile nodes interconnected by a wireless technology, forming a decentralised network, without any fixed infrastructure. This type of network is characterised by a dynamic topology which randomly varies with the time. Such behaviour makes difficult the determination of routes between two mobile nodes, from where the difficulty in setting up effective routing algorithms for these networks. In this context, the MANET (Mobile Ad hoc NETwork) group proposes two categories of routing algorithms : proactive and reactive. The proactive algorithms permanently have a route for each pair of source/destination nodes, which generates an important signaling traffic. On the contrary, for the reactive algorithms, the routes are built on demand and are destroyed after their use, generating a priori a weak traffic of signalisation but also an additional delay to the construction delay (or rebuilding) of routes. Within this memory, we propose a formulation of the routing problem by taking account of the parameters such as the average end-to-end delay, the packet delivery fraction and the routing overhead. The results of simulation show that the performances of the network depend on both the traffic intensity and the nodes mobility degree.
Document Type: Mémoire de maîtrise
Issue Date: 2007
Open Access Date: 12 April 2018
Grantor: Université Laval
Collection:Thèses et mémoires

Files in this item:
Description SizeFormat 
24518.pdfTexte14.99 MBAdobe PDFThumbnail
All documents in CorpusUL are protected by Copyright Act of Canada.