Pages that link to "Item:Q2427436"
From MaRDI portal
The following pages link to Designing \(k\)-coverage schedules in wireless sensor networks (Q2427436):
Displaying 11 items.
- Cluster based node scheduling method for wireless sensor networks (Q439766) (← links)
- A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks (Q605616) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Wireless sensor networks scheduling for full angle coverage (Q835725) (← links)
- Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios (Q937387) (← links)
- Optimization scheme for sensor coverage scheduling with bandwidth constraints (Q1001327) (← links)
- Cover-free families and topology-transparent scheduling for MANETs (Q1877340) (← links)
- Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks (Q2506800) (← links)
- A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks (Q2643635) (← links)
- Interference-Free k-barrier Coverage in Wireless Sensor Networks (Q2942393) (← links)
- On the Cover Scheduling Problem in Wireless Sensor Networks (Q3091546) (← links)
