Each day, the dream of seamless networking and connectivity everywhere is getting closer to become a reality. In this regard, mobile Ad-Hoc networks (MANETs) have been a hot topic in the last decade; but the amount of MANET usage nowadays confines to a tiny percentage of all our network connectivity in our everyday life, which connectivity through infrastructured networks has the major share. On the other hand, we know that future of networking belongs to Ad-Hocing , so for now we try to give our everyday infrastructure network a taste of Ad-Hocing ability; these types of networks are called Wireless Mesh Networks (WMN) and routing features play a vital role in their functionality. In this thesis we examine the functionality of 3 Ad-Hoc routing protocols known as AODV, OLSR and GRP using simulation method in OPNET17.5. For this goal we set up 4 different scenarios to examine the performance of these routing protocols; these scenarios vary from each other in amount of nodes, background traffic and mobility of the nodes. Performance measurements of these protocols are done by network throughput, end-end delay of the transmitted packets and packet loss ratio as our performance metrics. After the simulation run and gathering the results we study them in a comparative view, first based on each scenario and then based on each protocol. For conclusion, as former studies suggest AODV, OLSR and DRP are among the best routing protocols for WMNs, so in this research we don’t introduce the best RP based on the obtained functionality results, instead we discuss the network conditions that each of these protocols show their best functionality in them and suggest the best routing mechanism for different networks based on the analysis from the former part.

The evolution of communication networks has led us to an era where you cannot only perform surgery halfway across the world, but do so while being in the comfort of your own home. By eliminating the need for wires, wireless networks revolutionised communication networks by enabling nodes to communicate while being in a mobile state. The concept opened many doors to new applications and possibilities. Network Coding is a technique that optimises the throughput of a network by coding packets. Geo-Routing is a routing method that operates by using the geographical distances between nodes as the routing metric. Opportunistic Routing is a routing method that exploits the broadcast characteristics of wireless networks. In this thesis, we developed a routing scheme that incorporates Network Coding, Geo- Routing and energy aware conditions. It accomplishes this task by using one of the key phases constituting Opportunistic Routing. The developed routing scheme was implemented in OMNeT++. Various simulation experiments were conducted in OMNeT++ pertaining to the implemented scheme. The results indicate significant increase in performance metrics such as throughput and survivability. / Thesis (MIng (Computer and Electronic Engineering))--North-West University, Potchefstroom Campus, 2013

The evolution of communication networks has led us to an era where you cannot only perform surgery halfway across the world, but do so while being in the comfort of your own home. By eliminating the need for wires, wireless networks revolutionised communication networks by enabling nodes to communicate while being in a mobile state. The concept opened many doors to new applications and possibilities. Network Coding is a technique that optimises the throughput of a network by coding packets. Geo-Routing is a routing method that operates by using the geographical distances between nodes as the routing metric. Opportunistic Routing is a routing method that exploits the broadcast characteristics of wireless networks. In this thesis, we developed a routing scheme that incorporates Network Coding, Geo- Routing and energy aware conditions. It accomplishes this task by using one of the key phases constituting Opportunistic Routing. The developed routing scheme was implemented in OMNeT++. Various simulation experiments were conducted in OMNeT++ pertaining to the implemented scheme. The results indicate significant increase in performance metrics such as throughput and survivability. / Thesis (MIng (Computer and Electronic Engineering))--North-West University, Potchefstroom Campus, 2013

The study of matrices have been of interest to mathematicians for some time. Recently the use of matrices has assumed greater importance also in the fields of management, social science, and natural science because they are very useful in the organization and presentation of data and in the solution of linear equations. The theory of matrices is yet another type of mathematical model which we can use to solve many problems that arise in these fields. The aim of this paper is to show how we can use matrices and their mathematical model to solve some problems in the process of routing. First we will introduce the term of routing and the new approach in the process of selecting paths. We will show some simple examples. We will also pint out how we can learn about matrices in the classroom. At the end we will discuss about advantages and potential disadvantages that may occur in the described technique.

Au cours des dernières années, le trafic réseau nécessitant une qualité de service (QoS) a augmenté de façon exponentielle. Dans cette thèse, notre objectif est de trouver des routages dans les réseaux câblés et sans fil en prenant en compte les contraintes liées à la QoS et en minimisant le coût de la communication. Nous nous intéressons tout d’abord à la résolution du problème du chemin multi-contraint (MCP) pour lequel un algorithme exact efficace est proposé. Cet algorithme permet d'améliorer le temps d'exécution tout en maintenant la qualité de la solution. En ce qui concerne le problème de la diffusion multipoint (multicast) multi-contraint de coût minimal (MCMCM), une nouvelle formulation utilisant la Programmation Linéaire en Nombres Entiers est proposée. Elle permet de calculer les hiérarchies optimales, structures les plus pertinentes pour résoudre de manière exacte le problème MCMCM. Un algorithme de prétraitement efficace est également conçu pour accélérer le temps de résolution dans les réseaux de grande taille. En ce qui concerne le problème du routage avec QoS dans les « Low Power et Lossy Networks » (LLN), une solution basée sur une nouvelle fonction objective est présentée. Cette solution minimisant une longueur non linéaire est la première à prendre en compte un nombre quelconque de contraintes pour le routage avec QoS. Nous avons conçu un algorithme exact et deux algorithmes de routage heuristique pour résoudre ce problème dans les réseaux LLN avec QoS. / In recent years, the network traffic requiring Quality of Service (QoS) has been growing explosively. In this thesis, we study the multi-constrained QoS routing in networks. The objective is to find routes in wired and wireless networks taking into account constraints related to the QoS and minimizing the cost of the communication. We present several propositions. To solve the Multi-Constrained Path problem (MCP), an efficient exact algorithm is proposed. This algorithm is shown to be able to improve the execution time while maintaining the quality of the solution. Concerning the Multi-Constrained Multicast Minimum Cost problem (MCMCM), a new Integer Linear Programming (ILP) formulation is proposed to compute hierarchies, which are the exact solutions for MCMCM. An efficient preprocessing-based algorithm is also designed to accelerate the resolution time in large size networks. Regarding the problem of QoS routing in Low Power and Lossy Networks (LLNs), a new Objective Function (OF)-based solution is presented. This solution uses a non-linear length function. It is the first that takes into account any number of metrics and constraints for QoS routing. We designed an exact and two heuristic routing algorithms with QoS constraints for LLNs.

.Wireless Sensor Networks importance is rapidly increasing and becoming a vital element in the process of gathering information in almost every scientific and practical aspect, but since the sensor node is usually a small device and has a battery with very limited life, power consumption is turning out to be the main drawback of this significant technology thus a lot of work and researches is going on to find new ways to reduce the power needed to operate those sensors. One of the main power consuming functionality of this technology is the wireless transmission of the data that the sensors collect across the fields [5][6]. In order to overcome this restriction, many proposals have been made to create an optimal algorithm that can guide the way each sensor node transmit it's data in order to reduce the power needed for the transmission process. This research focuses on creating a simplified scheduling algorithm that can break up the transmission waves into chains of nodes, so that each node transmits the data that has been collected to the best available node around, and so on till the information is propagated to the main server that collects all the information and analyze them.This newly proposed algorithm takes many attributes into considerations, but the main ones are the geographical information and the load that each senor node carries. A simulation model has been created to verify the effectiveness of the algorithm and to compare how close the results to the ideal network configuration are.

This thesis presents a comparison between a basic shortest path routing policy of the Destination-Sequence Distance Vector (DSDV) protocol and two power-aware policy variations of it. In the two modified versions, the routes are selected based on the energy available on the nodes and not only the shortest path distance to the destination. Simulations are conducted for a given situation of nodes and the energy efficiency of the three aforementioned policies are evaluated for example scenarios. First, a brief overview of the theory behind the study is presented. It consists of an description of ad hoc networking, DSDV, and our energy-aware modifications to DSDV. After the fundamental theory, the method is presented. It consists of a description of how the simulated scenarios relates to a real-world scenario and the simplifications made in the model. We present an overview of the model used for simulation and the operation of the program. This section ends with an explanation of the three simulated policies: shortest path, simple weighted and doubled weighted. When the theory behind the thesis are completed, the simulations are conducted. The results are examined and a summary of their meaning is discussed. It is explained how the assumptions effect the reliability of the study and an estimation of the accuracy of the results are presented. We find that the power-aware policy variations (simple weighted and double weighted) both achieve better network lifetime than the basic shortest path policy, at the cost of slightly longer per-packet paths. These results are encouraging and show that very simple modifications to DSDV can achieve significant gains in the network lifetime, helping users get the most out of their networks. Future investigation could try to optimize these gains.

This paper considers a real world waste collection problem in which glass, metal, plastics, or paper is brought to certain waste collection points by the citizens of a certain region. The collection of this waste from the collection points is therefore a node routing problem. The waste is delivered to special sites, so called intermediate facilities (IF), that are typically not identical with the vehicle depot. Since most waste collection points need not be visited every day, a planning period of several days has to be considered. In this context three related planning problems are considered. First, the periodic vehicle routing problem with intermediate facilities (PVRP-IF) is considered and an exact problem formulation is proposed. A set of benchmark instances is developed and an efficient hybrid solution method based on variable neighborhood search and dynamic programming is presented. Second, in a real world application the PVRP-IF is modified by permitting the return of partly loaded vehicles to the depots and by considering capacity limits at the IF. An average improvement of 25% in the routing cost is obtained compared to the current solution. Finally, a different but related problem, the so called multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is considered. In this problem class just a single day is considered and the depots can act as an intermediate facility only at the end of a tour. For this problem several instances and benchmark solutions are available. It is shown that the algorithm outperforms all previously published metaheuristics for this problem class and finds the best solutions for all available benchmark instances.

[pt] Como em toda grande empresa da indústria de óleo e gás, fortemente integrada e altamente rentável, várias são as oportunidades de buscar e encontrar processos logísticos com reais possibilidades de otimização e melhoria. Neste tipo de companhia, encontramos diversas cadeias de suprimento subjacentes ao processo, que por seu porte e complexidade, seriam consideradas principais em diversas outras indústrias ou ramos de serviços. Neste contexto, a presente dissertação se propõe a analisar as etapas e percalços para implantação e manutenção de um software de roteirização como ferramenta para planejamento de frota e rota de transporte de funcionários em regime de turno de uma refinaria. O cenário escolhido para o piloto é uma refinaria de grande porte do estado do Rio de Janeiro. O estudo revisa a bibliografia existente, descreve as principais etapas de coleta e tratamento de dados, mede através do software TRANSCAD as distâncias das rotas propostas e verifica se o potencial ganho obtido em relação à solução em análise justificaria a aquisição de uma ferramenta para este fim. / [en] As in many big oil and gas companies, there are a lot of opportunities to search and find logistics processes with real possibilities for optimization and improvement. In this kind of company there are some supply chains, that are not core chains wich could be considered as main chains in many other industries or service areas due to their size and complexity. Regarding that issue, the present work proposes to analyze the steps and problems related to launching and maintaining a routing software as a solution for vehicle fleet planning and refinery s employees transportation routing. A big refinery placed in Rio de Janeiro state is the chosen scenario. This study reviews the present literature on the theme, describes the main steps on this research and data treatment, uses the software TRANSCAD to measure de length of the proposed routes and finds out if the potential gain with the software solution justifies the acquisition of this tool.

A wireless sensor network is designed to monitor events and report this information to a central location, or sink node. The information is required to efficiently travel through the network. It is the job of the routing protocol to officiate this process. With transmissions consuming the majority of the energy available to a sensor node, it becomes important to limit their usage while still maintaining reliable communication with the sink node. The aim of the research covered in this dissertation was to adapt the flat and hierarchical architectures to create a new hybrid that draws on current protocol theories. The designed and developed protocol, Hybrid Energy Efficient Routing (HEER) protocol, builds upon the initial groundwork laid out by the previously developed Simple Energy Efficient Routing (SEER) protocol designed by C.J. Leuschner. Another aspect of the work was to focus on the current lack of credibility that is present in the WSN research community. The validity of SEER was examined and tested and this led to the main focus of this research, ensuring that HEER proves to be valid. The HEER protocol for wireless sensor networks is designed such that it is computationally simple, limits the number of transmissions, employs a cross-layer approach, is reliable, is energy-aware, has limited support for mobile nodes, is energy efficient, and most importantly is credible. Sensor nodes are extremely limited when it comes to their available energy resources. To maximise the node and network lifetimes requires the designed algorithm to be energy aware and as efficient as possible. A cross-layer design approach is followed which allows for the different layers of the OSI model to interact. The HEER protocol limits the number of transmissions that are used for network operation. This is achieved by using a minimal amount of messages for network setup and by selecting the optimal route. Route selection is calculated using hop count, current energy available, energy available on the receiving node, and lastly the energy required to reach the destination node. HEER combines and expands upon the method used by SEER for route selection. Network lifetime for networks of large sizes is increased, mainly due to more efficient routing of messages. The protocol was kept computationally simple and energy efficient, thus maintaining network survivability for as long as possible. / Dissertation (MEng)--University of Pretoria, 2008. / Electrical, Electronic and Computer Engineering / unrestricted