Log in

Relevant bibliographies by topics / Adaptive routing / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Adaptive routing.

Dissertations / Theses on the topic 'Adaptive routing'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Adaptive routing.'

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

Porwal, Rupesh. "Adaptive Selective Flooding Qos Routing." Thesis, Indian Institute of Science, 2002. https://etd.iisc.ac.in/handle/2005/3924.

Full text

Abstract:

The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that requires the availability of certain resources (such as bandwidth) to be guaranteed for them to function properly. The routing in this context, called Quality-of-Service (QoS) Routing, is the problem of finding suitable paths that meet the application's resource requirements. The majority of proposed QoS routing schemes operate by maintaining the global state of the network,

APA, Harvard, Vancouver, ISO, and other styles

2

Porwal, Rupesh. "Adaptive Selective Flooding Qos Routing." Thesis, Indian Institute of Science, 2002. http://hdl.handle.net/2005/51.

Full text

Abstract:

The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that requires the availability of certain resources (such as bandwidth) to be guaranteed for them to function properly. The routing in this context, called Quality-of-Service (QoS) Routing, is the problem of finding suitable paths that meet the application's resource requirements. The majority of proposed QoS routing schemes operate by maintaining the global state of the network, a

APA, Harvard, Vancouver, ISO, and other styles

3

Nathan, Daniel Arulananthan. "Adaptive methods for automated routing." Thesis, Coventry University, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272952.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cheung, Yuk Wai. "Adaptive routing strategy for freight transportation networks /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202004%20CHEUNG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Thanh-Son, Nguyen. "Adaptive routing for distributed multi-computer systems." Thesis, University of Westminster, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Xanthopoulos, Thucydides. "Fault tolerant adaptive routing in multicomputer networks." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36546.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.<br>Includes bibliographical references (p. 149-152).<br>by Thucydides Xanthopoulos.<br>M.S.

APA, Harvard, Vancouver, ISO, and other styles

7

Hutchison, Andrew. "Modelling adaptive routing in Wide Area Networks." Master's thesis, University of Cape Town, 1991. http://hdl.handle.net/11427/13555.

Full text

Abstract:

Bibliography: leaves 132-138.<br>This study investigates the modelling of adative routing algorithms with specific reference to the algorithm of an existing Wide Area Network (WAN). Packets in the network are routed at each node on the basis of routing tables which contain internal and external delays for each route from the node. The internal delay on a route represents the time that packets queued for transmission will have to wait before being transmitted, while the external delay on a route represents the delay to other nodes via that route. Several modelling methods are investigated and c

APA, Harvard, Vancouver, ISO, and other styles

8

Hasan, Affaf, and Ismail Liaqat. "Adaptive Probabilistic Routing in Wireless Ad Hoc Networks." Thesis, Linköpings universitet, Fysik och elektroteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94547.

Full text

Abstract:

The goal of this thesis work is to analyze how design elements and wireless attributes affect opportunistic routing, and in this context develop a new protocol. The algorithm developed aims to improve opportunistic elements in comparison to a well-known opportunistic protocol Simple Opportunistic Adaptive Routing (SOAR).

APA, Harvard, Vancouver, ISO, and other styles

9

Musolesi, Mirco. "Context-aware adaptive routing for delay tolerant networking." Thesis, University College London (University of London), 2007. http://discovery.ucl.ac.uk/1446033/.

Full text

Abstract:

Delay tolerant networking has received considerable attention from the research commu nity in the recent years. Advances in wireless and mobile technologies have enabled new application scenarios where intermittent disconnections are common and not exceptional. Examples include communication in sparse mobile ad hoc networks for emergency support, infestation-based systems for connectivity in remote areas and data collection in sensor networks for wildlife monitoring. At the same time, most of the existing research work in mobile networking is based on the assumption that a path exists between

APA, Harvard, Vancouver, ISO, and other styles

10

Ngai, John Y. Seitz Charles L. Seitz Charles L. "A framework for adaptive routing in multicomputer networks /." Diss., Pasadena, Calif. : California Institute of Technology, 1989. http://resolver.caltech.edu/CaltechETD:etd-02132007-153533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Kubička, Matěj. "Constrained Time-Dependent Adaptive Eco-Routing Navigation System." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS434/document.

Full text

Abstract:

L'éco-routage est une méthode de navigation du véhicule qui sélectionne les trajets vers une destination minimisant la consommation de carburant, la consommation d'énergie ou les émissions de polluants. C'est l'une des techniques qui tentent de réduire les coûts d'exploitation et l'empreinte environnementale du véhicule. Ce travail passe en revue les méthodes actuelles d'éco-routage et propose une nouvelle méthode pour pallier leurs insuffisances. La plupart des méthodes actuelles attribuent à chaque route du réseau routier un coût constant qui représente la consommation du véhicule ou la quan

APA, Harvard, Vancouver, ISO, and other styles

12

Quek, Henry C. "QOS management with adaptive routing for next generation internet." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA378393.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

VALDIVIA, YVAN JESUS TUPAC. "ADAPTIVE ROUTING IN DATA COMMUNICATION NETWORKS THROUGH REINFORCEMENT LEARNING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2000. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=1348@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Esta dissertação investiga a aplicação dos métodos de Reinforcement Learning na descoberta de rotas ótimas em uma rede de comunicação. Uma rede de comunicação real possui um comportamento dinâmico, mudando seu estado com o tempo. Os algoritmos de roteamento devem, portanto, oferecer rapidez na resposta às mudanças do estado da rede. O objetivo do trabalho é avaliar a aplicação de técnicas de Reinforcement Learning (RL) como base de algoritmos adaptativos de roteamento de pacotes. O problema de roteamento de pacotes sob a

APA, Harvard, Vancouver, ISO, and other styles

14

Li, Guang Yu. "Adaptive and Opportunistic QoS-based Routing Protocol in VANETs." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112142/document.

Full text

Abstract:

Les réseaux véhicules (VANET) permettent d’offrir des solutions efficaces et rentables pour diverses applications telles que celles liées à : la sécurité routière, la gestion du trafic routier et les applications multimédia en utilisant les communications sans fil multi-sauts entre les véhicules communicants. Cependant, la mise en place et le maintien de liens multi-sauts fiables dans les environnements VANET posent de réels défis principalement à cause des changements rapides de topologie et des déconnexions fréquentes des liens, ce qui conduit à l'échec et l'inefficacité des protocoles de ro

APA, Harvard, Vancouver, ISO, and other styles

15

Liu, Bin. "State-sharing mechanisms that support adaptive routing in distributed networks." Thesis, University of Birmingham, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.569177.

Full text

Abstract:

It is desirable to make packet-switched network routing algorithms adaptive to changes in the distribution of traffic loading in order to maximize the utilization of network capacity. In a distributed routing algorithm, this requires sharing routing state updates (i.e., routing information exchanges amongst routing nodes). On the one hand, the routing state-sharing is helpful to optimize distributed routing in dynamic environments; on the other hand, the information exchange consumes network resources that could be otherwise used for user traffic. When network changes take place dynamically, t

APA, Harvard, Vancouver, ISO, and other styles

16

Ramrekha, Tipu Arvind. "Cognitive and adaptive routing framework for mobile ad-hoc networks." Thesis, Kingston University, 2012. http://eprints.kingston.ac.uk/22795/.

Full text

Abstract:

In this thesis, we investigate the field of distributed multi-hopped routing in Mobile Ad Hoc Networks (MANETs). MANETs are suitable for autonomous communication in remote areas lacking infrastructures or in situations where destruction of existing infrastructures prevail. One such important communication service domain is in the field of Public Protection and Disaster Relief (PPDR) services where rescuers require high bandwidth mobile communications in an ad hoc fashion. The main objectives of this thesis is to investigate and propose a realistic framework for cognitive MANET routing that is

APA, Harvard, Vancouver, ISO, and other styles

17

JAIN, NEHA. "ENERGY AWARE AND ADAPTIVE ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1086154249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Holland, Gavin Douglas. "Adaptive protocols for mobile ad hoc networks." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1445.

Full text

Abstract:

Recent advances in low-power technologies have resulted in the proliferation of inexpensive handheld mobile computing devices. Soon, just like the Internet empow- ered a whole new world of applications for personal computers, the development and deployment of robust ubiquitous wireless networks will enable many new and exciting futuristic applications. Certain to be an important part of this future is a class of networks known as "mobile ad hoc networks." Mobile ad hoc networks (or simply "ad hoc networks") are local-area networks formed "on the spot" between collocated wireless devices. These

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Ding Ph D. Massachusetts Institute of Technology. "Autonomous Underwater Vehicle (AUV) path planning and adaptive on-board routing for adaptive rapid environmental assessment." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42292.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2007.<br>Includes bibliographical references (p. 198-204).<br>In shallow water, a large part of underwater acoustic prediction uncertainties are induced by sub-meso-to-small scale oceanographic variabilities. Conventional oceanographic measurements for capturing such ocean-acoustic environmental variabilities face the classical conflict between resolution and coverage. The Adaptive Rapid Environmental Assessment (AREA) project was proposed to resolve this conflict by optimizing the location of in-situ meas

APA, Harvard, Vancouver, ISO, and other styles

20

Anderson, Robert Blake. "Routing and Control of Unmanned Aerial Vehicles for Performing Contact-Based Tasks." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/103201.

Full text

Abstract:

In this dissertation, two main topics are explored, the vehicle routing problem (VRP) and model reference adaptive control (MRAC) for unknown nonlinear systems. The VRP and its extension, the split delivery VRP (SVRP), are analyzed to determine the effects of using two different objective functions, the total cost objective, and the last delivery objective. A worst-case analysis suggests that using the SVRP can improve total costs by as much as a factor of 2 and the last delivery by a factor that scales with the number of vehicles over the classical VRP. To test the theoretical worst-cases a

APA, Harvard, Vancouver, ISO, and other styles

21

Loucif, Samia. "Performance evaluation of Distributed Crossbar Switch Hypermesh." Thesis, University of Glasgow, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Khaw, Fook Cheon. "An expert system for adaptive part routing in computer integrated manufacturing." Ohio : Ohio University, 1987. http://www.ohiolink.edu/etd/view.cgi?ohiou1183047615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Su, Pu. "QOS IN COGNITIVE PACKET NETWORKS: ADAPTIVE ROUTING, FLOW AND CONGESTION CONTROL." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4286.

Full text

Abstract:

With the emergence of various applications that have different Quality of Service (QoS) requirements, the capability of a network to support QoS becomes more and more important and necessary. This dissertation explores QoS in Cognitive Packet Networks (CPN) by using adaptive routing, flow and congestion control. We present a detailed description and analysis of our proposed routing algorithms based on single and multiple QoS constraints. An online estimation of packet loss rate over a path is introduced. We implement and evaluate the adaptive routing scheme in an experimental CPN test-bed. Our

APA, Harvard, Vancouver, ISO, and other styles

24

Gao, Song 1976. "Optimal adaptive routing and traffic assignment in stochastic time-dependent networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30188.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2005.<br>Includes bibliographical references (p. 233-237).<br>A stochastic time-dependent (STD) network is defined by treating all link travel times at all time periods as random variables, with possible time-wise and link-wise stochastic dependency. A routing policy is a decision rule which specifies what node to take next out of the current node based on the current time and online information. A formal framework is established for optimal routing policy problems in STD networks, including g

APA, Harvard, Vancouver, ISO, and other styles

25

Eshaftri, Mohamed. "Adaptive energy management mechanisms for cluster based routing wireless sensor networks." Thesis, Edinburgh Napier University, 2017. http://researchrepository.napier.ac.uk/Output/1032654.

Full text

Abstract:

Wireless Sensor Network (WSN) technology has been one of the major avenues of Internet of Things (IoT) due to their potential role in digitising smart physical environments. WSNs are typically composed of a vast number of low-power, low–cost and multifunctional sensor nodes within an area that automatically cooperate to complete the application task. This emerging technology has already contributed to the advancement of a broad range of applications. Nevertheless, the development of WSNs is a challenging issue due to significant concerns, which need to be resolved to take full benefit of this

APA, Harvard, Vancouver, ISO, and other styles

26

Tipper, David Warren. "Adaptive routing, flow control, and buffer management in computer communication networks." Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184526.

Full text

Abstract:

Adaptive routing and flow control methods are necessary in computer networks due to the nonstationary conditions that exist in such networks. In this dissertation three distinct yet complementary approaches to modeling computer networks for performance evaluation and control under nonstationary conditions are presented namely: queueing theory, discrete event simulation, and state variable modeling. The application of these techniques to the design and performance evaluation of adaptive routing and flow control methods is demonstrated with the development of a new two-level hierarchical adaptiv

APA, Harvard, Vancouver, ISO, and other styles

27

Di, Caro Gianni. "Ant colony optimization and its application to adaptive routing in telecommunication networks." Doctoral thesis, Universite Libre de Bruxelles, 2004. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211149.

Full text

Abstract:

In ant societies, and, more in general, in insect societies, the activities of the individuals, as well as of the society as a whole, are not regulated by any explicit form of centralized control. On the other hand, adaptive and robust behaviors transcending the behavioral repertoire of the single individual can be easily observed at society level. These complex global behaviors are the result of self-organizing dynamics driven by local interactions and communications among a number of relatively simple individuals.<p><p>The simultaneous presence of these and other fascinating and unique chara

APA, Harvard, Vancouver, ISO, and other styles

28

Tsiakas, Panagiotis. "Adaptive load balancing routing algorithms for the next generation wireless telecommunications networks." Thesis, Brunel University, 2009. http://bura.brunel.ac.uk/handle/2438/7509.

Full text

Abstract:

With the rapid development of wireless networks, mesh networks are evolving as a new important technology, presenting a high research and commercial interest. Additionally, wireless mesh networks have a wide variety of applications, offering the ability to provide network access in both rural and urban areas with low cost of maintenance. One of the main functionalities of a wireless mesh network is load balancing routing, which is the procedure of finding the best, according to some criteria, routes that data need to follow to transfer from one node to another. Routing is one of the state-of-t

APA, Harvard, Vancouver, ISO, and other styles

29

Swarbrick, Ian Andrew. "Low cost, adaptive, fault tolerant routing in low dimension direct interconnection networks." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/844480/.

Full text

Abstract:

Throughput and latency are critical parameters in multiprocessor interconnection networks. These parameters are governed by the combination of routing node and interconnect performance. Recent years have seen several new interconnect technologies reach the stage of maturity where they may be applied in practical systems. One such technology is free-space optical interconnect. The problems of wiring density, low data-rates and limited integrated circuit (IC) pin-out are neatly side-stepped by the use of optical interconnect. In order to make practical use of optical interconnects, packet routin

APA, Harvard, Vancouver, ISO, and other styles

30

SUBRAMANIAN, VINOD. "SOCRATES: Self-Organized Corridor Routing and Adaptive Transmission in Extended Sensor Networks." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1037989018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Subramanian, Vinod. "SOCRATES self-organized corridor routing and adaptive transmission in extended sensor networks /." Cincinnati, Ohio : University of Cincinnati, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=ucin1037989018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kammenhuber, Nils [Verfasser]. "Traffic-adaptive routing / Nils Kammenhuber." 2008. http://d-nb.info/991745469/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Yang, shyi-chang, and 楊錫昌. "Adaptive Multicast Routing in ATM Ntworks." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/80600104834616854489.

Full text

Abstract:

碩士<br>國立中正大學<br>資訊工程學系<br>85<br>In this thesis, we study the multicast routing problem in ATM networks.The multicast routing problem, also known as the Steiner tree problem,has been well studied in the literature. However, less attention has beenmade for the definition of link costs and evaluating the performance ofmulticast routing algorithm from the network revenue point of view.Therefore, in this thesis, we first proposed two approaches,namely, the MDP and LLR approaches, for defininglin

APA, Harvard, Vancouver, ISO, and other styles

34

Tsai, Ming-Jer, and 蔡明哲. "Adaptive Fault-Tolerant Routing for Multicomputers." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/29266892549748081524.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Chen, Kui-Rong, and 陳奎融. "SELF-ADAPTIVE NETWORK QOS ROUTING MECHANISM." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/9dpz5c.

Full text

Abstract:

碩士<br>淡江大學<br>電機工程學系碩士班<br>106<br>With the rapid development of the Internet, many new specifications and protocols are proposed for solving problems in the Internet. In addition, a continued advance in functionality of network equipment, bandwidth, and stability of network made great progress in streaming media, which has a great impact on network performance. However, despite the obvious growth of the ability of Internet to provide better service quality, the principle of delivery service is still based on “best-effort” strategy, this transmission method cannot provide service quality guaran

APA, Harvard, Vancouver, ISO, and other styles

36

Huang, Yi-Zhan, and 黃奕展. "Dynamic Adaptive Routing for Heterogeneous Wireless Network." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/62763485812409931722.

Full text

Abstract:

碩士<br>國立中央大學<br>資訊工程研究所<br>89<br>This thesis presents an integrated architecture, Heterogeneous Wireless Network (HWN) and a dynamic adaptive routing protocol (DARP) for HWN. To support ubiquitous communication, HWN integrates cellular network with ad hoc network (independent Basic Service Set) in wireless local area network (WLAN) and reserves advantages of sizable coverage in cellular network and high data rate in deployable ad hoc network. It also enlarges the scope of communication for ad hoc network and improves the throughput for cellular network. Consequently, nodes in HWN can communica

APA, Harvard, Vancouver, ISO, and other styles

37

Li, Hui-Chun, and 李惠君. "Cube-based adaptive wormhole routing in hypercubes." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/75735198477776996952.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

TSAI, YIMIN, and 蔡貽敏. "ADAPTIVE ROUTING AND PERFORMANCE ANALYSIS IN MULTICOMPUTERS." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/47373606730666454427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

CHENG, WEI-KANG, and 鄭瑋剛. "Implementation of PageRank-based SDN Adaptive Routing." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/cr3gqc.

Full text

Abstract:

碩士<br>銘傳大學<br>電腦與通訊工程學系碩士班<br>107<br>As the increasing of network traffic, the links will be congested. In this thesis, we use the characteristic of SDN(Software Defined Networking) to balance the loads. The controller will capture the flow from switches, and use the PageRank algorithm to calculate the popularity of each switch. Based on the popularity, the best path will be re-routed so that the traffic will not go through the popular switch and the loads will be shared by each link.

APA, Harvard, Vancouver, ISO, and other styles

40

Agrawal, Nidhi. "Adaptive routing algorithms for fault-tolerant topologies." Thesis, 1998. http://localhost:8080/xmlui/handle/12345678/5531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wang, Hao. "Load-sensitive adaptive routing (LSAR) for computer networks." Thesis, 2003. http://hdl.handle.net/2429/14233.

Full text

Abstract:

Shortest Path First (SPF) routing protocols such as OSPF and IS-IS are the dominant intradomain Internet routing protocols nowadays, and are widely used in the Internet Service Provider (ISP) backbone networks. The weights, or the lengths, of the links in an OSPF/IS-IS network are set by the network operator and usually are not changed during the network operation. The packets are routed along the shortest paths from the sources to the destinations. The paths between the origin and destination pairs are fixed regardless of the traffic load changes, since the weights of the links are predetermi

APA, Harvard, Vancouver, ISO, and other styles

42

Lai, Yu-Ting, and 賴鈺婷. "Adaptive Zone Routing Algorithm for Ad-hoc Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/t78jkp.

Full text

Abstract:

碩士<br>國立交通大學<br>電控工程研究所<br>101<br>An ad-hoc network, constructed by a set of mobile nodes, is a decentralized small wireless network and does not require any infrastructure or the central control systems. Each mobile node in this network can either send/receive messages or help relay messages in between. This has brought up a need of an efficient routing protocol which can route packets between mobile nodes. Zone Routing Protocol (ZRP), as one of the ad-hoc routing protocols, creates a topological map of a zone for routing packets, such that the whole ad-hoc network can benefit from the local

APA, Harvard, Vancouver, ISO, and other styles

43

Chen, Chien-Lung, and 陳建龍. "Adaptive Linked-List Routing Algorithm with Wormhole Mechanism." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/qmggwc.

Full text

Abstract:

碩士<br>國立中山大學<br>電機工程學系研究所<br>104<br>Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is universally used in Internet of Things(IOT) in recent years, Chiu and Wang proposed a linked list routing algorithm with wormhole mechanism. The algorithm includes the manner of construction linked list network, data jumping for routing broken, a new node join mechanism, the manner of construction wormhole network and aim at the modbus protocol as application layer, set up suitable Modbus extension instructions for data collection. It’s an algorithm for IOT data collection. However, there are still

APA, Harvard, Vancouver, ISO, and other styles

44

Hsu, Yu-Ming, and 徐玉鳴. "Adaptive Routing Protocol for Reliable Sensor Network Applications." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/03709503381231988995.

Full text

Abstract:

碩士<br>國立東華大學<br>資訊工程學系<br>94<br>In recent years, thanks to the daily development of micro-electro-mechanical-system (MEMS) and wireless communication technology, we are able to produce the small volume, low cost and multi-function wireless sensors, we are also able to gather the mass wireless sensor and deploy them into a wireless sensor network. According to their different needs, we may apply them to environmental monitor, domestic care, security, or even military. The operation of wireless sensor network is rooted in energy. We embed the battery in the inner part of wireless sensor, but

APA, Harvard, Vancouver, ISO, and other styles

45

"Adaptive Decentralized Routing and Detection of Overlapping Communities." Doctoral diss., 2011. http://hdl.handle.net/2286/R.I.8999.

Full text

Abstract:

abstract: This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based model is provided; it creates all edges deterministically and shows an asymptotically matching upper bound on the route length. The main goal is to improve greedy routing through a decentralized machine learning process. Two c

APA, Harvard, Vancouver, ISO, and other styles

46

Ngai, John Yee-Keung. "A Framework for Adaptive Routing in Multicomputer Networks." Thesis, 1989. https://thesis.library.caltech.edu/630/1/Ngai_jy_1989.pdf.

Full text

Abstract:

<p>Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube [47] and its commercial descendents, consist of many computing nodes that interact with each other by sending and receiving messages over communication channels between the nodes. The communication networks of the second-generation machines, such as the Symult Series 2010 and the Intel iPSC2 [2], employ an oblivious wormhole-routing technique that guarantees deadlock freedom. The network performance of this highly evolved oblivious technique has reached a limit of being capable of delivering,

APA, Harvard, Vancouver, ISO, and other styles

47

Gandlur, Karthik Satyanarayana. "Implementation of adaptive routing in public logistics networks." 2002. http://www.lib.ncsu.edu/theses/available/etd-08152002-140219/unrestricted/etd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

LONARDO, ALESSANDRO. "DQN-Routing: a novel adaptive routing algorithm for torus networks based on deep reinforcement learning." Doctoral thesis, 2020. http://hdl.handle.net/11573/1362841.

Full text

Abstract:

Torus networks are widely adopted as custom interconnects in High-Performance Computing (HPC) systems because of a series of interesting features, such as their regular physical arrangement, short cabling at low dimensions, good path diversity and good performance for the rather wide class of workloads characterized by local communication patterns. One of their main disadvantages is that they have a larger diameter compared to other network topologies, resulting in an increased communication latency at large sizes. Using a relatively small sized torus network as the lowest

APA, Harvard, Vancouver, ISO, and other styles

49

Xia, Feng. "Dynamic Weight Mapping Adaptive Routing (DWMAR) for IP networks." Thesis, 2004. http://hdl.handle.net/2429/17342.

Full text

Abstract:

This thesis addresses the difficulties of both Shortest Path First (SPF) and traditional adaptive routing protocols. SPF does not respond to the link flow change so that it cannot find optimized routes for the network. Traditional adaptive routing protocols do respond to link load changes. However, the network flow varies so widely that a fixed global weight mapping function cannot be suitable for all the scenarios. That is why traditional adaptive routing protocols are prone to being unstable and counteract the benefits obtained from the link weight adaptation. Dynamic Weight Mapping Adaptive

APA, Harvard, Vancouver, ISO, and other styles

50

"Adaptive routing in data communication networks through reinforcement learning." Tese, MAXWELL, 2000. http://www.maxwell.lambda.ele.puc-rio.br/cgi-bin/db2www/PRG_0991.D2W/SHOW?Cont=1348:pt&Mat=&Sys=&Nr=&Fun=&CdLinPrg=pt.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!