To see the other types of publications on this topic, follow the link: DYNAMIC ROUTING PROTOCOL.
Dissertations / Theses on the topic 'DYNAMIC ROUTING PROTOCOL'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 38 dissertations / theses for your research on the topic 'DYNAMIC ROUTING PROTOCOL.'
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
Macintosh, Adam. "Local area dynamic routing protocol : a position based routing protocol for MANET." Thesis, London South Bank University, 2015. http://researchopen.lsbu.ac.uk/2070/.
Full textAbstract:
A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols.
2
Nilsson, Kim. "Reactive Networking using Dynamic Link Exchange Protocol." Thesis, KTH, Kommunikationsnät, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-154832.
Full textAbstract:
This master thesis studies the possibilities of using a radio-router protocol in order to increase the quality of service in dynamic tactical network environments. We cover three radio-router protocols with emphasis on Dynamic Link Exchange Protocol (DLEP). Many applications, such as voice and video communication, have bandwidth and latency requirements which need to be fulfilled in order to provide a sufficient level of quality. This poses a problem in tactical network environments where links are typically dynamic and both bandwidth andlatency can vary. A radio-router protocol can alleviate this problem and also improve the routing in a network by allowing routers to take part of link-layer information. By using a radio link emulator (RLE) developed by Saab we are able to simulate dynamic network environments. We have performed two experiments by combining the RLE and an implementation of a subset ofthe DLEP specification draft. Both experiments simulate typical military network scenarios and allow us to analyse the effects of utilizing link-layerfeedback.Our results show that by using DLEP it is possible to provide better quality of service in highly dynamic conditions. We also show that DLEP can influence Optimized Link State Routing (OLSR) by making OLSR aware of changes in the network topology. This leads to a reduced network convergence time with only a small increase in OLSR overhead.
3
Matheus, Luiz Eduardo Mendes. "DYRP-VLC: a dynamic routing protocol for visible light communication networks." Universidade Federal de Juiz de Fora (UFJF), 2018. https://repositorio.ufjf.br/jspui/handle/ufjf/8076.
Full textAbstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2018-11-19T12:44:23Z
No. of bitstreams: 1
luizeduardomendesmatheus.pdf: 1606990 bytes, checksum: 2736fa2230ff16ef4aaa41155178b616 (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-11-23T13:06:46Z (GMT) No. of bitstreams: 1
luizeduardomendesmatheus.pdf: 1606990 bytes, checksum: 2736fa2230ff16ef4aaa41155178b616 (MD5)<br>Made available in DSpace on 2018-11-23T13:06:46Z (GMT). No. of bitstreams: 1
luizeduardomendesmatheus.pdf: 1606990 bytes, checksum: 2736fa2230ff16ef4aaa41155178b616 (MD5)
Previous issue date: 2018-09-03<br>Na última década, o interesse (acadêmico e comercial) em torno da Comunicação por Luz Visível (VLC) aumentou consideravelmente, devido a fatores como a crescente demanda por recursos sem fio na Internet e às vantagens oferecidas pela transmissão de dados através da luz visível. Entretanto, a utilização da luz como meio de comunicação, principalmente em ambientes internos, oferece diversos desafios, como interferência e bloqueios criados por obstáculos. Ao mesmo tempo, este tipo de ambiente oferece uma rica infraestrutura de fontes de luz, que podem ser utilizadas para auxiliar na comunicação através de mecanismos multi-hop. A maioria dos trabalhos presentes na literatura adotam técnicas simples para construção de mecanismos multi-hop em redes VLC, focando principalmente em aumento de distância.
Neste trabalho, foi desenvolvido um protocolo de roteamento dinâmico, DYRP-VLC (DynamicRoutingProtocolforVisibleLightCommunication),quetemcomoobjetivo aumentar o desempenho de sistemas VLC em ambientes dinâmicos, enquanto reage à obstáculos construindo rotas alternativas na rede. A avaliação do protocolo foi realizada em um ambiente real, utilizando a plataforma embarcada OpenVLC 1.0 e métricas adotadas para problemas de roteamento. Os resultados obtidos mostram que, usando o DYRP-VLC, a rede foi capaz de se adaptar a mudanças dinâmicas na comunicação, como sombras e obstáculos, com pouca sobrecarga.<br>In the last decade, the interest in Visible Light Communication (VLC) has increased considerably, from both academic and commercial perspectives, due to factors such as the growing demand for wireless resources and the advantages offered by the transmission of data through visible light. However, the use of light as a communication medium, especially in indoor environments, offers several challenges, which includes shadowing and interference caused by obstacles. At the same time, this type of environment offers a rich infrastructure of light sources, which can be used to aid communication through multi-hop mechanisms. Most of the works present in the literature adopt simple techniques to construct multi-hop mechanisms in VLC networks, focusing mainly on increasing distance. Inthisthesis,wedevelopedDYRP-VLC(DynamicRoutingProtocolforVisibleLight Communication), a reactive routing protocol which aims to increase the performance ofVLCsystemsindynamicenvironments,whilereactingtoobstaclesbyconstructing alternative routes in the network. The evaluation of the protocol was performed in a real environment, using OpenVLC 1.0 embedded platform and adopting metrics for routing problems. The results show that, by using DYRP-VLC, the network was able to adapt to dynamic changes in communication, such as shadows and obstacles, with low overhead.
4
Ramakrishnan, Karthik. "An Improved Model for the Dynamic Routing Effect Algorithm for Mobility Protocol." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/864.
Full textAbstract:
An ad-hoc network is a packet radio network in which individual mobile nodes perform routing functions. Typically, an ad-hoc networking concept allows users wanting to communicate with each other while forming a temporary network, without any form of centralized administration. Each node participating in the network performs both the host and router function, and willing to forward packets for other nodes. For this purpose a routing protocol is needed. A novel approach utilizes the uniqueness of such a network i. e. distance, location and speed of the nodes, introducing a Distance Routing Effect Algorithm for Mobility (DREAM). The protocol uses the <i>distance effect</i> and the <i>mobility rate</i> as a means to assure routing accuracy. When data needs to be exchanged between two nodes, the directional algorithm sends messages in the recorded direction of the destination node, guaranteeing the delivery by following the direction. The improved algorithm suggested within this thesis project includes an additional parameter, direction of travel, as a means of determining the location of a destination node. When data needs to be exchanged between two nodes, the directional algorithm sends messages in the recorded direction of the destination node, guaranteeing the delivery by following the direction. The end result is an enhancement to the delivery ratio, of the sent to the received packet. This also allows the reduction in the number of control packets that need to be distributed, reducing the overall control overhead of the Improved Dream protocol.
5
Jabbar, Abdul. "AeroRP: A Geolocation Assisted Aeronautical Routing Protocol for Highly Dynamic Telemetry Environments." International Foundation for Telemetering, 2009. http://hdl.handle.net/10150/605970.
Full textAbstract:
ITC/USA 2009 Conference Proceedings / The Forty-Fifth Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2009 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>With the increasing importance of networked systems for telemetry, there is a need for efficient routing algorithms in aeronautical environments. Unlike traditional mobile networks, the highly dynamic nature of airborne networks results in extremely short-lived paths, especially for multi-hop scenarios thereby necessitating domain-specific protocols. In this paper, we present the detailed design and evaluation of AeroRP, a cross-layered routing protocol designed specifically for airborne telemetry applications. AeroRP exploits the broadcast nature of the wireless medium along with the physical node location and trajectory to improve the data delivery in Mach-speed mobile scenarios We present a multi-modal protocol that addresses various operational scenarios of test and telemetry networks. Preliminary simulation results show that AeroRP significantly outperforms traditional MANET routing protocols while limiting the overhead.
6
Hari, Krishnan Prem Kumar. "Design and Analysis of a Dynamic SpaceWire Routing Protocol for Reconfigurable and Distributed On-Board Computing Systems". Thesis, Luleå tekniska universitet, Rymdteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-76534.
Full textAbstract:
Future spacecrafts will require more computational and processing power to keep up with the growing demand in requirements and complexity. ScOSA is the next generation on-board computer developed by the German Aerospace Centre (DLR). The main motivation behind ScOSA is to replace the conventional on-board computer with distributed and reconfigurable computing nodes which provides higher performance, reliability, availability and stability by using a combination of the COTS components and reliable computing processors that are space qualified. In the current ScOSA system reconfiguration and routing of data between nodes are based on a static decision graph. SpaceWire protocol is used to communicate between nodes to provide reliability. The focus of the thesis is to design and implement a dynamic routing protocol for ScOSA which can be used in future for not only communicating between the nodes but also for reconfiguration. SpaceWire IPC is a customized protocol developed by DLR to provide communication between the nodes in a distributed network and to support monitoring, management and reconfiguration services. The dynamic routing protocol proposed in this thesis is primarily derived from the monitoring mechanism used in the SpaceWire IPC. PULL type monitoring mechanism is modelled and simulated using OMNeT++. The results obtained provide a qualitative outlook of the dynamic routing protocol implemented.
7
Adugna, Leykun, and Goran Laic. "Kan projekt med öppen källkod användas delvis eller helt för at tuppfylla behoven för routing-applikationer?" Thesis, KTH, Medicinteknik och hälsosystem, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-272732.
Full textAbstract:
I dagens samhälle är det inte ovanligt för företag och organisationer att hitta bättre och alternativa mjukvaror med öppen källkod för att lösa sina behov. De söker programvaror som har de nödvändiga egenskaperna som krävs för att driva sin verksamhet och eventuellt ersätta egenutvecklad programvara för att spara tid och undvika onödiga kostnader. Denna avhandling har undersökt företagens behov av routing-applikationer och tagit fram ett förslag med hjälp av egenutvecklad testbädd. Den egenutvecklade testbädden kan användas av företag för att avgöra om den önskade öppen källkod programvara är lönsamt att implementera i ens verksamhet. Den routing-applikation som visade sig vara bättre än den befintliga är FRRouting(Free Range Routing). Lösningen som föreslås av studien har givit bevisad effekt genom ett pilotprojekt där öppen källkod har varit framgångsrikt på ett kvalitetsmässigt, funktionellt och kostnadseffektivt sätt att ersätta en befintlig programvara<br>Companies are looking into the open source community in the hope of finding a better alternative software to replace their existing software suit. They are looking for software that has the necessary properties required to run their business and possibly help them avoid unnecessary costs and save time. This thesis has examined the needs of routing application for companies and presented a suggestion by using self-developed testbed. The testbed can be used by companies to decide the beneficial of implementing the desired routing application software. The routing application that gave the best result in this study is FRRouting (Free Range Routing). The solution proposed by the study has been proven to be effective through a pilot project where open source program has been successful by retaining the expected quality, functionality in a cost-effective way.
8
Almotiri, Sultan H. "Design and Evaluation of Security Mechanism for Routing in MANETs. Elliptic Curve Diffie-Hellman cryptography mechanism to secure Dynamic Source Routing protocol (DSR) in Mobile Ad Hoc Network (MANET)." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/5718.
Full textAbstract:
Ensuring trustworthiness through mobile nodes is a serious issue. Indeed, securing the routing protocols in Mobile Ad Hoc Network (MANET) is of paramount importance. A key exchange cryptography technique is one such protocol. Trust relationship between mobile nodes is essential. Without it, security will be further threatened. The absence of infrastructure and a dynamic topology changing reduce the performance of security and trust in mobile networks. Current proposed security solutions cannot cope with eavesdroppers and misbehaving mobile nodes. Practically, designing a key exchange cryptography system is very challenging. Some key exchanges have been proposed which cause decrease in power, memory and bandwidth and increase in computational processing for each mobile node in the network consequently leading to a high overhead. Some of the trust models have been investigated to calculate the level of trust based on recommendations or reputations. These might be the cause of internal malicious attacks. Our contribution is to provide trustworthy communications among the mobile nodes in the network in order to discourage untrustworthy mobile nodes from participating in the network to gain services. As a result, we have presented an Elliptic Curve Diffie-Hellman key exchange and trust framework mechanism for securing the communication between mobile nodes. Since our proposed model uses a small key and less calculation, it leads to a reduction in memory and bandwidth without compromising on security level. Another advantage of the trust framework model is to detect and eliminate any kind of distrust route that contain any malicious node or suspects its behavior.
9
Shah, Vijay K. "A DIVERSE BAND-AWARE DYNAMIC SPECTRUM ACCESS ARCHITECTURE FOR CONNECTIVITY IN RURAL COMMUNITIES." UKnowledge, 2019. https://uknowledge.uky.edu/cs_etds/82.
Full textAbstract:
Ubiquitous connectivity plays an important role in improving the quality of life in terms of economic development, health and well being, social justice and equity, as well as in providing new educational opportunities. However, rural communities which account for 46% of the world's population lacks access to proper connectivity to avail such societal benefits, creating a huge "digital divide" between the urban and rural areas. A primary reason is that the Information and Communication Technologies (ICT) providers have less incentives to invest in rural areas due to lack of promising revenue returns. Existing research and industrial attempts in providing connectivity to rural communities suffer from severe drawbacks, such as expensive wireless spectrum licenses and infrastructures, under- and over-provisioning of spectrum resources while handling heterogeneous traffic, lack of novel wireless technologies tailored to the unique challenges and requirements of rural communities (e.g., agricultural fields).
Leveraging the recent advances in Dynamic Spectrum Access (DSA) technologies like wide band spectrum analyzers and spectrum access systems, and multi-radio access technologies (multi-RAT), this dissertation proposes a novel Diverse Band-aware DSA (d-DSA) network architecture, that addresses the drawbacks of existing standard and DSA wireless solutions, and extends ubiquitous connectivity to rural communities; a step forward in the direction of the societal and economic improvements in rural communities, and hence, narrowing the "digital divide" between the rural and urban societies. According to this paradigm, a certain wireless device is equipped with software defined radios (SDRs) that are capable of accessing multiple (un)licensed spectrum bands, such as, TV, LTE, GSM, CBRS, ISM, and possibly futuristic mmWaves. In order to fully exploit the potential of the d-DSA paradigm, while meeting heterogeneous traffic demands that may be generated in rural communities, we design efficient routing strategies and optimization techniques, which are based on a variety of tools such as graph modeling, integer linear programming, dynamic programming, and heuristic design. Our results on realistic traces in a large variety of rural scenarios show that the proposed techniques are able to meet the heterogeneous traffic requirements of rural applications, while ensuring energy efficiency and robustness of the architecture for providing connectivity to rural communities.
10
Bizagwira, Honoré. "Réseaux de capteurs sans fil étendu robuste exploitant des liens atypiques." Thesis, Clermont-Ferrand 2, 2016. http://www.theses.fr/2016CLF22770/document.
Full textAbstract:
Ce mémoire de thèse se place dans le contexte des applications de surveillance de l’environnement nécessitant des mesures régulières de caractéristiques biologiques ou géo-physiques. Il s’agit par exemple de mesurer la propagation de polluants dans les cours d’eau, de surveiller le développement de bactérie dans des eaux de baignade. Les réseaux de capteurs sans fils (RCsF) apparaissent comme des solutions économiques et fiables pour permettre l’automatisation de la collecte de telles données. Le bon fonctionnement de ces réseaux dépend de la qualité des transmissions radio, ce qui est particulièrement vrai dans des milieux où les conditions sont peu favorables à la propagation des ondes radio et où les liens peuvent donc se révéler intermittents. L’objectif de ce travail est de proposer une solution protocolaire efficace dans de telles conditions, dans le cas particulier d’un réseau de capteur déployé à la surface de l’eau. Le mémoire débute par la description d’une méthodologie, des mécanismes et d’une plate-forme destinée à explorer la qualité d’un lien radio situé à la surface de l’eau. Nous présentons différentes mesures qui ont été effectuées. Les solutions protocolaires que nous proposons prennent en compte le caractère évolutif de la topologie due à l’instabilité des liens radio afin d’améliorer l’efficacité de la collecte et de réduire la consommation énergétique des noeuds. Notre approche est basée sur la reconstruction périodique de la topologie, la communication entre les noeuds par rendez-vous définis par des fenêtres de transmissions, l’utilisation du multi-canal pour drainer les données et l’adaptation de la taille des fenêtres de transmission en fonction du trafic local. L’ensemble de ces propositions est validé par prototypage et par simulation sur NS-3. Les résultats montrent que notre solution est capable de collecter les données dans une topologie dynamique tout en réduisant à la fois le délai de collecte et la consommation énergétique<br>This thesis takes place in the context of environmental monitoring applications requiring regular measurements of biological or geophysical characteristics. These applications include for instance the measuring of the spread of pollutants in rivers, monitoring of the development of bacteria in bathing waters, etc. Wireless Sensor Networks (WSNs) provide cost-effective and reliable solutions to allow the automation of such data gathering. The good functioning of these networks depends on the quality of the radio transmissions, which is particularly true in environments where the conditions are not suitable for the propagation of radio waves and where the links may therefore be intermittent. The objective of this work is to propose an effective protocol solution under such conditions, in the particular case of a sensor network deployed on the water surface. The thesis begins with a description of the methodology, mechanisms and a platform for exploring the quality of a radio link displayed at the water surface. We present different measures that have been carried out. The protocol solutions we propose take into account the evolutionary nature of the topology due to the instability of the radio links in order to improve the efficiency of the data gathering and to reduce the energy consumption of the nodes. Our approach is based on the periodic reconstruction of the topology, the communication between nodes by appointments defined by transmission windows, the use of the multi-channel to drain the data and the adaptation of the transmission window size as a function of local traffic. All these propositions are validated by prototyping and simulation using NS-3. The results show that our solution is capable of collecting data in a dynamic topology while reducing both gathering time and energy consumption
11
Diao, Xunxing. "A resource-aware embedded commucation system for highly dynamic networks." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2011. http://tel.archives-ouvertes.fr/tel-00715649.
Full textAbstract:
Chaque année en Europe, 1.300.000 accidents de la route ont comme conséquence 1.700.000 blessés. Le coût financier d'accidents de la route est évalué à 160 milliards d'euros (approximativement le même coût aux Etats-Unis). VANET (Vehicular Ad-hoc NETwork) est une des technologies clés qui peut permettre de réduire d'une façon significative le nombre d'accidents de la route (e.g. message d'urgence signalant la présence d'un obstacle ou d'un véhicule en cas de brouillard). En plus de l'amélioration de la sécurité et du confort des conducteurs et des passagers, VANET peut contribuer à beaucoup d'applications potentielles telles que la prévision et la détection d'embouteillages, la gestion d'infrastructure de système de transport urbain (e.g. système de transport intelligent multimodal) etc. Dans cette thèse, je présenterai un système embarqué dédié à la communication inter-véhicule particulièrement pour les applications sécuritaires de passagers et de conducteurs. Nos efforts de recherche et de développement sont centrés sur deux principaux objectifs : minimiser le temps de latence intra-noeud et le délai de communication inter-véhicule en prenant en compte le changement dynamique du VANET. De ce fait pour atteindre ces objectifs, des nouvelles approches (e.g. inter-couche 'Cross-layering') ont été explorées pour respecter les contraintes de ressource (QoS, mémoire, CPU et énergie de la communication inter-véhicule) d'un système embarqué à faible coût. Le système de communication embarqué proposé comporte deux composants logiciels principaux : un protocole de communication dénommé CIVIC (Communication Inter Véhicule Intelligente et Coopérative) et un système d'exploitation temps réel appelé HEROS (Hybrid Event-driven and Real-time multitasking Operating System). CIVIC est un protocole de communication géographique à faible consommation énergétique et à faible temps de latence (délai de communication). HEROS gère contextuellement l'ensemble du système (matériel et logiciel) en minimisant le temps de latence et la consommation des ressources (CPU et mémoire). En outre, le protocole de communication CIVIC est équipé d'un système de localisation LCD-GPS (Low Cost Differential GPS). Pour tester et valider les différentes techniques et théories, la plateforme matérielle LiveNode (LImos Versatile Embedded wireless sensor NODE) a été utilisée. En effet, la plateforme LiveNode permet de développer et de prototyper rapidement des applications dans différents domaines. Le protocole de communication CIVIC est basé sur la technique de 'broadcast' à un saut ; de ce fait il est indépendant de la spécificité du réseau. Pour les expérimentations, seule la norme d'IEEE 802.15.4 (ZigBee) a été choisie comme médium d'accès sans fil. Il est à noter que le médium d'accès sans fil ZigBee a été adopté comme le médium standard pour les réseaux de capteurs sans fil (RCSFs) et le standard 6LoWPAN ; car il est peu coûteux et peu gourmand en énergie. Bien que le protocole de communication à l'origine soit conçu pour répondre aux exigences de VANET, ses domaines d'application ne sont pas limités à VANET. Par exemple il a été utilisé dans différents projets tels que MOBI+ (système de transport urbain intelligent) et NeT-ADDED (projet européen FP6 : agriculture de précision). Les VANETs et les RCSFs sont les réseaux fortement dynamiques, mais les causes de changement topologique de réseau sont différentes : dans le réseau VANET, il est dû à la mobilité des véhicules, et dans le RCSF, il est dû aux pannes des noeuds sans fil. Il est à noter que le VANET et le RCSF sont généralement considérés comme un sous-ensemble du réseau MANET (réseau ad-hoc mobile). Cependant, ils sont réellement tout à fait différents du MANET classique, et leurs similitudes et différences seront expliquées en détail dans la thèse. La contribution principale de mes travaux est le protocole CIVIC, qui échange des messages en basant sur l'information géographique des noeuds (position). Les travaux relatifs de la thèse se concentreront sur les techniques, les problèmes et les solutions de routage géographique, mais d'autres techniques de routage seront également adressées. Quelques projets relatifs au protocole de communication ont été étudiés mais leur implémentation et les aspects d'expérimentation n'ont pas été détaillés. Enfin la thèse ne présente pas simplement les techniques et concepts adoptés, et les résultats de simulation, mais en outre, elle expliquera les aspects techniques importants pour la réalisation et l'expérimentation des différentes applications ainsi que les résultats concrets obtenus.
12
Wu, Jian. "Reliable routing protocols for dynamic wireless ad hoc and sensor networks." Enschede : University of Twente [Host], 2007. http://doc.utwente.nl/58410.
Full text
13
Cho, Jin-Hee. "Design, Implementation and Analysis of Wireless Ad Hoc Messenger." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/10058.
Full textAbstract:
Popularity of mobile devices along with the presence of ad hoc networks requiring no infrastructure has contributed to recent advances in the field of mobile computing in ad hoc networks. Mobile ad hoc networks have been mostly utilized in military environments. The recent advances in ad hoc network technology now introduce a new class of applications.
In this thesis, we design, implement and analyze a multi-hop ad hoc messenger application using Pocket PCs and Microsoft .Net Compact Framework. Pocket PCs communicate wirelessly with each other using the IEEE 802.11b technology without the use of an infrastructure. The main protocol implemented in this application is based on Dynamic Source Routing (DSR), which consists of two important mechanisms, Route Discovery and Route Maintenance. We adopt DSR since DSR operates solely based on source routing and "on-demand" process, so each packet does not have to transmit any periodic advertisement packets or routing information. These characteristics are desirable for the ad hoc messenger application for which a conversation is source-initiated on-demand.
To test our application easily, we have developed a testing strategy by which a mobility configuration file is pre-generated describing the mobility pattern of each node generated based on the random waypoint mobility model. A mobility configuration file thus defines topology changes at runtime and is used by all nodes to know whether they can communicate with others in a single-hop or multi-hops during an experimental run.
We use five standard metrics to test the performance of the wireless ad hoc messenger application implemented based on DSR, namely, (1) average latency to find a new route, (2) average latency to deliver a data packet, (3) delivery ratio of data packets, (4) normalized control overhead, and (5) throughput. These metrics test the correctness and efficiency of the wireless ad hoc messenger application using the DSR protocol in an 802.11 ad hoc network that imposes limitations on bandwidth and resources of each mobile device.
We test the effectiveness of certain design alternatives for implementing the ad hoc messenger application with these five metrics under various topology change conditions by manipulating the speed and pause-time parameters in the random waypoint model. The design alternatives evaluated include (1) Sliding Window Size (SWS) for end-to-end reliable communication control; (2) the use of per-hop acknowledgement packets (called receipt packets) deigned for rapid detection of route errors by intermediate nodes; and (3) the use of cache for path look-up during route discovery and maintenance.
Our analysis results indicate that as the node speed increases, the system performance deteriorates because a higher node speed causes the network topology to change more frequently under the random waypoint mobility model, causing routes to be broken. On the other hand, as the pause time increases, the system performance improves due to a more stable network topology. For the design alternatives evaluated in our wireless ad hoc messenger, we discover that as SWS increases, the system performance also increases until it reaches an optimal SWS value that maximizes the performance due to a balance of a higher level of data parallelism introduced and a higher level of medium contention in 802.11 because of more packets being transmitted simultaneously as SWS increases. Beyond the optimal SWS, the system performance deteriorates as SWS increases because the heavy medium contention effect outweighs the benefit due to data parallelism. We also discover that the use of receipt packets is helpful in a rapidly changing network but is not beneficial in a stable network. There is a break-even point in the frequency of topology changes beyond which the use of receipt packets helps quickly detect route errors in a dynamic network and would improve the system performance. Lastly, the use of cache is rather harmful in a frequently changing network because stale information stored in the cache of a source node may adversely cause more route errors and generate a higher delay for the route discovery process. There exists a break-even point beyond which the use of cache is not beneficial.
Our wireless ad hoc messenger application can be used in a real chatting setting allowing Pocket PC users to chat instantly in 802.11 environments. The design and development of the dynamic topology simulation tool to model movements of nodes and the automatic testing and data collection tool to facilitate input data selection and output data analysis using XML are also a major contribution. The experimental results obtained indicate that there exists an optimal operational setting in the use of SWS, receipt packets and cache, suggesting that the wireless ad hoc messenger should be implemented in an adaptive manner to fine-tune these design parameters based on the current network condition and performance data monitored to maximize the system performance.<br>Master of Science
14
Antoshchenko, І. М. "Динамічна маршрутизація з використанням протоколу пограничної маршрутизації BGP". Master's thesis, Сумський державний університет, 2019. http://essuir.sumdu.edu.ua/handle/123456789/76457.
Full text
15
Шандиба, М. В. "Інформаційна технологія налаштування динамічної маршрутизації на роутерах Cisco". Master's thesis, Сумський державний університет, 2018. http://essuir.sumdu.edu.ua/handle/123456789/72252.
Full textAbstract:
Створено інформаційну технологію налаштування динамічної маршрутизації на роутерах Cisco, що значно спрощує роботу у мережевому симуляторі Cisco Packet Tracer та на реальному обладнанні, допомагає зменшити час налаштування роутера та може використовуватись на будь-якому пристрої. Для створення використано такі засоби та мови програмування: HTML, СSS, jQuery, AJAX, PHP.
16
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
17
Yu, Chen-Kan, and 余成淦. "Dynamic Routing Protocol On SS7 Networks." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/56186832411001167906.
Full textAbstract:
碩士<br>中華大學<br>資訊工程學系碩士班<br>90<br>Signaling System NO.7 has been applied to conventional Public Switched Telephone Networks（PSTN），Integrated Service Digital Networks（ISDN），Broadband-ISDNs，and Mobile Telephone Systems.
The signaling messages are routed by Signaling Transfer Points (STPs). Routing tables in STPs are setup manually. That is, the routing paths including backup paths between any two STPs are pre-determined. In cases of link failure, the routing paths are also changed manually. Due to the importance of SS7 networks, it is necessary to develop a suitable dynamically routing protocol to make SS7 networks more robust.
In this thesis, we develop a dynamic routing protocol (DRP) with OSPF advantages, open algorithm, supporting various computing of distance, dynamic routing, and adapting to hierarchical networks, but it is much simpler than OSPF.
18
Lopez, Antonio Mira. "Simulated annealing based hierarchical Q-routing a dynamic routing protocol /." 2007. http://digital.library.okstate.edu/etd/umi-okstate-2506.pdf.
Full text
19
Hsu, Yi-Ting, and 徐亦霆. "Dynamic Grey Relational Routing Protocol in MANET." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/97053434557286825072.
Full textAbstract:
碩士<br>朝陽科技大學<br>網路與通訊研究所<br>96<br>Issues relating to routing protocols are important in wireless ad hoc network research. The better of route mechanism not only save transmit time but also ensure the transmit quality and save the consumption of energy. In this thesis we present a weighted ad-hoc routing protocol that exhibits low cost and high efficiency. In our method, important factors including hop counts, bandwidth, and nodes’ residual energy are considered. Grey relational analysis is utilized to discover the importance of these factors and to decide their weighted values. We apply this weight value to the route protocol and propose a dynamic grey relational routing protocol to decide a suitable route. Simulation result shows that the performance of the proposed method is better than traditional wireless ad hoc network routing protocols.
20
Wu, Ming-Shiou, and 吳明修. "Dynamic Multi-channel Multi-path Routing Protocol forWireless Mesh Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/22320605243175756360.
Full textAbstract:
碩士<br>國立中山大學<br>電機工程學系研究所<br>98<br>With the wireless mesh network in the embedded systems related applications booming in recent years, the demand of enhancing the overall end to end network traffic and ensuring a stable connection is growing. We proposed a Dynamic Multi-channel Multi-path Routing Protocol (DMMR Protocol) to decompose contending traffics over different channel, different time and different paths to enhance the end to end network traffic. Choosing channel dynamically according to the channel usage around node in the process of finding paths can avoid inter-flow and intra-flow channel competition. We tend to choose paths with less intersection nodes to reduce the probability of multiple paths are broken at same time when a single node cannot work. We can enhance end to end network traffic further by using multiple interfaces at one node. We use NS2 to test DMMR Protocol, and analyzing the overall end to end traffic when multiple connections are setting up in the network. If the network can accept a new connection, the increment of end to end traffic is same as the traffic of the new connection. In connection robust test, a single path broken will not affect other flows in same connection and the end to end traffic in the connection will recovery immediately when the broken path is repaired.
21
KUMAR, S. P. AJITH. "ROUTING AND CONGESTION CONTROL IN OPPORTUNISTIC NETWORKS." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14606.
Full textAbstract:
ABSTRACT
Opportunistic networks are one of the most interesting evolutions of
MANETs. Mobile nodes are enabled to communicate with each other in
opportunistic networks even if there is no route to connect them. Also, nodes
are not having knowledge about the network topology, which (instead) is
necessary in MANET routing protocols. In this network routes are building
dynamically, whenever messages are en route between the sender and the
destination(s), and any potential node can be opportunistically used as the
next hop, provided it is bringing the message nearer to the destination.
These necessities make opportunistic networks a challenging and demanding
research field.
In this project, a new routing protocol named as Reduced Flooding
Epidemic Protocol (RFEP) for infrastructure-less is proposed and is an
existing Epidemic routing protocol improvement model. Its objective is to
reduce the amount of flooding done in the Epidemic protocol. Therefore it
reduces the resource consumption and network bandwidth and as well as
power of nodes that helps in maximizing the network lifetime.
Also a method for congestion control is proposed here for
opportunistic networks. Congestion is an important problem in this network
because some nodes having better connection comparing with other nodes
and so the load is unfairly distributed towards them. Therefore, a threshold
based packet forwarding scheme is proposed in this work to overcome this
issue. Number of nodes is selected as the subsequent hop to forward the
packets whose utility metric computed based on its social metrics, delay and
packet dropping probability which is higher than the current host by the
predefined threshold. The outcome shows that it generated very good results
in terms of delivery probability, overhead ratio and reduced number of
packets dropped.
22
CHEN, YU-TING, and 陳侑廷. "Improved Dynamic Routing Protocol and the Lifetime of Wireless Sensor Networks." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/95140248464771111584.
Full textAbstract:
碩士<br>東海大學<br>資訊工程學系<br>102<br>ABSTRACT
Over the past decade, research on wireless sensor networks has been active, including low power consumption and backup and routing path. Transmission of packets requires cooperation among nodes. Hence this work focuses on investigating communication protocol, topology, packet retransmission, and topology reconstruction of wireless sensor networks. Through analysis of current routing protocols of wireless sensor networks, an effective packet transmission method as well as a routing protocol is proposed to extend the life cycle of wireless sensor networks.
We propose a dynamic routing protocol for wireless sensor networks, in which a dynamic routing path is used for packet transmission mainly to avoid early death of wireless sensor networks caused by frequently sending packets to the same node from multiple nodes. Thus, the lifetime of the wireless sensor network can be prolonged by avoiding situations that the external nodes are still alive while the intermediate forwarding nodes are dead. We use Network Simulator 2 (NS2) for simulations. The experimental results show that the dynamic routing protocol has significant improvement of life time of wireless sensor networks.
In the future, we plan to do more research on design and implementation of wireless sensor networks based on the proposed dynamic routing protocol.
23
Yen, Yun-Sheng, and 顏雲生. "A Multicast Routing Protocol with Dynamic Tree Adjustment for Mobile IPv6." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/39584128597213338203.
Full textAbstract:
碩士<br>國立東華大學<br>資訊工程學系<br>91<br>Abstract
As the Internet grows faster and becomes more popular, applications such as real-time systems, on-line services, interactive games and so on have become more widespread. Moreover, the design technique for Integrated-Circuit has become more sophisticated and the ICs are much smaller. The devices (i.e. Notebook, PDA, laptop, and palmtop.) will attract more and more people. Apparently, the wireless networks will also become the best choice by people in the near future. Combining the devices with the infrastructure, people will have a more convenient way to communicate with each other.
TCP/IP is currently the standard network protocols for wired Internet. To make all the Internet services available to all mobile users. Mobile IP is proposed. Another important development for TCP/IP is the evolvement to the next generation Internet. The next generation protocol is called IPv6. Situations arise in some Internet applications that a piece of data needs to be sent to multicast receipients. This is called multicasting. In this thesis, we study the multicasting routing problem based on Mobile IPv6.
In multicasting, the mobility of sender may cause a serious problem. When a sender moved, the full delivery tree would fall so that multicast datagrams can’t forward to all receivers. In this thesis, we propose a Reverse Traffic Interface (RTI) mechanism to preserve the integrity of adjusted tree. In the mechanism, we will create a Backward-Forced Path (BFP) to re-generate a new tree without re-routing. It can ensure multicast datagrams be sent to all reachable destinations without interruption. In addition, we show that a slight modification of the DVMRP version 3, called DVMRPv6, can be used in Mobile IPv6 to support our mechanism. Finally, we use a total tree cost measures to estimate and judge our scheme and implement a simulation to manifest the effect. It shows that our proposal genuinely makes multicasting on mobiles network simpler, more efficient, and more reliable.
24
Lai, Nian-Fu, and 賴年福. "An Adaptive Transmission Range of Dynamic Source Routing Protocol in MANET." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/55ka68.
Full textAbstract:
碩士<br>國立臺北科技大學<br>電子電腦與通訊產業研發碩士專班<br>95<br>Mobile ad-hoc network (MANET) is a kind of wireless network. MANET is dynamically constructed with a group of mobile hosts within the range of wireless transmission. The characteristics of mobile devices in a MANET include the high mobility, limited bandwidth and limited power energy. To guarantee the QoS of a routing in MANET, we proposed an adaptive mechanism that nodes can adjust its radio power to forward packets base on certain conditions. That is, every node has a large and a small transmission range. Such an adaptive policy could save power energy, the node’s lifetime, and reduce the propagation delay time.
However the proposed routing protocol could search an adequate path for forwarding packets, but it needs not to maintain the information of whole MANET.
The data to be forwarded are classified into high priority mode and low priority mode. High priority data is transmitted by a large radio power, and low priority data is sent by a small radio power. The other condition to adapt the adjust transmission range is according to the residual power energy of nodes.
We use NS2 to measure the data deliver ratio, end-to-end time delay, node live ratio and the node’s hop counts. A simulation system is built to measure, analysis and compare the routing efficiency between DSR, MDSR and ADSR.
25
Dash, Anwesha, and Karishma Jain. "Energy Efficient Dynamic Source Routing Protocol For Mobile Ad hoc Networks." Thesis, 2013. http://ethesis.nitrkl.ac.in/4920/1/109CS0005.pdf.
Full textAbstract:
In a MANET, there is no Base Station i.e no fixed infrastructure and the nodes are free to move, thus network topology changes dynamically in an unpredictable manner. In this network each node acts both as a router and its job as an ordinary device. The major constraint of a network is the network parameters. These parameters are crucial in determining the network stability and reliability. Hence a better algorithm than the existing DSR algorithm is proposed to make the network transmission energy ecient. The major parameters on which the selection of the path depends is : (1) Node type and energy (2) Packet size (3) Delay in the network channel (4) no of hop counts required to reach the destination (5) Energy loss during transmission The conventional DSR algorithm uses any arbitrary path between the source and the destination pair. There is no parameter to judge the effectiveness of the path and this even floods the route cache with lengthier and multiple paths for the same source and destination. The EEDSR algorithm selects a node as a source node n then selects a set of node as destination. For each source and destination pair the best path is selected and then the parameters are collected. The average value of the parameters are taken over al the source and destination pair. This process is repeated for all the network of different dimension and a graph was plotted between no of nodes and the average parameter value. This algorithm not only enhances the network life but also minimises the effort required during the route maintenance phase. It even prevents back flooding of the packets and thus reduces the network congestion.
26
Wu, Yi-Jui, and 吳奕叡. "A Wormhole-Proof Dynamic Source Routing Protocol for Wireless Ad-hoc Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/96181651592935494498.
Full textAbstract:
碩士<br>國立交通大學<br>資訊科學與工程研究所<br>95<br>In recent years, wireless mobile ad-hoc networks (MANet) have becoming attractive and important in both research and practice. However, many previous works on MANet assume a trusty network environment, while malicious adversaries can easily disrupt, eavesdrop and intrude because of the nature of wireless communication. In this thesis, we study a particular attack called wormhole attacks, and develop a wormhole-proof dynamic source routing protocol, which requires neither time synchronization nor specialized hardware, to counter wormhole attacks. The results show that the proposed protocol can effectively detect wormhole attacks and involve less computation overhead while compared to the previous works.
27
Chiu, Jin-Shiou, and 邱錦繡. "A Novel Routing Protocol With Dynamic Support Scheme for Mobile Ad hoc Networks." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/12464089998707981665.
Full textAbstract:
碩士<br>元智大學<br>資訊工程學系<br>93<br>Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime. Each mobile host in that environment may move randomly and the movement of hosts may result in a break for the route. Therefore, the mechanism for reconstructing a new route is an important issue in Ad hoc networks.
In this thesis, we propose a novel routing protocol that utilizes some fixed hosts called supporting nodes. Supporting nodes can dynamically support a weak link (a link between two adjacent hosts which may become invalid in a short time due to mobility) to extend the life time of the route. Then, the number of route discovery process can be reduced and the average network traffic will be further minimized. The simulation results show that our proposed approach outperforms several existing schemes both in reducing the total number of network control packets and increasing the average life time of the network.
28
Su, Hon-Yu, and 蘇弘裕. "A Routing Protocol Design by Applying Dynamic Detouring to Vehicular Ad Hoc Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/32281459693675230118.
Full textAbstract:
碩士<br>崑山科技大學<br>數位生活科技研究所<br>100<br>With the advance of the technology of wireless networks, applications in vehicular communication systems are widely developed. Among these, the routing efficiency of the vehicular networks plays an important role in the quality of service. Many routing protocols in the area of mobile ad hoc networks do not find a new route unless the old route is broken. It is shown that the performance of such protocols is worse than those capable of adapting the routes dynamically before breakage if the topology changes quickly. One of the adaptive protocols proposed recently is Dynamic Link Breaking Avoidance (DLBA) and Dynamic Path Shortening (DPS), which can detour the route to avoid route breakage and shorten the route as well. As a consequence, the protocol can reduce the overhead of route discovery and increase the network performance.
DLBA-DPS was designed based on AODV routing protocol, in which a single-path is built between the source and destination nodes. In this thesis, we extend the concept of DLBA-DPS to the multipath protocol with the capability of accessing the Internet, AOMDV+. In the design of the new protocol, we found the situation that can cause routing loops and we have proposed a simple method to avoid this problem. To compare the performance of the AOMDV+ protocols with and without the scheme of DLBA-DPS, we have taken some experiments by NS2 and SUMO simulators.
29
Tendean, Robby, and 鄭健力. "Energy-Efficient Routing Protocol with Static Clustering and Dynamic Structure for Wireless Sensor Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/99736789157508726886.
Full textAbstract:
碩士<br>國立臺灣科技大學<br>資訊工程系<br>97<br>Due to limited energy of sensor nodes in a wireless sensor network, an energy-efficient routing protocol with static clustering and dynamic structure (ERP-SCDS) is designed in this paper to prolong the network lifetime. With the aid of virtual points in a corona-based wireless sensor network, static clusters with dynamic structures are formed in ERP-SCDS. Moreover, next-round cluster heads are selected in advance to avoid a deadlock when the old cluster heads die. Finally, a simple relay node selection mechanism instead of a complicated multi-hop route discovery algorithm is further designed for ERP-SCDS. Incorporating these mechanisms into ERP-SCDS enables it to form balanced cluster sizes to prolong the network lifetime. Via simulations, we demonstrate that ERP-SCDS outperforms some closely related protocols in the literature.
30
Feng, Hsiao-Ning, and 馮筱寧. "Adaptive Cache Timeout Using GPS for Dynamic Source Routing Protocol in Wireless Ad Hoc Network." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/58995318609444071881.
Full text
31
Chih-Feng, Chao. "A Cache-Based Mechanism Integrated with Dynamic Backup Routes Routing Protocol in Mobile Ad Hoc Networks." 2005. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0002-1006200514183500.
Full text
32
Chang, Wei-Lun, and 張瑋倫. "Combining dynamic channel assignment and routing protocol for solving deafness problems in multi-channel wireless mesh networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/01327290992246477313.
Full text
33
Shih, Yang Tso, and 楊左詩. "A Dynamic On-demand Multicast Routing Protocol for Adjusting Mesh Size in a Wireless Ad Hoc Network." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/84908559212047271718.
Full textAbstract:
碩士<br>國立臺灣科技大學<br>資訊管理系<br>91<br>A wireless ad hoc network is characterized by the highly-dynamic topology with limited bandwidth, memory, and power. How to design an efficient routing protocol in this environment is a challenge.
Most prior works in a wireless ad hoc network focused on developing an unicast routing protocol. However, recently multicast routing becomes an important issue because the applications using this technique become popular. As a result, several multicast routing protocols in ad hoc networks have been proposed. Among these proposed multicast routing protocols, ODMRP（On Demand Multicast Routing Protocol） has the best performance.
Therefore, we modify ODMRP and propose a Dynamic On-demand Multicast Routing Protocol, called D-ODMRP. It can appropriately adjust mesh size depending on whether the network state is stable or not. For reducing overhead and packet delivery latency, the multicast source adopts a dynamic broadcasting mechanism against the rapid change of network topology. We compare the performance of D-ODMRP and ODMRP through NS-2. Regardless of any load, D-ODMRP can achieve high packet delivery ratio as ODMRP, while the former has a less overhead than the latter. In high loaded case, D-ODMRP has the shortest packet delivery latency. These simulation results show that D-ODMRP has the better performance than ODMRP.
34
Шевченко, Назарій Андрійович, та Nazariy Shevchenko. "Аналіз протоколів маршрутизації у сучасних комп’ютерних мережах для швидкості поширення маршрутної інформації і обчислення оптимальних шляхів". Master's thesis, 2021. http://elartu.tntu.edu.ua/handle/lib/35206.
Full textAbstract:
В першому розділі проведено опис: маршрутизації маршрутизованих
протоколів у комп’ютерних мережах, види маршрутизації, класи протоколів
маршрутизації, класифікації алгоритмів маршрутизації, маршрутизації
одноадресної передачі, особливості протоколів маршрутизації стану посилань
та проведено опис відкритого протоколу маршрутизації найкоротшого шляху
(OSPF).
В другому розділі проведено огляд протоколів маршрутизації таких як:
інформаційний протокол маршрутизації (RIP), інформаційний протокол
маршрутизації (RIP) V1 і V2, протокол EIGRP та наведено особливості
вдосконаленого протоколу маршрутизації внутрішніх шлюзів (EIGRP).
В третьому розділі проведено опис протоколу маршрутизації OSPF,
наведено ролі маршрутизатора та найкоротший шлях (OSPF) і його
налаштування, описано стани протоколу (OSPF) та наведено відкриття
найкоротшого шляху в OSPF.
В четвертому розділі проведено розробку початкових налаштувань
маршрутизації протоколів «OSPF та EIGRP» для обладнання компанії Cisco.<br>The first section describes: routing of routing protocols in computer networks,
types of routing, classes of routing protocols, classification of routing algorithms,
unicast routing, features of link state routing protocols and a description of the open
path routing protocol (OSP).
The second section provides an overview of routing protocols such as: Routing
Information Protocol (RIP), Routing Information Protocol (RIP) V1 and V2, EIGRP
protocol, and features of the Advanced Internal Gateway Routing Protocol (EIGRP).
The third section describes the OSPF routing protocol, describes the roles of
the router and the shortest path (OSPF) and its settings, describes the protocol states
(OSPF), and provides the discovery of the shortest path in OSPF.
In the fourth section, the initial routing settings of the OSPF and EIGRP
protocols for Cisco equipment were developed.<br>Вступ ...7
1 Аналіз проблематики дослідження ...9
1.1 Маршрутизація маршрутизованих протоколів у комп’ютерних
мережах ... 9
1.2 Види маршрутизації ...11
1.3 Класи протоколів маршрутизації ...14
1.4 Класифікація алгоритмів маршрутизації ...16
1.5 Маршрутизація одноадресної передачі ...18
1.6 Особливості протоколів маршрутизації стану посилань ...19
1.7 Відкритий протокол маршрутизації найкоротшого шляху (OSPF) 20
1.8. Висновки до 1 розділу ...21
2 Аналіз протоколів маршрутизації ...22
2.1 Інформаційний протокол маршрутизації (RIP) ...22
2.2 Інформаційний протокол маршрутизації (RIP) V1 і V2...26
2.3 Протокол EIGRP ...29
2.4 Особливості вдосконаленого протоколу маршрутизації внутрішніх
шлюзів (EIGRP) ...31
2.5 Висновки до 2 розділу ...34
3 Дослідження динамічного протоколу OSPF ...35
3.1 Протокол маршрутизації OSPF ...35
3.2 Ролі маршрутизатора та найкоротший шлях (OSPF) і його
налаштування ...37
3.3 Стани протоколу (OSPF) ...40
3.4 Відкриття найкоротшого шляху в OSPF ...42
3.5 Висновки до розділу 3 ...44
4 Практична реалізація наукових досліджень ...45
4.1 Маршрутизатори Cisco Systems та ії особливості ...45
4.2 Проведення налаштування маршрутизатора Cisco ...46
4.3 Висновки до 4 розділу ...52
5 Охорона праці та безпека в надзвичайних ситуаціях ...53
5.1 Охорона праці ...53
5.1.1 Вимоги охорони праці при виконанні робіт на персональному
комп’ютері ...53
5.1.2 Вимоги щодо організації та обладнання робочих місць ...54
5.1.3 Вимоги безпеки під час роботи з комп’ютером ...56
5.2 Безпека в надзвичайних ситуаціях ...56
5.2.1 Міжнародний тероризм ...56
5.2.2 Структура системи БЖД ...58
5.2.3 Елементи теорії, що відповідають моделі безпеки
життєдіяльності ...62
5.3 Висновки до 5 розділу ...65
Висновки ...66
Перелік використаних джерел ...67
Додатки
35
Tseng, Chih-Jen, and 曾智仁. "Research on Dynamic IP Multicast QoS Routing Protocols." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/28146240159107672832.
Full textAbstract:
博士<br>國立臺灣科技大學<br>電子工程系<br>91<br>With the proliferation of real-time audio and video applications shared by multiple users on the Internet, the importance of multicast QoS routing increases dramatically. Many existing IP multicast routing protocols are mature enough to be standardized but they still cannot support guaranteed quality of service and their performance are still doubted. Some newly proposed QoS-aware approaches can overcome this issue but there still are many problems such as favoring bias to specific group density population, constructing poor multicast delivery tree and long routing latency that suffers in highly dynamic environment, and the scalability problem in terms of both communication and storage overhead incurred by global advertising scheme.
In this dissertation, four efficient strategies are proposed to address those issues in the field of dynamic IP multicast QoS routing protocols. First, we propose a density sensitive approach named DSDMR, which relies on the scheme of adaptive bi-direction search to overcome the problem of favoring bias to specific group density. Second, a temporal-correlated T-TBP approach is designed to improve the total cost of multicast delivery tree, which is constructed by non-arrangement Steiner tree based approaches, via path caching and route adjustment techniques. Both the DSDMR and T-TBP approaches belong to the class of on-demand based scheme, which has the strengths of constructing feasible multicast tree via the most up-to-date information, and more scalable in terms of modest communication overhead and negligible storage overhead. However, the disadvantage of long routing latency make the on-demand based scheme hard to adapt to frequently changed membership. The precomputation-based approach can overcome this problem but needs to sacrifice both communication and storage overhead. To conjoin the benefits of both kinds of approaches, we propose a hybrid approach named PPMRP protocol based on the schemes of scope-limited advertisement and probabilistic selection of precomputation routers. Furthermore, another attempt called MQOSPF is also proposed, which is a very simple multicast extension of the well-known precomputation-based unicast QoS routing protocol named QOSPF.
Recently, there are many multicast QoS routing algorithms, which strive to efficiently compute feasible multicast delivery tree, have been proposed. However, from protocol aspect, some other important concerns including both routing performance and routing overhead need to be taken into account. To demonstrate the benefits of our proposals, we compare those proposals with some newly proposed multicast QoS routing protocols. Both performance and overhead for all those protocols are evaluated through the extensive simulations.
36
Hareesh, Garimidi. "Dynamic Modeling of Routing Protocols Using Colored Petri Net." Thesis, 2015. http://ethesis.nitrkl.ac.in/6804/1/Dynamic_Hareesh_2015.pdf.
Full textAbstract:
The growth of interest and research on mobile ad-hoc networks is exponentially in recent years. In a Mobile Ad hoc NETwork (MANET), Nodes are mobile in nature, so the node movement in the dynamic environment causes frequent topology changes to the network. In this paper, we are going to model the AODV (Ad hoc On-demand Distance Vector) routing protocol and analyse the STATE SPACE diagram of AODV routing protocol using CPN TOOL to detect the problems in routing protocol and resolve the issues before implementation. Modelling in CPN tools require predefined input values to be incorporated in the states which are used to detect the neighbours and track the path from one node to another node on the network. In this model, we assume all nodes have sufficient energy. State space diagram helps to identify the loops, path breaks and dead nodes in the network. In this paper we done dynamic modelling of AODV routing protocol using cpn with the help of NS2 and MATLab. In this process we chosen a trace file from ns2 convert it into cpn input format with the help of MATLab.
37
Chen, Jing. "Design and analysis of dynamic packet scheduling protocols for unidirectional optical buses /." 2008. http://proquest.umi.com/pqdweb?did=1654494041&sid=5&Fmt=2&clientId=10361&RQT=309&VName=PQD.
Full text
38
Timo, Roy Clinton. "Information-theoretic bounds for overhead dynamic networks." Phd thesis, 2009. http://hdl.handle.net/1885/149992.
Full text