Time-optimum packet scheduling for many-to-one routing in wireless sensor networks (Q5421614): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time-constrained scheduling of weighted packets on trees and meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Dynamic Routing with Per-Packet Delay Guarantees of <i>O</i>(Distance + 1/Session Rate) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank

Latest revision as of 10:50, 27 June 2024

scientific article; zbMATH DE number 5204522
Language Label Description Also known as
English
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
scientific article; zbMATH DE number 5204522

    Statements

    Time-optimum packet scheduling for many-to-one routing in wireless sensor networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 October 2007
    0 references
    Wireless sensor networks
    0 references
    scheduling
    0 references
    algorithm
    0 references
    graph theory
    0 references
    energy efficiency
    0 references
    time optimum
    0 references

    Identifiers