• No results found

routing path

AORPM- Anonymity of Routing Path in MANETs

AORPM- Anonymity of Routing Path in MANETs

... better routing approach compared to other existing routing ...Earlier routing approaches give anonymity either to source or to destination or to routing ...the routing approach against ...

7

2. Evaluating Impact of Wormhole on Routing and Routing Path Length

2. Evaluating Impact of Wormhole on Routing and Routing Path Length

... some routing parameters of network like average affected nodes when base is at center, average affected nodes when base is at corner and affect on routing path length by employing strict protocol and ...

5

Improved Network Performance by Avoiding Attack on Routing Path Using Shortest Path Routing

Improved Network Performance by Avoiding Attack on Routing Path Using Shortest Path Routing

... evaluate routing protocols are Routing Overhead, Throughput and Average End to End Delay, Packet loss ...Shortest path algorithm is a simple and easy to understand method ...shortest path ...

7

Title: TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL: A REVIEW

Title: TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL: A REVIEW

... reactive routing protocol in ZigBee is derived from AODVjr (AODV junior), which is one of the representative routing protocols in MANET (Mobile Ad-hoc ...MANET routing protocols, ZigBee reactive ...

5

Self Diagnosing and Fault Evacuation Framework for Ad-Hoc Network

Self Diagnosing and Fault Evacuation Framework for Ad-Hoc Network

... the routing protocols establish the optimal routing path between the source and target node, the self diagnosing management activates the special functional module that are provided to each of the ...

5

MINIMUM TREE ROUTING WITH SECURITY IN WIRELESS SENSOR NETWORKS

MINIMUM TREE ROUTING WITH SECURITY IN WIRELESS SENSOR NETWORKS

... tree routing and proposes a shortcut tree routing protocol that overcomes the overhead occurred when following the tree ...tree routing algorithm is efficient in terms of both routing ...

6

Efficient Cluster Elimination Protocol (ECEP) for Ad Hoc Networks

Efficient Cluster Elimination Protocol (ECEP) for Ad Hoc Networks

... the routing path and the whole set up of the nodal structure enters in to the dead state ...a routing algorithm has been suggested that selects the path form the source to the destination on ...

5

Comparison of Energy Efficient Routing Protocols in Wireless Sensor Network

Comparison of Energy Efficient Routing Protocols in Wireless Sensor Network

... the routing protocols is reactive protocols and proactive ...establishing path rather it will quickly send the data without any ...the path establishing was just a waste of time, energy and ...whose ...

7

Cooperative Enhancement Based Approach to DSR using Genetic Algorithm

Cooperative Enhancement Based Approach to DSR using Genetic Algorithm

... a routing protocol designed to provide higher ...new routing protocol proposed to provide continuity in the data packets and avoid resending of data packets from the ...alternative routing ...

5

QoS Aware Power and Hop Count Constraints Routing Protocol with Mobility Prediction for MANET Using SHORT

QoS Aware Power and Hop Count Constraints Routing Protocol with Mobility Prediction for MANET Using SHORT

... Constraints Routing Protocol with Mobility Prediction for Mobile Ad hoc Network using Self Healing and Optimizing Routing Technique ...constraints routing protocol with self healing technique for ...

7

ENERGY EFFICIENT ROUTING IN WSN

ENERGY EFFICIENT ROUTING IN WSN

... efficient routing using A* algorithm which finds optimal path from source node to destination node (base station) against some crucial parameter of sensor network such as packet reception rate (PRR), ...

7

Improving Time and Energy Efficiency in Data Center Networks

Improving Time and Energy Efficiency in Data Center Networks

... efficiency routing algorithm [1] is used to find the routing path under packet ...efficient routing path and the transmitted packets would take huge energy consumption because using EER ...

6

VPN STIPULATION BASED VIBRANT DEVELOPMENT

VPN STIPULATION BASED VIBRANT DEVELOPMENT

... Each VPN in the active router environment contains two types of agents on the active routers: queue agents, and control agents [6]. VPN endpoints control a delay of sessions according to the maximum and minimum delay ...

7

An Effective Routing Algorithm with Chaotic Neurodynamics for Optimizing Communication Networks

An Effective Routing Algorithm with Chaotic Neurodynamics for Optimizing Communication Networks

... the routing algorithm [1,30] shows high performance for the communication ...chaotic routing algo- rithm [14-19] is also enhanced if the node obtains not only the shortest distance information but also the ...

9

Throughput Maximization using Spatial Reusability in Multi-Hop Wireless Networks

Throughput Maximization using Spatial Reusability in Multi-Hop Wireless Networks

... of routing in multi-hop wireless networks, to achieve high end-to-end throughput, it is difficult to find the optimal path from the source node to the destination ...of routing protocols have been ...

7

Comprehensive Analysis of Dynamic Routing
          Protocols in Computer Networks

Comprehensive Analysis of Dynamic Routing Protocols in Computer Networks

... various routing protocols. Routing protocols aim at finding the best path in the network to ensure proper ...Each routing protocol has its own set of standards to judge a route quality by ...

6

networks . Routing algorithm can be classified as distance vector and link state. Among distance vector and link state routing, distance vector routing algorithm forwards the information to each and every node from

networks . Routing algorithm can be classified as distance vector and link state. Among distance vector and link state routing, distance vector routing algorithm forwards the information to each and every node from

... Bellman-Ford algorithm solves the single-source shortest-path problem in the general case in which edges of a given digraph can have negative weight as long as G contains no negative cycles. it uses d[u] as an ...

5

Load Balancing Dynamic Source Routing Protocol Based on Multi-Path Routing

Load Balancing Dynamic Source Routing Protocol Based on Multi-Path Routing

... Routing delays include domain name request delays, TCP connection setup delays, TCP con- nection release delays, and IP routing delays on individual gateways. If the user application uses the domain name of ...

11

Mobile ad hoc network overview

Mobile ad hoc network overview

... point-to-point routing and uses the connection-oriented packet forwarding ...the path. Hence, although the resulting path does not necessarily result in the smallest possible number of hops, the ...

8

EXPERIMENT3

EXPERIMENT3

... : Routing is the process of selecting paths in a network along which to send network ...traffic. Routing is performed for many kinds of networks, including the telephone network (Circuit switching), ...

6

Show all 10000 documents...

Related subjects