Fuzzy Logic Based Enhanced AOMDV with Link Status Classification for Efficient Multi-Path Routing in Multi-Hop Wireless Networks

Recently, special types of routing protocols are designed for sensor networks. Almost all of these routing protocols have considered the energy efficiency as the ultimate objective in order to maximize the lifetime of the whole network. The different types of routing protocols available in WSN are data centric, hierarchical, and location-based and on demand routing protocols. Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of the best hierarchical clustering protocols with probabilistic model to manage the energy consumption of WSN. However, LEACH uses global information without considering the local information i.e. the residual energy of each node for CH election process. Hence, Deterministic Energy-efficient Clustering protocol (DEC), a deterministic model is developed by using clustering scheme to manage and organize the WSN with mobile scenario. This protocol promises a better election of cluster-heads based on residual energy information and it is more energy efficient than LEACH protocols. Ad hoc on demand Distance Vector (AODV) is another routing protocol used in sensor network to support mobility. AODV is also on demand routing protocol. However, AODV do not provide multipath loop free and has link disjoint path. Hence, Ad hoc On-demand Multipath Distance Vector (AOMDV) is developed for WSN to guarantee loop freedom and disjointness of alternate paths. Frequent route discovery and route failure is occurred in AOMDV protocols due to the involvement of repeated mobile nodes without checking the energy levels of those nodes for packet transmission. To reduce the route failures occurred by the usage of nodes with reduced energy, energy aware ad hoc on-demand multipath distance vector routing protocol (E-AOMDV) is developed by incorporating energy aware concept in AOMDV protocol to increase the network performance. In this paper, the performance analysis namely residual energy of DEC protocol is examined for various packet length and nodes. Delivery ratio analysis of EAOMDV protocol is also done in this paper for various simulation times and nodes. The simulation results shows that DEC has better performance than LEACH and also E-AOMDV has better performance than AOMDV.

The advent of mobile computing devices and wide deployment of wireless networks have led to an exponential increase in the internet traffic. Long congestion epochs and frequent link failures in wireless network lead to more number of packets being dropped and incur high end-to-end delay, thereby degrading the overall performance of the network. Congestion control, though mainly incorporated at the transport layer, if coupled with the routing protocols, can significantly improve overall performance of the network. In this paper we propose Ant based Congestion Adaptive Multipath (Ant-CAMP) routing protocol that aims to avoid congestion by proactively sending congestion notification to the sender. The proposed Ant-CAMP routing protocol is implemented in Network Simulator-2 (NS-2) and its performance is compared with Ad-hoc On Demand Multi-Path Distance Vector (AOMDV) in terms of Packet Drops due to Congestion, Packet Delivery Fraction and Average End-to-End Delay.

We develop an on-demand multipath routing protocol for multi-hop wireless networks (MWNs), capable of finding spatially disjoint paths without the need of location information. Multipath routing can enable various applications and enhancements in MWNs, such as load balancing, bandwidth aggregation, reliability and secure communications. The use of spatially disjoint routes is important to effectively achieve these gains, due to the non-interfering nature of the paths. Most of the proposed multipath protocols for MWNs focus on reliability and do not find spatially disjoint paths. We propose a new on-demand protocol called Spatially Disjoint Multipath Routing (SDMR), capable of finding multiple paths in one route discovery, measuring the distance between them and choosing paths with most separation. Simulations demonstrate the effectiveness of the protocol in finding spatially separate routes.

Multi-path routing protocol attracts more and more attention because the routing performance can be improved by making use of advantages of multi-path routing protocol, such as fault-tolerant and load balance. To validate multi-path routing protocol in real environment, the Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol is implemented in Linux based on AODV-UU. The functions of AOMDV protocol are implemented in user space, and the interaction with the kernel is implemented based on Netlink and Netfilter. Experimental results validate the implementation of AOMDV.

In this paper, we design grid-based routing (GBR) protocols for wireless multi-hop networks. The objective is to effectively reduce the protocol overhead for network management with the assistance of position information. GBR divides networks into equally spaced grids. To perform a routing operation, GBR requires as few grids as possible to participate while preserving network connectivity. We design different protocols for different environments and deduce analytical results to observe the high performance of the designed protocols.

Routing within wireless mobile multi-hop networks is a challenging task. Therefore, in the past several routing protocols have been developed with various extensions and adoptions to certain specific scenarios. The consensus of the discussion about routing is that depending on all aspects of their application reaching from number of nodes, mobility, to the data traffic profile of the application developers can choose an optimal routing protocol. In the meantime some routing protocols have evolved as standard choice like AODV, DSR, OLSR, TBRPF. With the advent of sensor networks, requirements like scalability and resource consumption are added to the research domain. This resulted in additional extremely specialized routing algorithms or special extensions to existing protocols. So is there really a need and room for another routing protocol? We are convinced that a really simple, efficient, scalable protocol that allows for mobility and is suited for various performance classes of devices does not exist. We propose GRAPE as a completely new approach for routing in wireless multi-hop networks and present performance results based on simulations and measurements that demonstrate the potential of the routing approach.

Within this paper we planned a routing presentation of AODV and AOMDV protocols in MANET. The AODV (Ad hoc on demand Distance Vector) protocol is the unipath routing protocol and forming established the route in on require manner. With the help of AOMDV routing approach average end-to-end delay and routing above your head minimized and increased the presentation of the system. The multipath protocol has ability to ward balance the load of the network efficiently. The AOMDV (Ad hoc On demand Multipath Distance Vector) is the multipath routing protocol and established the more than two routes as the back-up route or alternative routes for data transmission and receiving in MANET. The performance of both the protocols are measured through maximum load handling, average load handling capability of nodes and routing performance is based on top of the packet deliverance part, throughput and end-to-end delay. The presentation of AOMDV protocol is superior to the unipath AODV and also handle the load through distributed to alternative paths.

We consider the problem of quality of service (QoS) routing in multi-hop wireless networks where data are transmitted from a source node to a destination node via multiple hops. The routing component of a QoS-routing algorithm essentially involves the link and path metric calculation which depends on many factors such as the physical and link layer designs of the underlying wireless network, transmission errors due to channel fading and interference, etc. The task of link metric calculation basically requires us to solve a tandem queueing problem which is the focus of this paper. We present a unified tandem queue framework which is applicable for many different physical layer designs. We present both exact and approximated decomposition approaches. Using the queueing framework, we can derive different performance measures, namely, end-to-end loss rate, end-to-end average delay, and end-to-end delay distribution. The proposed decomposition approach is validated and some interesting insights into the system performance are highlighted. We then present how to use the decomposition queueing approach to calculate the link metric and incorporate this into the route discovery process of the QoS routing algorithm. The extension of the queueing and QoS routing framework to wireless networks with class-based queueing for QoS differentiation is also presented.

Wireless internet has become popular in recent years due to the tremendous growth in the number of mobile computing devices and high demand for continuous network connectivity regardless of physical locations. In this paper, we investigate the effects of routing protocols on the performance of Transmission Control Protocol (TCP) variants in multi-hop wireless networks. Through simulations we study the effects of Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols on TCP Tahoe, TCP Reno, TCP Newreno, TCP with Selective Acknowledgment (SACK) option and TCP Vegas. The simulations are carried out for static as well as mobile nodes. The performance metric used is throughput. Another metric, expected throughput is used for the comparison of throughput when nodes are mobile.

Limited resources of nodes in MAMETs force the extensive studies for energy-aware multipath routing protocols, which should provide the fault tolerance for broken links and the load balance for extending bandwidth and equalizing energy consumption. This paper proposes a novel energy-aware multipath ad hoc routing protocol to equalize the energy consumption, thus, to extend the network lifetime of each node in MANETs. The proposed Time Delay On-demand Multipath (TIDOM) routing protocol accommodates the time delay function in flooding RREQ packets. The time delay function is inversely proportional to the residual battery capacity of intermediate nodes themselves. This function avoids nodes with poor residual battery capacity, and promotes nodes with good residual battery capacity joining the routes. Simulation results show that TIDOM improves the network lifetime, energy consumption, and additionally packet delivery ratio over the Ad hoc On-demand Multipath Distance Vector (AOMDV).

The authors introduce the idea of multiple protocols and illustrate its validity by considering the problem of routing in multihop radio networks. A continuing, simulation-based performance evaluation at Naval Research Laboratory's (NRL) Distributed Simulation and Prototyping facility shows that overall network performance improves significantly when multiple protocols are switched in response to changing environmental conditions rather than using a single routing protocol. Dynamic conditions illustrated in the simulations are implemented as changes in topological connectivity. Important new issues that arise when multiple protocols are employed are identified for further research.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Although the wireless multi-hop network paradigms have some unifications in terms of their routing function, they have many distinguishing features based on the fact that each paradigm has its own characteristics and application demands. In this chapter, we explore the distinguishing features that shape the routing functionalities of each of these paradigms. We present a discussion of the design considerations of routing protocols for each paradigm, the popular classifications of such routing protocols, and the core routing components of each paradigm along with some routing functionalities of each component and some representative protocols that adopt these functionalities. Finally, we present a summary of the core routing components and main functionalities for each paradigm for the sake of a concise and clear comparison of the various wireless multi-hop network paradigms.KeywordsWireless routingWireless multi-hop networksWireless ad-hoc networksWireless sensor networksWireless mesh networksVehicular ad-hoc networks

We have developed a cost-effective wireless multi-hop network system for accessing core networks. Cost-effectiveness can be provided to users by offering them a wireless multi-hop network in which a wireless link enables multiple hops between access points (APs) and reduces the number of APs connected to a wired network. The key issues of wireless multi-hop networks are routing and security. We proposed a hybrid routing for wireless multi-hop networks that combines on-demand and table-driven routing, a packet check scheme between APs, and an authentication scheme. To ensure both correct routing and security, the system makes use of a wireless multi-hop (WM) layer between the IP and medium access control (MAC) layers. This paper evaluates the system based on its FTP throughput, round-trip time, and route creation time. The FTP throughput was about 3.5 Mbps even when there were four hops in an 802.11b wireless LAN. We believe that our wireless multi-hop network system is useful for providing cost-effective broadband access service.

In this paper, we introduce the stable path topology control problem for link-state routing in mobile multi-hop networks. We formulate the topology control problem of selective link-state broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident edges and independent of the policies of other agents. We show that under a condition called the positivity condition, these independent local policies preserve the stable routing paths globally. We then provide an efficient algorithm, which we call the Stable Path Topology Control algorithm, to compute this local policy that yields a pruned graph. Using simulations, we demonstrate that this algorithm, when used with the popular ETX metric, outperforms topology control mechanisms commonly used for Mobile Ad Hoc Networks.

The definition of new radio network topologies and deployment concepts capable of providing a ubiquitous radio coverage area for beyond 3G systems is one of the main objectives of the WINNER project [1]. Within this context, routing and forwarding algorithms for infrastructure-based multi-hop networks are investigated. We first present a new mathematical model of the routing problem in infrastructure-based multi-hop wireless networks that takes into account QoS requirements considering bandwidth constraints. Since the characteristics of such new networks allow to control the path selection of each flow, we then propose a new routing algorithm based on a heuristic. Finally, to show the performance of the proposed algorithm several simulation results are presented.