Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2009
Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?
FOWANC '09: Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computingPages 57–66https://doi.org/10.1145/1540343.1540353A protocol, dubbed BeSpoken, steers data transmissions along a straight path called a spoke through a wireless sensor network with many location-unaware nodes. BeSpoken implements a simple, spatially recursive communication process, where a set of ...
- research-articleMay 2009
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
FOWANC '09: Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computingPages 47–56https://doi.org/10.1145/1540343.1540352Data aggregation is an efficient primitive in wireless sensor network (WSN) applications. This paper focuses on data aggregation scheduling problem to minimize the latency. We propose an efficient distributed method that produces a collision-free ...
- research-articleMay 2009
A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model
FOWANC '09: Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computingPages 13–20https://doi.org/10.1145/1540343.1540347Link scheduling is crucial in improving the throughput in wireless networks and it has been widely studied under various interference models. In this paper, we study the link scheduling problem under physical interference model where all senders of the ...
- research-articleMay 2009
Wireless link scheduling under a graded SINR interference model
FOWANC '09: Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computingPages 3–12https://doi.org/10.1145/1540343.1540346In this paper, we revisit the wireless link scheduling problem under a graded version of the SINR interference model. Unlike the traditional thresholded version of the SINR model, the graded SINR model allows use of "imperfect links", where ...
