Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks (Q5391125): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Data-gathering wireless sensor networks: organization and capacity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed time-optimal scheduling for convergecast in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity of wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-matchings for bipartite graphs and load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for delay-sensitive aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the capacitated tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-optimum packet scheduling for many-to-one routing in wireless sensor networks / rank
 
Normal rank

Latest revision as of 22:18, 3 July 2024

scientific article; zbMATH DE number 5874709
Language Label Description Also known as
English
Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks
scientific article; zbMATH DE number 5874709

    Statements

    Identifiers