Loading [a11y]/accessibility-menu.js
Conflict-Free Many-to-One Data Aggregation Scheduling in Multi-Channel Multi-Hop Wireless Sensor Networks | IEEE Conference Publication | IEEE Xplore

Conflict-Free Many-to-One Data Aggregation Scheduling in Multi-Channel Multi-Hop Wireless Sensor Networks


Abstract:

In this paper, we studied the minimum latency conflict-free many-to-one data aggregation scheduling problem in multi-channel multi-hop wireless sensor networks: Given loc...Show More

Abstract:

In this paper, we studied the minimum latency conflict-free many-to-one data aggregation scheduling problem in multi-channel multi-hop wireless sensor networks: Given locations of all sensors and a base station, some sensors which are called as sources, find a schedule such that data from all sources can be transmitted to the base station without any conflict and the latency is minimized. In this model, each sensor has three parameters which are transmission range r, interference range ar and carrier sensing range βr where α, and β are constant. There are λ ≥ 1 available channels for communications. We designed an approximation algorithm with ratio (⌈a/λ⌉ + 11 ⌈b/λ⌉) This work improves our previous work when λ = 1. Extensive simulations valuate the performance of the algorithm.
Date of Conference: 05-09 June 2011
Date Added to IEEE Xplore: 28 July 2011
ISBN Information:

ISSN Information:

Conference Location: Kyoto, Japan

References

References is not available for this document.