Search results for "Tribute"

showing 10 items of 1455 documents

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…

Routing protocol020203 distributed computingComputer Networks and CommunicationsComputer sciencebusiness.industryNetwork packetComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsContext (language use)02 engineering and technologyNetwork topologyIPv6Key distribution in wireless sensor networksHardware and Architecture0202 electrical engineering electronic engineering information engineeringTimerbusinessWireless sensor networkSoftwareComputer networkInternational Journal of Ad Hoc and Ubiquitous Computing
researchProduct

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…

Routing protocol020301 aerospace & aeronautics0209 industrial biotechnologyoptimal information flowComputer scienceDistributed computingMulti-agent systemVisibility (geometry)Graph theory02 engineering and technologyLogical consensus algorithm020901 industrial engineering & automationSettore ING-INF/04 - Automatica0203 mechanical engineeringConsensusRouting (electronic design automation)Wireless sensor networkConnectivity
researchProduct

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 …

Routing protocolCognitive radiobusiness.industryComputer scienceDistributed computingRendezvousThroughputbusinessConnected dominating setComputer Science::Information TheoryComputer networkHop (networking)Communication channel2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications
researchProduct

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks

2009

International audience; A multichannel MAC improves throughput in wireless mesh networks by multiplexing transmissions over orthogonal channels. In this paper, we propose an efficient way for constructing the wireless mesh structure associated with Molecular MAC, a multichannel MAC layer designed for efficient packet forwarding. Molecular MAC outperforms other classical approaches, but requires a specific structure for efficient operation. First, we propose a centralized protocol that provides an upper bound for constructing such a molecular structure through a MILP (Mixed Integer Linear Programming) formulation that maximizes network capacity. Then, we present two distributed self-stabiliz…

Routing protocolComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Mesh networkingThroughput0102 computer and information sciences02 engineering and technology01 natural sciencesMultiplexinglaw.invention[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]law0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet ArchitectureComputer Science::Information TheorySpanning treeWireless mesh network[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industryRadio Link ProtocolComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPacket forwarding020206 networking & telecommunications010201 computation theory & mathematicsbusinessCommunication channelComputer network
researchProduct

ECAR: an Energy/Channel Aware Routing Protocol For Cooperative Wireless Sensor Networks

2011

International audience; The proliferation of low power networks like Wireless Sensor Networks (WSN) rose up new challenges. Power conservation and channel quality become the most important parameters. Obviously, hop count based routing protocols are no more adapted to such networks having power limitations and channel problems. Several alternatives were suggested to cope with these constraints. In MAC layer for example, cooperative protocols were designed to enhance the channel use: the neighbor nodes help the source to retransmit its packets. However, if the path proposed by the routing protocol contains poor channels, the cooperative communications will not save all the packets. Therefore…

Routing protocolDynamic Source RoutingComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Enhanced Interior Gateway Routing ProtocolWireless Routing Protocol02 engineering and technology01 natural sciencesHop (networking)Routing Information Protocol[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Ad hoc On-Demand Distance Vector Routing0202 electrical engineering electronic engineering information engineeringDestination-Sequenced Distance Vector routingwireless sensor networksComputingMilieux_MISCELLANEOUSenergy efficiency0105 earth and related environmental sciencesZone Routing ProtocolStatic routing010505 oceanographyNetwork packetbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPath vector protocol020206 networking & telecommunicationsDistance-vector routing protocolLink-state routing protocolOptimized Link State Routing ProtocolInterior gateway protocolbusinesscooperative relayingWireless sensor networkbiobjective routing protocolEfficient energy useComputer network
researchProduct

NICE-MRP: a Near-Optimal Radio-Interference Aware Multi-path Routing Protocol for MANETs

2013

International audience; Nowadays, with the miniaturization of communication devices, dense and highly mobile ad-hoc networks are very common. Besides, more and more devices have several radio interfaces. In such an environment, multi-path routing should be considered. Yet, only few multi-path ad-hoc routing protocols take into account the radio-interferences which might arise between two geographically close routes. Moreover, they generally only forbid the addition of interfering paths rather than looking for a different, more optimized, solution. This paper presents NICE-MRP, a novel multi-path routing protocol for mobile ad-hoc networks giving efficient solutions with respect to physical …

Routing protocolDynamic Source RoutingComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Wireless Routing Protocol050801 communication & media studies02 engineering and technologyRouting Information Protocol[INFO.INFO-MC]Computer Science [cs]/Mobile Computing[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0508 media and communications[INFO.INFO-MC] Computer Science [cs]/Mobile Computing0202 electrical engineering electronic engineering information engineeringZone Routing ProtocolStatic routing[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industry05 social sciencesComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationLink-state routing protocolInterior gateway protocol[INFO.INFO-MO] Computer Science [cs]/Modeling and SimulationbusinessComputer network
researchProduct

Distributed routing and channel allocation in multi-channel multi-hop ad hoc networks

2013

In this paper, we propose a novel routing protocol which is integrated with channel assignment for multi-channel multi-hop wireless ad hoc networks. In such a network, each node is equipped with three transceivers. One is always tuned on a control channel which is responsible for control and broadcast messages, and the other two perform as transmitter and receiver respectively for traffic flows on different data channels. The routing protocol works in an on-demand manner, and the proposed routing discovery process selects a path that potentially traverses nodes with lighter traffic load and lower number of carried flows. With a given number of non-overlapping channels, the optimal solution …

Routing protocolDynamic Source RoutingComputer scienceWireless ad hoc networkDistributed computingEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolHop (networking)Routing Information ProtocolControl channelDestination-Sequenced Distance Vector routingZone Routing ProtocolStatic routingChannel allocation schemesAdaptive quality of service multi-hop routingbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPath vector protocolAd hoc wireless distribution serviceDistance-vector routing protocolLink-state routing protocolOptimized Link State Routing ProtocolMultipath routingInterior gateway protocolHazy Sighted Link State Routing ProtocolbusinessComputer network2013 IEEE Wireless Communications and Networking Conference (WCNC)
researchProduct

RBCR: a Relay-Based Cooperative Routing Protocol for Cooperative Wireless Sensor Network

2011

International audience; In wireless sensor networks several constraints decrease communications performances. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances.

Routing protocolDynamic Source RoutingComputer scienceWireless ad hoc networkDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]0211 other engineering and technologiesWireless Routing Protocol02 engineering and technologylaw.invention[SPI]Engineering Sciences [physics][INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]RelaylawAd hoc On-Demand Distance Vector Routing0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUS021103 operations researchmulti-objective routing protocolbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsRouting (electronic design automation)cooperative relayingbusinessWireless sensor networkComputer network
researchProduct

A combined relay-selection and routing protocol for cooperative wireless sensor networks

2012

International audience; In wireless sensor networks several constraints decrease communications performances. In fact, channel randomness and energy restrictions make classical routing protocols inefficient. Therefore, the design of new routing protocols that cope with these constraints become mandatory. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances in term of delivery ratio, power …

Routing protocolDynamic Source RoutingComputer science[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Distributed computingEnhanced Interior Gateway Routing ProtocolWireless Routing Protocol02 engineering and technologylaw.inventionRouting Information Protocol[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Ad hoc On-Demand Distance Vector RoutingRelaylaw0202 electrical engineering electronic engineering information engineeringDestination-Sequenced Distance Vector routingHierarchical routingZone Routing ProtocolStatic routingbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPolicy-based routingPath vector protocol020206 networking & telecommunicationsEnergy consumptionAd hoc wireless distribution serviceKey distribution in wireless sensor networksDistance-vector routing protocolOptimized Link State Routing ProtocolLink-state routing protocolMultipath routingInterior gateway protocol020201 artificial intelligence & image processingHazy Sighted Link State Routing ProtocolbusinessWireless sensor networkEfficient energy useComputer network2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC)
researchProduct

Distance Constrained Mapping to Support NoC Platforms Based on Source Routing

2010

Efficient NoC is crucial for communication among processing elements in a highly parallel processing systems on chip. Mapping cores to slots in a NoC platform and designing efficient routing algorithms are two key problems in NoC design. Source routing offers major advantages over distributed routing especially for regular topology NoC platforms. But it suffers from a serious drawback of overhead since it requires whole communication path to be stored in every packet header. In this paper, we present a core mapping technique which helps to achieve a mapping with the constraint over the path length. We have found that the path length constraint of just 50% is sufficient in most cases. We als…

Routing protocolDynamic Source RoutingEqual-cost multi-path routingComputer scienceRouting tableDistributed computingEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolGeographic routingSource routingRouting Information ProtocolHeaderDestination-Sequenced Distance Vector routingTriangular routingZone Routing ProtocolStatic routingbusiness.industryPolicy-based routingPath vector protocolDSRFLOWNetwork on a chipLink-state routing protocolRouting domainMultipath routingbusinessComputer network
researchProduct