This research paper analyses the throughput capacity of Mobile Ad hoc Network (MANET) with reduced packet loss. The nodes are then discovered using Medium Access Control (MAC) 802.11 protocol. It has the capability to...
详细信息
This research paper analyses the throughput capacity of Mobile Ad hoc Network (MANET) with reduced packet loss. The nodes are then discovered using Medium Access Control (MAC) 802.11 protocol. It has the capability to discover the neighbor nodes automatically and the next node of the throughput for each node is determined using Flooding algorithm. In this algorithm, each node try to forward every information to every one of its nearest source node and then it receives the acknowledgement from the destination nodes. After initializing the source and destination node, the shortest path between the source and destination node is determined using K- Nearest Neighbor (KNN) algorithm. It calculates the distance between the nodes and sort the nearest neighbor based on the minimum distance. The routing is performed with the help of dynamicsourcerouting (DSR) algorithm which allows each dispatcher to decide on and control the routes used in routing packets. The packet loss gets reduced by considering the throughput of nodes. Here the Operating System is Linux Simulation software and then Network Simulator version 2 tool was used.
Ad hoc UAV network is characterized for its high node mobility, fast changing network topology, high frequency of interchanging data and complex application environment. The performance of traditional routing algorith...
详细信息
Ad hoc UAV network is characterized for its high node mobility, fast changing network topology, high frequency of interchanging data and complex application environment. The performance of traditional routingalgorithms are so poor over aspects such as end to end delay, data packet delivery ratio and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. An ant colony optimization based polymorphism-aware routingalgorithm- APAR algorithm is proposed to solve the problems. This algorithm integrates ACO algorithm and dynamic source routing algorithm, the level of pheromone in routes which are gained in routing discovery process, is chosen as a standard to choose route and calculated by sensing the distance of a route, the congestion level of a route, and the stability of a route. A new volatilization mechanism of pheromone is also introduced to the algorithm. Meanwhile, the algorithm can make adjustment to the variance of UAV formation to prevent the compromise of the network performance. The simulation results show the APAR algorithm has superiority over traditional algorithms in data package delivery ratio, end to end delay, routing overhead and it is dependable in battlefield environment.
An efficient routingalgorithm called Hierarchical routing is presented in this paper. The algorithm assumes that the network is divided into logical clusters. In each cluster a so-called Central Controller stores the...
详细信息
ISBN:
(纸本)0780383443
An efficient routingalgorithm called Hierarchical routing is presented in this paper. The algorithm assumes that the network is divided into logical clusters. In each cluster a so-called Central Controller stores the routing information and exchanges it with its neighboring Central Controllers. Each routing entry contains a time index which is used to react to dynamic topology changes and to minimize the amount of exchanged routing information. The presented algorithm is best suited for mobile ad hoe networks. The algorithm has been especially designed for a centralized ad hoc network HEE based on the HIPERLAN/2 standard standardized by ETSI but may be used in any ad hoc network configuration. The performance of the algorithm is analytically compared to the performance of the dynamic source routing algorithm.
暂无评论