An efficient QoS routing algorithm for solving MCP in ad hoc networks

Providing guaranteed quality of service (QoS) in wireless networks is a key issue for deploying multimedia applications. To support such a QoS, an arduous problem concerning how to find a feasible end to end path to satisfy multiple QoS constraints should be studied. In general, multi-constrained path selection, with or without optimization, is an NP-complete problem that cannot be exactly solved in polynomial time. Approximation algorithms and heuristics with polynomial and pseudo-polynomial time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational complexities that cannot be used for multimedia applications in ad hoc networks characterized by mobility and performance constraints (e.g., limited energy, wireless medium, etc.). Recently a promising heuristic algorithm H_MCOP using a non linear Lagrange relaxation path functions has demonstrated an improvement in its success rate and in finding feasible paths. However, the H_MCOP is not suitable for ad hoc networks and has not exploited the full capability that a Lagrange relaxation could offer. In this paper, we propose an efficient multi-constrained path heuristic called E_MCP, which exploits efficiently the Lagrange relaxation and enhances the path search process to be adequate to mobile ad hoc networks. Using extensive simulations on random mobile network with correlated and uncorrelated link weights, we show that the same level of computational complexity, E_MCP can achieve a higher success ratio of finding feasible paths.     

Multicast Support in DiffServ Using Mobile Agents

Many multicast applications, such as video‐on‐demand and video conferencing, desire quality of service (QoS) support from an underlying network. The differentiated services (DiffServ) approach will bring benefits for theses applications. However, difficulties arise while integrating native IP multicasting with DiffServ, such as multicast group states in the core routers and a heterogeneous QoS requirement within the same multicast group. In addition, a missing per‐flow reservation in DiffServ and a dynamic join/leave in the group introduce heavier and uncontrollable traffic in a network. In this paper, we propose a distributed and stateless admission control in the edge routers. We also use a mobile agents‐based approach for dynamic resource availability checking. In this approach, mobile agents act in a parallel and distributed fashion and cooperate with each other in order to construct the multicast tree satisfying the QoS requirements.     

Systematic forecasts of solar collector's performance in various sites of different climates in Algeria

This paper presents the results of theoretical models suggesting investigation of the performance of a solar air flat plate collector. The model can predict the temperature of the outlet air. This will be compared with the results obtained by the experimental results. The range of experimental results related to the thermal performances of plane–air solar collectors and various practical uses, inspires us to undertake this work in the context of a rational exploitation of local solar field. Indeed the setting up of a solar system to satisfy a well-determined need in a given site has to be done only after first having estimated the system productivity relative to the solar field actually available by fine weather (bright sky) or by bad days (covered sky) and then having an exact knowledge of the evolution of the climatic parameters.     

An efficient heterogeneous key management approach for secure multicast communications in ad hoc networks

In a mobile wireless ad hoc network, mobile nodes cooperate to form a network without using any infrastructure such as access points or base stations. Instead, the mobile nodes forward packets for each other, allowing communication among nodes outside wireless transmission range. As the use of wireless networks increases, security in this domain becomes a very real concern. One fundamental aspect of providing confidentiality and authentication is key distribution. While public-key encryption has provided these properties historically, ad hoc networks are resource constrained and benefit from symmetric key encryption. In this paper, we propose a new key management mechanism to support secure group multicast communications in ad hoc networks. The scheme proposes a dynamic construction of hierarchical clusters based on a novel density function adapted to frequent topology changes. The presented mechanism ensures a fast and efficient key management with respect to the sequential 1 to n multicast service.     

Bioinspired Redox‐Active Catechol‐Bearing Polymers as Ultrarobust Organic Cathodes for Lithium Storage

Redox‐active catechols are bioinspired precursors for ortho ‐quinones that are characterized by higher discharge potentials than para ‐quinones, the latter being extensively used as organic cathode materials for lithium ion batteries (LIBs). Here, this study demonstrates that the rational molecular design of copolymers bearing catechol‐ and Li⁺ ion‐conducting anionic pendants endow redox‐active polymers (RAPs) with ultrarobust electrochemical energy storage features when combined to carbon nanotubes as a flexible, binder‐, and metal current collector‐free buckypaper electrode. The importance of the structure and functionality of the RAPs on the battery performances in LIBs is discussed. The structure‐optimized RAPs can store high‐capacities of 360 mA h g^?1 at 5C and 320 mA h g^?1 at 30C in LIBs. The high ion and electron mobilities within the buckypaper also enable to register 96 mA h g^?1 (24% capacity retention) at an extreme C‐rate of 600C (6 s for total discharge). Moreover, excellent cyclability is noted with a capacity retention of 98% over 3400 cycles at 30C. The high capacity, superior active‐material utilization, ultralong cyclability, and excellent rate performances of RAPs‐based electrode clearly rival most of the state‐of‐the‐art Li⁺ ion organic cathodes, and opens up new horizons for large‐scalable fabrication of electrode materials for ultrarobust Li storage.     

Contribution to the Study of the Reduction of Energy Consumption through the Exchanger Coupled Conventional Air‐Ground‐Air Conditioner. Application to the Building

In this study, a new method of using the earth‐air heat exchangers to reduce energy consumption in buildings is discussed. The idea is to couple the EAHE with the condenser of a residential air conditioning system to enhance the effectiveness of the latter. Under the climatic conditions of high temperature in summer (south‐eastern region of Algeria), which can sometimes exceed 50 °C, what makes the heat exchange between the air conditioner and the external environment very difficult in addition to the problem of thermal comfort and the cost of energy consumption. Conducting a simulation by the TRNSYS software that allows to couple the model of the EAHE with the condenser of a residential air conditioner and connect the system with a building. The results show a clear reduction in the energy consumed by this system in connection with the direct use of the air conditioner and increase air conditioning efficiency, coefficient of performance, and energy efficiency rating. In this paper the Hollmuller model was ameliorated and the obtained results are in concord with it. The system is capable of resolving the problem of mal cooling of buildings by air conditioners under critical climate conditions, in addition to lowering the heat output of the condenser, and reducing its effect on the environment.     

Improving IPTV Forwarding Mechanism in IEEE 802.16j MMR Networks Based on Aggregation

Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.     

A Load-Balancing and Push-Out Scheme for Supporting QoS in MANETs

Currently, mobile ad hoc networks (MANETs) lack load-balancing capabilities, and thus, they fail to provide good performance especially in the case of a large volume of traffic. Ad hoc networks lack also service differentiation. However, in these wireless environments, where channel conditions are variable and bandwidth is scarce, the differentiated services developed for the Internet are suboptimal without lower layers' support. The IEEE 802.11 standard for Wireless LANs is the most widely used WLAN standard today. It has a mode of operation that can be used to provide service differentiation, but it has been shown to perform badly. In this paper, we present a simple but very effective method for support Quality of Service, by the use of load-balancing and push-out scheme. This approach offers to the mobile node: the ability to alleviate congestion by traffic distribution of excessive load, and to support priority of packets in the single MAC buffer. We evaluate the performance of our algorithm and compare it with the original IEEE 802.11b protocol. Simulation results show that this new approach reduces packet loss rate and increases throughput as well as provides service differentiation in the MAC layer.     

Security and performance enhancement of AODV routing protocol

A mobile ad hoc networks (MANET) is a decentralized, self‐organizing, infrastructure‐less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc On‐demand Distance Vector (AODV) using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global (TG) and trust local (TL). TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service/distributed denial of service (DOS/DDOS) attack using network simulator NS‐2. It is compared with the Trust Cross Layer Secure (TCLS) protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end‐to‐end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV + Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV + Ant is compared with simple ant routing algorithm (SARA), AODV, and Trust AODV under DOS/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end‐to‐end delay, there is no significant improvement. Copyright © 2014 John Wiley & Sons, Ltd.