搜索资源列表
P07164389[1].pdf
- Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. it s useful to stuy GA for reader.-Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. It' s useful to stuy GA for reader.
graphpartition
- MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report: Joã o Hespanha. An efficient MA
aodv
- Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad hoc networks. This code describes no of packets received at the destination.
dsdv
- Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm
dsr
- Dynamic Source Routing (DSR) is a routing protocol for wireless mesh networks. It is similar to AODV in that it forms a route on-demand when a transmitting computer requests one. However, it uses source routing instead of relying on the routing table
amultihoprouting
- In this study we propose a gateway based energy-effi cient routing protocol (M-GEAR) for Wireless Sensor Networks (WSNs) with the our designed matlab source code-In this study we propose a gateway based energy-effi cient routing protoc
code
- the network lifetime based on a new Energy-Aware Objective Function used to design a Routing Protocol for Low-Power and Lossy Networks. The proposed Objective Function uses the Expected Transmission Count Metric and the Remaining Energy on each senso
leachsamplecode
- IT IS THE CODE FOR LEACH PROTOCOL. LEACH IS THE ENERGYY EFFICIENT ROUTING PROTOCOL WHICH IS MOST WIDELY USED IS SMALL AREA NETWORKS
energy
- routing algorithm for destination