Search results for "Routing protocol"
showing 10 items of 81 documents
Group mobility impact over TCP and CBR traffic in mobile ad hoc networks
2004
We present an analysis of the effect that mobility models have over the performance of a mobile ad hoc network. We concentrate on group mobility because there is a growing attention on the development and evaluation of MANET's approach applied to personal area networks (PANs), especially based on Bluetooth technology. We investigate the effect that the mobility model has on the performance of CBR traffic and TCP traffic. We propose four different group mobility models and describe a mobility pattern generator called grcmob to be used with the ns-2 simulator. We perform a thorough evaluation of a MANET behavior using as a reference the behavior obtained with the random waypoint mobility mode…
Multicast access control concept for xDSL-customers
2006
Multicast is a tempting possibility for many broad- band services. It makes possible to deliver one data-stream to several receivers simultaneously. IP-Multicast is based on an open group concept. This means that it is possible for all the users to join the group and thus receive the data. The open concept is also the main reason why multicast has not been taken in wider use. There is two different solution to solve this problem, group access control and multicast data encryption. Group access control mechanisms focuses on restricting the group membership at the users edge device. Traffic encryption scheme relies on end-to-end encryption, so a key management architecture is also needed. We …
Quality of Service Multicasting over Differentiated Services Networks
2003
This paper proposes a solution to support real-time multicast traffic with Quality of Service (QoS) constraints over Differentiated Services (DiffServ) IP networks. Our solution allows multicast users to dynamically join and leave the multicast tree. Moreover, it allows a multicast user which has negotiated a best-effort session to upgrade to a QoS-enabled session. Our solution is backward compatible with the Protocol Independent Multicast (PIM) scheme. It combines two ideas. First, resource availability along a new QoS path is verified via a probe-based approach. Second, QoS is maintained by marking replicated packets with a special DSCP value, before forwarding them on the QoS path.
Clustering-Based Algorithm for Connectivity Maintenance in Vehicular Ad-Hoc Networks
2014
International audience; Among recent advances in wireless communication technologies' field, Vehicular Ad-hoc Networks (VANETs) have drawn the attention of both academic and industry researchers due to their potential applications including driving safety, entertainment, emergency applications, and content sharing. VANET networks are characterized by their high mobile topology changes. Clustering is one of the control schemes used to make this global topology less dynamic. It allows the formation of dynamic virtual backbone used to organize the medium access, to support quality of service and to simplify routing. Mainly, nodes are organized into clusters with at least one cluster head (CH) …
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…
An efficient distributed approach for dynamic multicast trees
2005
In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…
A new Scheme for RPL to handle Mobility in Wireless Sensor Networks
2017
Mobile wireless sensor networks (WSNs) are characterised by dynamic changes in the network topology leading to route breaks and disconnections. The IPv6 routing protocol for low power and lossy networks (RPL), which has become a standard, uses the Trickle timer algorithm to handle changes in the network topology. However, neither RPL nor Trickle timer are well adapted to mobility. This paper investigates the problem of supporting mobility when using RPL. It enhances RPL to fit with sensors' mobility by studying two cases. Firstly, it proposes to modify RPL in order to fit with a dynamic and hybrid topology in the context of medical applications. Secondly, it investigates a more general case…
A self-routing protocol for distributed consensus on logical information
2010
In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision. The approach therein proposed is based on the construction of an iterative map, whose computation is centralized and guaranteed under suitable conditions on the input visibility and graph connectivity. Under the same conditions, we extend the approach in this work by allowing the construction o…
I-RP: Interference Aware Routing Protocol for WBAN
2018
The Wireless Body Sensor Networks (WBSN) have witnessed tremendous research interest because of their wide range of applications (medical and non-medical) in order to improve the quality of life. The healthcare applications of WBSN demands dissemination of patient’s data, reliably and in a timely manner. For this purpose, medical teams may use real-time applications for disseminating critical data such as blood pressure, ECG, and EEG. The critical data packets are highly delay sensitive that must reach intended destination within time constraints. Due to the exchange of real-time and multi-media data, some nodes or links may experience the significant level of interference in the network. C…
Power-constrained sensor selection and routing for cooperative detection in cognitive radios
2012
Given a spectrum-sensing network, a set of active nodes jointly aggregate sensed data at a preset frequency-band and simultaneously route this information to an arbitrarily chosen querying node through a power-constrained multi-hop path. Locally, each sensor node is assumed to be an energy-based detector. This work focuses on deriving algorithms that jointly optimize sensor selection and cooperative detection from which a power-efficient route to the querying node can be established, and then, a tree routing structure spanning the chosen nodes is constructed under a power budget constraint. Sensor information is sequentially aggregated along this optimized routing structure up to the queryi…