The Main Goal Of Geographical Routing

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

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:-

Its advantages are that its implementation is simple due to the fact that the intermediate nodes only respond to requests and never initiate communication themselves, that it can easily monitor if a node is responsive or not and that it locates data in an efficient way since each node in the network only maintains information for about logN nodes, where N is the number of nodes. Its disadvantages are that it sends queries repeatedly over long distances under certain circumstances because it uses the iterative scheme and that it does not learn useful routing information from received queries like the Kademlia protocol

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;

Location disclosure Attack: This type of attack is a part of the information disclosure attack. The malicious node(s) leaks information regarding the location or the structure of the network. It itself may also use the location information for further attack. It gathers the node location information such as a route map and knows nodes situated on the target route. Figure 1.3 show Location disclosure Attack.

The Two-Tier Data Dissemination (TTDD) assumes that the sensor nodes are stationary and location aware and sinks are allowed to change their location dynamically [9]. When any change is sensed by sensors the source node will generate the reports. Then the source node chooses itself as a start crossing point and sends data to its adjacent crossing points. This is also used in which nodes are stationery for multiple mobile sinks.

In this example, here node A wants to send data packets to node D and starts to find the shortest path for its destination, so if node D is a malicious node then it will show that it has active route to the specified destination. It will then send the response In the example, data packets transfer in a hierarchic data center network. The link capacity is 1000 kb/s. The number on each is the traffic load. The distribution of traffic is based on equal cost multi-path (ECMP). In figure 8, we can see that the 3). Congestions

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

The combined United Continental Holdings competes on the basis of having what it terms "the most comprehensive global route network", modern planes, and "an industry-leading loyalty program" (UnitedContinentalHoldings.com, 2012). The merger between two struggling airlines was announced in 2010, and the United brand is going to be the one that is most prominent going forward. There have recently been some minor implementation problems in unwinding the Continental name (Martin, 2012).

routing. In this chapter, we introduce some popular routing protocols in each of the three

-A map is useful for finding the shortest distance between two places when it is used as a

Routers decide where the best route to a destination is using a file called the “routing table”, which has a list of different ways to get to one direction, quantified by the metric, which determines the distance of the path to travel so the router can efficiently pick the best path to use.

1. Which of the following routing protocols are considered to use distance vector logic? B, A