To see the other types of publications on this topic, follow the link: And Hybrid Routing Protocols.
Dissertations / Theses on the topic 'And Hybrid Routing Protocols'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'And Hybrid Routing Protocols.'
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
Asker, Zada Salar. "Ad Hoc Networks : Performance Evaluation Of Proactive, Reactive And Hybrid Routing Protocols In NS2." Thesis, Högskolan Väst, Institutionen för ekonomi och it, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-2778.
Full textAbstract:
No infrastructure, no centralized administration and self-configuration are the main characteristics of MANETs. The primary motivation of MANET deployment is to increase portability, mobility and flexibility. However, this mobility causes an unpredictable change in topology and makes routing more difficult. Many routing algorithms have been proposed and tested over the last few years in order to provide an efficient routing in Ad Hoc networks. In this report we will show our conducted study with AODV (reactive), DSDV (proactive) and ZRP (hybrid) routing protocols. The performance of routing protocols have been evaluated carefully by analyzing the affects of changing network parameters such as, number of nodes, velocity, pause time, workload and flows on three performance metrics: packet delivery ratio, routing cost and average end- to- end delay. All the simulation work has been conducted in NS2. Our simulation results show that AODV gives better performance in all designed simulation models in terms of packets delivery ratio. DSDV shows the second best performance. Performance of ZRP is found average.
2
Page, Jonathan Grant. "Energy efficient hybrid routing protocol for wireless sensor networks." Pretoria : [s.n.], 2007. http://upetd.up.ac.za/thesis/available/etd-09042008-130625/.
Full text
3
Boneke, Nokonoko Dulce-Maira. "An energy-efficient routing protocol for Hybrid-RFID Sensor Network." Master's thesis, University of Cape Town, 2011. http://hdl.handle.net/11427/10079.
Full textAbstract:
Radio Frequency Identification (RFID) systems facilitate detection and identification of objects that are not easily detectable or distinguishable. However, they do not provide information about the condition of the objects they detect. Wireless sensor networks (WSNs), on the other hand provide information about the condition of the objects as well as the environment. The integration of these two technologies results in a new type of smart network where RFID-based components are combined with sensors. This research proposes an integration technique that combines conventional wireless sensor nodes, sensor-tags, hybrid RFID-sensor nodes and a base station into a smart network named Hybrid RFID-Sensor Network (HRSN).
4
PEPPAS, NIKOLAOS. "A HYBRID ROUTING PROTOCOL FOR COMMUNICATIONS AMONG NODES WITHHIGH RELATIVE SPEED IN WIRELESS MESH NETWORKS." Master's thesis, University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2345.
Full textAbstract:
Wireless mesh networks (WMN) is a new promising wireless technology which uses already available hardware and software components. This thesis proposes a routing algorithm for military applications. More specifically, a specialized scenario consisting of a network of flying Unmanned Aerial Vehicles (UAVs) executing reconnaissance missions is investigated. The proposed routing algorithm is hybrid in nature and uses both reactive and proactive routing characteristics to transmit information. Through simulations run on a specially built stand alone simulator, based on Java, packet overhead, delivery ratio and latency metrics were monitored with respect to varying number of nodes, node density and mobility. The results showed that the high overhead leads to high delivery ratio while latency tends to increase as the network grows larger. All the metrics revealed sensitivity in high mobility conditions.M.S.Cp.E.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering MSCpE
5
Holliday, Peter Joshua Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. "NOMAD - A Hybrid Mobile Ad Hoc and Disruption Tolerant Routing Protocol for Tactical Military Networks." Awarded by:University of New South Wales - Australian Defence Force Academy. Information Technology & Electrical Engineering, 2009. http://handle.unsw.edu.au/1959.4/43724.
Full textAbstract:
There has been much research in recent years within the general field of mobile ad hoc networks (MANET) with many proposals submitted to the IETF for consideration. Delay or Disruption Tolerant Networking (DTN) is a relatively new field for routing, concerned with networks that experience long transmission delay or periods of disruption. Military forces around the globe have applied one or the other networking paradigms with varying degrees of success to their own problems of mobility at the lower tactical level (Brigade and below). The fundamental reason for this limited success is that many of the desired tactical scenarios at this level require a network that is not exclusively ad hoc or exclusively disrupted, but rather a network that dynamically adapts to a variety of mobility situations ranging from relatively stable, almost enterprise like, to completely disrupted. Synchronous MANET protocols have limited disruption tolerance at layer 3, and DTN routing protocols, which are further up the network stack, implement hop by hop asynchronous protocols that are unable to take advantage of prolonged network stability. The primary contribution of this thesis is NOMAD, a new hybrid routing protocol for military mobile ad hoc and disrupted networks. NOMAD is unique in that it operates as a proactive synchronous link state MANET protocol when the network is connected, but is able to seamlessly transition into asynchronous DTN mode when required. The results outlined in this thesis indicate that the hybrid NOMAD protocol provides a substantial improvement over standard synchronous MANET protocols. This thesis also makes a significant contribution with respect to synthetic mobility model generation. Mobility models are essential for the correct evaluation of any routing protocol. A mobility modelling tool called SWarMM (Synthetic Warfare Mobility Modelling) was also developed as part of this thesis. SWarMM provides an agent based simulation tool for generating credible synthetic mobility models for use with the discrete network simulation tools, such as OPNET and NS2.
6
Migas, Nikos. "MARIAN : a hybrid, metric-driven, agent-based routing protocol for multihop ad-hoc networks." Thesis, Edinburgh Napier University, 2008. http://researchrepository.napier.ac.uk/Output/4000.
Full textAbstract:
Recent advances in technology provided the ground for highly dynamic, mobile, infrastructure-less networks, namely, ad-hoc networks. Despite their enormous benefits, the full potential cannot be reached unless certain issues are resolved. These mainly involve routing, as the lack of an infrastructure imposes a heavy burden on mobile devices that must maintain location information and route data packets in a multi-hop fashion. Specifically, typical adhoc routing devices, such as Personal Digital Assistants (PDAs), are limited in respect to the available throughput, life-time, and performance, that these may provide, as routing elements. Thus, there is a need for metric-driven ad-hoc routing, that is, devices should be utilised for routing according to their fitness, as different device types significantly vary in terms of routing fitness. In addition, a concrete agent-based approach can provide a set of advantages over a non-agent-based one, which includes: better design practice; and automatic reconfigurability. This research work aims to investigate the applicability of stationary and mobile agent technology in multi-hop ad-hoc routing. Specifically, this research proposes a novel hybrid, metric-driven, agent-based routing protocol for multi-hop ad-hoc networks that will enhance current routing schemes. The novelties that are expected to be achieved include: maximum network performance, increased scalability, dynamic adaptation, Quality of Service (QoS), energy conservation, reconfigurability, and security. The underlying idea is based on the fact that stationary and mobile agents can be ideal candidates for such dynamic environments due to their advanced characteristics, and thus offer state of the art support in terms of organising the otherwise disoriented network into an efficient and flexible hierarchical structure, classifying the routing fitness of participating devices, and therefore allow intelligent routing decisions to be taken on that basis.
7
Janský, Václav. "Směrování v bezdrátových sítích." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235998.
Full textAbstract:
This work deals with routing protocols for ad hoc wireless networks. First ad hoc networks are introduced. Routing protocols are then classified according to several criteria. Four routing protocols algorithms are described. They are proactive protocols DSDV and CGSR, reactive DSR and hybrid ZRP. Next AODV routing protocol is described in details. Advantages and disadvantages of AODV and two variants of AODV are also introduced. A new protocol is designed based on the disadvantages of the AODV protocol. This work also describes the implementation and integration of the new protocol in the ns-2 simulator. Results of the simulations are presented.
8
Porsch, Marco. "Layer 2 Path Selection Protocol for Wireless Mesh Networks with Smart Antennas." Master's thesis, Universitätsbibliothek Chemnitz, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-74743.
Full textAbstract:
In this thesis the possibilities of smart antenna systems in wireless mesh networks are examined. With respect to the individual smart antenna tradeoffs, a routing protocol (Modified HWMP, MHWMP) for IEEE 802.11s mesh networks is presented, that exploits the full range of benefits provided by smart antennas: MHWMP actively switches between the PHY-layer transmission/reception modes (multiplexing, beamforming and diversity) according to the wireless channel conditions. Spatial multiplexing and beamforming are used for unicast data transmissions, while antenna diversity is employed for efficient broadcasts. To adapt to the directional channel environment and to take full benefit of the PHY capabilities, a respective MAC scheme is employed. The presented protocol is tested in extensive simulation and the results are examined.
9
Bereketli, Alper. "On Qos Multicast Routing Routing Protocols." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606446/index.pdf.
Full textAbstract:
Multicasting is a technique used for distributing data packets from one or more sources to a set of receivers on interconnected networks. Currently developing network applications bring specific quality of service (QoS) requirements like bounded delay, minimum bandwidth, and maximum data loss rate. Providing the required quality of service addresses routing and resource reservation concepts. In this study, a literature survey is carried out on traditional and QoS multicast routing protocols, and the need for QoS routing protocols is investigated. QoS multicast routing protocols are classified and compared according to their multicast tree construction and resource reservation approaches. Two QoS protocols, QROUTE and QMBF, are selected, and their performances are experimentally compared using the network simulation tool Network Simulator-2 (ns-2). The objective of the simulations is to compare the QoS routing algorithms and their tree construction efficiencies. The first contribution of the thesis is the survey and classification of traditional and QoS multicast routing protocols. Another contribution is the ns-2 implementation of two QoS multicast routing protocols. The final contribution of the thesis is the performance evaluation of the recent protocols from a different perspective.
10
Jaafar, Talal Mohamed. "Simulation-Based Routing Protocols Analyses." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16197.
Full textAbstract:
A new approach to distributed network simulations that eases the burdens on the simulation developer in creating space-parallel simulations is presented. It provides a full-topology knowledge for every federate (simulator instance) to make the best routing decision to destinations simulated at other federates. Later, this technique was used to characterize the benefits of IP Anycast mechanism at large scale. Different IP Anycast scenarios were simulated in a detailed Border Gateway Protocol (BGP) simulator using a realistic large-scale AS topology. Results indicated that Anycast indeed provides higher availability and decreased end-to-end delay. It also showed that Anycast does not provide load balancing, and the BGP overhead associated with a topology change is reduced when Anycast is deployed. In addition, a simulation model of Enhanced Interior Gateway Routing Protocol (EIGRP) was developed and used to present a new approach for host mobility within an AS. The new solution is to allow end systems to retain a fixed IP address as those systems move across subnet boundaries, and to use route advertisement updates (by EIGRP) to inform routers of new or revised routes to reach the mobile hosts as they migrate. The simulation results showed the viability of this approach, and the ability of EIGRP to update routing tables in a timely fashion.
11
Raghuveer, Madhusudhan. "Interoperability of ad-hoc routing protocols." Thesis, Wichita State University, 2008. http://hdl.handle.net/10057/2039.
Full textAbstract:
Mobile ad-hoc networks are fast emerging and play a very important role in the field of wireless communications. With the advantages of mobility and infrastructure less the applications of ad-hoc networks have increased drastically. There are different routing protocols specifically designed for ad-hoc networks. Some examples of these routing protocols are DSDV, DSR AODV and DSR. Each of the routing protocols proposed for ad-hoc networks has its own advantages. For example DSDV is best suited for small scale ad-hoc networks and the design principles are very simple and are not very efficient when there is mobility and the size of the network increases. AODV and DSR are on-demand routing protocols and are best suited for large networks and also when a lot of mobility is involved among the wireless nodes in the network. Thus it is not possible to define a single routing protocol that would best suite all ad-hoc networks. The selection of a routing protocol purely depends on the application and also the scalability of the network. Having said that there cannot be a single routing protocol for all kinds of ad-hoc network this thesis concentrates on the concept of having interoperability between ad-hoc routing protocols. This thesis proposes a methodology which involves defining a universal packet which would be understood by all routing protocols. The design of having interoperability between the ad-hoc routing protocol involves three phases namely Bootstrap Phase, Route Discovery Phase and Data Exchange Phase. The method involved does not propose any changes to the existing protocols but an addition of universal packet format which would be understood by all routing protocols. Having discussed the proposed methodology for having interoperability between ad-hoc routing protocols this thesis discuses a mathematical model to calculate the maximum time involved in the Bootstrap Phase and the Route Discovery phase. The simulation results show that not only the number of hops to the egress node play important role in the time determination in Bootstrap Phase but also the distance between the source and the egress node play a key factor in the time determination process.Thesis Thesis [M.S.] - Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering
12
Arnaud, Mathilde. "Formal verification of secured routing protocols." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2011. http://tel.archives-ouvertes.fr/tel-00675509.
Full textAbstract:
With the development of digital networks, such as Internet, communication protocols are omnipresent. Digital devices have to interact with each other in order to perform the numerous and complex tasks we have come to expect as commonplace, such as using a mobile phone, sending or receiving electronic mail, making purchases online and so on. In such applications, security is important. For instance, in the case of an online purchase, the right amount of money has to be paid without leaking the buyer personal information to outside parties. Communication protocols are the rules that govern these interactions. In order to make sure that they guarantee a certainlevel of security, it is desirable to analyze them. Doing so manually or by testing them is not enough, as attacks can be quite subtle. Some protocols have been used for years before an attack was discovered. Because of their increasing ubiquity in many important applications, e.g. electronic commerce, a very important research challenge consists in developing methods and verification tools to increase our trust on security protocols, and so on the applications that rely on them. For example, more than 28 billion Euros were spent in France using Internet transactions, and the number is growing. Moreover, new types of protocols are continuously appearing in order to face new technological and societal challenges, e.g. electronic voting, electronic passport to name a few.
13
Billings, J. N. "Specifying and compiling internet routing protocols." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596636.
Full textAbstract:
This dissertation describes a system that allows routing languages to be specified in a declarative style. These specifications can then be compiled into low-level code and combined with one of several pre-supplied routing algorithms to producing routing protocol implementations. The system contains two types of routing algorithms: offline and online. Offline algorithms are variants of traditional shortest paths algorithms such as Dijkstra’s algorithm, and allow the computation of routing solutions for static graphs. Online algorithms are generalised versions of current Internet routing protocols, obtained by removing the implicit routing languages and replacing them with routing interfaces. This latter type of algorithm allows the generation of fully-fledged Internet routing protocols. Traditionally, routing protocols are monolithically specified and implemented. Specifications may reach hundreds of pages of informal prose, and implementations usually contain tens of thousands of lines of source code, often with serious errors. The metarouting approach has several significant advantages. Firstly, by separately specifying routing languages and reusing existing routing algorithms, it allows the rapid development of new routing protocols. Secondly, the system is able to determine whether a particular combination of routing language and algorithm is well-behaved. This involves the automatic inference of mathematical properties of routing languages. Finally, routing language specifications can be compiled into the efficient code with minimal user intervention. In some cases the compiler is able to exploit inferred mathematical properties. This dissertation concludes with an algebraic model of protocol interaction that is termed simple route redistribution. This model demonstrates how to avoid the safety problems that are associated with the traditional interaction mechanisms of route redistribution and administration distance. Fundamental to simple route redistribution is a clear distinction between routing and forwarding. The model also captures the separation of locators and identifiers found in recent proposals for a new Internet architecture.
14
Shah, Syed Iftikhar Hussain, and Syed Hassan Shaheed. "PERFORMANCE EVALUATION OF MANET ROUTING PROTOCOLS." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1101.
Full textAbstract:
The research study determines OPNET simulation to evaluate the MANET routing protocols i.e. AODV, DSR, GRP and OLSR performance for HTTP and FTP base application traffic. Results from the simulation result helps to measure the performance matrix i.e. packet delivery fraction, normalized routing load, throughput and end to end delay. Scalar values are extracted from simulation to plot desired performance graphs to analyze. The research results and conclusion produces enough information for the selection of best routing protocol for MANET in terms of HTTP and FTP application types.
15
Raghuveer, Madhusudhan Pendse Ravindra. "Interoperability of ad-hoc routing protocols." A link to full text of this thesis in SOAR, 2008. http://hdl.handle.net/10057/2039.
Full text
16
Tahir, Saleem. "Performance Issues of Routing Protocols in MANET." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2681.
Full textAbstract:
A mobile ad-hoc network is an assortment of wireless mobile hosts, which establishes a momentary network without any assist of centralized administrator. The characteristics of an ad-hoc network can be explored on the base of routing protocols. The dynamic topology is the vital characteristic in which nodes frequently change their position. In the ad-hoc networks, there are mobile nodes such as Personal Digital Assistance (PDA), smart phone and laptops; they have limited operational resources like battery power and bandwidth. The control traffic is to be minimized, which is the main responsibility of routing protocols by selecting the shortest path and controlling the traffic. In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. For this purpose, we first study and explain these protocols and then we use the Optimized Network Engineering Tool (OPNET) modeler tool and analyze the performance metrics delay, throughput and network load.
17
Alim, M. Abdul. "On the interaction of internet routing protocols." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609846.
Full text
18
LeBeau, Andrew David. "HIERARCHICAL ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/858.
Full textAbstract:
In recent wireless sensor network research, using a mobile data center (sink) to collect data has shown the ability to decrease the overall energy expenditure of the sensor field. Before the introduction of mobile sinks, many different routing protocols were developed under the assumption of a stationary sink. This work compares three such routing protocols, one hierarchical and two non-hierarchical, under the assumption of a mobile sink to determine which is best. The three protocols are tested against varying sink speed, node communication radius, and sensor field node populations. Different sink movement strategies and modifications to the routing protocols are also evaluated. This work shows that a modified Directed Diffusion, a non-hierarchical routing protocol, performs slightly better on average than a modified TEEN, a hierarchical routing protocol.
19
alyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.
Full textAbstract:
Multicasting can be done in two different ways: source based tree approach andshared tree approach. Shared tree approach is preferred over source-based treeapproach because in the later construction of minimum cost tree per source is neededunlike a single shared tree in the former approach. However, in shared tree approach asingle core needs to handle the entire traffic load resulting in degraded multicastperformance. Besides, it also suffers from „single point failure‟. Multicast is acommunication between one or multiple senders and multiple receivers, which used asa way of sending IP datagrams to a group of interested receivers in one transmission.Core-based trees major concerns are core selection and core as single point of failure.The problem of core selection is to choose the best core or cores in the network toimprove the network performance.In this dissertation we propose 1) a multiple core selection approach for core-based tree multicasting, senders can select different cores to have an efficient loadbalanced multicore multicasting. It will overcome any core failure as well. 2) Novel andefficient schemes for load shared multicore multicasting are presented. Multiple coresare selected statically, that is, independent of any existing multicast groups and also theselection process is independent of any underlying unicast protocol. Some of theselected cores can be used for fault- tolerant purpose also to guard against any possible core failures. 3) We have presented two novel and efficient schemes forgroup-based load shared multicore multicasting in which members of a multicast groupuse the same core tree for their multicasting. 4) We also presented two schemes aim atachieving low latency multicasting along with load sharing for delay sensitive multicastapplications. Besides, we have presented a unique approach for core migration, whichuses two very important parameters, namely, depth of a core tree and pseudo diameterof a core. One noteworthy point from the viewpoint of fault tolerance is that the degreeof fault-tolerance can be enhanced from covering single point-failure to any number ofcore failures.
20
Jin, Jingren Lim Alvin S. "Improving geographic routing with neighbor sectoring." Auburn, Ala., 2007. http://hdl.handle.net/10415/1337.
Full text
21
Praveenkumar, Ramesh. "Investigation of routing protocols in a sensor network." Birmingham, Ala. : University of Alabama at Birmingham, 2006. http://www.mhsl.uab.edu/dt/2006m/praveenkumar.pdf.
Full text
22
Chen, Chao. "Advanced Routing Protocols for Satellite and Space Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7107.
Full textAbstract:
Satellite systems have the advantage of global coverage and offer a solution for providing broadband access to end users. Local terrestrial networks and terminals can be connected to the rest of the world over Low Earth Orbit (LEO) satellite networks simply by installing small
satellite interfaces. With these properties, satellite systems play a crucial role in the global Internet to support real-time and non-real-time applications. Routing in satellite networks, and the integration of satellite
networks and the terrestrial Internet are the key issues to support these services.
Furthermore, the developments in space technologies enable the realization of deep-space missions such as Mars exploration. The Interplanetary Internet is envisioned to provide communication services for scientific data delivery and navigation services for the explorer spacecrafts and orbiters of future
deep-space missions. The unique characteristics posed by deep-space communications call for different research approaches from those in
terrestrial networks.
The objective of this research is to develop advanced architectures and efficient routing protocols for satellite and space networks to support applications with different traffic types and heterogeneous quality-of-service
(QoS) requirements. Specifically, a new QoS-based routing algorithm (QRA) is proposed as a
connection-oriented routing scheme to support real-time multimedia applications in satellite networks. Next, the satellite grouping and routing protocol (SGRP) is presented as a
unicast routing protocol in a two-layer satellite IP network architecture. The border gateway protocol - satellite version (BGP-S) is then proposed as a unified routing protocol to accomplish the integration of the terrestrial and satellite IP networks at the network layer.
Finally, a new routing framework, called the space backbone routing (SBR), is introduced for routing through different autonomous regions in the Interplanetary Internet. SBR provides a self-contained and scalable solution to support different traffic types through the Interplanetary Internet.
23
Osękowska, Ewa A. "Performance Evaluation of Wireless Mesh Networks Routing Protocols." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3712.
Full textAbstract:
The tremendous growth in the development of wireless networking techniques attracts growing attention to this research area. The ease of development, low installation and maintenance costs and self healing abilities are some of the qualities that make the multi-hop wireless mesh network a promising solution for both - rural and urban environments. Examining the performance of such a network, depending on the external conditions and the applied routing protocol, is the main aim of this research. It is addressed in an empirical way, by performing repetitive multistage network simulations followed by a systematic analysis and a discussion. This research work resulted in the implementation of the experiment and analysis tools, a comprehensive assessment of the simulated routing protocols - DSDV, AODV, OLSR and HWMP, and numerous observations concerning the simulation tool. Among the major findings are: the suitability of protocols for wireless mesh networks, the comparison of rural and urban environments and the large impact of conditions such as propagation, density and scale of topology on the network performance. An unexpected but valuable outcome is the critical review of the ns network simulator.Mobile number: +48 660144055
24
Ullah, Muhammad, and Waqar Ahmad. "Evaluation of Routing Protocols in Wireless Sensor Networks." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2500.
Full textAbstract:
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. The building block of such an infrastructure is comprised of hundreds or thousands of small, low cost, multifunctional devices which have the ability to sense compute and communicate using short range transceivers known as sensor nodes. The interconnection of these nodes forming a network called wireless sensor network (WSN). The low cost, ease of deployment, ad hoc and multifunctional nature has exposed WSNs an attractive choice for numerous applications. The application domain of WSNs varies from environmental monitoring, to health care applications, to military operation, to transportation, to security applications, to weather forecasting, to real time tracking, to fire detection and so on. By considering its application areas WSN can be argue as a traditional wired or wireless network. But in reality, these networks are comprised of battery operated tiny nodes with limitations in their computation capabilities, memory, bandwidth, and hardware resulting in resource constrained WSN. The resource constrained nature of WSN impels various challenges in its design and operations degrading its performance. On the other hand, varying numbers of applications having different constraints in their nature makes it further challenging for such resources constrained networks to attain application expectations. These challenges can be seen at different layer of WSNs starting from physical layer up to application layer. At routing layer, routing protocols are mainly concerned with WSN operation. The presence of these challenges affects the performance of routing protocols resulting in overall WSN performance degradation. The aim of this study is to identify the performance challenges of WSN and analyze their impact on the performance of routing protocols. For this purpose a thorough literature study is performed to identify the issues affecting the routing protocols performance. Then to validate the impact of identified challenges from literature, an empirical study has been conducted by simulating different routing protocols, taking into consideration these challenges and results are shown. On the basis of achieved results from empirical study and literature review recommendations are made for better selection of protocol regarding to application nature in the presence of considered challenges.
25
Huang, Yi-an. "Anomaly Detection for Wireless Ad-Hoc Routing Protocols." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010706-024527.
Full textAbstract:
HUANG, YI-AN. Anomaly Detection for Wireless Ad-Hoc Routing Protocols.(Under the direction of Wenke Lee.)
Mobile Ad-hoc networking (MANET) is an important emergingtechnology. As recent several security incidents remind us, noopen computer system is immune from intrusions. The routing protocolsin ad-hoc networks are key components yet vulnerable and presentspecial challenges to intrusion detection.
In this thesis, we propose an anomaly detection scheme for existingad-hoc routing protocols. Our approach relies on information from localrouting data and other reliable local sources. Our approach models thetemporal/sequential characteristics of observations and uses entropyanalysis for feature selection. Classification algorithms are used tocompute anomaly detection models. We present case studies on DSR andDSDV protocols using the ns-2 simulator. The overall results thusfar are very encouraging. We discuss how the available information from arouting protocol influences anomaly detection performance and attemptto provide guidelines on what features we need for anomaly detection.
Finally, we also discuss several challenging issues and propose ourfuture work.
26
Chinthalapani, Nishanth. "RDMA based IP routing protocols and router architecture." Thesis, Wichita State University, 2008. http://hdl.handle.net/10057/2006.
Full textAbstract:
The Ethernet technology has advanced from the era of fast Ethernet to the era of gigabit ethernet. The gigabit routers currently available in the market are employing expensive hardware based implementations for improving the throughput [6], which makes the overall cost of the device prohibitively high. In this thesis the author reviews the existing router architectures and routing protocols and critiques the shortcomings of the existing implementation. This thesis evaluates the drawbacks in the existing infrastructure and proposes an architecture that provides a solution based on the RDMA protocol. The proposed architecture uses the RDMA protocol for transferring the data payload from the ingress interface to the destination interface. In this research the author also presents an analytical mathematical model that can be used for calculating the delay incurred by a packet, memory utilization and CPU utilization for both architectures. The potential benefits by the use of RDMA protocol are also explained in detail in this thesis. The necessity for modifying the update packet structure in the existing implementation of RIP is discussed in detail. Packet payload handling in both architectures is compared and the advantages in the RDMA protocol based implementation are presented.Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and COmputer Engineering.
Includes bibliographic references (leaves 75-77)
27
Yang, Ying. "Routing protocols for wireless sensor networks: A survey." Thesis, Mittuniversitetet, Institutionen för informationsteknologi och medier, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-19700.
Full textAbstract:
Wireless sensor networks(WSNs) are different to traditional networks and are highly dependent on applications, thus traditional routing protocols cannot be applied efficiently to the networks. As the variability of both the application and the network architecture, the majority of the attention, therefore, has been given to the routing protocols. This work surveys and evaluates state-of-the-art routing protocols based on many factors including energy efficiency, delay andcomplexity, and presents several classifications for the various approaches pursued. Additionally, more attention is paid to several routing protocols and their advantages and disadvantages and, indeed, this work implements two of selected protocols, LEACH and THVRG, on the OPNET, and compares them in many aspects based on a large amount of experimental data. The survey also provides a valuable framework for comparing new and existing routing protocols. According to the evaluation for the performance of the routing protocols, this thesis provides assistance in relation to further improving the performance in relation to routing protocols. Finally, future research strategies and trends in relation to routing technology in wireless sensor networks are also provided.
28
Huang, Yangcheng. "Improving signaling performance of proactive MANET routing protocols." Thesis, University College London (University of London), 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497501.
Full text
29
Yuan, Xiaochun, and 袁小春. "Routing protocols in all-optical packet switched networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31243885.
Full text
30
Hequn, Zhang, and Wang Rui. "SIMULATION-BASED PERFORMANCE COMPARISONS OF GEOCAST ROUTING PROTOCOLS." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-25768.
Full textAbstract:
Intelligent Transportation System (ITS) is the main research domain for making road transport safer and more comfortable. For the sake of increasing the benefits of ITS, projects about Inter-Vehicle Communication (IVC) system have been proposed to make communications among vehicles possible, to exchange traffic information and avoid accidents. In order to create communication network among vehicles or between vehicles and infrastructure, Vehicular Ad hoc Networks (VANETs) has been proposed. Many applications in VANETs need to send messages to vehicles within a specific geographic region. This behavior is called geocast and this specific geographic region is called the Zone of Relevance (ZOR). Some routing protocols which are related to Geocast have been proposed in literature for VANETs. So it is significant to evaluate and compare the performance of these known Geocast routing protocols. In this thesis, categories of the routing protocols, as well as communication forwarding schemes are introduced. The routing protocols in VANETs are also summarized and compared. In order to evaluate the performance of these protocols, the evaluation methods are proposed and then a Geocast routing simulator is designed and used to simulate the Geocast network environment and several Geocast routing protocols.
31
Pourroostaei, Ardakani Saeid. "Wireless sensor network routing protocols for data aggregation." Thesis, University of Bath, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.675693.
Full textAbstract:
Wireless Sensor Networks (WSNs) comprise a number of sensor nodes which typically sense, measure and report environmental data. The nodes themselves are highly resource constrained. They are typically networked in a self-organising manner without any specific infrastructure or centralised control. The key objective of WSN protocols is to minimise the cost of ambient data collection. Ambient data samples need to be collected and forwarded through minimum cost links (in terms of hop count and consumed energy) to data consumer access point (sink) for further analysis and manipulation. WSN routing is the field of research that focuses on the interconnection of sensor nodes via either single or multi-hop paths to forward data packets from event regions to the sink. However, the routing overhead increases if raw data packets are forwarded from each source region to the sink. Data aggregation is therefore a technique that has the potential to collect and combine data packets to express the collected information in a summary form. It reduces the number and size of transmissions and eliminates redundant data packets. WSN Routing can be performed in two models for data aggregation: mobile agent and client/server. The former routes mobile agent(s) to collect and aggregate data samples from the sensor nodes, whereas the latter establishes an hierarchical network in which data packets are aggregated and forwarded from the ambient event regions to the sink in a convergent manner. Data aggregation routing aims to maximise the number of collected data samples, while minimising energy consumption and data collection delay. Minimising energy consumption is a vital requirement due to resource constraints in WSNs. Data collection delay should be minimised as it is the key to data freshness. At the same time, the number of collected data samples should be maximised, as it should lead to increased accuracy and robustness in data collection. To achieve the objectives of data aggregation routing, this thesis proposes two data aggregation protocols: one for mobile agents (called ZMA) and another using client/server (named CBA). ZMA uses multiple mobile agents to collect and aggregate over a WSN. The mobile agents start their journeys in a bottom-up manner from the event regions to the sink. They visit the sensor nodes and collect and aggregate data samples and then return to the sink to deliver the (aggregated) results. CBA partitions the network into a set of data-centric clusters and then establishes a spanning tree from the cluster-heads to the sink to forward and aggregate data packets hierarchically. The performance of the proposed protocols is tested and evaluated through simulation. The simulation results of each of the proposed protocols are compared against two well-known protocols for each routing model, namely TBID (Tree-Based Itinerary Design) and NOID (The Near-Optimal Itinerary Design algorithm) for mobile agents and LEACH (Low-Energy Adaptive Clustering Hierarchy) and DDiFF (Directed Diffusion) for client/server. The results indicate that the proposed algorithms perform well compared to the respective benchmark protocols in most circumstances.
32
Wang, Yunsheng. "Designing Efficient Routing Protocols in Delay Tolerant Networks." Diss., Temple University Libraries, 2013. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/224066.
Full textAbstract:
Computer and Information SciencePh.D.
This thesis presents the design and evaluation of routing protocols for efficient content delivery and dissemination in delay tolerant networks. With the advancement in technology, the communication devices with wireless interfaces become more and more universal. Delay tolerant networks (DTNs) are characterized by intermittent connectivity and limited network capacity. There exist several different application scenarios: connectivity of developing countries, vehicular DTN road communications, and social contact networks. In this thesis, we explore the characteristics in DTNs, such as mobility pattern, contact history information, and social feature information, to design efficient routing schemes. The research reported in this thesis investigates the technical challenges and their solutions of applying different DTN routing protocols. We design multicast schemes to forward the information to a group of destinations in DTN environment. We extend the delegation forwarding scheme in DTN multicasting. An non-replication multicast tree is also studied in this report. We also apply ticket-based and social-tie-based approaches in content distribution systems. We leverage the users' social feature information to study the hypercube-based routing schemes in social contact networks. We also study the resource management problem in DTNs. We design a joint replication-migration-based scheme to solve the storage congestion. These techniques are evaluated comprehensively in realistic simulation studies, by comparing the performance with state-of-the-art approaches in both synthetic and real traces.
Temple University--Theses
33
Chinthalapani, Nishanth Pendse Ravindra. "RDMA based IP routing protocols and router architecture." A link to full text of this thesis in SOAR, 2008. http://hdl.handle.net/10057/2006.
Full textAbstract:
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and COmputer Engineering.Copyright 2008 by Nishanth Chinthalapani. All Rights Reserved. Includes bibliographical references (leaves 75-77).
34
Gaines, Brian Lee. "A dual-agent approach for securing routing protocols." Master's thesis, Mississippi State : Mississippi State University, 2007. http://library.msstate.edu/etd/show.asp?etd=etd-11072007-165316.
Full text
35
Yuan, Xiaochun. "Routing protocols in all-optical packet switched networks /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25100725.
Full text
36
Abusaimeh, Hesham. "Energy-aware routing protocols in Wireless Sensor Networks." Thesis, Loughborough University, 2009. https://dspace.lboro.ac.uk/2134/8141.
Full textAbstract:
Saving energy and increasing network lifetime are significant challenges in the field of Wireless Sensor Networks (WSNs). Energy-aware routing protocols have been introduced for WSNs to overcome limitations of WSN including limited power resources and difficulties renewing or recharging sensor nodes batteries. Furthermore, the potentially inhospitable environments of sensor locations, in some applications, such as the bottom of the ocean, or inside tornados also have to be considered. ZigBee is one of the latest communication standards designed for WSNs based on the IEEE 802.15.4 standard. The ZigBee standard supports two routing protocols, the Ad hoc On-demand Distance Vector (AODV), and the cluster-tree routing protocols. These protocols are implemented to establish the network, form clusters, and transfer data between the nodes. The AODV and the cluster-tree routing protocols are two of the most efficient routing protocols in terms of reducing the control message overhead, reducing the bandwidth usage in the network, and reducing the power consumption of wireless sensor nodes compared to other routing protocols. However, neither of these protocols considers the energy level or the energy consumption rate of the wireless sensor nodes during the establishment or routing processes.
37
Abdelshafy, Abdallah Mohamed Ahmed. "Securing routing protocols in mobile ad hoc networks." Thesis, Heriot-Watt University, 2016. http://hdl.handle.net/10399/3206.
Full textAbstract:
A Mobile Ad Hoc Network (MANET) is more prone to security threats than other wired and wireless networks because of the distributed nature of the network. Conventional MANET routing protocols assume that all nodes cooperate without maliciously disrupting the operation of the protocol and do not provide defence against attackers. Blackhole and flooding attacks have a dramatic negative impact while grayhole and selfish attacks have a little negative impact on the performance of MANET routing protocols. Malicious nodes or misbehaviour actions detection in the network is an important task to maintain the proper routing protocol operation. Current solutions cannot guarantee the true classification of nodes because the cooperative nature of the MANETs which leads to false exclusions of innocent nodes and/or good classification of malicious nodes. The thesis introduces a new concept of Self- Protocol Trustiness (SPT) to discover malicious nodes with a very high trustiness ratio of a node classification. Designing and implementing new mechanisms that can resist flooding and blackhole attacks which have high negative impacts on the performance of these reactive protocols is the main objective of the thesis. The design of these mechanisms is based on SPT concept to ensure the high trustiness ratio of node classification. In addition, they neither incorporate the use of cryptographic algorithms nor depend on routing packet formats which make these solutions robust and reliable, and simplify their implementations in different MANET reactive protocols. Anti-Flooding (AF) mechanism is designed to resist flooding attacks which relies on locally applied timers and thresholds to classify nodes as malicious. Although AF mechanism succeeded in discovering malicious nodes within a small time, it has a number of thresholds that enable attacker to subvert the algorithm and cannot guarantee that the excluded nodes are genuine malicious nodes which was the motivation to develop this algorithm. On the other hand, Flooding Attack Resisting Mechanism (FARM) is designed to close the security gaps and overcome the drawbacks of AF mechanism. It succeeded in detecting and excluding more than 80% of flooding nodes within the simulation time with a very high trustiness ratio. Anti-Blackhole (AB) mechanism is designed to resist blackhole attacks and relies on a single threshold. The algorithm guarantees 100% exclusion of blackhole nodes and does not exclude any innocent node that may forward a reply packet. Although AB mechanism succeeded in discovering malicious nodes within a small time, the only suggested threshold enables an attacker to subvert the algorithm which was the motivation to develop it. On the other hand, Blackhole Resisting Mechanism (BRM) has the main advantages of AB mechanism while it is designed to close the security gaps and overcome the drawbacks of AB mechanism. It succeeded in detecting and excluding the vast majority of blackhole nodes within the simulation time.
38
Kondareddy, Yogesh Reddy Agrawal Prathima. "MAC and routing protocols for multi-hop cognitive radio networks." Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Electrical_and_Computer_Engineering/Thesis/Kondareddy_Yogesh_18.pdf.
Full text
39
Pore, Ghee Lye. "A performance analysis of routing protocols for adhoc networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Mar%5FPore.pdf.
Full textAbstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2006.Thesis Advisor(s): John C. McEachen. "March 2006." Includes bibliographical references (p. 85-89). Also available online.
40
Marinis, Artelaris Spyridon. "Performance evaluation of routing protocols for Wireless Mesh Networks." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-49745.
Full textAbstract:
Wireless Mesh Networks provide an organisation or a community with the means to extend or create a network independent of infrastructure. However, the network’s dynamic topology along with the fact that devices in the network might be mobile and move randomly, brings tolight various kind of problems on the network, with the most common being the routing. In this report, the problem of routing is examined in terms of throughput, routing overhead, end-to-end delay and packet delivery ratio on two chosen algorithms, namely the Dynamic MANET On-demand (DYMO) and the Better Approach To Mobile Adhoc Networking (B.A.T.M.A.N.). Furthermore, this thesis examines also a Transmission Control Protocol (TCP) connection and compares it against several TCP congestion control mechanisms, two of which, were implemented, namely TCP-Illinois and TCP-FIT, to address the effects that different TCP congestion mechanisms have on an ad-hoc network, when reliable connections are needed. The results show that DYMO is more stable, performs good overall and has the lowest routing overhead, however in a situation with limited mobility or no mobility (as in high mobility they perform poorly) proactive protocols like B.A.T.M.A.N. are worthy protocols, should the extra penalty of routing overhead in the network traffic is not causing any problems. Furthermore, regarding the TCP results, it was observed that TCP congestion algorithms designed specifically for Wireless networks, do offer better performance and should be considered, when designing an ad-hoc network.
41
Kanakaris, Venetis. "Energy aware routing protocols in ad hoc wireless networks." Thesis, University of Portsmouth, 2012. https://researchportal.port.ac.uk/portal/en/theses/energy-aware-routing-protocols-in-ad-hoc-wireless-networks(37e2da3e-a5bd-47b8-89d0-3221f6a60a40).html.
Full textAbstract:
In Mobile Ad hoc Network, communication at mobile nodes can be achieved by using multi-hop wireless links. The architecture of such a network is based, not on a centralized base station but on each node acting as a router to forward data packets to other nodes in the network. The aim of each protocol, in an ad hoc network, is to find valid routes between two communicating nodes. These protocols must be able to handle high mobility of the nodes which often cause changes in the network topology. Every ad hoc network protocol uses some form of a routing algorithm to transmit between nodes based on a mechanism that forwards packets from one node to another in the network. These algorithms have their own way of finding a new route or modifying an existing one when there are changes in the network. The novel area of this research is a proposed routing algorithm which improves routing and limits redundant packet forwarding, especially in dense networks. It reduces the routing messages and consequently power consumption, which increases the average remaining power and the lifetime of the network. The first aim of this research was to evaluate various routing algorithms in terms of power. The next step was to modify an existing ad hoc routing protocol in order to improve the power consumption. This resulted in the implementation of a dynamic probabilistic algorithm in the route request mechanism of an ad hoc On-Demand Distance Vector protocol which led to a 3.0% improvement in energy consumption. A further extension of the approach using Bayesian theory led to 3.3% improvement in terms of energy consumption as a consequence of a reduction in MAC Load for all network sizes, up to 100 nodes.
42
Yang, Junmo Sun Min-Te. "Practical consideration of routing protocols in ad hoc networks." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/YANG_JUNMO_37.pdf.
Full text
43
Al-Sherbaz, Ali. "WiMAX-WiFi techniques for baseband convergence and routing protocols." Thesis, University of Buckingham, 2010. http://nectar.northampton.ac.uk/4241/.
Full textAbstract:
The focus of this study was to investigate solutions that, when implemented in any heterogeneous wireless network, shall enhance the existing standard and routing protocol connectivity without impacting the standard or changing the wireless transceiver’s functions. Thus achieving efficient interoperability at much reduced overheads. The techniques proposed in this research are centred on the lower layers. This because of the facts that WiMax and WiFi standards have not addressed the backward compatibility of the two technologies at the MAC and PHY layers, for both the baseband functions as well as the routing IP addresses. This thesis describes two innovate techniques submitted for a PhD degree. The first technique is to combine WiMax and WiFi signals so to utilise the same "baseband implementation chain" to handle both of these technologies, thus insuring ubiquitous data communication. WiMax-WiFi Baseband Convergence (W2BC) implementation is proposed to offer an optimum configurable solution targeted at combining the 802.16d WiMax and the 802.11a WiFi technologies. This approach provides a fertile ground for future work into combining more OFDM based wireless technologies. Based on analysis and simulation, the W2BC can achieve saving in device cost, size, power consumption and implementation complexity when compared to current side-by-side implementations for these two technologies. The second technique, called "Prime-IP", can be implemented with, and enhance, any routing protocol. During the route discovery process, Prime-IP enables any node on a wireless mesh network (WMN) to dynamically select the best available route on the network. Prime-IP proposes a novel recursive process, based on prime numbers addressing, to accumulate knowledge for nodes beyond the “neighbouring nodes”, and to determine the sequence of all the “intermediate nodes” used to form the route
44
Cho, Gi Hwan. "Location and routing optimization protocols supporting internet host mobility." Thesis, University of Newcastle Upon Tyne, 1996. http://hdl.handle.net/10443/2105.
Full textAbstract:
With the popularity of portable computers and the proliferation of wireless networking interfaces, there is currently a great deal of interest in providing IP networking support for host mobility using the Internet as a foundation for wireless networking. Most proposed solutions depend on a default route through the mobile host's horne address, which makes for unnecessarily long routes. The major problem that this gives rise to is that of finding an efficient way of locating and routing that allows datagrams to be delivered efficiently to moving destinations whilst limiting costly Internet-wide location updates as much as possible. Two concepts - "local region" and "patron service" - are introduced based on the locality features of the host movement and packet traffic patterns. For each mobile host, the local region is a set of designated subnetworks within which a mobile host often moves, and the patrons are the hosts from which the majority of traffic for the mobile host originated. By making use of the hierarchical addressing and routing structure of Internet, the two concepts are used to confine the effects of a host moving, so location updates are sent only to a designated host moving area and to those hosts which are most likely to call again, thus providing nearly optimal routing for most communication. The proposed scheme was implemented as an IP extension using a network simulator and evaluated from a system performance point of view. The results show a significant reduction in the accumulated communication time along with improved datagram tunneling, as compared with its extra location overhead. In addition, a comparison with another scheme shows that our functionality is more effective both for location update and routing efficiency. The scheme offers improved network and host scalability by isolating local movement from the rest of the world, and provides a convenient point at which to perform administration functions.
45
Akhtar, Nadeem. "Routing and interworking protocols for next generation wireless networks." Thesis, University of Surrey, 2007. http://epubs.surrey.ac.uk/2243/.
Full text
46
Hayes, T. "Routing protocols for next generation mobile wireless sensor networks." Thesis, University of Sussex, 2016. http://sro.sussex.ac.uk/id/eprint/63977/.
Full textAbstract:
The recent research interest in wireless sensor networks has caused the development of many new applications and subsequently, these emerging applications have ever increasing requirements. One such requirement is that of mobility, which has inspired an entirely new array of applications in the form of mobile wireless sensor networks (MWSNs). In terms of communications, MWSNs present a challenging environment due to the high rate at which the topology may be changing. As such, the motivation of this work is to investigate potential communications solutions, in order to satisfy the performance demands of new and future MWSN applications. As such this work begins by characterising and evaluating the requirement of a large variety of these emerging applications. This thesis focuses on the area of routing, which is concerned with the reliable and timely delivery of data from multiple, mobile sensor nodes to a data sink. For this purpose the technique of gradient routing was identified as a suitable solution, since data can quickly be passed down a known gradient that is anchored at the sink. However, in a mobile network, keeping the gradient up-to-date is a key issue. This work proposes the novel use of a global time division multiple access (GTDMA) MAC as a solution to this problem, which mitigates the need for regularly flooding the network. Additionally, the concept of blind forwarding is utilised for its low overhead and high reliability through its inherent route diversity. The key contribution of this thesis is in three novel routing protocols, which use the aforementioned principles. The first protocol, PHASeR, uses a hop-count metric and encapsulates data from multiple nodes in its packets. The hop-count metric was chosen because it is simple and requires no additional hardware. The inclusion of encapsulation is intended to enable the protocol to cope with network congestion. The second protocol, LASeR, utilises location awareness to maintain a gradient and performs no encapsulation. Since many applications require location awareness, the communications systems may also take advantage of this readily available information and it can be used as a gradient metric. This protocol uses no encapsulation in order to reduce delay times. The third protocol, RASeR, uses the hop-count metric as a gradient and also does not perform encapsulation. The reduced delay time and the relaxed requirement for any existing method of location awareness makes this the most widely applicable of the three protocols. In addition to analytical expressions being derived, all three protocols are thoroughly tested through simulation. Results show the protocols to improve on the state-of-the-art and yield excellent performance over varying speeds, node numbers and data generation rates. LASeR shows the lowest overhead and delay, which comes from the advantage of having available location information. Alternatively, at the expense of increased overhead, RASeR gives comparatively high performance metrics without the need for location information. Overall, RASeR can be suitably deployed in the widest range of applications, which is taken further by including four additional modes of operation. These include a supersede mode for applications in which the timely delivery of the most recent data is prioritised. A reverse flooding mechanism, to enable the sink to broadcast control messages to the sensor nodes. An energy saving mode, which uses sleep cycles to reduce the networks power consumption, and finally a pseudo acknowledgement scheme to increase the reliability of the protocol. These additions enable RASeR to satisfy the needs of some of the most demanding MWSN applications. In order to assess the practicality of implementation, RASeR was also evaluated using a small testbed of mobile nodes. The successful results display the protocols feasibility to be implemented on commercially available hardware and its potential to be deployed in the real world. Furthermore, a key issue in the real world deployment of networks, is security and for this reason a fourth routing protocol was designed called RASeR-S. RASeR-S is based on RASeR, but introduces the use of encryption and suggests a security framework that should be followed in order to significantly reduce the possibility of a security threat. Whilst the main focus of this work is routing, alternative MAC layers are assessed for LASeR. Unlike the other two protocols, LASeR uses available location information to determine its gradient and as such, it is not reliant on the GTDMA MAC. For this reason several MAC layers are tested and the novel idea of dedicated sensing slots is introduced, as well as a network division multiple access scheme. The selected and proposed MACs are simulated and the GTDMA and two proposed protocols are shown to give the best results in certain scenarios. This work demonstrates the high levels of performance that can be achieved using gradient orientated routing in a mobile network. It has also shown that the use of a GTDMA MAC is an efficient solution to the gradient maintenance problem. The high impact of this work comes from the versatility and reliability of the presented routing protocols, which means they are able to meet the requirements of a large number of MWSN applications. Additionally, given the importance of security, RASeR-S has been designed to provide a secure and adaptable routing solution for vulnerable or sensitive applications.
47
Chen, Chaung-Kai, and 陳琮闓. "A Hybrid Overlay Multicast Routing Protocol for MANETs." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/94411208294316334286.
Full textAbstract:
碩士國立交通大學
資訊科學系所
92
We propose a novel multicast routing protocol, called hybrid overlay multicast routing protocol (HOMRP) for MANETs (Mobile Ad hoc NETworks). Existing overlay multicast routing protocols in MANETs have the main drawback of high packet delivery delay. In order to improve this shortcoming, we integrate multicasting and unicast tunnels for efficient packet delivery. In HOMRP, it creates multiple local multicast trees. Each pair of parent node and child node in a local multicast tree is at a distance of one-hop. It uses multicasting to deliver multicast packets in local multicast trees. This will provide efficient data forwarding. Unicast tunnels are used for transmitting packets between local multicast trees. To avoid looping routes between local multicast trees, each local multicast tree is assigned a tree ID. To deal with dynamic changing of network topology in MANETs, HOMRP uses a tree consolidation scheme for highly efficient data forwarding. In addition, in order to reduce the overhead of control messages flooding, we adopt two-level flooding for member discovery by limiting the value of TTL in a packet. HOMRP does not restrict to use any specific unicast routing protocol; hence it can operate with any unicast routing protocols. Route maintenance in HOMRP is initiated by each multicast group member. Each member only needs to maintain the nearby members. The same route structure of a multicast group can be shared by multiple senders (sources); this brings high efficiency of route maintenance. Simulation results have shown that the packet delivery ratio of HOMRP is close to that of ODMRP and is 50% better than that of AMRoute. HOMRP reduces 18% control overhead compared to ODMRP and reduces 9% end-to-end packet delay compared to AMRoute. In sum, HOMRP provides lower control overhead, high packet delivery ratio and is especially suitable for multicast applications with larger number of senders, compared to other approaches.
48
Huang, Po-Yueh, and 黃柏岳. "Hybrid-Structure Routing Protocol for Mobile Sensor Network Applications." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/71077246926425813186.
Full textAbstract:
碩士國立東華大學
資訊工程學系
94
Many studies assume that all sensor nodes and sinks in wireless sensor network are stationary. However, recent applications in battlefield, factory automation, chemical pollution monitoring, healthcare, and home security enable sinks to move dynamically to archive their jobs. Therefore, sink mobility has become increasingly important in various sensor applications. Handling such mobile sink conditions brings new challenges to large-scale sensor networking. The multi-hop dissemination path established from a source to a mobile sink may quickly become useless because of frequent network topology changes. The increased control message traffic can diminish the energy savings obtained by resetting multi-hop dissemination paths. Adopting conventional approaches or routing protocols to handle sink mobility significantly reduce the whole network lifetime discount. This investigation presents a Hybrid-Structure Routing Protocol (HSRP) combining the benefits of grid-based and cluster-based structures. The grid structure is adopted to divide the entire sensor network into many uniform cells. The four vertex nodes are selected to be the virtual cluster header of each virtual cluster. The grid-based structure can help solve the cluster header selection problem. All virtual cluster headers divide the entire sensor network uniformly as a grid structure. Therefore, the number of nodes in each virtual cluster is approximately equal. This feature prolongs the average network lifetime. In this hybrid-structure, a mobile sink selects the closest edge node as its agent. This edge node forwards data between mobile sinks and other edge nodes. The edge node forwards query messages to further node in the direction of the source, according to its routing table. The virtual cluster architecture is adopted to handle the sink mobility problem. When the mobile sink moves to another virtual cluster, it sends a leaving message to its original edge node. The original edge node then saves the current data in its cache. The new edge node selected by the mobile sink requests the previous saved data from the original edge node, and establishes a routing path toward to the source. The proposed HSRP mechanism for sensor network application can handle the sink mobility successfully, and continually deliver data to mobile sink. The simulation results indicate that proposed HSRP mechanism reduces energy consumption by about 28% than other approach. Furthermore, HSRP mechanism has a lower average delay time, higher successful ratio, and longer network lifetime.
49
Peng, Feng-Shiu, and 彭凡修. "A hybrid routing protocol for mobile ad hoc networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/88810541195982806269.
Full textAbstract:
碩士玄奘大學
資訊科學學系碩士班
97
A mobile ad hoc network is a kind of network with high environmental adaptability for that it does not need any fixed infrastructure. The absence of fixed infrastructure also causes many network issues, such as routing problem. Most of the relative researches discuss how to construct a routing path between two mobile nodes through other nodes. However, the more mobile nodes involved in a routing path, the data transmission will cause more nodes consume their valuable energy. In this paper, we propose a modified AODV protocol to construct routing path by using both the mobile nodes and base stations. For the base stations are connected by wired network, the distance between two base stations can be much longer than the distance between two mobile nodes; and the transmission on wired network consumes no valuable energy of any mobile node. Thus, the routing path constructed by the proposed protocol will involve less mobile nodes and cost less energy of mobile nodes. The results of our primary simulations show that the proposed protocol does get shorter paths （with less mobile nodes） when more base stations are setup.
50
Page, Jonathan Grant. "Energy efficient hybrid routing protocol for wireless sensor networks." Diss., 2008. http://hdl.handle.net/2263/27724.
Full textAbstract:
A wireless sensor network is designed to monitor events and report this information to a central location, or sink node. The information is required to efficiently travel through the network. It is the job of the routing protocol to officiate this process. With transmissions consuming the majority of the energy available to a sensor node, it becomes important to limit their usage while still maintaining reliable communication with the sink node. The aim of the research covered in this dissertation was to adapt the flat and hierarchical architectures to create a new hybrid that draws on current protocol theories. The designed and developed protocol, Hybrid Energy Efficient Routing (HEER) protocol, builds upon the initial groundwork laid out by the previously developed Simple Energy Efficient Routing (SEER) protocol designed by C.J. Leuschner. Another aspect of the work was to focus on the current lack of credibility that is present in the WSN research community. The validity of SEER was examined and tested and this led to the main focus of this research, ensuring that HEER proves to be valid. The HEER protocol for wireless sensor networks is designed such that it is computationally simple, limits the number of transmissions, employs a cross-layer approach, is reliable, is energy-aware, has limited support for mobile nodes, is energy efficient, and most importantly is credible. Sensor nodes are extremely limited when it comes to their available energy resources. To maximise the node and network lifetimes requires the designed algorithm to be energy aware and as efficient as possible. A cross-layer design approach is followed which allows for the different layers of the OSI model to interact. The HEER protocol limits the number of transmissions that are used for network operation. This is achieved by using a minimal amount of messages for network setup and by selecting the optimal route. Route selection is calculated using hop count, current energy available, energy available on the receiving node, and lastly the energy required to reach the destination node. HEER combines and expands upon the method used by SEER for route selection. Network lifetime for networks of large sizes is increased, mainly due to more efficient routing of messages. The protocol was kept computationally simple and energy efficient, thus maintaining network survivability for as long as possible.Dissertation (MEng)--University of Pretoria, 2008.
Electrical, Electronic and Computer Engineering
unrestricted