By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Deying Li ; Sch. of Inf., Renmin Univ. of China, Beijing, China ; Qinghua Zhu ; Hongwei Du ; Weili Wu
more authors

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.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011