Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks

DOI10.1007/978-3-642-14849-1_14zbMath1218.68061OpenAlexW2118446847MaRDI QIDQ5391125

Bhaskar Krishnamachari, Amitabha Ghosh, Özlem Durmaz İncel

Publication date: 5 April 2011

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.921.9068

zbMATH Keywords

survey articledata collectioncontention-free time division multiple access (TDMA)-based scheduling protocols

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Network protocols (68M12)

Related Items (7)

Optimal multi-TDMA scheduling in ring topology networks ⋮ Network design under general wireless interference ⋮ Aggregation tree construction using hierarchical structures ⋮ Radio aggregation scheduling ⋮ Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Optimal controller location in wireless networked control systems

Cites Work

• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Data-gathering wireless sensor networks: organization and capacity.
• Distributed time-optimal scheduling for convergecast in wireless sensor networks
• Tight bounds for delay-sensitive aggregation
• The complexity of the capacitated tree problem
• The capacity of wireless networks
• Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks
• Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
• Semi-matchings for bipartite graphs and load balancing

This page was built for publication: Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks