부산대학교 도서관

Nowadays, the problem of using minimum number of time slots for data aggregation such that sensors can work without data collision for data transmissions has received a great deal of attention in Wireless Sensor Network (WRSN). It is worth mentioning that there exists many approaches that are tried to reduce the number of time slots for data aggregation in WSNs. However, most of previous works are fallen into reducing time slots in certain circle. In this paper, we investigate the problem of Reducing Data Aggregation Time without Data Collision (RDATDC) problem and first propose a new overlap circle technique, which is termed the Overlap-Circle-based algorithm (OCBA), to solve the RDATDC problem. Simulation results show that the OCBA has better performance than other method.