Pages that link to "Item:Q1398906"

The following pages link to Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. (Q1398906):

Displaying 36 items.

• Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks (Q391238) (← links)
• Optimal wake-up scheduling of data gathering trees for wireless sensor networks (Q433434) (← links)
• Optimal energy allocation in heterogeneous wireless sensor networks for lifetime maximization (Q455966) (← links)
• Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding (Q634890) (← links)
• Energy-efficient cooperative data aggregation for wireless sensor networks (Q666214) (← links)
• Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
• Improved algorithm for minimum data aggregation time problem in wireless sensor networks (Q732821) (← links)
• A fast algorithm for data collection along a fixed track (Q744105) (← links)
• Understanding optimal data gathering in the energy and latency domains of a wireless sensor network (Q850335) (← links)
• Fast algorithm for multicast and data gathering in wireless networks (Q963390) (← links)
• Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
• Data aggregation and routing in wireless sensor networks: Optimal and heuristic algorithms (Q1017477) (← links)
• Data-gathering wireless sensor networks: organization and capacity. (Q1427453) (← links)
• Optimal multi-TDMA scheduling in ring topology networks (Q1666713) (← links)
• A framework for overall storage overflow problem to maximize the lifetime in WSNs (Q1699754) (← links)
• Energy efficient ant colony algorithms for data aggregation in wireless sensor networks (Q1757820) (← links)
• A Lagrangean-based heuristics for the target covering problem in wireless sensor network (Q1788968) (← links)
• Spanning trees with minimum weighted degrees (Q2380008) (← links)
• Distributed clustering algorithms for data-gathering in wireless mobile sensor networks (Q2455400) (← links)
• Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks (Q2471714) (← links)
• Maximum lifetime data sensing and extraction in energy constrained networked sensor systems (Q2497726) (← links)
• Exact and approximate balanced data gathering in energy-constrained sensor networks (Q2575091) (← links)
• Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks (Q2830947) (← links)
• Latency-constrained aggregation in sensor networks (Q2930288) (← links)
• A data gathering algorithm based on topology in WSN (Q2984352) (← links)
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint (Q3512451) (← links)
• Improving Inter-cluster Broadcasting in Ad Hoc Networks by Delayed Flooding (Q3627742) (← links)
• GATHERING RADIO MESSAGES IN THE PATH (Q4928335) (← links)
• (Q4929422) (← links)
• Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks (Q5106396) (← links)
• Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks (Q5233841) (← links)
• Algorithmic Aspects of Wireless Sensor Networks (Q5312958) (← links)
• Algorithmic Aspects of Wireless Sensor Networks (Q5312967) (← links)
• Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks (Q5391125) (← links)
• Latency Constrained Aggregation in Sensor Networks (Q5449519) (← links)
• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)