[go: up one dir, main page]

Yao et al., 2019 - Google Patents

Multicast scheduling algorithms for battery-free wireless sensor networks

Yao et al., 2019

Document ID
286411540040996873
Author
Yao B
Gao H
Li J
Publication year
Publication venue
2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)

External Links

Snippet

Currently, a new type of wireless sensor network (WSN) named as battery-free network (BF- WSN), has been proposed and widely studied. Compared with traditional battery-powered WSN (BP-WSN), nodes in BF-WSN can harvest energy from ambient environment …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • 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
    • 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • 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
    • H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
    • 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
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W52/00—Power Management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0216—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
    • 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
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/12—Dynamic Wireless traffic scheduling; Dynamically scheduled allocation on shared channel
    • 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
    • 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
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource
    • H04W72/0446—Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource the resource being a slot, sub-slot or frame
    • 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
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W56/00—Synchronization arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02B—INDEXING SCHEME RELATING TO CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. INCLUDING HOUSING AND APPLIANCES OR RELATED END-USER APPLICATIONS
    • Y02B60/00—Information and communication technologies [ICT] aiming at the reduction of own energy use
    • Y02B60/50—Techniques for reducing energy-consumption in wireless communication networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks

Similar Documents

Publication Publication Date Title
Arafat et al. A Q-learning-based topology-aware routing protocol for flying ad hoc networks
So et al. Load-balanced opportunistic routing for duty-cycled wireless sensor networks
Li et al. Enhancing real-time delivery in wireless sensor networks with two-hop information
US20070233835A1 (en) Methodology for scheduling data transfers from nodes using path information
Torkestani et al. Weighted Steiner connected dominating set and its application to multicast routing in wireless MANETs
Gherbi et al. Distributed energy efficient adaptive clustering protocol with data gathering for large scale wireless sensor networks
Crowcroft et al. Improved structures for data collection in wireless sensor networks
Veisi et al. Enabling centralized scheduling using software defined networking in industrial wireless sensor networks
Cheng et al. Taming collisions for delay reduction in low-duty-cycle wireless sensor networks
Fan et al. Delay-bounded transmission power control for low-duty-cycle sensor networks
Bhatia et al. RD-TDMA: A randomized distributed TDMA scheduling for correlated contention in WSNs
Fradj et al. A range-based opportunistic routing protocol for wireless sensor networks
Cheng et al. Collision-free dynamic convergecast in low-duty-cycle wireless sensor networks
Boukerche et al. A taxonomy of routing protocols in sensor networks
Yao et al. Multicast scheduling algorithms for battery-free wireless sensor networks
Hamouda et al. Energy efficient mobile routing in actuator and sensor networks with connectivity preservation
Gajjar et al. LEFT: A latency and energy efficient flexible TDMA protocol for wireless sensor networks
Matsui et al. ECORS: Energy consumption-oriented route selection for wireless sensor network
Barac et al. A lightweight routing protocol for industrial wireless sensor and actuator networks
Gautam et al. Data dissemination in wireless sensor networks: A state-of-the art survey
Rusli et al. Markov chain-based analytical model of opportunistic routing protocol for wireless sensor networks
Long et al. Energy-aware routing scheme in industrial wireless sensor networks for Internet of Things systems
Ray Techniques to enhance the lifetime of mobile ad hoc Networks
Ozen et al. Forwarder set based dynamic duty cycling in asynchronous wireless sensor networks
Haqbeen et al. An Intelligent cross-layer QoS-aware protocol with traffic-differentiation-based for energy efficient communication in WSNs