【摘要】 目前在无线传感器网络中,数据聚集大多数采用的都是单信道,导致有很高的延迟。尤其是在高密度无线传感器网络中,数据聚集是一个比较耗时的操作。人们已经证明了最小化数据聚集延迟问题是NP难问题。给出一个新的降低数据聚集延迟的近似算法,其近似比为16,并在理论上证明了该算法的延迟上界是15R+Δ-15,Δ是网络的最大度,R是网络半径。相对于现有的算法,该算法理论上具有更小的近似比和时间延迟。模拟结果也说明该算法平均延迟比现有的算法小。更多还原

【Abstract】 Existing works on data aggregation in wireless sensor networks(for short WSNs) usually use a single channel which results in a long latency due to high interference,especially in high-density WSNs.Therefore,data aggregation is a fundamental yet time consuming task in WSNs.Minimum data aggregation latency problem has been already proved NP-hard.This paper presents a new approximate algorithm with ratio bound 16 to reduce data aggregation latency and proves that this algorithm has a latency bound of 15R + Δ-15,where Δ is the maximum degree and R is the network radius.This paper proves that the algorithm has lower time latency and ratio bound than other existing algorithms in theory.Simulation results show that this algorithm has lower average latency than previous works.更多还原