ECARDM: Energy Consumption Aware Route Discovery for Multicasting in Mobile Ad hoc Networks

Consideration of energy consumption in the case of wireless ad hoc networks leads to effective reduction of energy consumption by the nodes and increases the lifetime of the batteries for nodes. It is imperative from the existing models that there is significant scope for improvement in the energy-consumption based route discovery models. A model of Fuzzy based marginal energy disbursed multicast route discovery model for MANETs can support in reducing the power consumption has been proposed in our earlier research paper. In the present paper, a contemporary solution termed 201C;Energy Consumption Aware Route Discovery for Multicasting for MANETs201D; has been proposed, which is profoundly a fuzzy reasoning and genetic algorithm based model that focus on both the energy consumption and also the element of end-to-end delay whilst discovering the route. The experimental study of the model in comparison to BWDCMR and GAEEQMR models depicted that the proposed algorithm is very effective and can certainly be result oriented

Energy Efficient Multicast Routing in Mobile Ad Hoc Networks: Contemporary Affirmation of Benchmarking Models in Recent Literature

The Mobile Ad hoc Networks playing critical role in network aided communication requirements The features such as ad hoc and open architecture based connectivity and node mobility are elevating the mobile ad hoc networks as much as feasible to deploy and use The direct communication between any of two nodes in this network is possible if target node is in the range of source node If not the indirect communication took place which is usually referred as multi hop routing The multi hop routing occurs as either a unicast model one source node to one destination node multicast model one source node to multiple destination nodes or multiple casting manifold unicast routing In these routing strategies provision of service quality in multi hop routing is a challenging task The optimal quality of service in routing magnifies the delivery ratio transmission rate network life span and other expected characteristics of the ad hoc routing Among the quality service provision factors minimal energy conservation is prime factor which is since the nodes involved in routing are self-energized and if discharged early then the route will be destructed that causes discontinued routing The energy consumption is more specific in multicast routing hence it is grabbing the more attention of the current research contribution

Novel approaches to performance evaluation and benchmarking for energy-efficient multicast: empirical study of coded packet wireless networks

With the advancement of communication networks, a great number of multicast applications such as multimedia, video and audio communications have emerged. As a result, energy efficient multicast in wireless networks is becoming increasingly important in the field of Information and Communications Technology (ICT). According to the study by Gartner and Environmental Protection Agency (EPA) report presented to United State Congress in 2007,energy consumption of ICT nodes accounts for 3% of the worldwide energy supply and is responsible for 2% of the global Carbon dioxide (CO2) emission. However, several initiatives are being put in place to reduce the energy consumption of the ICT sector in general. A review of related literature reveals that existing approaches to energy efficient multicast are largely evaluated using a single metric and while the single metric is appropriate for effective performance, it is unsuitable for measuring efficiency adequately. This thesis studied existing coded packet methods for energy efficiency in ad hoc wireless networks and investigates efficiency frontier, which is the expected minimum energy within the minimum energy multicast framework. The energy efficiency performance was based on effective evaluation and there was no way an inefficient network could reach a level of being an efficiency frontier. Hence, this work looked at the position of how true efficiency evaluation is obtained when the entire network under examination attains their efficiency frontiers using ratios of weighted outputs to weighted inputs with multiple variables. To address these challenges and assist network operators when formulating their network policies and performing network administrations, this thesis proposed novel approaches that are based on Data Envelopment Analysis (DEA) methodology to appropriately evaluate the efficiency of multicast energy and further minimizes energy transmission in ad hoc wireless networks without affecting the overall network performance. The DEA, which was used to study the relative efficiency and productivity of systems in Economic and Operational Research disciplines, is a non-parametric method that relies on linear programming technique for optimization of discrete units of observation called the decision making units (DMUs)

Heuristics for Network Coding in Wireless Networks

Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from one source to all nodes, in a multi-hop wireless network. The broadcast we focus on is based on network coding, a promising avenue for reducing cost; previous work of ours showed that the performance of network coding with simple heuristics is asymptotically optimal: each transmission is beneficial to nearly every receiver. This is for homogenous and large networks of the plan. But for small, sparse or for inhomogeneous networks, some additional heuristics are required. This report proposes such additional new heuristics (for selecting rates) for broadcasting with network coding. Our heuristics are intended to use only simple local topology information. We detail the logic of the heuristics, and with experimental results, we illustrate the behavior of the heuristics, and demonstrate their excellent performance

Improving Multicast Communications Over Wireless Mesh Networks

In wireless mesh networks (WMNs) the traditional approach to shortest path tree based multicasting is to cater for the needs of the poorest performingnode i.e. the maximum permitted multicast line rate is limited to the lowest line rate used by the individual Child nodes on a branch. In general, this meansfixing the line rate to its minimum value and fixing the transmit power to its maximum permitted value. This simplistic approach of applying a single multicast rate for all nodes in the multicast group results in a sub-optimal trade-off between the mean network throughput and coverage area that does not allow for high bandwidth multimedia applications to be supported. By relaxing this constraint and allowing multiple line rates to be used, the mean network throughput can be improved. This thesis presents two methods that aim to increase the mean network throughput through the use of multiple line rates by the forwarding nodes. This is achieved by identifying the Child nodes responsible for reducing the multicast group rate. The first method identifies specific locations for the placement of relay nodes which allows for higher multicast branch line rates to be used. The second method uses a power control algorithm to tune the transmit power to allow for higher multicast branch line rates. The use of power control also helps to reduce the interference caused to neighbouring nodes.Through extensive computer simulation it can be shown that these two methods can lead to a four-fold gain in the mean network throughput undertypical WMN operating conditions compared with the single line rate case

Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks

This article is posted here with permission of IEEE - Copyright @ 2010 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council of U.K. underGrant EP/E060722/