Improved link repair technique for multicast routing in Wireless Mesh Network

Recently, the study of multicast routing attracts more attentions in MANET. Multicast Ad Hoc On-Demand Distance Vector (MAODV) protocol, which is multicast operation of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, enables dynamic, self-starting, multihop routing between participating mobile nodes wishing to join or participate in a multicast group within an Ad Hoc network. Through analyzing its operation mechanism, we present a probability based multicast routing protocol with energy constrained (PBMR),in which a hybrid probability forwarding strategy is adopted. When a node wants to join a multicast tree, it floods a RREQ-Join message to its neighbors, when the neighbors receive this message, the neighbor with much energy left has a high probability to forward the message, and so on. By making correctness proof and complexity analysis of PBMR, this paper evaluates MAODV and PBMR with extensive simulations, the results show that PBMR has a better jitter than MAODV and a more balance in energy consumption. On the one hand, it saves the energy of the network system; on the other hand, it has a longer network lifetime and a more stable routing than MAODV and successfully solves the inconsistent problem of energy and scalability.

Wireless technology is emerging as a key technology for the future networks. Wireless mesh networks (WMNs) have emerged as an indispensable technology for deployment of wireless services for various applications in personal, enterprise, and metropolitan areas. Researchers are working actively in different fields of WMNs for providing better services. Routing protocols play a vital role in WMNs to provide reliable configuration and maintenance of topology of the network. Designing a suitable cost metric for routing protocols to provide quality links for data transmission is the backbone of WMNs. Many cost metrics have been proposed for WMNs and is still an active research topic as new performance metrics need to be discovered due to the dynamics of this field. This paper considers the genetic algorithm-based routing technique for WMN.We have studied the existing cost metrics and proposed a genetic algorithm technique for routing in WMN. To evaluate the genetic algorithm, and to determine the relative performance of the genetic algorithm in the context of routing in WMN, we carry out experiments on two test systems. We have evaluated the quality of the results produced by our algorithm with the traditional hop count metric results. Our results show that routing in WMN using genetic algorithm produces better results as compared to traditional hop count metric results. Finally, we carry out a detailed analysis of results, which help us in gaining an insight into the suitability of genetic algorithm for routing in WMN.

Multicast routing protocols proposed for mobile ad hoc networks have certain limitations. Most of these protocols try to discover the route on-demand by flooding route request messages, which results in increased end-to-end latency and also consumes considerable amount of network bandwidth. These limitations make protocols not suitable for real-time multimedia communication. In this paper, we have presented an efficient mobile agents aided multicast routing (MAMR) protocol which overcomes these limitations. The protocol is a hybrid protocol where intelligent mobile agents can been integrated with existing on-demand multicast routing protocols such as multicast ad hoc on-demand distance vector (MAODV) routing protocol, on-demand multicast routing protocol (ODMRP) routing protocol and others. Here, the mobile agents move around the network and collect the routing information. This routing information assists on-demand multicast routing protocols in discovering the route in a definite path instead of flooding the route request messages, thereby achieving better end-to-end latency and reduced control traffic in the network. We have used MAODV protocol as an underlying protocol with mobile agents. The proposed MAMR protocol and MAODV have been compared through extensive simulations with end-to-end latency, packet delivery ratio and control overhead as performance parameters

Multicast routing in mobile ad hoc networks by using a multiagent system

Design of certification authority using secret redistribution and multicast routing in wireless mesh networks

Wireless mesh networks (WMN) are believed to be a highly promising technology and will play an increasingly important role in future generation wireless mobile networks. Routing in WMN is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. The swarm intelligence paradigm, such as ant colony optimization (ACO), has recently been demonstrated as an active approach for routing in both wired and wireless networks. We designed a novel ACO-based multicasting routing algorithm. In the proposed algorithm, a source-based approach is adapted to build a multicast tree among all the multicast members, and an evolutional scheme for the original multicast tree is designed to find a more optimal multicast tree. In addition the evolutional scheme also acts as a local recovery technique when some intermediate nodes move away. Compared with ODMRP and MAODV, the proposed algorithm performs better in terms of average delay, success ratio and efficiency.

To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast sessions in wireless mesh networks is a new problem to the best of our knowledge. In this paper, we propose a resilient forwarding mesh approach for protecting a multicast session in wireless mesh networks. Utilizing the wireless broadcast advantage, a resilient forwarding mesh effectively establishes two node disjoint paths for each source-destination pair. This allows a multicast session to be immune from any single link or intermediate node failure. We introduce four heuristic algorithms to obtain approximate solutions that seek to minimize the number of required broadcast transmissions. We evaluate the performance of these heuristic algorithms against the optimal resilient forwarding mesh (ORFM) obtained by solving an integer linear programming (ILP) formulation of the problem. Experimental results demonstrate that one of these heuristic algorithms, which we call the minimal disjoint mesh algorithm (MDM), performs sufficiently close to ORFM. Besides, we find that the resilient forwarding mesh approach provides efficient 1+ 1 protection (Pioro and Medhi, 2004) to the multicast session without incurring much additional overhead on a single minimal cost multicast tree

QoS routing problem in wireless mesh networks is a NP-complete problem, and it is hard to get the global solution with the traditional algorithm. In this paper, we adopt a novel dynamic ant genetic hybrid algorithm to solve QoS unicast routing problem for wireless mesh network, whose innovation are using the best melting point evaluation strategy to control the calling of the two algorithms dynamically. Simulation results show that the novel algorithm is superior to the genetic algorithm and the static ant genetic hybrid algorithm in quality and efficiency for QoS routing in wireless mesh network.

Wireless technology has become an essential part of this era’s human life and has the capability of connecting virtually to any place within the universe. A mesh network is a self healing wireless network, built through a number of distributed and redundant nodes to support variety of applications and provide reliability. Similarly, anycasting is an important service that might be used for a variety of applications. In this paper we have studied anycast routing in the wireless mesh networks and the anycast traffic from the gateway to the mesh network having multiple anycast groups. We have also studied the geocast traffic in which the packets reach to the group head via unicast traffic and then are broadcasted inside the group. Moreover, we have studied the intergroup communication between different anycast groups. The review of the related literature shows that no one has considered anycasting and geocasting from gateway to the mesh network while considering the multiple anycast groups and intergroup communication. The network is modeled, simulated and analyzed for its various parameters using OMNET++ simulator.

QoS routing in wireless mesh networks (WMNs) is a daunting task. Finding a path for a given flow depends not only on the bandwidth-delay requirements of that flow but also on the available bandwidth of all the nodes in that path and the amount of bandwidth consumption caused by that flow along its path. Contrary to the wired networks, these two parameters are not fixed and depend on the interference pattern of the network that in turn depends on the selected path itself. This converts the QoS routing in wireless mesh networks to a much harder problem. Existing methods use on-demand approach based on flooding of routing packets. This approach does not scale up to large networks. Field-based routing (FBR) is a promising approach to reduce the routing overhead for static route set up. However, it is not previously used for QoS routing. In this paper, we have developed a new FBR based QoS routing protocol for WMNs. Contribution of this paper is two folds. First, a one-pass field-based routing instead of regular two-pass approach is developed that significantly reduces the overhead of distributing routing information and computing the path and increases the QoS delivered to the flows. Secondly, a new routing metric named LU-IR is introduced that is shown to lower intra-flow and inter-flow interferences and results in increased network service capacity. The performance of the proposed algorithm is extensively studied through simulations. The results indicate that average delay of the flows is improved and the network throughput is increased compared to the existing schemes.

Voice over IP (VoIP) over a wireless mesh network (WMN) is a killer application candidate of the next generation services over wireless and mobile network infrastructure. Yet, the routing and transport efficiencies in consideration of specific attributes of WMNs have been little emphasized. Distinctively from conventional networks, the major traffic pattern of WMNs is anycast (one-to-one-of-many). To fully utilize the service aspects of WMNs, load balancing and scalability should simultaneously be supported. For VoIP, one challenge is to maintain the perceived quality depending on both loss and delay. In this paper, we assess autonomous load balancing anycast routing regarding VoIP supportability. The protocol is based on physics analogy and a distributed algorithm. We compare the protocol with shortest-path routing and back-pressure routing via simulations. Simulation results exhibit that autonomous load balancing of the protocol efficiently supports voice calls to guarantee the certain level of quality.

The ultimate goal of routing in wireless mesh networks (WMNs) is to find the “good” paths between the source and destination. Considering of the characteristics of this new networking paradigm, such as low mobility and less restriction from the energy effect, the focus is on the design and optimization of the technology to establish the path that can reflect this network feature. In this paper, an efficient routing algorithm is proposed based on decision-making sequence in WMNs, and the routing process is mapped into multi-stage decision process. We construct a mathematical model for it and present a multi-decision sequential routing method taking use of the idea of dynamic programming. In addition, a new metric (EEDT) for routing based on the information of MAC layer in WMNs is given, which optimized the two objectives- end to end delay and throughput. In the end, the multi-decision sequential routing algorithm (MDSR) is proposed that synthesized the suggesting method and new metric. The path selected by MDSR would be better based on the mathematical model, and it has lower delay of routing building. At the same time, EEDT can accurately capture the quality of the network links. Simulation results show that the proposed routing algorithm significantly improves the performance of the WMNs in terms of end-to-end delay and throughput.

Wireless mesh networks (WMN) possess characteristics such as self-healing, self-configuring and self-discovery. Due to this nature WMN has emerged as the most widely used popular network. Since these devices are operated using battery resources, several works have been carried out for minimizing energy consumption during routing process, thereby increasing network lifetime. WMNs are more vulnerable for attackers due to its wide usage. Many works can be found to detect the intruder during routing without considering energy as a metric. There exist possibilities of intruder to attack the battery resource thereby reducing network efficiency in energy-aware routing. Hence in this work we propose a novel approach to detect an intruder by self-monitoring mechanism of node considering metrics such as packet size, data rate, remaining energy and draining rate of a energy resources of a node. The proposed model consists of three modules, namely self-intrusion detector, monitor and evaluator. It detects and helps in making decisions to participate in the network transmission. The working of the model is analyzed and shows that the proposed model detects intruder effectively, thereby resulting in increase of WMN efficiency.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.

Interference makes it difficult for a wireless network to provide robust performance and could sometimes lead to transient failures. Dynamic channel switching (DCS) allows a wireless network interface (NIC) to operate in different frequency channels during different time periods without disrupting network connections that traverse the NIC. DCS enables a wireless mesh network to avoid frequency channels with serious interference in certain parts of its coverage area by switching to more idle channels. Although DCS provides additional radio agility, it significantly increases the complexity of the wireless mesh network's routing protocol. This paper describes the design, implementation and evaluation of a wireless mesh network system called Carlsbad, which supports both DCS and load-balancing/fault-tolerant routing, and successfully runs on low-cost commodity IEEE 802.11-based access points. Performance experiments on the first Carlsbad prototype show that despite the additional overhead it introduces, DCS can indeed improve the overall throughput of an IEEE 802.11-based wireless mesh network, sometimes by a factor of more than 2, for both TCP and UDP connections.