원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.5 No.1
2012.01
pp.61-68
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보