earticle

논문검색

Node Skiping Routing

초록

영어

Path is establish prior to transmission of information from source to destination. Along the established path, packets encounter queuing delay and processing delay in all the nodes through which the packet travels to reach destination. Moreover nodes implement variety of other function like firewall and classification of the packet. Thus every node adds nodal delay in end to end delay. In this paper we proposed to skip node from established path using the broadcast nature of wireless that will reduce nodal delay. Proposed scheme uses skip graph for the skipping of the nodes in the established path. The study shows there is significant reduction in end to end delay in the proposed scheme compared to traditional method. Paths from source to destination are also more stable, particularly when large number of nodes are present in established path.

목차

Abstract
 1. Introduction
 2. Motivation and Background
  2.1 Skip Graph
  2.2 Queueing Delay
  2.3 Processing Delay
 3. Proposed Scheme
 4. Simulation and Result
 5. Conclusion
 References

저자정보

  • Koj Sambyo Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh- 791112, India
  • Anish Kumar Saha Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh-791112, India
  • C.T. Bhunia Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh-791112, India

참고문헌

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

    함께 이용한 논문

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

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