Straight Line Routing on Next Hop Graph in Wireless Sensor Networks

: Information processing and information routing in wireless sensor network is one of the most important key area of recent research. Building an optimal routing protocol for information routing is a tough task in dealing with the sensor nodes. Information exchange can be done with the major possible way in order to provide a secure communication and reliable data delivery, here in this study we focus on routing protocol with reliable delivery. Hence we proposed a new algorithm/protocol which optimally routes the data packets from source to destination with efficient utilization of energy resources. The proposed protocol is based on next hop graph node in terms of reliable data packet routing by framing the route in the form of graphs. The simulation results showed in the performance analysis phase denotes the proposed method outperforms the existing routing protocol in terms of reliability and robustness in efficient routing. The proposed methodology achieves the connectivity and connectivity path in WSN which is critical in WSN.


Introduction
With major advances in technology, sensors have become more power with a smaller in size at a low cost that has improved the effectiveness of many military and social applications such as battle field surveillance, protection and tragedy management. (Baghyalakshmi et al., 2010;Barabási and Albert, 1999;Broch et al., 1999) Wireless Sensor network is an advanced wireless sensor technology used in various applications such as medical-health monitoring, military applications (Guo and Jia, 2012;Karp and Kung, 2000;Kennedy and Eberhart. 1995). One of the most vital problems in wireless sensor networks is finding optimal routes for transmitting data between sources to destination. (Ruyan et al., 2010;Satyanarayanan, 2007) Generally it pairs in a multi-hop fashion. Several algorithms have been proposed for routing. The previous research for routing scheme was explained clearly in the section "previous work". Arif and Rani, (2012;Okdem and Karaboga, 2009) Many researchers have undergone for solving the routing problem in Wireless sensor network.
WSN consist of large numbers (hundreds or thousands) of wirelessly connected heterogeneous sensor nodes that are spatially scattered across a large field of interest (Kavitha Rani and Kannan, 2013) and the process continuous with data gathering from several sensors to monitor events. (Park and Corson, 1997;Rao et al., 2003) In this study, we proposed a robust methodology to exchange data packets with less energy consumption and with high processing of data exchange, a new hybrid algorithm has been developed and built for data routing.

Previous Work
Various researchers have proposed various optimal routing algorithms for information routing in Wireless sensor networks. Since the need of finding optimality has not reached the end source, the expectation for the routing protocol from its source is still in need. Previous attempt was finding optimal path using hybrid scheme which combines PSO algorithms with the computational intelligence. In that way, the initial stage of research started with FFA algorithm which is basically fast reactive and fast adaptive in nature. The protocol is insisted by the SI and advanced computational procedure to route the data packets. The main key idea behind the protocol is to navigate the packets even if the node failure occurs. The node head and node defined are clearly explained in the section Local field where the packet information and routing information are stored. The clear cut explanation of the node selection and inspired swarm based formulation (Kavitha Rani and Kannan, 2013): where, t i V denotes the velocity grid of the node. For Node-Head selection the end solution formulated was defined as where:

Proposed Methodology
Here a new hybrid methodology is used with swarm intelligence and basic approach in computational efficiency. The proposed methodology has high efficiency in terms of utilizing the energy resources. Visu et al. (2012;Yong-Chang and Gang, 2008) Various approaches are worked with in order to achieve high optimality and to route the data packets. The main key idea is to provide node identity with packet information which was achieved in the previous attempt in the field of Local field information. Next hop of each sensor nodes are traced back using the FFA algorithm, once the node has been identified the hop count will raises to next level, the graph predicts the node value of each vertices to be in the straight line, thus the graph predicted forms a minimal rate of spanning tree using the vertices. The hop count will be in increasing order which helps in identifying the node and its counter.
The Next hop is predicted by flooding protocol which floods the ARP req i.e., RTS message to all the neighbours, once the node which is nearest to the flooding node, the particular node responds to the corresponding node with CTS message. Once the CTS message is received the node is identified and its distance vector is initialized in the Hop counter. Thus the counter is incremented whenever it receives CTS message from various neighbours.

Next Hop Graph
Next hop graph is generated using the neighbour node ACK packets. When it receives the more number of packets the counter will be incremented based on the response from various nodes. The zone level is indicated based on localization of the sensor nodes. Once the node is identified then the vertices of each node are updated and plotted into the graph structure. The node with higher range of localized positioning takes the lead of all the nodes and acts as the root/ head of all the nodes.

Zone Level
Zone is defined based on the localization distance of the sensor node. Sedighizadeh and Masehian (2009;Shen et al., 2009)

Result Analysis
The proposed methodology is tested with maximum of 30 sensor nodes and minimum of 5 sensor nodes.

Conclusion
Here we conclude the paper with achieving better results in hybrid routing schemes, the proposed methodology outperforms with 91% accuracy in terms of data packet routing and the scheme supports the security orientation during the data transmission due to its CTS and RTS flooding mechanism. It combines various localization features such as flooding, root node prediction, nearest neighbour discovery. Here the methodology is well defined and it can be used for various applications such as military intrusion detection system, medical applications. Figure 1 shows that the proposed methodology can be a root of adaptation to various higher level application tier protocols and hence it can be easily adapted to Mobile Adhoc based networks. Figure 2 and 3 shows the simulator working model of the proposed protocol. Hence the enhancement level of the proposed protocol will be on Adhoc networks-information routing and its strategy on reliable packet delivery. Development of next strategic level routing will be on branch and cut methodology towards the future scope of development on MANET and WSN (Shirkande and Vatti, 2013;Sombuntham and Kachitvichayanukul, 2010).