Log in

Relevant bibliographies by topics / Routers (Computer networks) / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Routers (Computer networks).

Dissertations / Theses on the topic 'Routers (Computer networks)'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 August 2024

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 'Routers (Computer networks).'

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

Prado, Alexandre B. "Auto-configuration of Cisco routers with application software /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03sep%5FPrado.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Awad, Ashraf A. "Scalable application-aware router mechanisms." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04052004-180005/unrestricted/awad%5Fashraf%5Fa%5F200312%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tam, Wing-yan. "Quality of service routing with path information aggregation." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36782956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Al-Amoudi, Ahmed. "Evaluation of virtual routing appliances as routers in a virtual environment /." Online version of thesis, 2008. http://hdl.handle.net/1850/7544.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

林俊？ and Chun-wing Lam. "Fault-tolerant routing for unidirectional networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29506530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shah, Subodh. "CAD-HOC a CAD like tool for generating mobility benchmarks in ad-hoc networks /." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1049/FinalETDCopy.pdf.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2001.<br>Title from first page of PDF file. Document formatted into pages; contains xiii, 90 p.; also contains graphics. Vita. Includes bibliographical references (p. 85-89).

APA, Harvard, Vancouver, ISO, and other styles

7

Vik, Knut-Helge. "Quality of service aware source initiated ad-hoc routing." Online access for everyone, 2004. http://www.dissertations.wsu.edu/thesis/Spring2004/K%5FVik%5F050704.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zang, Joanna Q. "Design of a redundancy protocol /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

He, Rongsen. "Indirect interconnection networks for high performance routers/switches." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/R_He_072307.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Feng. "Building scalable next generation Internet routers /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20WANGF.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Zhang, Lei. "Alleviating problems due to resource constraints in computer networks using additional information /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20ZHANGL.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Wallace, Brian T. "Automated system for load-balancing EBGP peers." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0008800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Kuhr, Mark Gregory Hamilton John A. "An adaptive jam-resistant cross-layer protocol for mobile ad-hoc networks In noisy environments." Auburn, Ala., 2009. http://hdl.handle.net/10415/1611.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Tam, Wing-yan, and 譚泳茵. "Quality of service routing with path information aggregation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B36782956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ke, Yu-Kung. "Scalable mechanisms for IP QoS-based routing with performance objective." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13753.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Lu, Zhenxin, and 蘆振鑫. "Location-aware routing with reduced location maintenance routing for Ad hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29737308.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Vishwanathan, Roopa Tate Stephen R. "Power-benefit analysis of erasure encoding with redundant routing in sensor networks." [Denton, Tex.] : University of North Texas, 2006. http://digital.library.unt.edu/permalink/meta-dc-5426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Zhang, Jin. "Relay and routing selection in relay-based wireless networks /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20ZHANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhao, Ting. "Fast IP lookup engine /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202004%20ZHAOT.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Lee, Chung-Wei. "Altruistic QoS routing and multi-path multimedia communication." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp4085/dissertation6.pdf.

Full text

Abstract:

Thesis (Ph. D.)--University of Florida, 2001.<br>Title from first page of PDF file. Document formatted into pages; contains xi, 86 p.; also contains graphics. Vita. Includes bibliographical references (p. 82-85).

APA, Harvard, Vancouver, ISO, and other styles

21

Kothapalli, Hindu. "Localization of nodes in wired and wireless networks." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Kothapalli_09007dcc806b7c59.pdf.

Full text

Abstract:

Thesis (M.S.)--Missouri University of Science and Technology, 2009.<br>Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed August 25, 2009) Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

22

Chan, Michael Chi Fung. "MOLE : multi-hop object location in wireless mesh networks /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20CHAN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Spring, Neil Timothy. "Efficient discovery of network topology and routing policy in the Internet /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/6985.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Gao, Xin. "A space-efficient wireless mesh network : architecture, frequency planning and routing /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20GAO.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Herbert, Alan. "Towards large scale software based network routing simulation." Thesis, Rhodes University, 2015. http://hdl.handle.net/10962/d1017931.

Full text

Abstract:

Software based routing simulators suffer from large simulation host requirements and are prone to slow downs because of resource limitations, as well as context switching due to user space to kernel space requests. Furthermore, hardware based simulations do not scale with the passing of time as their available resources are set at the time of manufacture. This research aims to provide a software based, scalable solution to network simulation. It aims to achieve this by a Linux kernel-based solution, through insertion of a custom kernel module. This will reduce the number of context switches by eliminating the user space context requirement, and serve to be highly compatible with any host that can run the Linux kernel. Through careful consideration in data structure choice and software component design, this routing simulator achieved results of over 7 Gbps of throughput over multiple simulated node hops on consumer hardware. Alongside this throughput, this routing simulator also brings to light scalability and the ability to instantiate and simulate networks in excess of 1 million routing nodes within 1 GB of system memory

APA, Harvard, Vancouver, ISO, and other styles

26

Zhou, Zhen. "Design and analysis of scheduling and queue management schemes for high performance switches and routers /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20ZHOU.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Han, Seon Yeong. "Shadowing effect on ad hoc network." Diss., Online access via UMI:, 2004. http://wwwlib.umi.com/dissertations/fullcit/1422359.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Liu, Jing. "Stable and scalable arbitration algorithms for crossbar-based switches/routers /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20LIUJ.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 92-96). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

29

Paudel, Bandana. "On the effects of small-scale fading and mobility in mobile wireless communication network." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Paudel_09007dcc806c00f9.pdf.

Full text

Abstract:

Thesis (M.S.)--Missouri University of Science and Technology, 2009.<br>Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed August 25, 2009) Includes bibliographical references (p. 71-73).

APA, Harvard, Vancouver, ISO, and other styles

30

Paul, Indrani. "Switch scheduling in the Multimedia Router (MMR)." Thesis, Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Chen, Weisong. "A pervasive information framework based on semantic routing and cooperative caching." Click to view the E-thesis via HKUTO, 2004. http://sunzi.lib.hku.hk/hkuto/record/B31065326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Chen, Weisong, and 陳偉松. "A pervasive information framework based on semantic routing and cooperative caching." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B31065326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Suryadevara, Usha. "Buffer management in tone allocated multiple access protocol." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000357.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2001.<br>Title from title page of source document. Document formatted into pages; contains vi, 78 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

34

Hussein, Abedellatif Mohammed. "Flooding control in route discovery for reactive routing in mobile ad hoc networks /." Online version of thesis, 2007. http://hdl.handle.net/1850/4495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Chim, Tat-wing, and 詹達榮. "Novel algorithms to improve internet traffic distribution management." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29798322.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Chonbodeechalermroong, Yongyut School of Electrical Engineering UNSW. "Simple star multihop optical network." Awarded by:University of New South Wales. School of Electrical Engineering, 2001. http://handle.unsw.edu.au/1959.4/20328.

Full text

Abstract:

A new multihop wavelength-division multiplexed (WDM) optical network designed for uniform traffic with two wavelengths per node that can give the maximum throughput and minimum delay is proposed. It is called a 'Simple Star' multihop optical network. This network has good characteristics in traffic balance and small average number of hops. Moreover, Simple Star can be used together with multiple star couplers to reduce the number of wavelength used. Furthermore, unlike most existing networks, this network does not impose an upper limit to the number of nodes. Another interesting pattern is Simple Star with Center Node (Simple Star CN) particularly for prime numbers of nodes. It can be shown that the average number of hops of Simple Star (normal plus CN) is in between those of Shufflenet and Kautz, but the throughput and delay are better. An associated network called Simple Star Shared Channel (Simple Star SC) for two transceivers per node is also presented and it can be used together with multiple star couplers to reduce the number of wavelengths. An example of a 16-node Simple Star SC shows that the number of wavelengths used can be 8 times less than that in the normal Simple Star network. The Shared Channel simulation model is based on the concept of CSMA/CD (Carrier Sense Multiple Access with Collision Detection).

APA, Harvard, Vancouver, ISO, and other styles

37

Mancera-Mendez, German Andres. "Ad hoc wireless networks flooding and statistical understanding of node movement /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 2.31 Mb., 68 p, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:1435817.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Shek, Lai-yee Liza, and 石麗儀. "Ad Hoc routing and time-slot scheduling in bluetooth networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B29699393.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Kumar, Abhishek Anand. "Traffic sensitive quality of service controller." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0114104-230026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Dawra, Gaurav. "Terrain based routing protocol for sparse ad-hoc intermittent network (TRAIN)." Thesis, Montana State University, 2005. http://etd.lib.montana.edu/etd/2005/dawra/DawraG1205.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Zhou, Brian Dazheng. "Steiner tree optimization in multicast routing." online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?MQ71842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Needels, Keith. "Detecting and recovering from overlay routing attacks in peer-to-peer distributed hash tables /." Online version of thesis, 2008. http://hdl.handle.net/1850/8800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kang, Intae. "Topology control for broadcasting over energy constrained wireless ad hoc networks /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chau, Ming Kit. "Quality of service routing in mobile ad hoc networks /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20CHAU.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 156-159). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

45

Liu, Yu. "Power-based routing schemes for mobile ad hoc networks /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202004%20LIUY.

Full text

Abstract:

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.<br>Includes bibliographical references (leaves 137-142). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

46

Ho, Ai Hua. "Virtual router approach for wireless ad hoc networks." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4781.

Full text

Abstract:

Wireless networks have become increasingly popular in recent years. There are two variations of mobile wireless networks: infrastructure mobile networks and infrastructureless mobile networks. The latter are also known as mobile ad hoc network (MANET). MANETs have no fixed routers. Instead, mobile nodes function as relay nodes or routers, which discover and maintain communication connections between source nodes and destination nodes for various data transmission sessions. In other words, an MANET is a self-organizing multi-hop wireless network in which all nodes within a given geographical area participate in the routing and data forwarding process. Such networks are scalable and self-healing. They support mobile applications where an infrastructure is either not available (e.g., rescue operations and underground networks) or not desirable (e.g., harsh industrial environments). In many ad hoc networks such as vehicular networks, links among nodes change constantly and rapidly due to high node speed. Maintaining communication links of an established communication path that extends between source and destination nodes is a significant challenge in mobile ad hoc networks due to movement of the mobile nodes. In particular, such communication links are often broken under a high mobility environment. Communication links can also be broken by obstacles such as buildings in a street environment that block radio signal. In a street environment, obstacles and fast moving nodes result in a very short window of communication between nodes on different streets. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Virtual Router abstraction in this dissertation. A virtual router is a dynamically-created logical router that is associated with a particular geographical area. Its routing functionality is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the virtual router. These physical nodes take turns in forwarding data packets for the virtual router. In this environment, data packets are transmitted from a source node to a destination node over a series of virtual routers. Since virtual routers do not move, this scheme is much less susceptible to node mobility. There can be two virtual router approaches: Static Virtual Router (SVR) and Dynamic Virtual Router (DVR). In SVR, the virtual routers are predetermined and shared by all communication sessions over time. This scheme requires each mobile node to have a map of the virtual routers, and use a global positioning system (GPS) to determine if the node is within the geographical region of a given router. DVR is different from SVR with the following distinctions: (1) virtual routers are dynamically created for each communication sessions as needed, and deprecated after their use; (2) mobile nodes do not need to have a GPS; and (3) mobile nodes do not need to know whereabouts of the virtual routers. In this dissertation, we apply Virtual Router approach to address mobility challenges in routing data. We first propose a data routing protocol that uses SVR to overcome the extreme fast topology change in a street environment. We then propose a routing protocol that does not require node locations by adapting a DVR approach. We also explore how the Virtual Router Approach can reduce the overhead associated with initial route or location requests used by many existing routing protocols to find a destination. An initial request for a destination is expensive because all the nodes need to be reached to locate the destination. We propose two broadcast protocols; one in an open terrain environment and the other in a street environment. Both broadcast protocols apply SVR. We provide simulation results to demonstrate the effectiveness of the proposed protocols in handling high mobility. They show Virtual Router approach can achieve several times better performance than traditional routing and broadcast approach based on physical routers (i.e., relay nodes).<br>ID: 030646255; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2011.; Includes bibliographical references (p. 110-122).<br>Ph.D.<br>Doctorate<br>Computer Science<br>Engineering and Computer Science<br>Computer Science

APA, Harvard, Vancouver, ISO, and other styles

47

Zheng, Zici. "Adaptive explicit congestion notification (AECN) for heterogeneous flows." Link to electronic thesis, 2001. http://www.wpi.edu/Pubs/ETD/Available/etd-0502101-062544.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Anhalt, Fabienne. "Virtualisation des réseaux : performance, partage et applications." Thesis, Lyon, École normale supérieure, 2011. http://www.theses.fr/2011ENSL0630.

Full text

Abstract:

La virtualisation apparaît comme étant une solution clé pour révolutionner l'architecture ossifiée des réseaux comme Internet. En ajoutant une couche d'abstraction au-dessus du matériel, la virtualisation permet de gérer et de configurer des réseaux virtuels indépendamment les uns des autres. La flexibilité qui en résulte donne à l'opérateur d'un réseau virtuel la possibilité de configurer la topologie, et de modifier les piles protocolaires. Jusqu'à présent, la virtualisation du réseau a été implémentée dans des plateformes de test ou de recherche, pour permettre l'expérimentation avec les protocoles de routage. Dans le but d'introduire la virtualisation dans les réseaux de production comme ceux de l'Internet, plusieurs nouveaux défis apparaissent, dont en particulier la performance et le partage des ressources de commutation et de routage. Ces deux questions sont particulièrement pertinentes, lorsque le plan de données du réseau lui-même est virtualisé, pour offrir un maximum d'isolation et de configurabilité. Pour cela, nous évaluons et analysons d'abord l'impact de la virtualisation sur la performance des routeurs virtuels logiciels. Puis, dans le but de pouvoir virtualiser le plan de données dans des réseaux de production, nous proposons une architecture matérielle de commutateur virtualisé, permettant le partage différencié des ressources tels que les ports et les tampons mémoire. D'autre part, nous examinons les possibles applications des réseaux virtuels et proposons un service de réseaux virtuels à la demande, avec un routage configurable, et des bandes passantes contrôlées, Nous appliquons et évaluons ce service dans le contexte d'infrastructures virtuelles<br>Virtualization appears as a key solution to revolutionize the architecture of ossified networks, such as the Internet. By adding a layer of abstraction on top of the actual hardware, virtual networks can be managed and configured flexibly and independently. The flexibility introduced into the network provides the operator with options for topology reconfiguration, besides allowing it to play with the software stacks and protocols. Today, network virtualization has been realized in research testbeds, allowing researchers to experiment with routing. Introducing virtualization in a production network such as those of the Internet raises several challenges, in particular the performance and the sharing of the routing and switching resources. These are in particular relevant, when the network data plane is virtualized, for maximum isolation and configurability in virtual networks. Therefore, we first evaluate and analyze the impact of virtualization on the performance of virtual software routers. Then, for being able to virtualize the data plane in production networks, we propose a hardware architecture of a virtualized switch, enabling the differentiated sharing of resources such as the ports and the memory buffers. Moreover, we examine the possible applications of virtual networks and propose a service for virtual networks on demand with configurable routing and controlled bandwidth. We apply and evaluate this service in the context of virtual infrastructures

APA, Harvard, Vancouver, ISO, and other styles

49

Lin, Edward Kin Wah. "MAC flow fairness in IEEE 802.11 based wireless mesh networks /." View abstract or full-text, 2010. http://library.ust.hk/cgi/db/thesis.pl?CSED%202010%20LIN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ni, Xian Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Performance evaluation of ETX on grid based wireless mesh networks." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/41016.

Full text

Abstract:

In the past few years Wireless Mesh Networks (WMNs) have developed as a promising technology to provide flexible and low-cost broadband network services. The Expected Transmission Count (ETX) routing metric has been put forward recently as an advanced routing metric to provide high QoS for static WMNs. Most previous research in this area suggests that ETX outperforms other routing metrics in throughput and efficiency. However, it has been determined that ETX is not immune to load sensitivity and route oscillations in a single radio environment. Route oscillations refer to the situation where packet transmission switches between two or more routes due to congestion. This has the effect of degrading performance of the network, as the routing protocol may select a non optimal path. In this thesis we avoided the route oscillation problem by forcing data transmission on fixed routes. This can be implemented in the AODV (Ad hoc On-demand Distance Vector) protocol by disabling both error messages and periodic updating messages (the HELLO scheme). However, a critical factor for our approach is that ETX must determine a high quality initial route in AODV. This thesis investigates whether the ETX metric improves initial route selection in AODV compared to the HOPS metric in two representative client-server applications: the Traffic Control Network (TCN) and the Video Stream (VS) network. We evaluate the ETX and HOPS metrics in a range of scenarios which possess different link qualities and different traffic loads. We find the ETX metric greatly improves initial route selection in AODV compared to the HOPS in the network in which only single flow exists. For networks in which there are multiple simultaneous flows, ETX behaves similar to HOPS in initial route selection. Based on these results, we find the solution of route stabilization to route oscillations in the context of ETX is only useful in the single flow case. To address this problem, we propose a modified solution of repeatedly broadcasting RREQ (Route Request) packets. Simulation results show that our modified solution allows ETX to be useful in the initial route selection in both single flow and multiple simultaneous flows cases.

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!