Earticle

초록

영어

In-network data aggregation is a fundamental traffic pattern in many applications of wireless sensor networks (WSNs). Data aggregation scheduling aims to find a collision-free transmission schedule scheme for data aggregation while minimizing the total network latency. This paper focuses on the data aggregation scheduling problem in duty-cycled WSNs (dc-WSNs), in which low-duty-cycle techniques are employed for energy-consuming operations. Based on greedy strategy, we propose two latency-efficient data aggregation scheduling algorithms, namely GAS-PAS and GAS-SAS for dc-WSNs. We theoretically derive the latency upper bounds of the proposed algorithms, and the results demonstrate that both GAS-PAS and GAS-SAS achieve constant approximation to the optimal latency. We also conduct extensive simulations to show that the proposed scheduling algorithms can improve data aggregation latency in dc-WSNs under various network settings, comparing with state-of-the-art algorithms in the literature.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Problem Definition
  3.1. System Model
  3.2. Problem Formulation
  3.3. Related Preliminary
 4. Data Aggregation Scheduling Algorithms
  4.1. Data Aggregation Tree Construction
  4.2. Aggregation Scheduling Algorithms
  4.3. Algorithm Analysis
 5. Simulation Results
 6. Conclusion
 References

키워드

저자

• Sun Chengting [ Lianyungang Technical College, Information Engineering College, Lianyungang Jiangsu, China ]
• Wang Zhen [ Lianyungang Technical College, Information Engineering College, Lianyungang Jiangsu, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605