[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Chaudet et al., 2012 - Google Patents

A model to evaluate brokers overlays for publish/subscribe in wireless sensor networks

Chaudet et al., 2012

Document ID
14355389374048639881
Author
Chaudet C
Demeure I
Ktari S
Publication year
Publication venue
2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)

External Links

Snippet

In this article, we propose a model to compare strategies to deploy a multiple brokers overlay to support a publish/subscribe middleware in wireless sensor networks. We provide expressions for the expected memory size required for buffering packets and the energy …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • H04L12/1886—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/121—Minimizing delay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H04W4/06—Selective distribution or broadcast application services; Mobile application services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control

Similar Documents

Publication Publication Date Title
Zhang et al. A neighbor coverage-based probabilistic rebroadcast for reducing routing overhead in mobile ad hoc networks
US8520556B2 (en) Terminal and N-tree constructing method
Oikonomou et al. IPv6 multicast forwarding in RPL-based wireless sensor networks
Feng et al. Stateless multicast protocol for ad hoc networks
Bhatia et al. A cluster based minimum battery cost AODV routing using multipath route for ZigBee
Shanmugam et al. A dynamic probabilistic based broadcasting scheme for manets
Yitayih et al. Towards developing enhanced cluster‐based QoS‐aware routing in MANET
Bheemalingaiah et al. ENERGY AWARE NODE DISJOINT MULTIPATH ROUTING IN MOBILE AD HOC NETWORK.
Hu et al. Bandwidth-satisfied multicast trees in MANETs
Sen et al. An adaptable and QoS-aware routing protocol for Wireless Sensor Networks
Liu et al. Managing wireless sensor networks with supply chain strategy
Chaudet et al. A model to evaluate brokers overlays for publish/subscribe in wireless sensor networks
Parthiban et al. Maximizing the network life time based on energy efficient routing in ad hoc networks
Lodhi et al. Transient Multipath routing protocol for low power and lossy networks.
Basagni et al. Rome: Routing over mobile elements in wsns
Chaudet et al. Building an efficient overlay for publish/subscribe in wireless sensor networks
Ramrekha et al. Standardisation advancements in the area of routing for mobile ad-hoc networks
Menchaca-Mendez et al. Hydra: Efficient multicast routing in MANETs using sender-initiated multicast meshes
Kumar Improving quality of service in mobile ad-hoc networks (MANETs) using adaptive broadcast scheduling algorithm with dynamic source routing protocol
Guo et al. A residual battery-aware routing algorithm based on DSR for BLE sensor networks
Khandelwal et al. Probabilistic routing using queuing theory for MANETs
Menchaca-Mendez et al. Robust and scalable integrated routing in MANETs using context-aware ordered meshes
Khattak et al. Two-tier cluster based routing protocol for wireless sensor networks
Santhi et al. Agent based adaptive multicast routing with QoS guarantees in MANETs
Mutthigarahalli Shankarappa et al. Performance analysis of EEDR routing protocol for WSNs