information transparency and wavelength reuse characteristics. This paper presents heuristic algorithm that can be used for routing and wavelength assignment for All-Optical WDM networks under dynamic arising of calls…
fast convergence method would be incorporated over the mesh network using the dynamic routing algorithm. The theory of multiple routes in the polygonal fashion would be connected with the target ... improve the…
nodes and partitioning of the network. This paper attempts to provide an energy aware routing algorithm. The proposed algorithm finds the transmission energy between the nodes relative to the distance ... analyzed…
nodes and partitioning of the network. This paper attempts to provide an energy aware routing algorithm. The proposed algorithm finds the transmission energy between the nodes relative to the distance ... analyzed…
nodes and partitioning of the network. This paper attempts to provide an energy aware routing algorithm. The proposed algorithm finds the transmission energy between the nodes relative to the distance ... analyzed…
time. The samples are taken for 2 - 3 months. We are using a routing algorithm to calculate the shortest and optimized path. The common problem in Indian road system ... work is going in the user’s destination path. Our…
analysis of various routing protocols Ad-hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA), Optimized Link State Routing (OLSR) and Destination Sequenced Distance Vector (DSDV) are carried
route anonymity protection and lower cost compared to other anonymous routing protocols. Many anonymity routing algorithms are based on the geographic routing protocol (e.g. Greedy Perimeter Stateless Routing (GPSR))…
reduce energy consumption. However, except the connected-k neighborhood (CKN) sleep scheduling algorithm and the geographic routing oriented sleep scheduling (GSS) algorithm, nearly all research work about geographic…
CRNs impose challenges due to the fluctuating nature of the available spectrum. To study routing algorithm a model that can simulate CRNs routing protocol needs defining. This paper presents
energy of the each node to improve the operational lifetime. The proposed energy aware routing algorithms for MANETs, called LAR (Location Aided Routing) is based on a fully distributed
number of workstations needed, but also the number of resource types required. A shortest route algorithm is proposed to find the optimal solution for RCALBP-I. An illustrative example
cluster heads are reselected based on the remaining energy level. The clustering and the routing algorithm are processed by the base station and a mobile node navigates among sensor nodes ... each sensor node, and…
fleet size and mix vehicle routing problem with quantity discounts for outsourcing, a non-linear programming model is established; and an evolutionary algorithm based on the shortest path encoding approach
called Acknowledge Based Route Discovery (ABRD), and also to provide alternative path using multipath routing algorithm, if such malicious node/nodes detected in routing path, during the route discovery
source, destination and route. So, we propose a protocol called Anonymous Location Based Efficient Routing Protocol (ALERT). The main technique used to provide anonymity is hierarchical partition. ALERT dynamically…
becoming scarce and expensive but also causing a dramatic climate change. Green protocols and algorithms are required to reinvent scalable and sustainable network by maximizing energy efficiency and reduce total…
landmarks in different time slots. Taking this graph as a basis, a two-stage routing algorithm is used to compute the practically fastest and customized route for end users. Necessarily
virtual-clustering-based (LVC) routing protocol for power heterogeneous MANETs, i.e., LRPH. To explore the advantages of high-power nodes, we develop an LVC algorithm to construct a hierarchical network ... eliminate…
polynomial-time optimal algorithm is used for the origin problem. Extended Sink Scheduling Data Routing algorithm is used to schedule sink nodes. The mobile sink scheduling scheme is enhanced
mined to provide the landmark graph. Based on the landmark graph and the routing algorithm that uses the variance-entropy based clustering techniques to build and evaluate the system
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.