An Distributed Parallel Aggregation Scheduling in Multihop SensorNet
Data aggregation is a primitive operation in wireless sensor network applications. This paper focuses on data aggregation scheduling problem to minimize the latency. An efficient distributed method is proposed to structure a collision-free schedule for parallel data aggregation in WSNs. We prove that the latency of the aggregation schedule generated by our algorithm is at most 4Δ+15R-16 time-slots where R is the network radius and Δ is the maximum node degree in the communication graph of the original network.
wireless sensor networks connected dominating set parallel aggregation scheduling latency
Liqun Shan Jinkuan Wang Zhigang Liu Ruiyan Du
School of Information Science & Engineering Northeastern University Shenyang, China Northeastern Pet School of Information Science & Engineering Northeastern University Shenyang, China Engineering Opti
国际会议
秦皇岛
英文
150-153
2010-11-05(万方平台首次上网日期,不代表论文的发表时间)