[go: up one dir, main page]

Sato et al., 2014 - Google Patents

A power-efficient distributed TDMA scheduling algorithm with distance-measurement for wireless sensor networks

Sato et al., 2014

Document ID
4890675785745869183
Author
Sato K
Sakata S
Publication year
Publication venue
Wireless personal communications

External Links

Snippet

This paper describes a power-efficient distributed TDMA slot scheduling algorithm which the slot allocation priority is controlled by distance measurement information in details. In our former proposed scheme, L-DRAND+, an extension of Lamport's bakery algorithm for …
Continue reading at link.springer.com (other versions)

Classifications

    • 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
    • H04W84/20—Master-slave selection or change arrangements
    • 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
    • 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
    • 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
    • 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
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04—Wireless resource allocation
    • 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
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
    • H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
    • H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • 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

Similar Documents

Publication Publication Date Title
US7266085B2 (en) Access and routing protocol for ad hoc network using synchronous collision resolution and node state dissemination
Wang et al. On reliable broadcast in low duty-cycle wireless sensor networks
Whitaker et al. Bluetooth scatternet formation: a survey
Ruby et al. SDN-enabled energy-aware routing in underwater multi-modal communication networks
WO2007014182A1 (en) Neighbor based tdma slot assignment
Joo et al. Local greedy approximation for scheduling in multihop wireless networks
Norouzi et al. An integrative comparison of energy efficient routing protocols in wireless sensor network
Salam et al. Performance analysis on homogeneous LEACH and EAMMH protocols in wireless sensor network
Chen et al. Energy-efficient itinerary planning for mobile agents in wireless sensor networks
Shah et al. An energy-efficient resource allocation scheme for mobile ad hoc computational grids
Zhao et al. Approximation algorithms for broadcasting in duty cycled wireless sensor networks
Lin et al. Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks
Dezfouli et al. DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks
Batta et al. A distributed tdma scheduling algorithm for latency minimization in internet of things
Dang et al. A hybrid multi-channel MAC protocol for wireless ad hoc networks
Ouni et al. Cooperative association/re-association approaches to optimize energy consumption for real-time IEEE 802.15. 4/ZigBee wireless sensor networks
Sato et al. A power-efficient distributed TDMA scheduling algorithm with distance-measurement for wireless sensor networks
KR20080058262A (en) Distributed context aware scheduled access in the network
Ranganathan et al. Enhancing the selection of backoff interval using fuzzy logic over wireless ad hoc networks
Maheshwari et al. Game theoretic application for energy efficient mobility handling in wireless sensor network
Sato et al. A distance-measurement-oriented distributed TDMA scheduling algorithm for sensor networks
Benrebbouh et al. Distributed TDMA for IoT using a dynamic slot assignment
Zhang et al. New Method of MSCA for Edge Computing
Wang et al. Collaborative routing, scheduling and frequency assignment for wireless ad hoc networks using spectrum-agile radios
Ramesh et al. A survey on routing methodologies for ICMANET