Log in

Relevant bibliographies by topics / Routing protocols (Computer network protocols) / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Routing protocols (Computer network protocols).

Dissertations / Theses on the topic 'Routing protocols (Computer network protocols)'

Author: Grafiati

Published: 4 June 2021

Last updated: 31 July 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 'Routing protocols (Computer network 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

alyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

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

APA, Harvard, Vancouver, ISO, and other styles

3

Jayakeerthy, Arunkumar Thippur Lim Alvin S. "Query-localized route repair mechanism for ad-hoc on-demand distance vector routing algorithm." Auburn, Ala, 2009. http://hdl.handle.net/10415/1608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

APA, Harvard, Vancouver, ISO, and other styles

5

Jin, Jingren Lim Alvin S. "Improving geographic routing with neighbor sectoring." Auburn, Ala., 2007. http://hdl.handle.net/10415/1337.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

APA, Harvard, Vancouver, ISO, and other styles

7

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

APA, Harvard, Vancouver, ISO, and other styles

8

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

APA, Harvard, Vancouver, ISO, and other styles

9

Ahmed, Mahad A. (Mahad Mohamed) 1973 Carleton University Dissertation Engineering Systems and Computer. "Performance analysis and improvement of the Open Shortest Path First routing protocol." Ottawa.:, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

11

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

12

Ekici, Eylem. "Routing and multicasting in satellite IP networks." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/15605.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Zhao, Xiaogeng. "An adaptive approach for optimized opportunistic routing over Delay Tolerant Mobile Ad hoc Networks." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1004822.

Full text

Abstract:

This thesis presents a framework for investigating opportunistic routing in Delay Tolerant Mobile Ad hoc Networks (DTMANETs), and introduces the concept of an Opportunistic Confidence Index (OCI). The OCI enables multiple opportunistic routing protocols to be applied as an adaptive group to improve DTMANET routing reliability, performance, and efficiency. The DTMANET is a recently acknowledged networkarchitecture, which is designed to address the challenging and marginal environments created by adaptive, mobile, and unreliable network node presence. Because of its ad hoc and autonomic nature, routing in a DTMANET is a very challenging problem. The design of routing protocols in such environments, which ensure a high percentage delivery rate (reliability), achieve a reasonable delivery time (performance), and at the same time maintain an acceptable communication overhead (efficiency), is of fundamental consequence to the usefulness of DTMANETs. In recent years, a number of investigations into DTMANET routing have been conducted, resulting in the emergence of a class of routing known as opportunistic routing protocols. Current research into opportunistic routing has exposed opportunities for positive impacts on DTMANET routing. To date, most investigations have concentrated upon one or other of the quality metrics of reliability, performance, or efficiency, while some approaches have pursued a balance of these metrics through assumptions of a high level of global knowledge and/or uniform mobile device behaviours. No prior research that we are aware of has studied the connection between multiple opportunistic elements and their influences upon one another, and none has demonstrated the possibility of modelling and using multiple different opportunistic elements as an adaptive group to aid the routing process in a DTMANET. This thesis investigates OCI opportunities and their viability through the design of an extensible simulation environment, which makes use of methods and techniques such as abstract modelling, opportunistic element simplification and isolation, random attribute generation and assignment, localized knowledge sharing, automated scenario generation, intelligent weight assignment and/or opportunistic element permutation. These methods and techniques are incorporated at both data acquisition and analysis phases. Our results show a significant improvement in all three metric categories. In one of the most applicable scenarios tested, OCI yielded a 31.05% message delivery increase (reliability improvement), 22.18% message delivery time reduction (performance improvement), and 73.64% routing depth decrement (efficiency improvement). We are able to conclude that the OCI approach is feasible across a range of scenarios, and that the use of multiple opportunistic elements to aid decision-making processes in DTMANET environments has value.

APA, Harvard, Vancouver, ISO, and other styles

14

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

15

Ho, Yao Hua. "Connectionless approach--a localized scheme to mobile ad hoc networks." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002742.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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 text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

17

Wibling, Oskar. "Creating Correct Network Protocols." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9361.

Full text

Abstract:

Network protocol construction is a complex and error prone task. The challenges originate both from the inherent complexity of developing correct program code and from the distributed nature of networked systems. Protocol errors can have devastating consequences. Even so, methods for ensuring protocol correctness are currently only used to a limited extent. A central reason for this is that they are often complex and expensive to employ. In this thesis, we develop methods to perform network protocol testing and verification, with the goal to make the techniques more accessible and readily adoptable. We examine how to formulate correctness requirements for ad hoc routing protocols used to set up forwarding paths in wireless networks. Model checking is a way to verify such requirements automatically. We investigate scalability of finite-state model checking, in terms of network size and topological complexity, and devise a manual abstraction technique to improve scalability. A methodology combining simulations, emulations, and real world experiments is developed for analyzing the performance of wireless protocol implementations. The technique is applied in a comparison of the ad hoc routing protocols AODV, DSR, and OLSR. Discrepancies between simulations and real world behavior are identified; these are due to absence of realistic radio propagation and mobility models in simulation. The issues are mainly related to how the protocols sense their network surroundings and we identify improvements to these capabilities. Finally, we develop a methodology and a tool for automatic verification of safety properties of infinite-state network protocols, modeled as graph transformation systems extended with negative application conditions. The verification uses symbolic backward reachability analysis. By introducing abstractions in the form of summary nodes, the method is extended to protocols with recursive data structures. Our tool automatically verifies correct routing of the DYMO ad hoc routing protocol and several nontrivial heap manipulating programs.

APA, Harvard, Vancouver, ISO, and other styles

18

Khan, Nabeel Pervaiz. "Performance evaluation of on demand multicast routing protocol for ad hoc wireless networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 56 p, 2009. http://proquest.umi.com/pqdweb?did=1891510831&sid=1&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Yan, Wei. "Synchronization, buffer management, and multicast routing in multimedia networks." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/13426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

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

21

Boyd, Alan W. F. "Node reliance : an approach to extending the lifetime of wireless sensor networks." Thesis, University of St Andrews, 2010. http://hdl.handle.net/10023/1295.

Full text

Abstract:

A Wireless Sensor Network (WSN) consists of a number of nodes, each typically having a small amount of non-replenishable energy. Some of the nodes have sensors, which may be used to gather environmental data. A common network abstraction used in WSNs is the (source, sink) architecture in which data is generated at one or more sources and sent to one or more sinks using wireless communication, possibly via intermediate nodes. In such systems, wireless communication is usually implemented using radio. Transmitting or receiving, even on a low power radio, is much more energy-expensive than other activities such as computation and consequently, the radio must be used judiciously to avoid unnecessary depletion of energy. Eventually, the loss of energy at each node will cause it to stop operating, resulting in the loss of data acquisition and data delivery. Whilst the loss of some nodes may be tolerable, albeit undesirable, the loss of certain critical nodes in a multi-hop routing environment may cause network partitions such that data may no longer be deliverable to sinks, reducing the usefulness of the network. This thesis presents a new heuristic known as node reliance and demonstrates its efficacy in prolonging the useful lifetime of WSNs. The node reliance heuristic attempts to keep as many sources and sinks connected for as long as possible. It achieves this using a reliance value that measures the degree to which a node is relied upon in routing data from sources to sinks. By forming routes that avoid high reliance nodes, the usefulness of the network may be extended. The hypothesis of this thesis is that the useful lifetime of a WSN may be improved by node reliance routing in which paths from sources to sinks avoid critical nodes where possible.

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

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.
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

24

謝紹康 and Siu-hong Savio Tse. "The performance of interval routing in general networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31236200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Tse, Siu-hong Savio. "The performance of interval routing in general networks /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1863574X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Al-Mousa, Yamin Samir. "MAC/routing design for under water sensor networks /." Online version of thesis, 2007. http://hdl.handle.net/1850/4496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

28

Kulkarni, Shrinivas Bhalachandra. "The simulation studies on a behaviour based trust routing protocol for ad hoc networks." Diss., Online access via UMI:, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

30

Ayaz, Beenish. "Improving routing performance of underwater wireless sensor networks." Thesis, University of Aberdeen, 2016. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=235433.

Full text

Abstract:

In this research work we propose a 3D node deployment strategy by carefully considering the unique characteristics of underwater acoustic communication as well as 3D dynamic nature of UWSN. This strategy targets 3D UWSN and not only improves the routing protocol performance significantly in terms of end to end delay and energy consumption but also provides reliability in data transmission. This strategy has been developed step by step from a single line of vertical communication to an effective 3D node deployment for UWSN. Several simulation experiments were carried out after adding different features to the final design to observe their impact on the overall routing performance. Finally, it is verified that this design strategy improves the routing performance, provides reliability to the network and increases network lifetime. Furthermore, we compared our results to the random node deployment in 3D, which is commonly used for analysing the performance of UWSN routing protocols. The comparison results verified our effective deployment design and showed that it provides almost 150% less end-to-end delay and almost 25% less energy consumption to the random deployment. It also revealed that by increasing the data traffic, our 3D node deployment strategy has no loss of data due to several back-up paths available, which is in contrast to random node deployment, where the packet loss occurs by increasing the data traffic. Improving the routing performance by carefully analysing the impact of 3D node deployment strategy and ensuring full sensing, transmission and back-up coverage in a highly unpredictable underwater environment, is a novel approach. Embedding this strategy with any networking protocol will improve its performance significantly.

APA, Harvard, Vancouver, ISO, and other styles

31

Mehendale, Hrushikesh Sanjay. "Lifenet: a flexible ad hoc networking solution for transient environments." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42781.

Full text

Abstract:

In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms. LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience. With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback. I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.

APA, Harvard, Vancouver, ISO, and other styles

32

Cappetto, Peter Michael. "History-based route selection for reactive ad hoc routing protocols." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Spring2007/p_cappetto_042207.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

CAVALCANTI, DAVE ALBERTO TAVARES. "INTEGRATED ARCHITECTURE AND ROUTING PROTOCOLS FOR HETEROGENEOUS WIRELESS NETWORKS." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1140716621.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

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

35

Parthasarathy, Madhusoodan. "Routing in the presence of groups in MANETs." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/m_parthasarathy_020409.pdf.

Full text

Abstract:

Thesis (M.S. in computer science)--Washington State University, May 2009.
Title from PDF title page (viewed on July 21, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 113-117).

APA, Harvard, Vancouver, ISO, and other styles

36

Lakshmanan, Sriram. "Cooperative communication in wireless networks: algorithms, protocols and systems." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42702.

Full text

Abstract:

Current wireless network solutions are based on a link abstraction where a single co-channel transmitter transmits in any time duration. This model severely limits the performance that can be obtained from the network. Being inherently an extension of a wired network model, this model is also incapable of handling the unique challenges that arise in a wireless medium. The prevailing theme of this research is to explore wireless link abstractions that incorporate the broadcast and space-time varying nature of the wireless channel. Recently, a new paradigm for wireless networks which uses the idea of 'cooperative transmissions' (CT) has garnered significant attention. Unlike current approaches where a single transmitter transmits at a time in any channel, with CT, multiple transmitters transmit concurrently after appropriately encoding their transmissions. While the physical layer mechanisms for CT have been well studied, the higher layer applicability of CT has been relatively unexplored. In this work, we show that when wireless links use CT, several network performance metrics such as aggregate throughput, security and spatial reuse can be improved significantly compared to the current state of the art. In this context, our first contribution is Aegis, a framework for securing wireless networks against eavesdropping which uses CT with intelligent scheduling and coding in Wireless Local Area networks. The second contribution is Symbiotic Coding, an approach to encode information such that successful reception is possible even upon collisions. The third contribution is Proteus, a routing protocol that improves aggregate throughput in multi-hop networks by leveraging CT to adapt the rate and range of links in a flow. Finally, we also explore the practical aspects of realizing CT using real systems.

APA, Harvard, Vancouver, ISO, and other styles

37

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

38

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

39

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

40

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 text

Abstract:

Computer and Information Science
Ph.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

APA, Harvard, Vancouver, ISO, and other styles

41

Kannan, Gangadharan. "Selective flooding for better QoS routing." Link to electronic version, 2000. http://www.wpi.edu/Pubs/ETD/Available/etd-0510100-143929/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Pompili, Dario. "Efficient Communication Protocols for Underwater Acoustic Sensor Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16301.

Full text

Abstract:

Underwater sensor networks find applications in oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation, tactical surveillance, and mine reconnaissance. The enabling technology for these applications is acoustic wireless networking. UnderWater Acoustic Sensor Networks (UW-ASNs) consist of sensors and Autonomous Underwater Vehicles (AUVs) deployed to perform collaborative monitoring tasks. The objective of this research is to explore fundamental key aspects of underwater acoustic communications, propose communication architectures for UW-ASNs, and develop efficient sensor communication protocols tailored for the underwater environment. Specifically, different deployment strategies for UW-ASNs are studied, and statistical deployment analysis for different architectures is provided. Moreover, a model characterizing the underwater acoustic channel utilization efficiency is introduced. The model allows setting the optimal packet size for underwater communications. Two distributed routing algorithms are proposed for delay-insensitive and delay-sensitive applications. The proposed routing solutions allow each node to select its next hop, with the objective of minimizing the energy consumption taking the different application requirements into account. In addition, a resilient routing solution to guarantee survivability of the network to node and link failures in long-term monitoring missions is developed. Moreover, a distributed Medium Access Control (MAC) protocol for UW-ASNs is proposed. It is a transmitter-based code division multiple access scheme that incorporates a novel closed-loop distributed algorithm to set the optimal transmit power and code length. It aims at achieving high network throughput, low channel access delay, and low energy consumption. Finally, an efficient cross-layer communication solution tailored for multimedia traffic (i.e., video and audio streams, still images, and scalar sensor data) is introduced.

APA, Harvard, Vancouver, ISO, and other styles

43

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

44

Lundgren, Henrik. "Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Yu, Xuan Hamilton John A. "A defense system on DDOS attacks in mobile ad hoc networks." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/YU_XUAN_49.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Mazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Goold, Jeremy C. "Improving Routing Security Using a Decentralized Public Key Distribution Algorithm." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd797.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

49

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Chitedze, Zimani. "Mobility management for Wi-Fi infrastructure and mesh networks." University of the Western Cape, 2012. http://hdl.handle.net/11394/2960.

Full text

Abstract:

Magister Scientiae - MSc
This thesis shows that mobility management protocols for infrastructure Internet may be used in a wireless mesh network environment. In this research Mobile IPv6 and Fast Handover for Hierarchical Mobile IPv6 are successfully implemented in a wireless mesh network environment. Two experiments were carried out: vertical and horizontal handover simulations. Vertical handover simulation involved a heterogeneous wireless environment comprising both wireless local area and wireless mesh networks. An OPNET Mobile IPv6 model was used to simulate the vertical handover experiment. Horizontal handover simulation involved Mobile IPv6 and Fast Handover for Hierarchical Mobile IPv6 applied in ns2 wireless mesh network. The vertical handover results show that MIPv6 is able to manage vertical handover between wireless local area and wireless mesh network. The horizontal handover results illustrate that in mesh networks, Fast Handover for Hierarchical Mobile IPv6's performance is superior to Mobile IPv6. Fast Handover for Hierarchical Mobile IPv6 generates more throughput and less delay than Mobile IPv6. Furthermore, Fast Handover for Hierarchical Mobile IPv6 drops less data packets than Mobile IPv6. The simulations indicate that even though there are multi-hop communications in wireless mesh networks, the performance of the multi-hop routing may not play a big role in the handover performance. This is so because the mesh routers are mostly static and the multi-hop routes are readily available. Thus, the total handover delay is not affected too much by the WMN hops in the paths for signaling message transmission.
South Africa

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!