Dissertations / Theses on the topic 'Flood routing Computer simulation'
To see the other types of publications on this topic, follow the link: Flood routing Computer simulation.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 30 dissertations / theses for your research on the topic 'Flood routing Computer simulation.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Pung, H. K. "Flood routing techniques for fibre optic local area networks with arbitrartopology." Thesis, University of Kent, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.332715.
Full text
2
Charalambous, James, University of Western Sydney, of Science Technology and Environment College, and School of Engineering and Industrial Design. "Application of Monte Carlo Simulation Technique with URBS Runoff-Routing Model for design flood estimation in large catchments." THESIS_CSTE_EID_Charalambous_J.xml, 2004. http://handle.uws.edu.au:8081/1959.7/769.
Full textAbstract:
In recent years, there have been significant researches on holistic approaches to design flood estimation in Australia. The Monte Carlo Simulation technique, an approximate form of Joint Probability Approach, has been developed and tested to small gauged catchments. This thesis presents the extension of the Monte Carlo Simulation Technique to large catchments using runoff routing model URBS. The URBS-Monte Carlo Technique(UMCT),has been applied to the Johnstone River and Upper Mary River catchments in Queensland. The thesis shows that the UMCT can be applied to large catchments and be readily used by hydrologists and floodplain managers. Further the proposed technique provides deeper insight into the hydrologic behaviour of large catchments and allows assessment of the effects of errors in inputs variables on design flood estimates. The research also highlights the problems and potentials of the UMCT for application in practical situations.Masters of Engineering (Hons.)
3
Herbert, Alan. "Towards large scale software based network routing simulation." Thesis, Rhodes University, 2015. http://hdl.handle.net/10962/d1017931.
Full textAbstract:
Software based routing simulators suffer from large simulation host requirements and are prone to slow downs because of resource limitations, as well as context switching due to user space to kernel space requests. Furthermore, hardware based simulations do not scale with the passing of time as their available resources are set at the time of manufacture. This research aims to provide a software based, scalable solution to network simulation. It aims to achieve this by a Linux kernel-based solution, through insertion of a custom kernel module. This will reduce the number of context switches by eliminating the user space context requirement, and serve to be highly compatible with any host that can run the Linux kernel. Through careful consideration in data structure choice and software component design, this routing simulator achieved results of over 7 Gbps of throughput over multiple simulated node hops on consumer hardware. Alongside this throughput, this routing simulator also brings to light scalability and the ability to instantiate and simulate networks in excess of 1 million routing nodes within 1 GB of system memory
4
Nóbrega, Rui Pedro da Silva. "Visualization and interaction in a simulation system for flood emergencies." Master's thesis, Faculdade de Ciências e Tecnologia, 2008. http://hdl.handle.net/10362/7830.
Full textAbstract:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia InformáticaThis thesis presents an interaction and visualization system for a river flood emergency simulation. It will also present a detailed study about forms of visual representation of critical elements in emergencies. All these elements are currently assembled in an application based on geographic information systems and agent simulation. Many of the goals in this thesis are interconnected with project Life-Saver. This project has the goal to develop an emergency response simulator, which needs a visualization and interaction system. The main goals of this thesis are, to create a visualization system for an emergency, to design an intuitive multimedia interface and to implement new forms of human-computer interaction. At the application level there is a representation of the simulation scenario with the multiple agent and their actions. Several studies were made to create an intuitive interface. New forms of multimedia interaction are studied and used such as interactive touch sensible boards and multi-touch panels. It is possible to load and retrieve geographic information on the scenario. The resulting architecture is used to visualize a simulation of an emergency flooding situation in a scenario where the Alqueva dam in Guadiana river fails.
5
Charalambous, James. "Application of Monte Carlo Simulation Technique with URBS Runoff-Routing Model for design flood estimation in large catchments." View thesis, 2004. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20050520.153001/index.html.
Full textAbstract:
Thesis (M.Eng. (Hons.)) -- University of Western Sydney, 2004."Masters of Engineering (Hons) thesis, University of Western Sydney, December 2004. Supervisors: Ataur Rahman and Don Carroll" Includes bibliography.
6
Kulkarni, Shrinivas Bhalachandra. "The simulation studies on a behaviour based trust routing protocol for ad hoc networks." Diss., Online access via UMI:, 2006.
Find full text
7
Kioumourtzis, Georgios A. "Simulation and evaluation of routing protocols for Mobile Ad Hoc Networks (MANETs)." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Sep%5FKioumourtzis.pdf.
Full textAbstract:
Thesis (M.S. in Systems Engineering and M.S. in Computer Science)--Naval Postgraduate School, September 2005.Thesis Advisor(s): Gilbert M. Lundy, Rex Buddenberg. Includes bibliographical references (p.133-135). Also available online.
8
Håkansson, Mikael, and Jan Renman. "Simulation and Analysis of Wireless Ad Hoc Routing Schemes." Thesis, Blekinge Tekniska Högskola, Avdelningen för telekommunikationssystem, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3359.
Full textAbstract:
An Ad Hoc network is a wireless network without any stationary infrastructure of any kind. The nodes should be able to communicate with each other using wireless links, where a packet might traverse multiple links from the source to the destination. Every node in the network acts as a router, forwarding packet from one node to another. Since Ad Hoc networks are wireless and the nodes often battery driven, it is very important that the routing protocol in use can handle a large degree of node mobility and at the same time be very energy efficient. This is not an easy thing and a numerous routing protocols for wireless Ad Hoc networks have been proposed. Our goal was to simulate and make a literature study of three completely different routing protocols for wireless Ad Hoc networks: the Dynamic Source Routing protocol (DSR), the Topology Dissemination Based on Reverse-Path Forwarding protocol (TBRPF), and the Zone Routing Protocol (ZRP).
9
Pore, Ghee Lye. "A performance analysis of routing protocols for adhoc networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Mar%5FPore.pdf.
Full textAbstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2006.Thesis Advisor(s): John C. McEachen. "March 2006." Includes bibliographical references (p. 85-89). Also available online.
10
Madani, Hadi. "Application of reservoir simulation and flow routing models to the operation of multi-reservoir system in terms of flood controlling and hydropower’s regulation." Thesis, KTH, Mark- och vattenteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171853.
Full textAbstract:
Dams are amongst the most important components of water resource systems. In many places the water regulated by and stored in dams is essential to meet the development objectives of water supply, flood control, agriculture (i.e. irrigation and livestock), industry, energy generation and other sectors. Previous studies (Gourbesvive, 2008) indicate that in the next 30 years water use will increase by 50% in the world. By 2025 about 4 billion people will live under conditions of severe water stress. Continuous deterioration in water quality in most developing countries is additional challenge. Therefore, development of priority water infrastructures and improvements of water management have essential and complementary roles in contributing to sustainable growth and energy reduction in developing countries like Sweden. One way of improving water management is through increasing the efficiency of utilization of dam reservoirs (Bosona, 2010). Reservoir operation is a complex task involving numerous hydrological, technical, economical, environmental, institutional and political considerations. There is no general algorithm that covers all type of reservoir operation problems. The choice for techniques usually depends on the reservoir specific system characteristics, data availability, the objectives specified and the constraints imposed. Goal of the mathematical modelling and simulation of a physical system is to provide the user with the relevant information used in design and/or management decision-making. However, in the absence of adequate foresight and planning for adverse impacts, past dam construction has often resulted in devastating effects for ecosystems and the livelihoods of affected communities. In this project with Hec-ResSim simulation model four reservoirs in Ore River Basin and 3 reservoirs in Lule River Basin in different location in Sweden are considered and by new operation rules, model is simulated. With consideration of two high floods event model is calibrated and new operation rules for flood control and hydropower melioration was rendered and suggested.
11
Berg, Emil. "Ad-hoc Routing in Low Bandwidth Environments." Thesis, Linköpings universitet, Programvara och system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-132194.
Full textAbstract:
AODV (Ad hoc On-demand Distance Vector routing), DSDV (Destination-Sequenced Distance-Vector routing), DSR (Dynamic Source Routing), and OLSR (Optimized Link State Routing protocol) are protocols used for routing management in ad-hoc networks. In a specific sensor data network application, nodes need information about the network topology, i.e. the network nodes and the connections between them. OLSR provides nodes with this information, while the three other protocols do not. This thesis investigates how OLSR compares to AODV, DSDV,and DSR in a low bandwidth network scenario. Two cases were analyzed: One where AODV, DSDV, and DSR distribute topology information in the application layer and one where they do not. The sensor data application was not finished when this thesis project started. Instead, a simplified traffic model of the application was used. In addition to a protocol comparison, this thesis investigates if traffic generated from the model results in high rates of packet loss, assuming low bandwidth conditions. The ns-3 network simulator was used for these investigations. This thesis shows that AODV outperforms the three other protocols regardless of whether AODV, DSDV, and DSR distribute topology information in the application layer or not. Furthermore, it is shown that running the traffic model in the low bandwidth environment is not possible without high rates of packet loss.
12
Adamek, Jordan Matthew. "Concurrent Geometric Routing." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1501087573328402.
Full text
13
Aymak, Onur. "Ad Hoc Packet Routing Simulation And Tactical Picture Display Tool For Navy." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/2/12605266/index.pdf.
Full textAbstract:
The importance of communication is vital in wartime. The capability of having all the position information of the allied and enemy forces in a single Tactical Information Display System (TIDS), maintains a great advantage for deciding what to do before the enemy reacts. A Naval Information Distributing System (NIDS) is developed for building an effective communication infrastructure between the war ships. In the designed network, besides the mobile platforms (ships), some fixed platforms (land stations) are used to transfer the information coming from these mobile platforms to all the other platforms. To demonstrate the performance and effectiveness of the Naval Information Distribution System, a discrete event simulation model is developed on a Geographic Information System. The goal of this thesis is to describe and experimentally evaluate an effective and feasible information sharing and routing system for Navy.
14
Zarekarizi, Mahkameh. "Ensemble Data Assimilation for Flood Forecasting in Operational Settings: from Noah-MP to WRF-Hydro and the National Water Model." PDXScholar, 2018. https://pdxscholar.library.pdx.edu/open_access_etds/4651.
Full textAbstract:
The National Water Center (NWC) started using the National Water Model (NWM) in 2016. The NWM delivers state-of-the-science hydrologic forecasts in the nation. The NWM aims at operationally forecasting streamflow in more than 2,000,000 river reaches while currently river forecasts are issued for 4,000. The NWM is a specific configuration of the community WRF-Hydro Land Surface Model (LSM) which has recently been introduced to the hydrologic community. The WRF-Hydro model, itself, uses another newly-developed LSM called Noah-MP as the core hydrologic model. In WRF-Hydro, Noah-MP results (such as soil moisture and runoff) are passed to routing modules. Riverine water level and discharge, among other variables, are outputted by WRF-Hydro. The NWM, WRF-Hydro, and Noah-MP have recently been developed and more research for operational accuracy is required on these models. The overarching goal in this dissertation is improving the ability of these three models in simulating and forecasting hydrological variables such as streamflow and soil moisture. Therefore, data assimilation (DA) is implemented on these models throughout this dissertation. State-of-the art DA is a procedure to integrate observations obtained from in situ gages or remotely sensed products with model output in order to improve the model forecast.
In the first chapter, remotely sensed satellite soil moisture data are assimilated into the Noah-MP model in order to improve the model simulations. The performances of two DA techniques are evaluated and compared in this chapter. To tackle the computational burden of DA, Massage Passing Interface protocols are used to augment the computational power. Successful implementation of this algorithm is demonstrated to simulate soil moisture during the Colorado flood of 2013. In the second chapter, the focus is on the WRF-Hydro model. Similarly, the ability of DA techniques in improving the performance of WRF-Hydro in simulating soil moisture and streamflow is investigated.
The results of chapter 2 show that the assimilation of soil moisture can significantly improve the performance of WRF-Hydro. The improvement can reach 58% depending on the study location. Also, assimilation of USGS streamflow observations can improve the performance up to 25%. It was also observed that soil moisture assimilation does not affect streamflow. Similarly, streamflow assimilation does not improve soil moisture. Therefore, joint assimilation of soil moisture and streamflow using multivariate DA is suggested.
Finally, in chapter 3, the uncertainties associated with flood forecasting are studied. Currently, the only uncertainty source that is taken into account is the meteorological forcings uncertainty. However, the results of the third chapter show that the initial condition uncertainty associated with the land state at the time of forecast is an important factor that has been overlooked in practice. The initial condition uncertainty is quantified using the DA. USGS streamflow observations are assimilated into the WRF-Hydro model for the past ten days before the forecasting date.
The results show that short-range forecasts are significantly sensitive to the initial condition and its associated uncertainty. It is shown that quantification of this uncertainty can improve the forecasts by approximately 80%. The findings of this dissertation highlight the importance of DA to extract the information content from the observations and then incorporate this information into the land surface models. The findings could be beneficial for flood forecasting in research and operation.
15
Lacks, Daniel Jonathan. "MODELING, DESIGN AND EVALUATION OF NETWORKING SYSTEMS AND PROTOCOLS THROUGH SIMULATION." Doctoral diss., University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3792.
Full textAbstract:
Computer modeling and simulation is a practical way to design and test a system without actually having to build it. Simulation has many benefits which apply to many different domains: it reduces costs creating different prototypes for mechanical engineers, increases the safety of chemical engineers exposed to dangerous chemicals, speeds up the time to model physical reactions, and trains soldiers to prepare for battle. The motivation behind this work is to build a common software framework that can be used to create new networking simulators on top of an HLA-based federation for distributed simulation. The goals are to model and simulate networking architectures and protocols by developing a common underlying simulation infrastructure and to reduce the time a developer has to learn the semantics of message passing and time management to free more time for experimentation and data collection and reporting. This is accomplished by evolving the simulation engine through three different applications that model three different types of network protocols. Computer networking is a good candidate for simulation because of the Internet's rapid growth that has spawned off the need for new protocols and algorithms and the desire for a common infrastructure to model these protocols and algorithms. One simulation, the 3DInterconnect simulator, simulates data transmitting through a hardware k-array n-cube network interconnect. Performance results show that k-array n-cube topologies can sustain higher traffic load than the currently used interconnects. The second simulator, Cluster Leader Logic Algorithm Simulator, simulates an ad-hoc wireless routing protocol that uses a data distribution methodology based on the GPS-QHRA routing protocol. CLL algorithm can realize a maximum of 45% power savings and maximum 25% reduced queuing delay compared to GPS-QHRA. The third simulator simulates a grid resource discovery protocol for helping Virtual Organizations to find resource on a grid network to compute or store data on. Results show that worst-case 99.43% of the discovery messages are able to find a resource provider to use for computation. The simulation engine was then built to perform basic HLA operations. Results show successful HLA functions including creating, joining, and resigning from a federation, time management, and event publication and subscription.Ph.D.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering PhD
16
Song, Jin-Hwa. "Inventory Routing Investigations." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5028.
Full textAbstract:
The elimination of distribution inefficiencies, occurring due to the timing of customers' orders is an important reason for companies to introduce vendor managed inventory programs. By managing their customers' inventories, suppliers may be able to reduce demand variability and therefore distribution costs. We develop technology to measure the effectiveness of distribution strategies. We develop a methodology that allows the computation of tight lower bounds on the total mileage required to satisfy customer demand
over a period of time. As a result, companies will be able to gain insight into the effectiveness of their distribution strategy. This technology can also be used to suggest desirable delivery patterns and to analyze tactical and strategic decisions.
Secondly, we study the inventory routing problem with continuous moves (IRP-CM). The typical inventory routing problem deals with the repeated distribution of a single product, from a single facility, with an unlimited supply, to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We introduce the IRP-CM to study two important real-life complexities: limited product
availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop a heuristic and an optimization algorithm to construct distribution
plans. The heuristic is an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology. To solve the IRP-CM to optimality, we give a time-discretized integer programming model and develop a branch-and-cut algorithm. As instances of time-discretized models tend to be large we discuss several possibilities for reducing the problem size. We introduce a set of valid inequalities, called delivery cover inequalities, in order to tighten the bounds given by the LP relaxation of the time-discretized model. We also introduce
branching schemes exploiting the underlying structure of the IRP-CM. An extensive computational study demonstrates the effectiveness of the optimization algorithm. Finally, we present an integrated approach using heuristics and optimization algorithms providing effective and efficient technology for solving inventory problems with continuous moves.
17
Betancourt, José. "Functional-input metamodeling : an application to coastal flood early warning." Thesis, Toulouse 3, 2020. http://www.theses.fr/2020TOU30097.
Full textAbstract:
Les inondations en général affectent plus de personnes que tout autre catastrophe. Au cours de la dernière décennie du 20ème siècle, plus de 1.5 milliard de personnes ont été affectées. Afin d'atténuer l'impact de ce type de catastrophe, un effort scientifique significatif a été consacré à la constitution de codes de simulation numériques pour la gestion des risques. Les codes disponibles permettent désormais de modéliser correctement les événements d'inondation côtière à une résolution assez élevée. Malheureusement, leur utilisation est fortement limitée pour l'alerte précoce, avec une simulation de quelques heures de dynamique maritime prenant plusieurs heures à plusieurs jours de temps de calcul. Cette thèse fait partie du projet ANR RISCOPE, qui vise à remédier cette limitation en construisant des métamodèles pour substituer les codes hydrodynamiques coûteux en temps de calcul. En tant qu'exigence particulière de cette application, le métamodèle doit être capable de traiter des entrées fonctionnelles correspondant à des conditions maritimes variant dans le temps. À cette fin, nous nous sommes concentrés sur les métamodèles de processus Gaussiens, développés à l'origine pour des entrées scalaires, mais maintenant disponibles aussi pour des entrées fonctionnelles. La nature des entrées a donné lieu à un certain nombre de questions sur la bonne façon de les représenter dans le métamodèle: (i) quelles entrées fonctionnelles méritent d'être conservées en tant que prédicteurs, (ii) quelle méthode de réduction de dimension (e.g., B-splines, PCA, PLS) est idéale, (iii) quelle est une dimension de projection appropriée, et (iv) quelle est une distance adéquate pour mesurer les similitudes entre les points d'entrée fonctionnels dans la fonction de covariance. Certaines de ces caractéristiques - appelées ici paramètres structurels - du modèle et d'autres telles que la famille de covariance (e.g., Gaussien, Matérn 5/2) sont souvent arbitrairement choisies a priori. Comme nous l'avons montré à travers des expériences, ces décisions peuvent avoir un fort impact sur la capacité de prédiction du métamodèle. Ainsi, sans perdre de vue notre but de contribuer à l'amélioration de l'alerte précoce des inondations côtières, nous avons entrepris la construction d'une méthodologie efficace pour définir les paramètres structurels du modèle. Comme première solution, nous avons proposé une approche d'exploration basée sur la Méthodologie de Surface de Réponse. Elle a été utilisé efficacement pour configurer le métamodèle requis pour une fonction de test analytique, ainsi que pour une version simplifiée du code étudié dans RISCOPE. Bien que relativement simple, la méthodologie proposée a pu trouver des configurations de métamodèles de capacité de prédiction élevée avec des économies allant jusqu'à 76.7% et 38.7% du temps de calcul utilisé par une approche d'exploration exhaustive dans les deux cas étudiés. [...]Currently, floods in general affect more people than any other hazard. In just the last decade of the 20th century, more than 1.5 billion were affected. In the seek to mitigate the impact of this type of hazard, strong scientific effort has been devoted to the constitution of computer codes that could be used as risk management tools. Available computer models now allow properly modelling coastal flooding events at a fairly high resolution. Unfortunately, their use is strongly prohibitive for early warning, with a simulation of few hours of maritime dynamics taking several hours to days of processing time, even on multi-processor clusters. This thesis is part of the ANR RISCOPE project, which aims at addressing this limitation by means of surrogate modeling of the hydrodynamic computer codes. As a particular requirement of this application, the metamodel should be able to deal with functional inputs corresponding to time varying maritime conditions. To this end, we focused on Gaussian process metamodels, originally developed for scalar inputs, but now available also for functional inputs. The nature of the inputs gave rise to a number of questions about the proper way to represent them in the metamodel: (i) which functional inputs are worth keeping as predictors, (ii) which dimension reduction method (e.g., B-splines, PCA, PLS) is ideal, (iii) which is a suitable projection dimension, and given our choice to work with Gaussian process metamodels, also the question of (iv) which is a convenient distance to measure similarities between functional input points within the kernel function. Some of these characteristics - hereon called structural parameters - of the model and some others such as the family of kernel (e.g., Gaussian, Matérn 5/2) are often arbitrarily chosen a priori. Sometimes, those are selected based on other studies. As one may intuit and has been shown by us through experiments, those decisions could have a strong impact on the prediction capability of the resulting model. Thus, without losing sight of our final goal of contributing to the improvement of coastal flooding early warning, we undertook the construction of an efficient methodology to set up the structural parameters of the model. As a first solution, we proposed an exploration approach based on the Response Surface Methodology. It was effectively used to tune the metamodel for an analytic toy function, as well as for a simplified version of the code studied in RISCOPE. While relatively simple, the proposed methodology was able to find metamodel configurations of high prediction capability with savings of up to 76.7% and 38.7% of the time spent by an exhaustive search approach in the analytic case and coastal flooding case, respectively. The solution found by our methodology was optimal in most cases. We developed later a second prototype based on Ant Colony Optimization (ACO). This new approach is more powerful in terms of solution time and flexibility in the features of the model allowed to be explored.[...]
18
Zhang, Xin. "Network Formation and Routing for Multi-hop Wireless Ad-Hoc Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11470.
Full textAbstract:
An energy-aware on-demand Bluetooth scatternet formation and routing protocol taking into
account network architecture and traffic pattern is proposed. The scatternet formation protocol is able to cope with multiple sources initiating
traffic simultaneously as well as prolong network lifetime. A modified Inquiry scheme using extended ID packet is introduced for fast device discovery and power efficient propagation of route request messages with low delay. A mechanism employing POLL packets in Page processes is proposed to transfer scatternet formation and route reply information without extra overhead. In addition, the energy aware forwarding nodes selection scheme is based on local information and results in more uniform network resource utilization and improved network lifetime. Simulation results show that this protocol can provide scatternet formation
with reasonable delay and with good load balance which results in prolonged network lifetime for Bluetooth-based wireless sensor networks.
In this research, a metric-based scatternet formation algorithm for the Bluetooth-based sensor motes is presented. It optimizes the Bluetooth network formation from the hop distance
and link quality perspectives. In addition, a smart repair mechanism is proposed to deal with link/node failure and recover the network connectivity promptly with low overhead. The experiments with the Intel Mote platform demonstrate the effectiveness of the optimizations.
This research also investigates the scalability of ad hoc routing protocols in very large-scale wireless ad hoc networks. A comprehensive
simulation study is conducted of the performance of an on-demand routing protocol on a very large-scale, with as many as 50,000 nodes in the network. The scalability analysis is addressed based on various network sizes, node density, traffic load, and mobility. The reasons for packet loss are analyzed and categorized at each network layer. Based on the observations, we observe the effect of the parameter selection and try to exhaust the scalability boundary
of the on-demand routing protocol for wireless ad hoc networks.
19
Othman, Salem. "Autonomous Priority Based Routing for Online Social Networks." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent1526481500145998.
Full text
20
Torkaman, Hossein. "Emulation of IP Core Network for Testing of the Serving GRPS Support Node (SGSN) Routing Application." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-3726.
Full textAbstract:
This thesis aims to investigate a method and tool for emulation of the General Packet Radio Service (GPRS) core network needed as an environment to test the routing functionality. GPRS is the most widely adopted mobile packet data delivery technology in the world. It utilizes an Intranet Protocol (IP)-based core network and involves significant changes to the way the Global System for Mobile communications (GSM) air interface is structured. It also forms the basis of the future structure of mobile network transmission and switching.
The Serving GPRS Support Node (SGSN) is the most fundamental node in GPRS. Ericsson produces and manages an increasing number of SGSN nodes in the world. One of main functionalities of SGSN node is to forward IP packets according to the destination address in the IP header on IP core network.
In each new release of SGSN, or when implementation or upgrades have been done on routing application on SGSN, design and test engineers at Ericsson need to emulate the IP core network. This must be done with use of many routers to generate huge amounts of data that can simulate the real world IP core network.
The major goal of this thesis was to analyze and verifying the use of a suitable and economical solution to emulating IP Core Network of the GPRS system for testing of different functionality of the routing application running in SGSN , instead of building up a physical Core Network with different infrastructure and many routers.
The method chosen for emulating the IP core network with many routers, and investigated in the thesis, is based on a Cisco simulator called “Dynamips”, which runs many actual Cisco Internetwork Operating Systems (IOS) with many different models of Cisco products in a virtual environment on Windows or Linux platforms. With this simulator, engineers at Ericsson will be able to use this simulator to emulate IP core network easily and efficiently to accomplish system test cases.
A conclusion of this work is that Dynamips could be used to emulate many complicated IP core network scenarios, with many routers to generate huge amounts of data to simulate the real world IP core network. The emulated system fulfils its purpose for testing of the routing application of SGSN regarding different functionality and characteristics. This is done to ensure and verify that SGSN routing application meets its functional and technical requirements, and also helps to find undiscovered errors as well as helps to ensure that the individual components of routing application on SGSN are working correctly.
21
Lol, Wilford Gibson. "An investigation of the impact of routing protocols on MANETs using simulation modelling a dissertation submitted to Auckland University of Technology in partial fufilment of the requirements for the degree of Master of Computer and Information Sciences, 2008 /." Click here to access this resource online, 2008. http://hdl.handle.net/10292/718.
Full textAbstract:
Thesis (MCIS - Computer and Information Sciences) -- AUT University, 2008.Includes bibliographical references. Also held in print ( xi, 105 leaves : ill. ; 30 cm.) in the Archive at the City Campus (T 621.382 LOL)
22
Ismailov, Alexej. "Network Monitoring in Delay Tolerant Network." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174053.
Full textAbstract:
A Disruption Tolerant Network (DTN) is a sparse network where connectivity is regulated by the proximity of mobile nodes. Connections are sporadic and the delivery rate is closely related to node movement. As network resources often are limited in such settings, it is useful to monitor the network in order to make more efficient communication decisions. This study investigates existing routing protocols and monitoring tools for DTN that best cope with the requirements of a tactical military network. A model is proposed to estimate source to destination delay in DTN. This model is evaluated in a Java-based software simulator called The ONE. In order to match the tactical military environment, two scenarios are constructed. The squad scenario simulates the formation movement pattern of several squads and the hierarchical communication scheme that is maintained in a military context. The other scenario simulates a convoy line movement of a military group during transportation. The results of this study show that the proposed mechanism can improve delivery rate and reduce network overhead in settings with strict buffer limitations. The estimation worked best in scenarios that contained some patterns of movement or communication. These patterns are resembled in the model's collected data and the model can provide the user with rough estimates of end-to-end delays in the network. Primary use of this model has been to reduce number of old messages in the network, but other applications like anomaly detection are also discussed in this work.Ett avbrottstolerant nätverk (DTN) är ett glest nät där konnektiviteten avgörs av närheten bland de rörliga noderna i nätverket. Avbrotten i ett sådant nät förekommer ofta och sporadiskt. Eftersom nätverksresurserna oftast är begränsade i sådana sammanhang, så är det lämpligt att övervaka nätverket för att göra det möjligt att fatta mer effektiva kommunikationsbeslut. Det här arbetet undersöker olika routingalgoritmer och övervakningsvektyg för DTN med hänsyn till de krav som ställs av ett taktiskt nät. En modell för att uppskatta fördröjningen från källa till destination är framtagen i arbetet. Modellen är utvärderad med hjälp av en Javabaserad mjukvarusimulator som heter The ONE. För att bäst representera den miljö som uppstår i militära sammanhang är två scenarion framtagna. Det första är ett truppscenario där nodernar rör sig i fromationer och nättrafiken följer den hierarkiska modellen som används i militär kommunikation. Det andra scenariot är ett konvojscenario där enheter marcherar på led. Resultaten från denna studie visar att den föreslagna modellen kan öka andelen levererade meddelanden och minska nätverksbelastningen i en miljö där bufferstorleken hos noderna är begränsad. Uppskattningen visade sig fungera bäst i scenarion som innehöll någon form av mönster bland nodernas rörelse eller deras kommunikation. Dessa mönster återspeglas i modellens insamlade data och modellen kan förse användaren med en grov estimering av slutfördröjningen till alla destinationer i nätet. Modellen har i huvudsak använts till att minska antalet gamla meddelanden i nätet, men arbetet berör även andra användningsområden som anomalidetektion.
23
Seo, Chung-Seok. "Physical Design of Optoelectronic System-on-a-Chip/Package Using Electrical and Optical Interconnects: CAD Tools and Algorithms." Diss., Available online, Georgia Institute of Technology, 2005, 2004. http://etd.gatech.edu/theses/available/etd-11102004-150844/.
Full textAbstract:
Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2005.David E. Schimmel, Committee Member ; C.P. Wong, Committee Member ; John A. Buck, Committee Member ; Abhijit Chatterjee, Committee Chair ; Madhavan Swaminathan, Committee Member. Vita. Includes bibliographical references.
24
Tiendrebeogo, Telesphore. "Système dynamique et réparti de nommage à indirections multiples pour les communications dans l'Internet." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00841591.
Full textAbstract:
Le routage dans Internet est basé sur des tables dites de routage, formées de blocs d'adresses IP. Cependant, la construction et la maintenance de telles tables de routage nécessitent l'utilisation de protocoles complexes qui ne passent pas à l'échelle en termes de mémoire et d'utilisation CPU. De plus, l'expérience montre que le plan d'adressage IP est insuffisant, car la sémantique d'une adresse IP est à la fois un identificateur et un localisateur. Dans nos travaux, nous proposons un système de réseau recouvrant pair-à-pair libre de toute contrainte topologique et utilisant des coordonnées virtuelles prises dans le plan hyperbolique nommé CLOAK (Covering Layer Of Abstract Knowledge en anglais). Les schémas de routages locaux basés sur des coordonnées virtuelles extraites du plan hyperbolique ont suscité un intérêt considérable ces dernières années. Dans cette thèse, nous proposons une nouvelle approche pour saisir le potentiel de la géométrie hyperbolique. L'objectif est de construire un système extensible et fiable pour créer et gérer des réseaux recouvrants dans Internet. Le système est implémenté comme une infrastructure pair-à-pair structuré basé sur les protocoles de la couche transport entre les pairs. Quant à l'organisation des données dans l'espace virtuel, nous employons la réplication pour améliorer la disponibilité et l'accessibilité des objets de l'overlay potentiellement instable. Nous avons implémenté et évalué différentes méthodes de réplication (réplication radiale, réplication circulaire).A l'aide de simulations, nous évaluons notre proposition à travers un certain nombre de métriques et nous montrons que les réseaux recouvrants pair-à-pair basés sur la géométrie hyperbolique ont de bonnes performances par rapport aux autres DHT existantes tout en introduisant flexibilité et robustesse dans les réseaux recouvrants dynamiques.
25
Wickman, Axel. "Exploring feasibility of reinforcement learning flight route planning." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-178314.
Full textAbstract:
This thesis explores and compares traditional and reinforcement learning (RL) methods of performing 2D flight path planning in 3D space. A wide overview of natural, classic, and learning approaches to planning s done in conjunction with a review of some general recurring problems and tradeoffs that appear within planning. This general background then serves as a basis for motivating different possible solutions for this specific problem. These solutions are implemented, together with a testbed inform of a parallelizable simulation environment. This environment makes use of random world generation and physics combined with an aerodynamical model. An A* planner, a local RL planner, and a global RL planner are developed and compared against each other in terms of performance, speed, and general behavior. An autopilot model is also trained and used both to measure flight feasibility and to constrain the planners to followable paths. All planners were partially successful, with the global planner exhibiting the highest overall performance. The RL planners were also found to be more reliable in terms of both speed and followability because of their ability to leave difficult decisions to the autopilot. From this it is concluded that machine learning in general, and reinforcement learning in particular, is a promising future avenue for solving the problem of flight route planning in dangerous environments.
26
SU, WEN-DA, and 蘇文達. "A study of the numerical simulation of flood routing of lower Tamsui River." Thesis, 1986. http://ndltd.ncl.edu.tw/handle/58715214132463633435.
Full text
27
Choi, Jangmin. "Simulation studies of routing algorithms for multicomputer systems." Thesis, 1995. http://hdl.handle.net/1957/34987.
Full textAbstract:
Efficient routing of messages is critical to the performance of multicomputers.
Many adaptive routing algorithms have been proposed to improve the network
efficiency; however, they can make only short-sighted decisions to choose a channel
for message routing because of limited information about network condition. The
short-sighted decisions may cause unnecessary waits at the next clock cycle if the
adaptive routing algorithm chooses a channel which has high probability of message
block at the next clock cycle.
In this thesis, look-ahead routing scheme is introduced to provide better
performance for conventional adaptive routing algorithms. The look-ahead scheme
as an adaptive routing algorithm makes longer-sighted decision to avoid possible
blocks at the next clock cycle.
This thesis also simulates the XY, the West-First, and the Double-Y channel
routing algorithms, which are deterministic, partially-adaptive and fully-adaptive,
respectively, in a 16 x 16 mesh network. Their performances are compared and
analyzed. The simulation includes the examination of look-ahead effect for the
West-First and the Double-Y channel routing algorithms.Graduation date: 1996
28
Perdikaris, John. "Guelph Flood Forecasting Model (GFLOOD): An Innovative Modelling Approach for Estimating Flows and Water Levels in Streams." Thesis, 2013. http://hdl.handle.net/10214/6652.
Full textAbstract:
The analysis of large-scale watershed processes and development of an efficient and integrated modelling platform is the focus of this research. The research focused on developing a series of modelling tools that can be used in the simulation of the overall response of a watershed based on a localized or distributed hydrologic event. This is achieved through the introduction of a hybrid modelling concept using a combination of empirically based lumped hydrologic processes and a physics-based distributed model representation. The watershed simulation model (GFLOOD) was developed to account for the complexity of the watershed including the variations in climate, soils, topography, and landuse conditions across the watershed. GFLOOD stands for Guelph Flood Forecasting Model, a river basin or watershed scale flow prediction model.
Two major modelling components of the GFLOOD model are the time parameters (time of concentration (Tc) and recession constant (K)) and the channel routing component. Each of these modelling components is evaluated separately. The equations developed in this study for estimating the time parameters can be used as an initial estimate for Tc and K for ungauged basins, and through calibration and/or sensitivity analysis the values of Tc and K can be finalized. The Saint Venant equations for flood routing are solved by transforming the momentum equation into a partial differential equation which has six parameters related to cross-sectional area and discharge of the channel, left floodplain and right floodplain. The simplified dynamic model was further modified to account for transmission losses, evaporation losses and bank storage within the channel. The model was compared with the solutions of the general dynamic wave model, diffusion wave model and the more complex dynamic wave model. The comparison shows that there is good agreement between the results of the simplified dynamic model and the other models however, the simplified dynamic model is easier to formulate and compute than the other models. The complete GFLOOD model was applied to the Welland River Watershed within Southern Ontario. The model was evaluated for its ability to predict streamflow and water levels along the main branch of the Welland River.
29
Kabeto, Mieso Denko. "The design and simulation of routing protocols for mobile ad hoc networks." Thesis, 2000. http://hdl.handle.net/10413/4421.
Full textAbstract:
This thesis addresses a novel type of network known as a mobile ad hoc
network. A mobile ad hoc network is a collection of entirely mobile nodes
that can establish communication in the absence of any fixed infrastructure.
Envisioned applications of these networks include virtual classrooms, emergency
relief operations, military tactical communications, sensor networks
and community networking.
Mobile ad hoc networking poses several new challenges in the design of
network protocols. This thesis focuses on the routing problem. The main
challenges in the design of a routing protocol for mobile ad hoc networks result
from them having limited resources and there being frequent topological
changes that occur unpredictably. Moreover, there is no fixed infrastructure
that supports routing. The conventional routing protocols are not generally
suitable for mobile ad hoc networks, as they cannot react quickly to the
changing network topology, cause excessive communication and computation,
or converge very slowly creating routing loops.
In this thesis we propose two classes of routing schemes for mobile ad hoc
networks. The first class is known as Limited Flooding Protocol. The protocol
is fully reactive and does not require the computation of routing tables. It
uses some basic principles of flooding, but reduces the communication overhead
by restricting packet propagation through the network. Several variations
of limited flooding are considered including deterministic, randomised
and priority-based mechanisms. The main advantage of this protocol is that
it can be used in networks with unpredictable topological changes and highly
mobile nodes, since maintaining routing table at the intermediate nodes is
not required.
The second class of routing protocols is based on hierarchical clustering
architecture and is intended for use in a relatively low mobility environment.
The basic idea of this protocol is to partition the entire network into smaller
units known as clusters and define routing mechanisms both within and between
clusters using a hierarchical architecture. The main advantage of this
architecture is reduction of storage requirements of routing information, communication
overhead and computational overhead at each node.
Discrete-event simulation is used for modelling and performance evaluation.
Various options and variations of the protocols are examined in the…[Page 2 of abstract is missing.]Thesis (Ph.D.)-University of Natal, Durban, 2000.
30
Chen, Mingye. "Performance evaluation of routing protocols using NS-2 and realistic traces on driving simulator." Thesis, 2014. http://hdl.handle.net/1805/4437.
Full textAbstract:
Indiana University-Purdue University Indianapolis (IUPUI)With the rapid growth in wireless mobile communication technology, Vehicular Ad-hoc Network (VANET) has emerged as a promising method to effectively solve transportation-related issues. So far, most of researches on VANETs have been conducted with simulations as the real-world experiment is expensive. A core problem affecting the fidelity of simulation is the mobility model employed. In this thesis, a sophisticated traffic simulator capable of generating realistic vehicle traces is introduced. Combined with network simulator NS-2, we used this tool to evaluate the general performance of several routing protocols and studied the impact of intersections on simulation results. We show that static nodes near the intersection tend to become more active in packet delivery with higher transferred throughput.