Search results for "routing"
showing 10 items of 587 documents
Applications and numerical convergence of the partial inverse method
2006
In 1983, J.E. Spingarn introduced what he called the Partial Inverse Method in the framework of Mathematical Programming. Since his initial articles, numerous applications have been given in various fields including Lagrangian multipliers methods, location theory, convex feasibility problems, analysis of data, economic equilibrium problems. In a first part of this paper we give a survey of these applications. Then by means of optimization problems relevant to location theory such as single and multifacility minimisum or minimax location problems, we examine the main advantages of the algorithm and we point out its drawbacks mainly concerning the rate of convergence. We study how different p…
An Adaptive Routing Mechanism for Efficient Resource Discovery in Unstructured P2P Networks
2005
The widespread adoption of large-scale decentralized peer-to-peer (P2P) systems imposes huge challenges on distributed search and routing. Decentralized and unstructured P2P networks are very attractive because they require neither centralized directories, nor precise control over network topology or data placement. However their search mechanisms are extremely unscalable, generating large loads on the network participants. In this paper, to address this major limitation, we propose and evaluate the adoption of an innovative algorithm for routing user queries. The proposed approach aims at dynamically adapting the network topology to peer interests, on the basis of query interactions among …
Cost-Efficient On-Chip Routing Implementations for CMP and MPSoC Systems
2011
[EN] The high-performance computing domain is enriching with the inclusion of networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area, and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism, or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge. This paper presents universal logic-based distributed routing (uLBDR), an efficient logic-based mechanism that adapts to any irregular topology derived from 2-D meshes, instead of usi…
A Novel Fault-Tolerant Routing Technique for Mesh-of-Tree based Network-on-Chip Design
2018
Due to the increase in the number of processing elements in System-on-Chips (SoCs), communication between the cores is becoming complex. A solution to this issue in SoCs gave rise to a new paradigm called Network-on-Chips (NoCs). In NoCs, communication between different cores is achieved using packet based switching techniques. In the deep sub-micron technology, NoCs are more susceptible to different kinds of faults which can be transient, intermittent and permanent. These faults can occur at any component of NoCs. This paper presents a novel Fault-Tolerant Routing (FTR) technique for Mesh-of-Tree (MoT) topology in the presence of router faults. The proposed technique is compared with routi…
Fault Tolerant Routing Methodology for Mesh-of-Tree based Network-on-Chips using Local Reconfiguration
2018
Increase in the processing elements in a System-on- Chip (SoC) has led to an increasing complexity between the cores in the entire network. This communication bottleneck led to rise in the new paradigm called Network-on-Chip (NoC). These NoC are very much susceptible to various types of faults which can be transient, intermittent or permanent. This paper presents a fault-tolerant routing technique which can route the packets from a source to a destination in presence of permanent faults in the leaf routers of Mesh-of-Tree topology where cores are connected. This is achieved by using reconfiguration in the local ports of the leaf routers by inserting multiplexers as a layer between the leaf …
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…
MAC strategies for single rendezvous multi-hop cognitive radio networks
2009
This paper presents two MAC strategies for multi-hop cognitive radio networks in single radio multi-channel cases. Both strategies use one of the idle multiple channels for communication among secondary users, and the network will leave the current channel and jump to another channel as a group if any primary user appears. The first strategy is based on a pre-defined pattern that will always tune to the next available channel when primary user emerges. The second one is based on the concept of connected dominating set in which a backbone is formed in the network in order to keep the continuity of the communication. The strategies are evaluated in both homogeneous and heterogeneous channels …