DAHMANE et SILINI, Khawla et Loubna2020-11-262020-11-262020https://repository.univ-msila.dz/handle/123456789/21310The need for communication services is rapidly increasing, because the mobile communication service is synonymous with an ideal communication style realizing communication anytime, anywhere and with anyone. Mobile ad hoc networks (MANET) is a collection of mobile nodes connected by wireless links that form a temporary network topology that works without a base station and centralized administration. We investigate a network routing problem in this dissertation studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters, and hence the optimal path, can only be estimated by routing packets through the network and observing the realized delays. Our aim is to find a routing policy that minimizes the regret (the cumulative difference of expected delay) between the path chosen by the policy and the unknown optimal path. We formulate the problem as a combinatorial bandit optimization problem. We present results showing that an policy KL-SR (KLBASED SOURCE-ROUTING) is optimal for the routing problem by NS2 ,TCL.enMANETS , Protocoles de routage ,The regret , KL-SR (KLBASED SOURCE-ROUTING) , NS2, TCThesis