Emerging communication technologies are now leading developers to design IT systems taking into count their energy-related considerations. Much research performed in the area of ad-hoc wireless networks tends to distribute the flows over all nodes of the network, which increases the amount of energy consumed by each node and reduces longevity of the network. To overcome these problems, this paper seeks to aggregate a set of flows within a number of nodes that is as low as possible in order to be capable of routing those flows. This proposal allows to maximize the number of network nodes that may be turned off. The proposed solution was formulated as an integer linear programming (ILP) problem using a set of energy and quality of service (QoS) constraints. This formulation minimizes the total energy consumed by the nodes to construct a topology network that is capable of meeting QoS requirement for a set flows inserted into the network. To evaluate the efficiency of the proposed model, a performance-based comparison was conducted with another routing model. The simulation results show that the proposed model offers better performance in terms of global energy consumption and network load

No abstract

The key aim of a multi-hop wireless network is to increase service efficiency in terms of transmission scheduling, packet transfer volume, and other factors. In a practical deployment of Ad- Hoc wireless network in three-dimensional (3D) environments, we study the optimizing transmission scheduling problem by end-to-end latency minimization using the signal-to-interference-and-noise rate (SINR) mechanism. Two strategies are considered. The former directly deals with end-to-end latency and eliminates the constraint of frame periodicity. The latter combines two cooperative transmission and transmission interference suppression models. The properties of both strategies are analyzed, and mixed-integer programming (MIP) models and solution heuristics are developed. Simulation results are presented to clarify the end-to-end latency performance of strategies, especially in 3D environments.