The authors discuss the development and performance of a series of distributed routing algorithms for a synchronous circuit-switched hypercube and enhanced hypercube. Several centralized routing algorithms were develo...
详细信息
IEEE802.16 is defining the standard of Worldwide Interoperability for Microwave Access (WiMAX) for Metropolitan Area Network (MAN). This paper analyze the performance of FTP (File Transfer Protocol) and FTP Generic tr...
详细信息
ISBN:
(纸本)9781479934485
IEEE802.16 is defining the standard of Worldwide Interoperability for Microwave Access (WiMAX) for Metropolitan Area Network (MAN). This paper analyze the performance of FTP (File Transfer Protocol) and FTP Generic traffic sources for different protocols such as AODV (Ad hoc On-demand Distance Vector), DSR (Dynamic Source routing), DYMO (Dynamic MANET On-demand), IERP (Interzone routing Protocols), LARI (Location Aided routing) in a WiMAX network. The simulation will done by using Exata network simulator version 4.1, it verifies the parameters like throughput, average jitter, end to end delay and packet delivery ratio values for different routing algorithm. Finally it will conclude with best routing protocols.
The paper proposed a novel methods in order to solve the congestion and routing oscillation, which based on crossover and mutation of the ant colony algorithm to achieve dynamic QoS routing realization. The algorithm ...
详细信息
ISBN:
(纸本)9780878492510
The paper proposed a novel methods in order to solve the congestion and routing oscillation, which based on crossover and mutation of the ant colony algorithm to achieve dynamic QoS routing realization. The algorithm expanded the scope of the search path selection adaptively adjust the strategy and the amount of information to determine the probability of renewal strategy, which can better adapt to dynamic network environment, you can make the shortest possible path of choice to meet the real-time applications, while avoiding link load is heavy, maintaining the distribution of network load balance. The simulation results show that the routing algorithm has better convergence speed and stability, which can more effectively address congestion and routing oscillation, its performance compared with traditional methods have been noticeably elevated, indicating it has a better multimedia network environment flexibility.
In this paper we present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the currently best algorithms for...
详细信息
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks wh...
详细信息
ISBN:
(纸本)9780984589333
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, we investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, we analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, we study the performance bounds for regularly dense networks with linear topology. Theoretical analysis shows that the proposed routing algorithm performs close to the optimal error performance.
In this article we propose several new progress based, localized, power and cost aware algorithms for routing in ad hoc wireless networks. Node currently holding the packet will forward it to a neighbor, closer to des...
详细信息
ISBN:
(纸本)3540225439
In this article we propose several new progress based, localized, power and cost aware algorithms for routing in ad hoc wireless networks. Node currently holding the packet will forward it to a neighbor, closer to destination than itself, which minimizes the ratio of power and/or cost to reach that neighbor, and the progress made, measured as the reduction in distance to destination, or projection along the line to destination. In localized algorithms, each node makes routing decisions solely on the basis of location of itself, its neighbors and destination. The new algorithms are based on the notion of proportional progress. The new power and cost localized schemes are conceptually simpler than existing schemes, and have similar or somewhat better performance in our experiments. Our localized schemes are also shown to be competitive with globalized shortest weighted path based schemes.
In the last decade, there has been a substantial amount of research in finding routing algorithms designed specifically to run on real-world graphs. In 2010, Abraham et al. showed upper bounds on the query time in ter...
详细信息
ISBN:
(纸本)9783662483503;9783662483497
In the last decade, there has been a substantial amount of research in finding routing algorithms designed specifically to run on real-world graphs. In 2010, Abraham et al. showed upper bounds on the query time in terms of a graph's highway dimension and diameter for the current fastest routing algorithms, including CONTRACTION HIERARCHIES, TRANSIT NODE routing, and HUB LABELING. In this paper, we show corresponding lower bounds for the same three algorithms. We also show how to improve a result by Milosavljevic which lower bounds the number of shortcuts added in the preprocessing stage for CONTRACTION HIERARCHIES. We relax the assumption of an optimal contraction order (which is NP-hard to compute), allowing the result to be applicable to real-world instances. Finally, we give a proof that optimal preprocessing for HUB LABELING is NP-hard. Hardness of optimal preprocessing is known for most routing algorithms, and was suspected to be true for HUB LABELING.
Mobile Ad hoc Networks (MANETs) are of great interest to researchers and have become very popular in the last few years. One of the great challenges is to provide a routing protocol that is capable of offering the sho...
详细信息
Mobile Ad hoc Networks (MANETs) are of great interest to researchers and have become very popular in the last few years. One of the great challenges is to provide a routing protocol that is capable of offering the shortest and most reliable path in a MANET in which users are moving continuously and have no base station to be used as a reference for their position. This thesis proposes some new routing protocols based on the angles (directions) of the adjacent mobile nodes and also the node density. In choosing the next node in forming a route, the neighbour node with the closest heading angle to that of the node of interest is selected, so the connection between the source and the destination consists of a series of nodes that are moving in approximately the same direction. The rationale behind this concept is to maintain the connection between the nodes as long as possible. This is in contrast to the well known hop count method, which does not consider the connection lifetime. We propose three enhancements and modifications of the Ad-hoc on demand distance vector (AODV) protocol that can find a suitable path between source and destination using combinations and prioritization of angle direction and hop count. Firstly, we consider that if there are multiple routing paths available, the path with the minimum hop count is selected and when the hop counts are the same the path with the best angle direction is selected. Secondly, if multiple routing paths are available the paths with the best angle direction are chosen but if the angles are the same (fall within the same specified segment), the path with minimum hop count is chosen. Thirdly, if there is more than one path available, we calculate the average of all the heading angles in every path and find the best one (lowest average) from the source to the destination. In MANETs, flooding is a popular message broadcasting technique so we also propose a new scheme for MANETS where the value of the rebroadcast packets fo
We investigate the minimum energy routing problem in cooperative multi-hop networks, where a single source communicates to a single destination assisted by several multi-hop relays that can accumulate information from...
详细信息
In this paper, we study the effect of adaptivity of routing algorithm on the overall performance in a hypercube multicomputer using wormhole switching. To this end, we use three accurate analytical models proposed for...
详细信息
暂无评论