Name
Title | ||
|---|---|---|
Conflict-free many-to-one data aggregation in multi-channel multi-hop wireless networks |
Abstract | ||
|---|---|---|
In this paper, we study the minimum latency conflict-free many-to-one data aggregation scheduling problem in multi-channel multi-hop wireless sensor networks: Given a set of sensor nodes along with a base station, and a subset of this set as the source nodes, find a schedule with the minimal latency, in which the data from all source nodes can be transmitted to the base station and no conflict happens. We assign each sensor three parameters: the transmission range r, the interference range alpha r and the carrier sensing range beta r, where alpha, and beta are constants. lambda >= 1 channels are available for communication. We design a centralised algorithm with latency bound as (inverted right perpendicular a/lambda inverted left perpendicular +11inverted right perpendicular b/lambda right left perpendicular)R + (Delta - 23) inverted right perpendicular b/lambda inverted left perpendicular - inverted right perpendicular a/lambda inverted left perpendicular 12, where a and b are two integer constants derived from alpha and beta, Delta is the maximum degree of the network, and R is the latency's trivial lower bound. Our algorithm has an approximation ratio (inverted right perpendicular a/lambda inverted left perpendicular +11 inverted right perpendicular b/lambda inverted left perpendicular). When lambda = 1, the performance ratio is a + 11b, which improves the result in Zhu et al. (2009). We evaluate our algorithm's performance through extensive simulations. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1504/IJSNET.2015.071382 | INTERNATIONAL JOURNAL OF SENSOR NETWORKS |
Keywords | Field | DocType |
conflict-free,many-to-one data aggregation,minimum latency,multi-channel,approximation algorithm,wireless networks,sensor networks | Integer,Base station,Wireless network,Approximation algorithm,Latency (engineering),Computer science,Upper and lower bounds,Computer network,Degree (graph theory),Wireless sensor network,Distributed computing | Journal |
Volume | Issue | ISSN |
19 | 1 | 1748-1279 |
Citations | PageRank | References |
1 | 0.35 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deying Li | 1 | 1216 | 101.10 |
| Zhu Qinghua | 2 | 55 | 6.05 |
| Zhu Yuqing | 3 | 467 | 37.26 |
| Du Hongwei | 4 | 343 | 41.34 |
| Weili Wu | 5 | 2093 | 170.29 |