Earticle

초록

영어

Data query is a common communication pattern in sensor networks. However, due to the introduction of sleep latency, it is challenging to perform efficient query in low-duty-cycle sensor networks. In particular, the round-trip delay from the sink to source nodes and vice versa over the same forwarding path could be extremely long. In this work, westudy the delay optimization problem by jointly considering routing and sleep scheduling, then propose a holistic scheme to find the asymmetric routing paths for data query and response so that the round-trip delay could be minimized. We compared ourMinimum Delay Query (MDQ) deign with the state-of-the-art schemes. The evaluation results verify that our design can greatly reduce the query delay in low-duty-cycle sensor networks.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Preliminary
  3.1. Network Model
  3.2. Assumptions
  3.3. Problem Description
 4. Minimum Delay Query Scheme
  4.1. Delay Model
  4.2. Design Overview
  4.3 Minimum Delay Query Algorithm
 5. Performance Evaluation
  5.1. Round-trip Delay and Transmission Counts
  5.2. The Impact of Network Size
  5.3. The Impact of Working Period
 6. Conclusion
 Acknowledgments
 References

키워드

저자

• Zuzhi Fan [ Department of Mathematics, Jinan University, Guangzhou 510632, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605