Search results for "Dynamic Source Routing"
showing 10 items of 33 documents
QoS Based Routing Protocol for Intra-Mesh Infrastructure Communications
2015
International audience; Mesh Networks (WMNs) have been considered as a promising alternative to conventional wired networks, thanks to its flexibility and easy deployment. Thus, to ensure a satisfying level of QoS guarantees for real-time and streaming applications such as Voice over IP (VoIP) and Video on Demand (VoD), we propose a novel QoS based routing protocol for wireless mesh environments, called Hybrid QoS Mesh Routing (HQMR), jointly with a clustering algorithm to enhance scalability issues within the mesh infrastructure. HQMR is composed of two routing sub-protocols: a reactive routing sub-protocol for intra-infrastructure communications and a proactive QoS based multi-tree routin…
Self-configuring multipath intra-mesh infrastructure QoS based routing
2016
International audience; Multi-path routing concept was largely exploited in wireless networks to provide benefits such as fault tolerance, load balancing, performance improvement in terms of latency, etc. In this paper, we propose a multi-path routing based protocol named MP-IMRR (Multi-path Intra-Mesh infrastructure Routing protocol) to improve our previously defined QoS based routing protocol for wireless mesh networks (i.e. IMRR). MP-IMRR is defined in order to achieve better reactivity and faster recovery from eventual route failures than the IMRR protocol by adopting the backup routes concept. Besides, given the complexity increase while considering network management systems, we adopt…
Cooperative layer-2 based routing approach for hybrid wireless mesh networks
2013
In a Wireless Mesh Network (WMN), the convenience of a routing strategy strongly depends on the mobility of the intermediate nodes that compose the paths. Taking this behaviour into account, this paper presents a routing scheme that works differently accordingly to the node mobility. In this sense, a proactive routing scheme is restricted to the backbone to promote the use of stable routes. Conversely, the reactive protocol is used for searching routes to or from a mobile destination. Both approaches are simultaneously implemented in the mesh nodes so that the routing protocols share routing information that optimises the network performance. Aimed at guaranteeing the IP compatibility, the …
A secure intersection-based routing protocol for data collection in urban vehicular networks
2014
Data routing has gained great intention since the appearance of Vehicular Networks (VANETs). However, in the presence of attackers, reliable and trustworthy operations in such networks become impossible without securing routing protocols. In this paper, we target to study and design a secure routing protocol S-GyTAR for vehicular environments. Several kinds of routing techniques are proposed in the literature and could be classified into topology-based or position-based strategies. Position-based is the most investigated strategy in vehicular networks due to the unique characteristics of such networks. For this reason, this work is based on the well-known intersection-based routing protocol…
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…
IMRR and IMPR Routing Protocols For Inter and Intra Wireless Mesh Communications
2015
Given the evolution of wireless technologies, Wireless Mesh Networks (WMN) have appeared as an emerging low-cost solution to ensure last-mile connectivity to the Internet network. However, providing real-time and streaming applications, such as VoIP (Voice over IP) and VoD (Video on Demand), with a satisfying QoS level is considered as an important challenge within these networks. In this paper, we propose a QoS based routing protocol, called Hybrid QoS Mesh Routing (HQMR), jointly with a clustering algorithm to improve the scalability of mesh networks. HQMR is composed of two routing sub- protocols: a reactive QoS based routing protocol for intra-mesh infrastructure communications and a pr…
Robust Data Gathering for Wireless Sensor Networks
2006
2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Proceedings Volume 1, 2005, Article number 1635527, Pages 469-474 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications; Kuala Lumpur; Malaysia; 16 November 2005 through 18 November 2005; Category number05EX1235; Code 69262 Robust data gathering for wireless sensor networks (Conference Paper) Ortolani, M. , Gatani, L. , Lo Re, G. Dipartimento di Ingegneria Informatica, Università degli Studi di Palermo, Viale delle Scienze Parco d'Orleans, 90128 Palermo, Italy View re…
A service-oriented routing scheme with load balancing in wireless mesh networks
2008
Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…
An Efficient Implementation of Distributed Routing Algorithms for NoCs
2008
The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most …
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.