Showing papers by "Bernard Cousin published in 2014"

A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement

Abstract: Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-path routing schemes, a new path-discovery process is required once a path failure is detected, and this process causes delay and wastage of node resources. A multipath routing scheme is an alternative to maximize the network lifetime. In this paper, we propose an energy-efficient multipath routing protocol, called ad hoc on-demand multipath routing with lifetime maximization (AOMR-LM), which preserves the residual energy of nodes and balances the consumed energy to increase the network lifetime. To achieve this goal, we used the residual energy of nodes for calculating the node energy level. The multipath selection mechanism uses this energy level to classify the paths. Two parameters are analyzed: the energy threshold β and the coefficient α. These parameters are required to classify the nodes and to ensure the preservation of node energy. Our protocol improves the performance of mobile ad hoc networks by prolonging the lifetime of the network. This novel protocol has been compared with other protocols: ad hoc on-demand multipath distance vector (AOMDV) and ZD-AOMDV. The protocol performance has been evaluated in terms of network lifetime, energy consumption, and end-to-end delay.

Energy Conservation for Ad Hoc On-Demand Distance Vector Multipath Routing Protocol

Abstract: Routing in ad hoc mobile networks is a problem which has not yet been satisfactorily solved. Traditional routing techniques are not well adapted to new networks. Indeed, their lack of reactivity with respect to the traffic and network changes means traditional routing techniques cannot easily be used except at the price of over-dimensioning of the network resources (network bandwidth, node memory utilization, node CPU load, etc.). In recent years the research community has been interested in the improvement of ad hoc routing, and among the solutions suggested multipath routing has been considered. Multiple paths are exploited in order to ensure reliability and a quick reaction to changes in topology with a low overhead generated by the control messages. In this article we present an extension of the well-known routing protocol AODVM (Ad hoc On-demand Distance Vector Multipath). We propose to improve the multipath routing strategy with a path classification to allow the paths with the best energy level to be chosen.

Joint power-delay minimization in 4G wireless networks

Abstract: In this paper, we formulate an optimization problem that jointly minimizes the network power consumption and transmission delay in broadband wireless networks. Power saving is achieved by adjusting the operation mode of the network Base Stations (BSs) from high transmit power levels to low transmit levels or switched-off. Minimizing the transmission delay is achieved by selecting the best user association with the BSs. We study the case of a realistic Long Term Evolution (LTE) Network where the challenge is the high computational complexity necessary to obtain the optimal solution. Therefore, we propose a simulated annealing based heuristic algorithm for the power-delay minimization problem. The proposed heuristic aims to compute the transmit power level of the network BSs and associate users with these BSs in a way that jointly minimizes the total network power and the total network delay. The simulation results show that the proposed algorithm has a low computational complexity which makes it advantageous compared with the optimal scheme. Moreover, the heuristic algorithm performs close to optimally and outperforms the existing approaches in realistic 4G deployments.

Shaping HTTP adaptive streams using receive window tuning method in home gateway

Abstract: In this paper, we describe a new method, called RWTM (Receive Window Tuning Method) that shapes HTTP adaptive streams. It employs the flow control in the gateway to improve the quality of experience (QoE) of users. Our use case is when two HTTP Adaptive streaming clients are competing for bandwidth in the same home network. Results show that our proposed method considerably improves the QoE; it improves the video stability, the fidelity to optimal video quality level selection and the convergence speed to the optimal video quality level.

Green Home Network based on an Overlay Energy Control Network

Abstract: Today, reducing global greenhouse gas emissions has become a crucial issue for protecting the earth's environment. This requires the reduction of energy consumption in as many sectors as possible, including home networks. Indeed, in the home environment, networked devices consume a large proportion of household energy. There are three reasons that can explain the high energy consumption of home network devices. Firstly, devices are in idle state for hours when they are not in operation. Secondly, they cannot go to an ultra-low power consumption state when they are not needed. And last but not least, there is an increasing number of home network devices with soaring power consumption in our homes. These home network devices have a long switching time from idle state to sleeping state. Moreover, explicit user commands are required to switch the device from idle state to soft-off state. We can certainly gain energy if the device stays in sleeping state or soft-off state instead of idle state. We propose an Overlay Energy Control Network (OECN) which can switch devices from idle state to sleeping state much more quickly and from idle state to soft-off state automatically. The Overlay Energy Control Network (OECN) is formed by at least one overlay energy control node connected to each home network device. The OECN power management coordinates the power states of all home network devices. The overlay energy control nodes can exchange energy control messages. The devices can be turned on or turned off, or can return to their power states when they receive the OECN messages. So that the OECN can be adaptive to our home network devices, the OECN is developed in two ways: (i) all overlay energy control nodes in the home network are ZigBee nodes. This is a ZigBee Mandatory OECN Solution (ZMS); (ii) one or more devices become the overlay energy control nodes where there are no ZigBee modules on that device. This is a ZigBee Optional OECN Solution (ZOS). In our simulation, we will evaluate our overlay energy-saving solutions with a self-controlled energy solution in three metrics: energy consumption, delay and cost. In the self-controlled solution, the device controls its own power state. The proposed Overlay Energy Control Network provides an efficient energy-saving solution for home network devices. In our use case, the ZigBee Mandatory Solution can gain 21.79% energy on average compared to the self-controlled solution. It is an efficient energy-saving solution, but it has a relatively high delay compared to the ZigBee Optional Solution and the self-controlled solution.

Multi-constrained path computation for inter-domain QoS-capable services

Abstract: Computing inter-domain multiprotocol label switching traffic engineering label switched path MPLS-TE LSP through a pre-determined sequence of domains is quite straight as each path computation element PCE, using the backward recursive PCE-based computation BRPC, knows who is the next to be contacted in order to continue the computation. The optimality of the inter-domain MPLS-TE LSP path depends strongly on the choice of the pre-determined sequence of domains on which the calculation works. In this paper, we propose a novel procedure allowing a forward discovery of multiple inter-domain sequences and the computation of constrained inter-domain paths for MPLS-TE LSPs over these domains sequences. Other issues around the inter-domain path computation, such as route discovery and inter-domain loop avoidance, are investigated. Experimental evaluation shows that our solution is effective in terms of protocol and algorithmic efficiency and provides satisfiable performance with high success rate, reasonable message overhead and runtime.

A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks

Abstract: Inter-domain quality of service (QoS) routing is a challenging problem for today's Internet. This problem requires the computation of paths that cross multiple domains and meet different QoS constraints. In addition, the used computation methods must meet the constraints of confidentiality and autonomy imposed by the domains of different operators. Path computation element (PCE)-based architecture offers a promising solution for inter-domain QoS routing. It ensures the computation of end-to-end QoS paths while preserving the confidentiality and the autonomy of the domains. In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks. HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Moreover, it integrates a crankback mechanism for improving path computation results in a single domain or in multiple domains based on the PCE architecture. Detailed analyses are provided to assess the performance of our algorithm in terms of success rate and computational complexity. The simulation results show that our algorithm has an acceptance rate of the requests very close to the optimal solution; precisely, the difference is lower than 1 % in a realistic network. Moreover, HID-MCP has a low computational complexity. Besides, our solution relies on the PCE architecture to overcome the limitations related to inter-domain routing such as domain autonomy and confidentiality.

Tree Reconfiguration without Lightpath Interruption in Wavelength Division Multiplexing Optical Networks with Limited Resources

Abstract: Today, operators use reconfiguration to improve the performance of connection oriented networks. In our previous work, we studied tree reconfiguration without data flow interruption in wavelength division multiplexing optical networks. In our previous approach, the available resources of the network (wavelengths) are not considered as limited. In this work, we study tree reconfiguration in a network which has a limited number of wavelengths per link. This paper proposes an algorithm called TRwRC (tree reconfiguration with resources constraint). TRwRC reconfigures a tree without data flow interruption in a network with a limited number of wavelengths.

Refined Overlay Power Management in the Home Environment

Abstract: The reduction of power consumption plays a key role in numerous environmental and economic issues. Since home network appliances are widely used, residential power consumption makes up a large part of global energy consumption. These home appliances are not only interconnected with each other to provide collaborative services, but are also integrally turned on to contribute to these collaborative services. Faced with this situation, we propose a refined overlay power management system in which appliances can be partially turned on depending on the services, and can be turned on at the moment they are required. In addition, user activities are critical information for the service launch, and so the proposed system has the capacity to learn information about the collaborative service in order to provide efficient power management.

Collaborative overlay power management based on the delay-power tradeoffs

Abstract: Achieving an energy-efficient home network while providing high quality user service is and will continue to be a significant need for the future residential environment. In this home network environment, numerous home appliances are widely used and also integrally turned on to contribute to the home network service. But these appliances are used partially in different service requirements. Therefore, in this paper, we propose a collaborative overlay power management system in which appliances can be partially turned on depending on the request of the services. Moreover, by learning a users behavior, the collaborative overlay power management could trend to minimize power consumption or trend to minimize the waiting delay. Regarding research on the different power consumption and waiting delay tradeoffs, our proposition allows for satisfying different user requirements on power consumption and waiting delay.

Study of Energy Saving in Carrier-Ethernet Network

Abstract: Energy saving is a really interesting topic in today's networks. Indeed, Information and Communication Technologies (ICT) systems are energy greedy, they require more and more energy and as energy is more and more expensive, thus we seek to save it. Accordingly, energy saving has recently received considerable attention as a promising approach for delivering ICT services with environmentally conscious use of smart technology. Thus, this paper addresses the issue of energy consumption in broadband and carrier networks and especially in Carrier-Ethernet networks. We review and describe relevant works currently proposed for energy-efficient operation of wired network infrastructure. Accordingly, in this paper we survey and discuss different technical issues related to energy saving. Furthermore, we have classified energy aware strategies in two main categories. Research proposals related to each category are deeply discussed. In addition, this paper identifies some of the remaining key research challenges. Besides that, we have analyzed the adaptation and the suitability of approaches that have been proposed for IP networks to carrier Ethernet networks.

Configurable Monitoring for Multi-domain Networks

Abstract: In this paper, we review the state-of-the-art monitoring architectures proposed for multi- domain networks. We establish the five requirements a multi-domain monitoring architecture must fulfilled. We note that these architectures do not support measurement configuration that enables the providers to perform flexible multi-domain measurements. Therefore, we propose a configurable multi-domain network monitoring architecture in order to give more flexibility in monitoring and solve the heterogeneity and interoperability problems. We also propose two collaboration schemes that can be applied in our configurable monitoring architecture. These collaboration schemes are based on the proactive selection and the reactive selection. We show through extensive simulations that the proactive collaboration scheme provides a more flexible multi-domain monitoring and reduces the delay and the overload of the monitoring establishment.

Applying p -cycle protection for a reliable IPTV service in IP-over-DWDM networks

Abstract: Today, television over Internet protocol (IPTV) has become very popular and service providers must deal with the rapid growth in the number of IPTV customers. Service providers must ensure the reliability of IPTV to satisfy customers’ needs, as a network failure could disrupt an IPTV transmission. Survivable multicast routing is important for providing a reliable IPTV service. Generally, most carriers route multicast traffic using the protocol-independent multicast source-specific mode (PIM-SSM) based on the routing information provided by the interior gateway protocol (IGP). Restoration using the IGP reconfiguration is slow and typically takes from 10 to 60 seconds. To ensure a fast restoration, we consider node and link failure recovery in the Dense Wavelength Division Multiplexing (DWDM) optical layer. The backup path is provided in this layer. Thus, the multicast tree does not change at the IP layer (the logical links do not change) and the restoration time is faster (typically of the order of 50 to 80 ms). In this paper, we apply p-cycles in IP-over-DWDM networks to provide a robust IPTV service. In addition, we propose a novel concept for node protection using p-cycles to achieve more efficient resource utilization. We also propose a new algorithm, the node and link protecting candidate p-cycle based algorithm (NPCC). This algorithm integrates our new concept for node protection. Extensive simulations show that it outperforms the existing approaches in terms of blocking probability, resource utilization efficiency and computation time rapidity.