International Journal of Advanced Science and Technology Vol.85 (2015), pp.1-8 http://dx.doi.org/10.14257/ijast.2015.85.01 ISSN: 2005-4238 IJAST Copyright ⓒ 2015 SERSC Node Skiping Routing Koj Sambyo 1 , Anish Kumar Saha 2 and C.T. Bhunia 3 Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh-791112, India 1 sambyo.koj@gmail.com, 2 anishkumarsaha@gmail.com, 3 ctbhunia@vsnl.com Abstract 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. Keywords: Node, Skip graph, Skip list, Queuing Delay, Processing Delay, Little’s theorem, Latency, Delay 1. Introduction Routing algorithm uses flooding method to find path from source to destination in the wireless network [1, 2, and 3]. The path is established prior to transmit of the packets by computing various accepted network method such as network traffic, load balancing, least numbers of nodes etc. Once the path has been established then packets are sent from source to destination. It is well known that path can be modified on account of traffic load or movement of the sender or destination or of the nodes but still in this case the path discovery has to be made through flooding process and from that established path the packets are to be transmitted. Even with the change of the network the packets are transmitted through dedicated establish path that was established prior to transmission of the packet. Proposed scheme use traditional method for establishing the path from source to destination in the initial stage and maintain skip graph while transferring packet from source to destination and when the network traffic changes it will try to skip some of the nodes from the established path by using the broad cast property of the network so that the nodal delay is reduced. It also avoids unnecessary flooding of the packets for establishing the new path when the nodes are already present in the skip graph. End to end delay depends on number of nodes in the established path [4]. By skipping a few nodes in the path, nodal delay of the skipped nodes are reduced thus reducing the end to end delay of transmission. In Section 2 we provide motivational and background of the proposed scheme. Section 3 gives the algorithm, Section 4 shows simulation and result we have concluded in Section 5.