EnergyEfficientWireless Communications with Future Networks and Diverse Devices
View this Special IssueResearch Article  Open Access
Abdellah Chehri, Hussein T. Mouftah, "Energy Efficiency Adaptation for Multihop Routing in Wireless Sensor Networks", Journal of Computer Networks and Communications, vol. 2012, Article ID 767920, 8 pages, 2012. https://doi.org/10.1155/2012/767920
Energy Efficiency Adaptation for Multihop Routing in Wireless Sensor Networks
Abstract
Wireless sensor networks (WSNs) are considered as a suitable solution for longtime and largescale outdoor environmental monitoring. However, an important feature that distinguishes the WSNs from traditional monitoring systems is their energy constraints. In fact, these nodes have often a limited and usually nonreplenishable power source. Therefore managing these limited resources is a key challenge. In this paper we use an optimization scheme based on adaptive modulation and power control for a green routing protocol. The optimization mechanism is subject to certain QoS requirements in terms of total endtoend delay time and bit error rate. The simulation results show that the proposed algorithm can, theoretically, reduce the consumed energy of the sensor nodes almost to half.
1. Introduction
Wireless sensor networks (WSNs) are one of today’s most interesting emerging technologies. WSN is made up of a large number of inexpensive devices that are networked via lowpower wireless communications [1]. The development of this attractive network has open many doors for a several number of “new and exciting” applications, in which flexibility, easy deployment, and configuration are important properties. Amongst a diverse set of applications where WSN can be used we can quote precision agriculture, environment monitoring, fire detection, smart home, intrusion detection, localization, medicine, and many others.
In addition, the wireless sensor networks are working in ad hoc fashion. The selfconfiguring, selfhealing characteristics make a WSN autonomous wireless network, and therefore allow them a great advantage in a large number of situations.
A large number of WSN applications are composed of stationary nodes. These nodes transmit the collected data at relatively low rates, with a focus to route the data to a central base station.
However, one important feature that distinguishes sensor networks from traditional monitoring systems is their nonreplenishable energy, where the sensor nodes are batterypower limited.
It is commonly accepted that the main design goal in wireless sensor networks is the reduction of energy costs. In fact, energy efficiency is an important point emphasized in the vast majority of relevant publications, since energy reserves are usually considered to be finite.
Energy consumption can be affected by all layers of the network, ranging from physical to application layer. Several energy management strategies have been investigated of a WSN [2–6]. The main works focus on efficient topology design (tier layer networks versus flat network) [2], link adaptation [3], energyefficient MAC [4], energyaware routing protocol [5], or suitable power preserving physical layer (by using green modulation and power control) [6].
However, this traditional layerwise approach leads to independent design of different layers and results in higher margins. Interesting approaches, called crosslayer, have been proposed to improve the whole network performance. Su and Lim [7] are the first who proposed a crosslayer design and optimization framework, by providing experimental results and analysis. The research done by the authors shows promising results, and they strongly recommend crosslayer design as a new methodology for designing and optimizing the performance of future wireless networks.
The main idea behind the crosslayer design is the transparency behavior between two or more layers. The interactions and information exchange between various protocol layers can achieve, generally, a good network performance.
In this paper we study design of a joint power and the adaptive modulation scheme applied to a green energy routing protocol. In addition, the proposed scheme used a suitable powersaving MAC protocol with a sleep mode mechanism.
The remainder of this paper is organized as follows. In Section 2, several efforts on energyrelated aspects at different layers in WSNs are addressed. The Section 3 deals with the proposed crosslayer assumptions and network configuration. The Section 4 gives the mathematical formulation of the proposed algorithm. Section 5 provides numerical evaluations using the random WSN topology as well as realistic node circuit sensor models to confirm our analysis. We consider first energyefficient communication over a single communication link between the nodes. Multihop routing will be analyzed using energy efficient routing protocol. Finally Section 6 concludes the paper with some direction for future works.
2. Related Works
Mainly, the sensor energy can be spent in two categories: the device consumption and transmission energy consumption. Even if the power consumption of wireless link represents approximately 70% of the total power in a sensor network, we take into consideration the hardware (or circuit) energy consumption [8]. To optimize the communication power consumption, much work has been conducted either for PHY, MAC, or routing layer. In this section we define the main areas where the sensor energy consumption can be reduced.
2.1. EnergyAware Physical Layer Protocols
At the physical layer, the modulation and the power transmission are the main adjustment parameters for an energy efficiency communication. One of the pioneering works on energyefficient modulation has been presented in [9]. The authors focused only on minimizing the energy consumption of transmitting one bit.
The modulation scaling (which exhibits benefits similar to those of voltage scaling) has been also presented. In [10] an adaptive modulation scheme for WSN with an Additive White Gaussian Noise (AWGN) channel has been investigated.
Link adaptation can also achieve a good performance in terms of energy saving in WSN. The results have shown that the link adaptation can improve the performance of such networks [11].
2.2. MAC Protocols
Many energy efficiency MAC protocols have been proposed in literature. One of the primary mechanisms for achieving lowenergy operation in energyconstrained WSNs is duty cycling [12].
In these approaches, each sensor node periodically cycles between an active state and a sleep state. Key parameters that characterize the duty cycle include sleep time, wake time, and the energy consumed during the active state and the sleep state. The period of a duty cycle is equivalent to its sleep time plus the active time. On the basis of this reduced duty cycle several protocols have been analyzed (SMAC, BMAC, RIMAC, XMAC, and TMAC).
Figure 1 shows the duty cycle mechanism, and the communicating nodes are synchronized with one another.
For this purpose, we use the system model according to a flexible dutycycling process utilized in practical sensor devices.
Each node is at any time in one of three different states: active (transmitting or receiving), sleeping (not communicating), or transient (powering up from sleep to active).
We denote as the transient mode duration consisting of the switching time from sleep mode to active mode. This model will be adopted in this work.
We should take into consideration that the circuit power consumption is dependent on the modulation order. However, this power is different for each of the three states. When the node is transmitting (i.e., active mode), the total power consumption is found as the sum of the transmission and circuit power consumption.
In addition we note that is a key factor in choosing the energyefficient modulation, since it directly affects the total energy consumption as we will show later.
2.3. Routing Protocol
Routing problems are usually considered to be the core of wireless sensor network design. However, in most application scenarios, WSN nodes are powered by small batteries, which are often in practice nonrechargeable. Therefore, a good routing protocol should be able to select the routes that consume minimal global energy. Hence, a software solution which combines crosslayer and energyaware system design to increase energy efficiency is a promising way worth exploring.
A plethora of routing protocols has been developed for WSNs and can be studied in detail in [13]. One reason for such a huge number of protocols for WSNs is that such networks are application specific, and a particular routing protocol can only satisfy a class of WSN application requirements. The shortest path and minenergy algorithm are a typical WSN routing policy.
In [14], the authors have studied network life time maximization of WSN through joint routing and sleep scheduling. The authors tackled the problem by transforming the nonconvex optimization routine into a special form of signomial program (SP). The problem is then solved through an IGP algorithm. Their proposed algorithm drastically outperforms the performance of optimal iterative separate routing and sleep scheduling method by an average of 29% over a large range of traffic rates.
Yanwei et al. proposed an energyefficient wakeup scheduling for data collection [15]. They have also proposed an efficient method to construct energyefficient data gathering tree, whose energy cost and time span of the scheduling are both within constant times of the optimum.
In [16], the authors have formulated the joint routing and power control problem in wireless multihop networks as a markov decision process. On the basis of the factorization of the state transition probability, the authors derived a distributed computation method for finding the optimal policy.
3. System Model and Assumptions
Our work has been informed and influenced by a variety of other research efforts [1, 3, 6, 8, 10, 12]. There are various proposals in the area of power management, mostly validated either using theoretical analysis or simulation.
In this work, we extend our previous work [8], to provide, optimize, and analyze a crosslayer energy efficiency model by jointly considering routing (maximum remaining energy routing protocol), MAC, physical layer, and device energy consumption. The works presented in [3, 6, 8, 10] (physical layer), TMAC (MAC layer), will be combined and applied to a randomly generated multihop route in a network of a given size and density; that is, the nodes in a multihop route will be configured so that the total energy consumption is minimized, subject to QoS requirements.
It is demonstrated that among various sinusoidal carrierbased modulations, the noncoherent Mary frequency shift keying (NCMFSK) is the most energyefficient scheme [6]. Therefore, this modulation scheme was selected in this work.
Our aim is to develop an energy efficiency algorithm for WSN over multihop route. The route is selected based on the battery energy levels of each node. Each node uses a modulation scaling and dynamic power transmission. The both parameters are able to vary dynamically depending on the QoS requirements (in terms of maximum endtoend delay and BER, bit error rate). In order to solve it, we proposed a scenario with the following characteristics.(i)The underlying wireless sensor network is going to be modeled as multihop communication paths. In each path, sensor nodes will be involved.(ii)Each node has the possibility of being part of several paths at the same time. Therefore different nodes will have more energy consumption per unit of time than others. (iii)Each node has several parameters. Most important parameters in our analysis are node remaining energy, modulation order, and transmission power.(iv)Packet of size is going to be transmitted from the sensor to sink with a given endtoend latency constraint.(v)The inference among nodes is assumed to be solved by a synchronized TMAC layer protocol.(vi)We selected the NCMFSK modulation scheme. However the research made can be easily extended to other modulation schemes.
4. Problem Formulation
We consider a communication link between adjacent nodes. So that the analysis reflected in the best reality, the theoretical energy consumption models in the transmitter and receiver nodes along the route, for both communication and hardware consumed energy, are taken into account.
4.1. Radio Link Model
The wireless channel model between the sensors is assumed to be Rayleigh flat fading with pathloss, which is a feasible model in static WSNs [6].
We denote the fading channel coefficient correspond to the transmitted symbol as where the amplitude is Rayleigh distributed with probability density function given according to where
When transmitting over a th link with transmission power the received signal power, , is given by where is the separation distance, is the gain factor at m, which is calculated by is the path loss exponent, and the link margin, which are all assumed to be the same for all hops.
The corresponding average signaltonoise ratio SNR () where is the energy of the transmitted signal, is the system bandwidth, the power spectral density of the AWGN on the channel, and the receiver noise figure. The measured SNR indicates the quality of a single wireless link.
4.2. Modulation Scheme
Actually the two schemes are playing different and complementary roles while the Mary quadrature amplitude modulation MQAM provides better spectral efficiency, and Mary frequency shift keying the MFSK assures power efficiency. The Noncoherent MFSK (NCMFSK) with a small order of constellation size has been considered the most energyefficient modulation in WSNs over Rayleigh and Rician fading channels [6].
In addition, using MFSK appears to be the most attractive solution for sensor networks as it is the modulation scheme that requires the least circuit complexity and apart from that increasing Mary results in small SNR and thus lessrequired transmitted power needed for a given SER. On the Basis of this criterion, NC MFSK has been selected in this work.
It is shown that the bit error rate BER, , conditioned upon of a Mary FSK is obtained as where is the zerothorder modified Bessel function. The average SER of NCMFSK is given by It is shown that is upper bounded by Since it aims to obtain the maximum energy consumption, we approximate the above upper bound as equality: Combining (7) and (12) yields the expression for the required transmission power using modulation order over a link:
4.3. Total Energy Consumption
As we described earlier, the energy consumed of the transmitter nodes is caused by two sources: one part is due to the RF signal generation, which mostly depends on choosing modulation and target distance and therefore on the transmission power . A second part of consumed energy (called ) is due to the hardware electronic components (filters, frequency synthesis and amplifiers…).
In this work, we used an energy consumption model for a generic (canonical) packetbased nodeto node wireless communication link. Although there are extensive assumptions and validations of these models by measurements in various scenarios, this is beyond the scope of this work.
Since sensor nodes in a typical WSN are densely deployed, the distance between nodes is normally short. Thus, the total circuit power consumption, defined by , is comparable to the RF transmit power consumption denoted by, where and represent the circuit power consumptions for the transmitting sensor and receiving node, respectively.
To modeling the , we use the similar model described by Abouei et al. [6]. The optimum NCMFSK demodulator consists of a bank of matched filters, each followed by an envelope detector. For the sensor node with the NCMFSK modulator, we denote the power consumption of frequency synthesizer, filters, and power amplifier as , and , respectively. In this case
For transmitting circuit’s part, we considered that the circuit consumption is depending on the modulation order. In other words, an increase of modulation order yields an increase of power consumption of node circuit. In addition, we assume that the receiving node uses a lownoise amplifier (LNA), which is generally placed at the frontend of an RF receiver circuit, an intermediatefrequency amplifier (IFA), and an ADC, regardless of type of deployed modulation. Thus, denoting , , , , and denoting power consumption of LNA, filters, envelope detector, IF amplifier, and ADC, respectively, the circuit power consumption of the node is given by In addition, it is shown that the energy consumption during transit time () is obtained as .
4.3.1. The Peak Power Constraint
The nodes are peak power limited, that is, the instantaneous power that can be drained from the batteries is limited by the constraint . The peak power constraint limits the total power consumption in each node, since is required. For a given modulation order , the output transmission power is then limited as follows: where factor depends on the drain efficiency of the RF power amplifier and the peaktoaverage power ratio (PAPR) of the transmitted signal as described in [6].
4.3.2. Active Transmitting Time
The time duration of the transmission of one packet of length bits (including all headers) can be modeled as where is channel bandwidth.
4.3.3. Link Energy Consumption
The total energy consumption for a packet transmission over the th hop can now be expressed as , , , and are all functions of the modulation order For easy writing, and this dependence will not be indicated explicitly.
4.3.4. Route Selection
To this point, we have simply assumed that a reliable path from source to sink has been found, without discussing how. Let us consider a source node try to forward the collected data to the sink node, and let us assume, without loss of generality, that there are disjoint routes from source to sink (see Figure 1). Each route , contains intermediate nodes . Let us call , with, the relative residual energy of node . The available energy on route is the lowest energy level of all nodes forming this route, that is, . Maximumminimum availableenergy routing selects the route with maximum , that is, route whose satisfies The route that has maximumminimum available power is preferred. Using (16), the total available energy is calculated by summing the PAs of each node along the route. On the basis of this approach, route () is selected in Figure 2.
4.3.5. QoS Requirements
The QoS requirements are given per endtoend packet transmission, in terms of the maximum allowed delay and . The total transmission time is calculated as the sum of the transmission and transit times for all nodes. In addition, there might be a queuing delay at each node, denoted . If no other traffic exists on the route, and all processing and buffering delays associated with the forwarding of the packet are ignored.
This assumption is made in [17] and will be adopted here. Although this assumption is not possible to fulfill in an implementable system, it does provide a theoretical upper performance bound.
For an endtoend delay constraint , a valid configuration must satisfy The probability for a successful endtoend transmission over hops can be found as the product of the probability for successful transmission for each hop, assuming that bit error events are independent between the hops; that is, a decodeandforward scheme is used. The following product must be satisfied: The dedicated time to share key information between nodes such as a routing protocol mechanism, remaining node’s energy, and so forth could be transmitted during a fixed time called (i.e., packet headers). Since this time is constant and not functions of any variables, it can be ignored for purposes of optimization.
4.3.6. Optimization Algorithm
We consider a communication link between adjacent nodes. So that the analysis could reflect the best reality, the theoretical energy consumption models in the transmitter and receiver nodes along the route, for both communication and hardware consumed energy, are taken into account. Consider subject to:where , is the distance between the nodes and . is the endtoend delay requirement, as we explain in the next subsection, which is imposed on the whole path as a constraint. is the required BER, and this parameter is also imposed on the whole path as a constraint. is the route length. is the function of the current residual energy of node .
The first expression gives the total energy consumption for each transmitting packet over all accessible routes (described by (15)). The inequality (20a) ensures that the packet should transmit through the route with minimum time , while is the individual transmission time of a node. It should be noted that, in some sensor network applications, the latency is very crucial (monitoring, risk, or fire detection). The third expression is the SNR constraint which is proportional to the BER constraint (9). The third one is the SNIR constraint which is proportional to the BER constraint.
The 4th line of (20c) means that each node transmits with an adaptive power which is less than a certain fixed power , where is the peak power constraint that limits the total power consumption in each node (given in (13)). The 5th line of (20d) denotes the energy consumption of a node as a function of remaining energy (from rich node to poor node).
The immediate solution for finding the optimal modulation for each node is to study all possibilities and then to determine the optimal modulation order. However, it is very expensive in processing time to find the optimal modulation by the examination of all possibilities. As solution which is more efficient consists of finding the optimal modulation of each node that respect all constraints without processing all possibilities. Therefore, suboptimal solution by using a greedy algorithm has been adopted to resolve the system of (19).
5. Simulations Results
In this paper, we assume that each node is stationary and knows its location via GPS or other localization services. Localization is a basic service essential for many applications that need to know the physical location of sensor readings. We also assume that radios can adjust their transmission power and modulation order. For example, the Chipcon CC1000 radio can vary its transmission power between −20 dbm and 10 dbm. RPAR is designed to work with existing simple CSMA/CA protocols such as the TMAC protocol in TinyOS.
5.1. Route Selection
We evaluate the performance of the algorithm for dense WSN network. Therefore, we deployed 100 nodes over a flat square area of 100 m × 100 m according to a uniform distribution. In order to represent a realistic multihop WSN network, an exponential distribution of node’s remaining energy is used.
Compared to the faraway nodes, the nodes close to the sink use often their energies to relay the data. With the times, these nodes drain overall energy. An exponential distribution of energy consummation of a multihop path can represent perfectly this scenario. To alleviate this responsibility, the other nodes should help to balance the expenses of the energy.
For ourrouting protocol, we use the maximumminimum availablepower scheme (Section 4.3.4). First, the energy was assigned to all nodes (using an exponential distribution). The second step is to find all possible routes between a node and the sink. From these founded routes, we chose the path that respects (16). The selected green route will be selected for our simulation. So, at this step, the data transmitting node have all the information about the number of hops, and the selected intermediate nodes relay the data.
5.2. Case of SingleHop Communication
First, we present some numerical results to evaluate the energy efficiency for single hop. The system described has been simulated taking as a reference IEEE 802.15.4 standard in order to make a realistic choice of the simulation parameter values. For this purpose, we assume that all modulation schemes operate in KHz and the = 2.4 GHz Industrial Scientist and Medical (ISM) band has been utilized for WSNs. According to the Federal Communications Commission (FCC 15.247 RSS210 standard) for United States/Canada, the maximum allowed antenna gain is 6 dBi [7]. In this work, we assume that Gt = Gr = 5 dBi.
To gain more insight to the above optimization problem, we use a specific numerical example with the simulation parameters summarized in Table 1 (for more details on the simulation parameters, we refer the reader to [6] and its references.). In addition, we assume the endtoend bit error probability of the route is and path loss exponent equal to 2.

Figure 3 shows the consumed energy over singlehop communication, in terms of energy per bit, as function of modulation order and hop length, for hop lengths 1–50 m, modulation order 1–8 bits/symbol, and target BER . The darkblue area below the sharp threshold marks the region for which no valid configuration exists, due to the peakpower constraint.
From this figure, we can see that when the transmission range increases the required energy to transmit a bit increase, this seems evident. However, if we increase the modulation order this would waste valuable energy for transmission over shorter distances, where a higher modulation is higher energy consumption. This important point will be useful in multihop scenario. Generally speaking, the optimal configuration for each hop is found as the best tradeoff between saving circuit energy at the cost of transmitting energy, and vice versa.
5.3. Case of Multihop Communication
The solution found in the Section 5.1 is encouraging; we analyze the impact of our algorithm in the case of a multihop. We select one of the routing algorithms given in Section 4.3 for the global study.
The problem is to find the optimally modulation order of each node to balance the consumed energy between all nodes across route without violating the endto end mean latency and packet loss constraints of the application. This should, naturally, take into account the remaining battery level for each node.
The simulation analises endtoend packet transmissions over multihop route. The folloing three important optimization schemes are investigated:(i)fixed modulation order (fixed rate) with a fixed transmission power,(ii)variable rate (variable modulation order) with a fixed transmission power,(iii)variable rate (variable modulation order) with a variable transmission power.
For basic comparison we first evaluate the impact of route length on the performance of each optimization scheme.
Averaging the results over a large number of iterations gives a better picture of the system’s performance. Hence, we use a Monte Carlo simulation with (the simulation was evaluated for 1000 times) and varying the rough lengths from 2 to 5.
First of all, the simulation results show (Figure 4) that the adaptive schemes can give huge energy savings. As one might expect, transmitting at a fixed rate with maximum power yields the largest energy consumption. For a route length of 4 hops, the results show that, by allowing power control (channel inversion), 37% of energy savings per bit can be obtained over fixed rate and fixed transmission power.
However, the system can achieve up to 49% by using adaptation modulation and power control. The variable rate (variable modulation order) with a variable transmission power adaptation scheme yields 19% of energy savings compared to a fixed rate with power control.
5.4. Impact of Delay Constraint
We have seen that the transmitting at high modulation order requires high consumed energy compared to transmission with a low order of modulation. The problem does not arise if there is not endtoend delay constraint (the user simply transmits with a low modulation order). So it seems important to see the impact of endtoend delay on the performance of the system.
Figure 5 shows the results of a number of simulations, where the delay constraint has gradually increased, while all other parameters are kept the same (, and number of hop = 5). The fixedrate modulation was fixed to . Form the same figure we note that setup error (where there is not solution or when the constraints are not respected) is much smaller for adaptive modulation than fixed modulation. However, when the time delay constraint increases, the error decreases in both cases. After delay constraint over 500 msec, the error setup becomes zeros.
6. Conclusion
The idea behind the energyefficient wireless sensor networks is that each node can only transmit to a limited number of other nodes directly. The limited resources of nodes imply that the transmission range is limited. In order to transfer the data to the final destination, the traffic must be relayed using intermediate nodes, creating a multihop route. The total energy consumption associated with an endtoend transmission over such a route can be significantly reduced if the nodes are correctly configured.
In this work, we investigate on the route optimization problem for wireless sensor networks from the energy management perspective. Our goal is to adapt all routes in the networks to transmit the data from the node to the sink with the best energy performance. This is calculated according to certain quality of service (QoS) in order to provide an energyefficiency routing strategy.
The simulation shows that we can reduce the consumed energy of a route up to 49% if the node selects the optimal transmission and modulation order.
References
 F. Weiwei, L. Feng, Y. Liu, Y. Fangnan, S. Lei, and S. Nishio, “Energyefficient cooperative communication for data transmission in wireless sensor networks,” IEEE Transactions on Consumer Electronics, vol. 56, no. 4, pp. 2185–2192, 2010. View at: Publisher Site  Google Scholar
 T. Kaur and J. Baek, “A strategic deployment and clusterheader selection for wireless sensor networks,” IEEE Transactions on Consumer Electronics, vol. 55, no. 4, pp. 1890–1897, 2009. View at: Publisher Site  Google Scholar
 S. Cui, A. J. Goldsmith, and A. Bahai, “Energyconstrained modulation optimization,” IEEE Transactions on Wireless Communications, vol. 4, no. 5, pp. 2349–2360, 2005. View at: Publisher Site  Google Scholar
 H. S. Kim and S. W. Lee, “Enhanced novel access control protocol over wireless sensor networks,” IEEE Transactions on Consumer Electronics, vol. 55, no. 2, pp. 492–498, 2009. View at: Publisher Site  Google Scholar
 E. Lee, S. Park, F. Yu, and S. H. Kim, “Data gathering mechanism with local sink in geographic routing for wireless sensor networks,” IEEE Transactions on Consumer Electronics, vol. 56, no. 3, pp. 1433–1441, 2010. View at: Publisher Site  Google Scholar
 J. Abouei, J. D. Brown, K. N. Plataniotis, and S. Pasupathy, “On the energy efficiency of LT codes in proactive wireless sensor networks,” IEEE Transactions on Signal Processing, vol. 59, no. 3, pp. 1116–1127, 2011. View at: Publisher Site  Google Scholar
 W. Su and T. L. Lim, “Crosslayer design and optimization for wireless sensor networks,” in Proceedings of the 7th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD '06), pp. 278–284, Washington, DC, USA, June 2006. View at: Publisher Site  Google Scholar
 A. Chehri and H. Mouftah, “Energyaware multihop transmission for sensor networks based on adaptive modulation,” in Proceedings of the 6th Annual IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob '10), October 2010. View at: Publisher Site  Google Scholar
 C. Schurgers, O. Aberborne, and M. Srivastava, “Modulation scaling for energyaware communication systems,” in International Symposium on Low Power Electronics and Design (ISLPED '01), pp. 96–99, Huntington Beach, CA, USA, August 2001. View at: Google Scholar
 S. Cui, A. J. Goldsmith, and A. Bahai, “Energyconstrained modulation optimization,” IEEE Transactions on Wireless Communications, vol. 4, no. 5, pp. 2349–2360, 2005. View at: Publisher Site  Google Scholar
 C. V. Phan, Y. Park, H. H. Choi, J. Cho, and J. G. Kim, “An energyefficient transmission strategy for wireless sensor networks,” IEEE Transactions on Consumer Electronics, vol. 56, no. 2, pp. 597–605, 2010. View at: Publisher Site  Google Scholar
 S. H. Hong and H. K. Kim, “A multihop reservation method for endtoend latency performance improvement in asynchronous MACbased wireless sensor networks,” IEEE Transactions on Consumer Electronics, vol. 55, no. 3, pp. 1214–1220, 2009. View at: Publisher Site  Google Scholar
 J. N. AlKaraki and A. E. Kamal, “Routing techniques in wireless sensor networks: a survey,” IEEE Wireless Communications, vol. 11, no. 6, pp. 6–28, 2004. View at: Publisher Site  Google Scholar
 F. Liu, C. Y. Tsui, and Y. J. Zhang, “Joint routing and sleep scheduling for lifetime maximization of wireless sensor networks,” IEEE Transactions on Wireless Communications, vol. 9, no. 7, pp. 2258–2267, 2010. View at: Publisher Site  Google Scholar
 W. Yanwei, L. Wu, L. XiangYang, L. YunHao, and L. Wei, “Energyefficient wakeup scheduling for data collection and aggregation,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 2, pp. 275–287, 2010. View at: Publisher Site  Google Scholar
 L. Zhichu Lin and M. van der Schaar, “Autonomic and distributed joint routing and power control for delaysensitive applications in multihop wireless networks,” IEEE Transactions on Wireless Communications, vol. 10, no. 1, pp. 102–113, 2011. View at: Publisher Site  Google Scholar
 H. C. Yang, L. Yang, and K. Wu, “Minimumenergy route configuration for wireless ad hoc networks,” in Proceedings of the 25th IEEE International Performance, Computing, and Communications Conference (IPCCC '06), Phoenix, Arizona, USA, April 2006. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2012 Abdellah Chehri and Hussein T. Mouftah. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.