earticle

논문검색

Analysis of Traffic Splitting Mechanisms for 2D Mesh Sensor Networks

초록

영어

For many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations within delay bounds and the buffer size of each sensor node is as small as possible. In this paper, we firstly introduce the system model of a mesh sensor network. Based on this system model, the expressions for deriving the delay bound and buffer requirement bound are presented using network calculus theory. In order to balance traffic load and improve resource utilization, three traffic splitting mechanisms are proposed. And the two bounds are derived in these traffic splitting mechanisms. To show how our method applies to real applications, we conduct a case study on a fresh food tracking application, which monitors the food freshness status in real-time during transportation. The numerical results show that the delay bound and buffer requirement bound are reduced while applying traffic splitting mechanisms. Thus the performance of the whole sensor network is improved with less cost.

목차

Abstract
 1. Introduction
 2. Network calculus theory
 3. Mesh sensor networks
  3.1. System model
  3.2. Traffic model
 4. Analysis of traffic splitting mechanisms
  4.1. Non-traffic-splitting scenario
  4.2. Traffic splitting mechanisms
  4.3. End-to-end delay bounds
 5. A case study and numerical results
  5.1 A case study
  5.2 The cluster-tree sensor network
  5.3 Numerical results
 6. Conclusions
 7. References

저자정보

  • Huimin She Dept. of ECS, Royal Institute of Technology, Sweden
  • Zhonghai Lu Dept. of ECS, Royal Institute of Technology, Sweden
  • Axel Jantsch Dept. of ECS, Royal Institute of Technology, Sweden
  • Li-Rong Zheng Dept. of ECS, Royal Institute of Technology, Sweden
  • Dian Zhou ASIC & System State Key Lab., Dept. of Microelectronics, Fudan University, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.