Search results for "Optimized Link State Routing Protocol"

showing 7 items of 17 documents

On the Interaction Between IEEE 802.11e and Routing Protocols in Mobile Ad-Hoc Networks

2005

The upcoming IEEE 802.11e standard was developed to offer QoS capabilities to WLAN, offering significative improvements to multimedia traffic. MANETs also benefit from this new technology since the most widely deployed and used wireless interfaces are IEEE 802.11 based. In this paper we expose results relative to the interaction of reactive routing protocols for MANETs and the IEEE 802.11e technology. We find that very substantial improvements in terms of throughput and normalized routing overhead are achieved due to increased routing responsiveness. We also detail the relation between the behavior experienced in each case and the internal mechanisms of the routing protocol being used, offe…

Routing protocolDynamic Source RoutingZone Routing ProtocolComputer sciencebusiness.industryDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPolicy-based routingWireless Routing ProtocolOptimized Link State Routing ProtocolLink-state routing protocolbusinessComputer networkIEEE 802.11s13th Euromicro Conference on Parallel, Distributed and Network-Based Processing
researchProduct

Evaluating a bound for MANETs routing protocols performance using graphs with activation windows

2008

In this paper we present an algorithm called STPA (shortest time path algorithm) which aims at providing a comparison tool for the evaluation of a bound for mobile ad hoc networks (MANETs) routing protocols performance. STPA provides an exhaustive evaluation of an ideal routing protocol. Based on the current position and state of the nodes it can determine factors like: how many complete messages get to the destination, which is the smallest amount of time required by a packet to get to the destination, which path followed each packet, and so on. This values would allow a protocol designer to improve or fine tune his proposal. We demonstrate that the complexity of the algorithm is O(sigma2)…

Routing protocolWireless ad hoc networkEqual-cost multi-path routingComputer sciencebusiness.industryDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSWireless Routing ProtocolMobile ad hoc networkOptimized Link State Routing ProtocolLink-state routing protocolComputer Science::Networking and Internet ArchitectureDestination-Sequenced Distance Vector routingbusinessComputer networkProceedings of the 6th Intl Symposium on Modeling and Optimization
researchProduct

An optimized path-selection using airtime metric in OLSR networks: Implementation and testing

2008

Wireless mesh networks used for broadband access may be equipped with multiple Internet gateways. Using airtime metric as the main criterion for path selection is an effective method for achieving load-balancing in such a multi-homed mesh network. In this paper, we describe how the radio-aware path selection using airtime as a metric can be implemented in order to achieve this functionality, based on a modified version of an open source OLSR implementation. The paper presents both the principle of this method, its implementation and the empirical results which focus on testing the airtime metric functionality based on a deployed small-scale test network.

Routing protocolWireless mesh networkComputer sciencebusiness.industryDistributed computingMesh networkingLoad balancing (computing)Optimized Link State Routing ProtocolBroadbandComputer Science::Networking and Internet ArchitectureThe InternetbusinessInternetworkingComputer network2008 IEEE International Symposium on Wireless Communication Systems
researchProduct

Circuit-Elimination based Link-State Routing in Mobile Ad-hoc Networks

2007

Circuit-elimination based connected dominating set formation is an efficient technique for reducing routing overhead in mobile ad hoc networks. In this paper, we propose a new message dissemination algorithm which utilizes such techniques to reduce the number of nodes that generate or forward link state advertisements in link state routing protocols. Simulation results with both static and dynamic network topologies demonstrate the potential of the proposed algorithm to reduce routing overhead, compared with a benchmark link state routing protocol, OLSR.

Static routingZone Routing ProtocolDynamic Source Routingbusiness.industryComputer scienceDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSWireless Routing ProtocolAd hoc wireless distribution serviceLink-state routing protocolOptimized Link State Routing ProtocolComputer Science::Networking and Internet ArchitectureDestination-Sequenced Distance Vector routingbusinessComputer network
researchProduct

Privacy-preserving scheme for mobile ad hoc networks

2011

This paper proposes a decentralized trust establishment protocol for mobile ad hoc networks (MANETs), where nodes establish security associations. In order to achieve privacy and security, we use homomorphic encryption and polynomial intersection so as to find the intersection of two sets. The first set represents a list of recommenders of the initiator and the second set is a list of trusted recommenders of the responder. The intersection of the sets represents a list of nodes that recommend the first node and their recommendations are trusted by the second node. In our experimental results we show that our scheme is effective even if there are 30 trusted nodes.

Vehicular ad hoc networkComputer scienceWireless ad hoc networkbusiness.industryMobile computingCryptographyMobile ad hoc networkEncryptionQA76Optimized Link State Routing ProtocolSecurity associationReputation systemComputer Science::Networking and Internet ArchitecturebusinessComputer Science::Cryptography and SecurityComputer network2011 IEEE Symposium on Computers and Communications (ISCC)
researchProduct

Castadiva: A Test-Bed Architecture for Mobile AD HOC Networks

2007

Evaluating and deploying all sorts of protocols and applications designed for wireless ad hoc networks in a real environment is an important and urgent task. Traditionally, all the proposals made rely solely on simulator results. However, as different research groups develop different solutions to solve problems related to these new networks, it becomes more and more important to migrate the proposed solutions to a real environment. In this work we present Castadiva, a test-bed architecture that allows validating software solutions for ad hoc networks using low-cost, of the-shelf devices and open source software. Through a friendly user interface, Castadiva offers the possibility to define …

Vehicular ad hoc networkOptimized Link State Routing Protocolbusiness.industryWireless ad hoc networkComputer scienceDistributed computingMobile computingMobile ad hoc networkAd hoc wireless distribution servicebusinessComputer network2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications
researchProduct

Multipath extensions to the DYMO routing protocol

2007

Multipath routing is a technique that can improve performance, specially in mobile ad hoc networks. Due to traffic dispersion it can perform load balancing; minimize the energy consumed by nodes or prevent traffic analysis. In this work we focus on enhancing the DYMO protocol to support multipath routing. We study the impact of traffic dispersion on both UDP and TCP traffic when varying a set of parameters.

Zone Routing ProtocolDynamic Source Routingbusiness.industryComputer scienceDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolLink-state routing protocolOptimized Link State Routing ProtocolMultipath routingComputer Science::Networking and Internet ArchitectureDestination-Sequenced Distance Vector routingbusinessComputer network2007 9th IFIP International Conference on Mobile Wireless Communications Networks
researchProduct