Earticle

초록

영어

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS). This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network to achieve better power management and stable routes in case of failure. RTS delays packets at intermediate hops (not just prioritizes them) for a duration that is a function of their deadline. Delaying packets allows the network to avoid hot spotting while maintaining deadline-faithfulness. We compare RTS with another prioritizing and scheduling algorithm for real-time data dissemination in sensor networks. This paper simulates RTS based on two typical routing protocols, shortest path routing and greedy forwarding with J-Sim.

목차

Abstract
 1. Introduction
 2. Limitations of Existing Solutions
 3. RTS: Basic Algorithm
  3.1 Static Real Time Scheduling (SRTS):
  3.2 Dynamic Real Time Scheduling (DRTS):
  3.3 Non-linear Real Time Scheduling (NLRTS):
 4. RTS Implementation
 5. RTS for Different Routing Protocols
 6. Implementation and Experimental Evaluation
  6.1 Performance under Random Deployment
  6.2 Performance under Busty Traffic
  6.3 Comparison with SPEED
 7. Conclusions & Future Work
 References

키워드

저자

• Deepali Virmani [ Dept of CSE BPIT, Delhi & Dept of CSE NSIT, Delhi, India ]
• Satbir Jain [ Dept of CSE BPIT, Delhi & Dept of CSE NSIT, Delhi, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605