The mobile Nodes in wireless Ad hoc networks are fed by batteries,so the energy limitation has become a performance bottleneck for mobile ad hoc networks.IEEE 802.11 has been used as the current standard MAC protocol for ad hoc networks.However,it has not the ability of adjusting power level dynamically,which reduces the performance of network.Power control can enhance the power efficiency of nodes,reduce the interferer of neighbor nodes and improve the performance of network.A novel power controlled MAC protocol based on SNR in mobile Ad hoc networks is presented in this paper.Simulation results demonstrate that compared to the IEEE 802.11 MAC protocol,the proposed protocol can decrease the power consumption greatly,and improve the energy utilization of mobile terminals while maintaining the throughput performance.

A Power Control MAC Protocol for Ad hoc Networks

One of the main design issues for wireless sensor networks is the sensor placement problem. We formulate a constrained multivariable nonlinear programming problem to determine both the locations of the sensor nodes and data transmission pattern. Our two objectives are to maximize the network lifetime and to minimize the application-specific total cost, given a fixed number of sensor nodes in a region with a certain coverage requirement. We first study a linear network, and find optimal placement strategies numerically. Through numerical results, we show that the optimal node placement strategies provide significant benefit over a commonly used uniform placement scheme. Furthermore, we also present a performance bound as a benchmark. Lastly, we extend the results to a more sophisticated planar network, and use numerical results to evaluate the performance of the proposed strategies.

Energy-aware node placement in wireless sensor networks

Many minimum energy (energy-efficient) routing protocols have been proposed in recent years. However, very limited effort has been made in studying routing overhead, route setup time, and route maintenance issues associated with these protocols. Without a careful design, an energy-efficient routing protocol can perform much worse than a normal routing protocol. In this paper, we first show that the minimum energy routing schemes in the literature could fail without considering the routing overhead involved and node mobility. We then propose a more accurate analytical model to track the energy consumptions due to various factors, and a simple energy-efficient routing scheme PEER to improve the performance during path discovery and in mobility scenarios. Our simulation results indicate that compared to a conventional energy-efficient routing protocol, PEER protocol can reduce up to 2/3 path discovery overhead and delay, and 50 percent transmission energy consumption.

Model and Protocol for Energy-Efficient Routing over Mobile Ad Hoc Networks

We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks: energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER, on the other hand, is an energy-efficient routing algorithm which finds routes minimizing the total energy required for end-to-end packet traversal. RMER and RMECR are proposed for networks in which either hop-by-hop or end-to-end retransmissions ensure reliability. Simulation studies show that RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending the operational lifetime of the network. This makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks. In the design of RMECR, we consider minute details such as energy consumed by processing elements of transceivers, limited number of retransmissions allowed per packet, packet sizes, and the impact of acknowledgment packets. This adds to the novelty of this work compared to the existing studies.

/pdf/energy-efficient-reliable-routing-considering-residual-1f08ek7hlt.pdf

Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks

The ever-increasing density in cloud computing parties, i.e. users, services, providers and data centres, has led to a significant exponential growth in: data produced and transferred among the cloud computing parties; network traffic; and the energy consumed by the cloud computing massive infrastructure, which is required to respond quickly and effectively to users requests. Transferring big data volume among the aforementioned parties requires a high bandwidth connection, which consumes larger amounts of energy than just processing and storing big data on cloud data centres, and hence producing high carbon dioxide emissions. This power consumption is highly significant when transferring big data into a data centre located relatively far from the users geographical location. Thus, it became high-necessity to locate the lowest energy consumption route between the user and the designated data centre, while making sure the users requirements, e.g. response time, are met. The main contribution of this paper is GreeDi, a network-based routing algorithm to find the most energy efficient path to the cloud data centre for processing and storing big data. The algorithm is, first, formalised by the situation calculus. The linear, goal and dynamic programming approaches are used to model the algorithm. The algorithm is then evaluated against the baseline shortest path algorithm with minimum number of nodes traversed, using a real Italian ISP physical network topology.

/pdf/greedi-an-energy-efficient-routing-algorithm-for-big-data-on-4j2yeqvw69.pdf

GreeDi: An energy efficient routing algorithm for big data on cloud

Current minimum energy routing schemes in wireless networks only consider energy consumption for transmitting data packets. However most wireless devices also transmit some control packets (such as RTS and CTS in 802.11) besides data packets. Without considering the energy consumption for control packets, the existing minimum energy routing schemes tend to use more intermediate nodes, which results in more energy consumption and less throughput. We first propose more comprehensive energy consumption models that consider the energy consumption for data packets as well as control packets. Based on these models, we propose our minimum energy routing scheme. The simulation results verify that our scheme performs better than the existing minimum energy routing schemes in terms of energy consumption as well as throughput.

/pdf/a-comprehensive-minimum-energy-routing-scheme-for-wireless-51npswzx7a.pdf

A comprehensive minimum energy routing scheme for wireless ad hoc networks

Energy conservation is important for ad hoc networks. However, little effort has been made to carefully study the energy cost metrics upon which the design of various energy efficient algorithms is based. More specifically, most existing energy consumption models only considered energy cost of exchanging data packets, although common wireless protocols also need control packets (e.g., ACK) for reliable data transmissions. Without considering the energy cost of exchanging control packets, these existing models tend to underestimate the actual energy consumption, and thus leading to suboptimal energy efficient designs. In this paper, we develop energy consumption models that take into account energy consumption due to data packets, control packets and retransmission. We verify by simulations that our models match the actual energy consumption much better than existing models. In addition, we show that a minimum energy routing protocol based on an accurate model of ours performs much better than those based on existing models

/pdf/on-accurate-energy-consumption-models-for-wireless-ad-hoc-3qsfw380a3.pdf

On Accurate Energy Consumption Models for Wireless Ad Hoc Networks

Many minimum energy (energy efficient) routing protocols have been proposed so far. However, a few effort has been spent on the routing overhead, route setup time, and route maintenance issues associated with such protocols. This paper first shows that the minimum energy routing schemes in the literature could fail without considering the routing overhead involved and the node mobility. It then proposes a more accurate analytical model to track the energy consumption and the impact of packets errors, and a simple energy-efficient routing scheme to improve the performance in mobility scenarios. The simulation results indicate that the PEER-based energy efficient routing has significantly higher performance than that of a normal energy-based routing scheme.

http://www.ece.sunysb.edu/~xwang/public/paper/42_02.PDF

Jinhua Zhu

Papers

Model and Protocol for Energy-Efficient Routing over Mobile Ad Hoc Networks

A comprehensive minimum energy routing scheme for wireless ad hoc networks

On Accurate Energy Consumption Models for Wireless Ad Hoc Networks

PEER: a progressive energy efficient routing protocol for wireless ad hoc networks