Geographic And Energy Aware Routing ( GEAR )

// - FTP/TCP flow from n0 to n3, starting at time 1.2 to time 1.35 sec.

the routing protocol is simply flooding, S will broadest the data packets and then these data packets are rebroadcasted by every neighbor of S, and

The CSC's first step consists on creating all the possible direct edges by employing the maximum available transmission power $P_{MAX}$. The algorithm for this step takes as input: the node set $V = {v_1, v_2, ..., v_n}$ with location information; the maximum transmission power $P_{MAX}$. As output, a direct graph $\overline{G}$ is produced. Figure \ref{top_nos} shows an input graph which consists of 500$\times$500 area with $n = 70$ nodes and no edges. Figure \ref{top_original} show the resulting graph when nodes create edges based on its maximum transmission power. In this examples, the maximum transmission power is $P_{MAX} = 4900$ and the maximum transmission range is $R_{MAX}$ = 70 meters. Note that the resulting graph is not necessarily connected.

Now consider node S that needs to determine a route to node D. The proposed LAR algorithms use flooding with one modification. Node S defines (implicitly or explicitly) a request zone for the route request A node forwards a route request only if it belongs to tie request zone. To increase the probability that the route request Will reach node D, the request zone should include the expected zone (described above). Additional, the request zone may also include other regions around the request zone. There are two reasons for this:-

In the location-based routing, sensor nodes are distributed randomly in an interesting area. They are positioned mostly by utilizing of Global position system. The distance among the sensor nodes is evaluated by the signal strength obtained from those nodes and coordinates are computed by interchanging information among neighbouring nodes. Location-based routing networks are;

The Hierarchical Power Aware Routing (HPAR) is a power aware routing protocol that divides the network into a group of sensors called zones [12]. In this, the cluster zones are formatted, then the decision is made that how message is routed so the battery life can be maximized. This protocol provides an approximation algorithm called max-min ZPmin algorithm. In this algorithm by applying Dijkshtra algorithm the path who consumes less power is found. Then the second path is found that maximizes the minimal residual power. The advantage is that it provides both transmission power and maximizes battery

Proposed algorithm consider three types of nodes every type have different initial energy level. normal nodes have E_0 energy. m advanced nodes have a times energy more than normal nodes with E_0 (1+a) energy level. m_0 super nodes have b times energy more than normal nodes with E_0 (1+b) energy level, where a and b are energy factors. As N is the number of total nodes in network, then for number of normal nodes, advanced nodes and super nodes N(1-m) , Nm〖(1-m〗_0) and Nmm_0 in the network, respectively.

The attacker correlates the packet transmission times of each node and traces the packets hop-by-hop from its source to its destination. The intuition here is that under normal scenarios, each intermediate forwarder will forward a packet towards its destination without adding additional delay or packet mixing. Privacy can be enhanced when each forwarder node adds a random delay before transmitting the packet ~\cite{zhang2012, shao2008} or route the packets to fake destinations~\cite{deng2005}.

In this example, we have three routers A, B and C. C’s E0 is directly connected to 192.168.3.0. And C’s routing table is (192.168.3.0; 0; E0) which shows that 192.168.3.0 is 0 hop away. RIP (Routing Information Protocol), running on C, tells B that 192.168.3.0 is reachable through C with a distance of 0. B adds 1 hop to the distance and enters the route to 192.168.3.0 into its own routing table which becomes (192.168.3.0; 1; S1). Now RIP is running on B and tells C that 192.168.3.0 is 1 hop away. Similarly, C adds 1 hop to the distance and enters the route to 192.168.3.0 into its own routing table which becomes (192.168.3.0; 2; S1).

This protocol use Dijkstra algorithm. It maintains a complex data base, also called as link state database, which contains full information about the remote routers and the exact network topology. The goal from this protocol is to provide similar information about network connection to each router, so each router can calculate the best route to each network this is happen when each router generates information about itself and pass these information to other routers in the network so each router make a copy of this information without changing it.

In simulated network the source node designated as1 initiates the routing procedure by sending RREQ or Route Request message to its surrounding nodes. The RREQ message sent by the source node is denoted in the color green. The other RREQ messages are shown in cyan, yellow, black etc. The source node 1 is sending the RREQ message to its neighbour nodes 5, 6, 9, 11 and 13 and the links are formed shown by the green line. Every time node 5,6,9,11,13 is sending the RREQ message to its neighbour and the links are formed.

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

Reactive routing protocols were designed to reduce the overheads by maintaining information for active routes at each node [8]. This means that each node determined and maintained routes only, when it requires sending data to a particular destination. It using two main mechanisms for route establishment: Route discovery and Route maintenance [17, 25]. Route discovery mechanism uses two messages: Route Request (RREQ) and Route Reply (RREP).

Ad hoc networks consist of a set of self-organized of mobile nodes which cooperate using a routing protocol to facilitate the communication. They have become very popular in recent years due to their characteristics: easy deployment, lack of infrastructure, dynamic topology, mobility and minimum commissioning costs.

1. For each node calculate the distance between the node N and the S of origin i.e. DNS and the distance between node N and the destination D i.e. DND.