There are several ad hoc routing algorithms that utilize position information in two dimensional (2D) coordinates to make routing decisions at each node. The well known 2D position based routing algorithm, Greedy Peri...
详细信息
ISBN:
(纸本)9781424402694;9781424402700
There are several ad hoc routing algorithms that utilize position information in two dimensional (2D) coordinates to make routing decisions at each node. The well known 2D position based routing algorithm, Greedy Perimeter Stateless routing (GPSR) does not function correctly in three dimensions (3D). We designed MLAR (Multipath Location Aided routing), a multipath variant of LAR (Location Aided routing). MLAR is position based, works efficiently in both 2D and 3D and uses alternate path routing. We have implemented and validated MLAR through simulations using ns-2 and studied its efficiency, scalability and other properties. We evaluated and compared the relative performance and benefits of our MLAR approach versus LAR, AODV and AOMDV in both 2D and 3D for a range of traffic and mobility scenarios. We present a direct comparison of a multipath position based algorithm with a multipath non-position based algorithm, as well as with both their single path versions. We also extended ns-2 to support 3D mobility models and routing protocols.
We propose a primary traffic based multihop routing with the cooperative transmission (PTBMR-CT) algorithm that enlarges the hop transmission distances to reduce the number of cognitive receivers on the route from the...
详细信息
ISBN:
(纸本)9781457720710
We propose a primary traffic based multihop routing with the cooperative transmission (PTBMR-CT) algorithm that enlarges the hop transmission distances to reduce the number of cognitive receivers on the route from the cognitive source (CS) to the cognitive destination (CD). In each hop, from the cognitive nodes in a specified area depending on the status of the primary traffic, the cognitive node that is farthest away from the cognitive sender is selected as the cognitive receiver. However, when the primary source (PS) is transmitting the data to the primary destination (PD), another cognitive node is also selected to be the cognitive receiver for the cooperative transmission from the cognitive nodes that are in a specified area. The cooperative transmission is performed if the PS still transmits the data to the PD when the cognitive receiver of the next hop is being searched. The simulation results show that the average number of cognitive receivers is reduced by the PTBMR-CT compared to the conventional primary traffic based farthest neighbor routing (PTBFNR), and the conventional PTBFNR is outperformed by the PTBMR-CT in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power of transmitting the data from the CS to the CD.
routing in D isruption Tolerant Networks (DTNs) is a challenging problem due to the intermittent connectivity between the nodes. Researchers have proposed many routing protocols that adapt to the temporary connections...
详细信息
ISBN:
(纸本)9781479932146;9781479932139
routing in D isruption Tolerant Networks (DTNs) is a challenging problem due to the intermittent connectivity between the nodes. Researchers have proposed many routing protocols that adapt to the temporary connections of DTNs. One classification of routing protocols makes use of historical information to predict future contact patterns for any pair of nodes. However, most existing protocols focus on the probability of a path from the source to the destination without considering the information in a packet which includes the source, destination, size, TTL (Time-To-Live) and limited resources such as available buffer size and bandwidth. In this paper, we propose a new prediction-based routing algorithm that takes into account packet information under the conditions of limited transmission opportunities. T he goal of this protocol is to increase the overall delivery ratio through scheduling packets at each node. Meanwhile, this protocol may sacrifice some messages' delivery delay time to some extent. Extensive simulation results with real traces show that our protocol with packet scheduling has better performance than the pure probabilistic routing algorithms in term of delivery ratio. Our protocol's performance advantage is more obvious for nodes with higher packet intensity and shorter TTL in packets.
We are given a channel-routing problem in which all nets have either (I) all their terminals on the same side of the channel, or (2) all but their rightmost terminal on the same side. This is the only class of multi-t...
详细信息
With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem sinc...
详细信息
With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.
Multi-path routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput by transmitting data over multiple paths. Disjoint multi-path routing (DMPR) requ...
详细信息
ISBN:
(纸本)1424405726
Multi-path routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput by transmitting data over multiple paths. Disjoint multi-path routing (DMPR) requires the multiple paths to be link- or node-disjoint. Implementation of both MPR and DMPR poses significant challenges in obtaining loop-free multiple (disjoint) paths and effectively forwarding the data over the multiple paths, the latter being significant in data-gram networks. In this paper, we develop a disjoint multipath routing strategy using colored trees with an objective to minimize the total cost of the routing paths in a network. Two trees, namely red and blue, rooted at a given drain is formed. We demonstrate through extensive simulations that the developed technique is extremely effective in optimizing the average cost of the paths. In addition, we also observe that the developed approach minimizes the average minimum (minimum of the two paths) cost, which is lower than that obtained by earlier algorithms. The colored tree approach simply doubles the size of the routing table when two link- or node-disjoint paths to a specific node is needed.
In optical Grid networks, the main challenge is to account for not only network parameters, but also for resource availability. Anycast routing has previously been proposed as an effective Solution to provide job sche...
详细信息
ISBN:
(纸本)9781424426256
In optical Grid networks, the main challenge is to account for not only network parameters, but also for resource availability. Anycast routing has previously been proposed as an effective Solution to provide job scheduling services in optical Grids, offering a generic interface to access Grid resources and services. The main weakness of this approach is its limited scalability, especially in a Multi-domain scenario. This paper proposes a novel anycast proxy architecture, which extends the anycast principle to a multi-domain scenario. The main purpose of the architecture Is to perform aggregation of resource and network states, and as Such improve Computational scalability and reduce control plane traffic. Furthermore, the architecture has the desirable properties of allowing Grid domains to maintain their autonomy and hide internal configuration details from other domains. Finally, we propose an impairment-aware anycast routing algorithm that incorporates the main physical layer characteristics of large-scale optical networks into its path computation process. By integrating the proposed routing scheme into the introduced architecture we demonstrate significant network performance improvements.
Contemporary routing protocols are found to be less resilient to pathological conditions involving load variations and changes in local link metrics. [2] As an example, the routing Information Protocol (RIP) presents ...
详细信息
ISBN:
(纸本)1842331159
Contemporary routing protocols are found to be less resilient to pathological conditions involving load variations and changes in local link metrics. [2] As an example, the routing Information Protocol (RIP) presents poor convergence rates. At the same time for the Open Shortest Path First (OSPF), which was designed to provide connectivity among network nodes and to reroute traffic in case of sporadic node or link failures, frequent link metric changes can lead to wildly oscillating routing tables. Such facts thus, necessitate an approach to routing, which shall overcome the shortcomings of the routing algorithms currently in use. The paper discusses meta-heuristics based on the behavior of real ants in real time ant colonies, for routing to address these issues.
Swarm intelligence, as demonstrated by a natural biological swarm, such as an ant colony, has many powerful properties that are desirable for effective routing in communications networks. In this paper, we propose an ...
详细信息
Swarm intelligence, as demonstrated by a natural biological swarm, such as an ant colony, has many powerful properties that are desirable for effective routing in communications networks. In this paper, we propose an intelligent routing algorithm that we are calling Fuzzy Logic Ant-based routing (FLAR), which is inspired by ant colonies and enhanced by fuzzy logic techniques. Using a fuzzy system as an intelligent and expert mechanism allows multiple constraints to be considered in a simple and intuitive way. Simulation results and a comparison of the proposed method with two state-of-the-art routing algorithms show better performance and a higher fault tolerance for our approach, particularly in regard to link failures.
Context aware routing (CAR) is a hybrid routing algorithm for opportunistic networks, which uses destination-sequence distance-vector (DSDV) algorithm and probabilistic routing in connected regions and between the con...
详细信息
ISBN:
(纸本)9781467318556;9781467318570
Context aware routing (CAR) is a hybrid routing algorithm for opportunistic networks, which uses destination-sequence distance-vector (DSDV) algorithm and probabilistic routing in connected regions and between the connected regions, respectively. We find that the control overhead of CAR is relatively high due to the utilization of DSDV and the default time-to-live (TTL) value of data affects the delivery rate. To solve these problems, we proposed an effective and reliable hybrid routing algorithm (ERHR). In ERHR, the optimized link-state routing version 2 (OLSRv2) is used in connected regions to reduce the control overhead, and the modification of TTL value makes a progress on the aspect of the data delivery rate. Theoretical analysis and simulation results show that the proposed algorithm has a better performance in terms of control overhead, data delivery rate and data retransmission overhead.
暂无评论