Duplicate copies of closer to the destination now know that a request message was dropped the RREQ packet received at any node are discarded. When the and lower their threshold values. The RREP is message can now reach the destination. When the destination receives a routed back to the source via the reverse path. Routes are erased by the RERR along its way.
Unused routes The second on-demand routing protocol we propose is called PAR- in the routing table are expired using a timer-based technique. The main objective B. AODV are described below. Route Discovery described below. In AODV, each mobile node has no choice and must forward packets for other nodes.
All nodes except RREQ is dropped; otherwise, the message is forwarded. When along the route have enough battery levels. If additional RREQs arrive energy resources of some nodes on the path are depleting too quickly. This route error new value and the new RREQ packet is re-broadcast; message forces the source to initiate route discovery again.
This is a local decision since it is dependent only on the remaining battery - If the new packet has a lower cost but the intermediate node knows capacity of the current node. To avoid this situation, the source will re- - Otherwise, if the new packet has a greater cost, the new RREQ send another RREQ message with an increased sequence number.
This reply message contains the cost of the selected path. The source node will select the route with the minimum More precisely, when an intermediate node receives the first RREQ cost.
The RREP is routed back to the source via the reverse path. The source node will select the route with the maximum lifetime. Each node tries to As in the first algorithms, route maintenance is needed either when a estimate its battery lifetime based on its past activity.
This is achieved node becomes out of direct range of a sending node or there is a change using a recent history of node activity. When node L sends a data packet, in its predicted lifetime. In the second case, the node sends a route error time instance W. This information is recorded and stored in the node. Hence, we use it for lifetime Hence, it is a local decision.
Our approach is a dynamic distributed load balancing approach that avoids power-congested nodes and chooses paths that are However, the same problem as in LEAR-AODV can occur. If the lightly loaded. To prevent this, we use the same D. In each request, there is III. The initial battery capacity of each node is 10 units. The performance metric, in these kind of studies, is the network Figure 2 b , compared to those of AODV cf. Figure 2 a. In LEAR- lifetime. The network lifetime can be defined as [6]: AODV, the nodes consume energy more equitably.
Thus, the nodes in the center of the network continue to maintain the network connectivity - the time taken for K nodes in the network to die; as long as possible, and the network will not be partitioned rapidly. On - the time taken for the first node to die; the other hand, for AODV, the energy level of the nodes in the center is largely lower than the half of the initial energy level.
That means in one instance we are taking the remaining energy left with the node gives the idea of its shortest path and in another time we go for longer path. If cost. All mobile should drain their power at So our proposed plan is to select the alternate routes in a equal rate as a minimal set of mobile exists such that their network by avoiding critical node in route selection.
Their removal cause network to partition. Such node is called as a advantage is that the traffic load is shared and congestion critical node. The route between these two partitions must paths are avoided. By finding the alternate routes if one path go through one of these critical nodes.
A routing procedure fails then routing takes place through the second path must divide the work among these nodes to maximize the avoiding delay in packet receiving. By doing such energy life of the network. This problem is similar to load expenditure in contention and retransmission is minimized. A packet to be routed through a path No node depletes their power rapidly as compare to any contains mobiles having grater amount of energy though it other node in the network.
So there is no network partition is not a shortest path. Delay is minimized as there is no causing maximization of network life. If there is more than congestion and nodes having less number of loads. For one path then one path acts as primary path and other as example if in a network to forward our packet we have backup paths. If primary path fails then load is transferred to chosen the shortest path to transfer my packet. But let my backup paths. Fig 1 shows a network structure.
In this packet number is 11 to transfer it through the shortest path. As neighbors are added keep track of their origin. End of step 3. As destination is reached stop and find the path Figure 1. Then switch of all nodes coming in the other node. As a result node 6 will spend its battery path for energy conservation due to idle state. Go to step 3 and process to front node. To avoid this Initially all the nodes are in switch off state or in status situation if while establishing the route from source to 0.
After the network is set up all nodes are ready state or in destination we go for alternate route selection then node is status 1. Then the source node 1 is put in a queue by penalized more as compare to other node in the network.
By nodes as given in adjacent list in table 1. The adding of new transferring the packets through these three alternate paths nodes and processing the front node is continued till the no node is used rapidly as compare to other node in the destination node 11 is reached.
After getting the destination network. So network life time is maximized by sharing node the path is finding out by traversing in backtrack till traffic load and minimizing congested paths. Now the next getting the source node. After getting one path the nodes in task is to find the procedure which will help to find all that particular path are go to idle state i. For finding the alternate paths switch off state to minimize energy consumption due to idle we are taking the help of queue and the procedure is state.
Then process is continued starting from the next front explained in section IV. By running this method IV. In this section we propose our algorithm to find out Fig. By we are going to apply our algorithm. But before that we running the algorithm all possible paths are determined in a have to first find out the adjacency list of each node, which network, then packet is routed through alternate paths.
For evaluation of algorithm a priority queue is node 1 in queue and processes it to get all available paths in considered. Considering that the front node of a queue has network. By taking network structure in fig. They deplete their energy at equal level, so no node die before any other node in the network.
Since packet Algorithm for shortest path : is routed through alternate paths the traffic load is shared. So there is no unnecessary delay in forwarding packets.
Put the source node in queue and change its status to consumption due to retransmission. In our algorithm, we propose that after getting one path 3. Repeat step 4 to 6 until queue is empty or the nodes of that path are going to the sleep mode to avoid destination is reached.
Example of a network structure they will wake up and participate in path finding procedure. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed at different rates depending on the power level and the intended receiver.
We propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem with node capacities and the algorithms converge to the optimal solution.
0コメント