Research Article  Open Access
Prolonging the Lifetime of TwoTiered Wireless Sensor Networks with Mobile Relays
Abstract
We propose a clustering scheme for wireless sensor nodes in hierarchical wireless sensor networking architectures that employs mobile relay nodes in order to achieve energy conservation and network lifetime prolongation. The key aspects of our scheme are relay node relocation and reclustering when failures are detected. The performance of the proposed approach is evaluated via simulations for various topology layouts based on the sensor node population and number of mobile relay nodes employed. The results show significant energy savings in particular for topologies with large numbers of sensors.
1. Introduction
Wireless sensor networks are becoming more and more popular nowadays due to the significant advantages they present in carrying out specialized monitoring tasks in certain application areas. These areas vary from military [1] and target tracking [2] to healthcare [3–5] and environmental monitoring [6–8]. However, there exist certain aspects that need to be addressed during deployment in order to achieve the best possible functionality and eliminate as much as possible problems that are inherent in wireless sensors technology and networking [9].
One of the most important design issues of a wireless sensor network that should be carefully treated is energy consumption and management that directly affects the network’s lifetime. Many research approaches have been proposed already as potential solutions to this problem. The suggested methods span from MAC layer algorithms [10–15] and topology control actions [16, 17] to hierarchical architectures that adopt the introduction of special purpose nodes, called relay nodes [18–20].
Research efforts on hierarchical architectures, also called twotiered architectures, apart from introducing the role of a relay node (RN) or cluster head (CH), go further by applying clustering techniques that aim at minimizing the sensor communication cost [18, 21]. Several techniques have been proposed in the literature that aim to avoid rapid battery drainage that consequently may cause network connectivity failures or sensing area holes [22–25]. In singlehop operation of wireless sensor nodes (WSNs), data propagation towards the destination (i.e., the base station (BS)) that will further process the sensed data is accomplished by the relay nodes. Thus, in hierarchical deployments the critical factor is the lifetime achieved by the relay nodes which has to be enhanced as much as possible. Towards this, a measurable objective is the number of data gathering rounds that can be carried out by an RN. A data gathering round of an RN corresponds to the procedure of receiving the collected data from the nodes in its cluster and transmitting them to the base station [26].
This work proposes a clustering scheme for SNs that enhances energy conservation and prolongs the network’s lifetime. The main difference with other similar approaches is that the RNs are not considered stationary nodes expected to function at the locations that were initially deployed but with mobility capabilities that allow them to move to new locations designated by optimal energy consumption management procedures. In particular we extend the work presented in [18] so that the RNs can move to new locations, a feature that in conjunction with reclustering can lead to energy consumption minima.
The rest of this work is organized as follows. Section 2 presents background work on the field of topology control for WSNs and clustering algorithms. In Section 3, we propose an algorithm that applies postdeployment topology control functions in an already formed cluster so that energy consumption is minimized. Simulation results that highlight the energy conservation achieved by the proposed algorithm are presented in Section 4. Finally, Section 5 concludes our work and suggests future research items.
2. WSN MobilityBased Topology Control and Clustering Algorithms
With the proliferation of WSN technologies and applications, the need for incorporating mobility has been identified as a means to enhance their performance. To this end various mobility models for WSNs have been introduced that range from sensing node mobility [20, 21] to base station (BS) movement in predefined or autonomous paths [27–29].
In the case of mobile sensor nodes, the movement capability is limited due to energy saving constraints and usually is identified within a cluster’s scope. On the contrary, a mobile base station or data collector does not present such limitations as they can be usually fed with unlimited energy. However, an energy conservation scheme based on a mobile BS is not appropriate for realtime data collection because a sensor that is ready to transmit should wait until it gets in the communication range of the BS. In order to confront with the implied data collection delay of this scheme, aggregation and processing of sensed data take place, which are usually performed by relay nodes [30].
2.1. Sensor Mobility Models
Sensor mobility is a recent addition to the WSNs characteristics that has been employed to face initial deployment problems and communication holes that may arise due to node failure or battery drainage. The solutions proposed vary from working with redundant nodes [31] ready to move—in a straightforward or cascaded mode—when asked so to using functional nodes of the WSN to replace failed ones or for balancing network traffic [32]. The mobile nodes of the latter case may be plain sensors with battery limitations or relays with enriched mobility and computational capabilities [33].
Our motivation of addressing such a sensor network redeployment problem combined with relay node mobility constraints is to evaluate further enhancements on scalability and power efficiency of clustering algorithms. In this paper a sensor field (topology) is divided (clustered) into groups (clusters) in accordance with the constraints defined by the Integer Linear Programming (ILP) formulas given in [18]. In this work, after the initial clustering has taken place, no further redeployment (reclustering) actions are taken in order to further minimize energy wastage.
Our work goes a step further towards network lifetime maximization. The RNs are not considered stationary devices designated to perform data collection and cluster coordination, but may move to new locations within the formed cluster in order to achieve power consumption savings. Also, RNs are not considered to be subject of power limitations, at least not at the same extent that SNs do. The trajectory of each RN is calculated taking into account all the necessary constraints so as not to incur any side effects to the clusters’ structure.
2.2. Sensor Communication: Radio Model
The main components of a sensor node are a sensing circuit, a data processing unit, and a radio transceiver. However, the power required for communication is the dominant part of the total power consumption in a sensor network. A radio model that defines in detail the communication power consumption is outlined in [34].
As this model suggests, energy is consumed at a rate of 50 nJ/bit for running the transmitter circuitry and 50 nJ/bit for the receiving one, which for the rest of this paper will be called . Additionally, the transmit amplifier also dissipates amount of energy (a typical value is 100 pJ/bit/m^{2}) to transmit one bit of data over unit distance.
In a typical WSN, energy consumption is mainly due to three reasons: packet transmission, packet reception, and data processing.
Thus, by taking into account the energy loss per bit due to transmission at a distance , the energy dissipated by the amplifier to transmit bits is given by where corresponds to the path loss exponent. Therefore, the overall energy consumption to transmit bits is given by On the other hand, the energy dissipated to receive bits over a distance is given by The energy consumed to process bits is defined as where (nJ/bit) is the energy consumed for processing a single bit.
3. Optimal Relay Node Placement
The clustering model proposed in [18] is derived via integerlinearprogramming (ILP) based formulations covering not only singlehop communications, but also multihop ones, and the corresponding methods are called ILPS and ILPM, respectively. The proposed version of our algorithm performs clustering under the assumption of singlehop data transmission in order to perform a preliminary evaluation of its operation without the need to take care for intersensor communication at this stage. The main innovation introduced in our approach, called MILPS (M stands for mobile), is the possibility to relocate the RNs since they hold mobility capabilities. The scope of their movement is to find the most suitable location within a cluster so that the overall energy consumption is minimized. In order to locate the new position of the relay node that minimizes the overall energy consumption, we consider all the locations that are not further than a distance from each node that comprises the cluster. Distance is the transmission range of a sensor. This constraint is necessary in order to preserve the topology of the already formulated clusters. If such a location is found, the relay node is forwarded towards it and the network lifetime is increased.
3.1. Step 1: SingleHop ILP Cluster Formulation
The adopted network model follows a twotiered wireless network architecture where sensor nodes form the sensing area (i.e., the lower layer), and relay nodes comprise the upper layer. The sink node (or base station) is considered to reside outside the sensing area at a long distance from both sensing and relay nodes. Thus, the total number of nodes, , of the network is . Each sensor is designated by label , where . A relay is denoted by a label , with while the label of the base station is . It should be noted that sensor and relay nodes operate in different ways. The former perform plain sensing while the latter gather the cluster’s sensed data and transmit them to the sink node. Thus, energy depletion and consequent shutdown of a sensing node may affect only the accuracy of measurements. On the other hand, a possible energy depletion of a relay node, which is actually the cluster head, results in total loss of the gathered data from the respective cluster.
The simulation topology consists of a grid of sensor nodes with relay nodes placed arbitrarily on the grid and a base station. Although the sensor nodes are considered to be uniformly distributed, the relay nodes are randomly placed. This topology formation follows the algorithm’s concept. The lower layer that consists of the sensing nodes that create data has little to do with the cluster formation procedure which depends on the relay nodes’ characteristics such as position, number, and transmission range. In addition, our algorithm goes one step further: after the initial random cluster formation, we deal also with the issue of prolonging the network’s lifetime by appropriately moving and relocating the relay nodes that are less in number and have superior processing and energy characteristics. In such a setup, each sensor can belong to only one cluster and each relay node can supervise only one cluster. ILPS proposes a formulation that creates clusters (equal to the number of the relay nodes), each one consisting of nodes, that leads to network lifetime maximization. In the singlehop model, each relay node receives data only from sensors that belong to its cluster and directly transmits them to the corresponding base station. A cluster is defined through a binary matrix as The condition above (according to the predefined notations) can be rewritten as
The algorithm’s objective is to minimize the energy dissipated per round of operation, , subject to the following constraints
Each sensor node must join only one cluster:
A sensor node may transmit to the relay node only if the latter is located within the transmission range of the node where denotes the Euclidean distance between locations and (i.e., ).
The total number of bits , generated in cluster and received by relay node , is computed by
Furthermore, the maximum energy spent by an RN in a round is computed by
3.2. Step 2: Relay Node Movement to New Locations
We have devised a replacement algorithm that is executed to calculate the optimum location of the relay nodes as soon as the respective clusters are formed. Let denote the set of all possible locations for the placement of a sensor within the sensing area. Since every node belongs to a cluster, the following holds: , where denotes all the available locations for cluster while denotes the number of relay nodes and consequently the clusters that will be formed. The possible locations that an RN may be placed are a subset of the locations included in the cluster. Let be a set of feasible distinct locations (a distinct location is represented by , ) for the relay node according to where , .
The above mentioned algorithm is described in detail in Algorithm 1.

4. Simulation Results
4.1. Environment Setup
The communication energy consumption is calculated according to the firstorder radio model [34] with the constants , , , , .
Our simulation environment comprised a combination of MATLAB and FICO Xpress Optimization suite that allowed us to solve the ILP clustering problem quickly and efficiently.
The simulated topologies scaled from 576 nodes (24 units of length by 24 units of width) to 10.000 nodes (100 units long by 100 units wide) while the RNs populations varied from 4 to 25. Such a dense distribution of sensing and relay nodes is allowed by the low pernode cost which supports at the same time the appropriate redundancy so as to obtain accurate field data.
The simulation results reveal an improvement to the energy consumption compared to ILPS that increases as the network topology population grows. After executing the clustering algorithm, on a squareshaped topology of 6400 sensor nodes, uniformly distributed on an area of 80 units length to 80 units width with 4 relay nodes available, we obtain the clustering depicted in Figure 1.
Accordingly, Figure 2 presents a 100*100 sensor node grid topology with 9 relay nodes.
Each cluster in Figures 1 and 2 contains a different number of nodes because the initial placement of the relay nodes within the sensing area is performed randomly. On the other hand, the distribution of the sensing nodes is done in a uniform manner due to its simplicity for grid topology formation and neutrality in producing the simulation results. It is also easier to study the algorithm’s scalability performance as the sensing nodes increase. We have to note also that despite the fact that the grid sizes may seem unrealistic they are in essence very important for assessment purposes. Further simulations will be performed over special purpose topologies where harsh environments affect the sensing nodes placement but mobility is a necessary feature in order to gain network connectivity.
4.2. Performance Evaluation of MILPS over ILPS
The performance results obtained are given in this section. Our method’s primary goal is to cluster the sensor nodes around an RN such that energy consumption within the cluster is minimized. The resulting energy consumptions when forming 4, 9, 16, and 25 clusters per sensing area are depicted in Table 1 and are compared to the ILPS method.

Table 1 presents the performance improvement of MILPS over the ILPS method versus the number of nodes for different grid formations and relay nodes. The comparison metric is energy consumption with 4, 9, 16, and 25 relay nodes. Table 1 also includes the percentage of improvement of our algorithm over ILPS. For clarity, the results provided in Table 1 are plotted in Figure 3.
As it can be easily observed, MILPS method surpasses ILPS in energysaving terms. Performance improvement varies from 4%, for sensing fields that contain approximately 500 sensors, to 15%–20% for large topologies with 10.000 nodes. Accordingly the achieved lifetimes are also improved (see Table 2). The measurements regarding network lifetimes were conducted with an initial energy of 5 Joules per SN.

Applying the powerlaw leastsquares method to the computed network lifetimes results in a fit, depicted in Figure 3, with the coefficient of determination, , varying from 0.9978 to 0.9997 (see Table 3). Thus, the lifetime of such a network layout can be predicted through an equation of the form . The values of and coefficients are assumed to be related to the parameters used during the ILP formulation of the clustering problem and more specifically to the dataflow from each sensor (i.e., bits per node), the relay node location, and the firstorder radio constants (i.e., , , , , ).

From Figure 4, we observe that the network lifetime decreases at unacceptable levels when the number of sensors exceeds 2000 nodes. This result has to be taken into account during deployments with such or higher number of sensors.
5. Conclusions
In this work a clustering method for prolonging the lifetime of twotiered wireless sensor networks is proposed and evaluated. In particular, we extend static clustering through the provision of mobility for the corresponding relay nodes. The obtained simulation results show a significant performance improvement on energy savings when the relay nodes are allowed to move into new locations within the initially formulated clusters. This performance improvement may exceed 20% when large topologies with thousands of sensors are considered. Furthermore, a curve fitting analysis on the results revealed that the network lifetime follows a powerlaw distribution. Finally, future work will focus on optimizing network coverage, connectivity, and performance in case of sensor or even relay node failures in special purpose topologies.
References
 C. Schurgers and M. B. Srivastava, “Energy efficient routing in wireless sensor networks,” in Proceedings of the IEEE Military Communications Conference, Communications for NetworkCentric Operations: Creating the Information Force (MILCOM '01), vol. 1, pp. 357–361, 2001. View at: Google Scholar
 X. Wang, J. J. Ma, S. Wang, and D. W. Bi, “Clusterbased dynamic energy management for collaborative target tracking in wireless sensor networks,” Sensors, vol. 7, no. 7, pp. 1193–1215, 2007. View at: Google Scholar
 S. Jiang, Y. Cao, S. Iyengar et al., “CareNet: an integrated wireless sensor networking environment for remote healthcare,” in Proceedings of the ICST 3rd International Conference on Body Area Networks (ICST '08), pp. 9:1–9:3, Brussels, Belgium, 2008. View at: Google Scholar
 H. Alemdar and C. Ersoy, “Wireless sensor networks for healthcare: a survey,” Computer Networks, vol. 54, no. 15, pp. 2688–2710, 2010. View at: Publisher Site  Google Scholar
 S.L. Chen, H. Y. Lee, C. A. Chen, H. Y. Huang, and C. H. Luo, “Wireless body sensor network with adaptive lowpower design for biometrics and healthcare applications,” IEEE Systems Journal, vol. 3, no. 4, pp. 398–409, 2009. View at: Publisher Site  Google Scholar
 P. Corke, T. Wark, R. Jurdak, W. Hu, P. Valencia, and D. Moore, “Environmental wireless sensor networks,” Proceedings of the IEEE, vol. 98, no. 11, pp. 1903–1917, 2010. View at: Publisher Site  Google Scholar
 H. Liu, Z. Meng, and M. Wang, “A wireless sensor network for cropland environmental monitoring,” in International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC '09), pp. 65–68. View at: Publisher Site  Google Scholar
 F. Ingelrest, G. Barrenetxea, G. Schaefer, M. Vetterli, O. Couach, and M. Parlange, “SensorScope: applicationspecific sensor network for environmental monitoring,” ACM Transactions on Sensor Networks, vol. 6, no. 2, pp. 1–32, 2010. View at: Publisher Site  Google Scholar
 I. Akyildiz, “Wireless sensor networks: a survey,” Computer Networks, vol. 38, pp. 393–422, 2002. View at: Google Scholar
 J.H. Chang and L. Tassiulas, “Maximum lifetime routing in wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 12, no. 4, pp. 609–619, 2004. View at: Publisher Site  Google Scholar
 H. Wang, N. Agoulmine, M. Ma, and Y. Jin, “Network lifetime optimization in wireless sensor networks,” IEEE Journal on Selected Areas in Communications, vol. 28, no. 7, pp. 1127–1137, 2010. View at: Publisher Site  Google Scholar
 R. Braynard, A. Silberstein, and C. Ellis, “Extending network lifetime using an automatically tuned energyaware MAC protocol,” Lecture Notes in Computer Science, vol. 3868, pp. 244–259, 2006. View at: Publisher Site  Google Scholar
 X. Yang, T. Camp, H. Yang, and A. P. Petropulu, “Extending network lifetime for ALLIANCES,” Computer Communications, vol. 32, no. 17, pp. 1837–1851, 2009. View at: Publisher Site  Google Scholar
 R. A. Rashid, W. M. A. E. W. Embong, A. Zaharim, and N. Fisal, “Development of energy aware TDMAbased MAC protocol for wireless sensor network system,” European Journal of Scientific Research, vol. 30, no. 4, pp. 571–578, 2009. View at: Google Scholar
 F. NaïtAbdesselam, B. Bensaou, T. Soëte, and K. L. Hung, “OMAC: an organized energyaware MAC protocol for wireless sensor networks,” in Proceedings of the IEEE International Conference on Communications (ICC '07), pp. 3648–3653, June 2007. View at: Publisher Site  Google Scholar
 P. Santi, “Topology control in wireless ad hoc and sensor networks,” ACM Computing Surveys, vol. 37, no. 2, pp. 164–194, 2005. View at: Publisher Site  Google Scholar
 Y. Wang, “Topology control for wireless sensor networks,” in Wireless Sensor Networks and Applications, Y. Li, M. T. Thai, and W. Wu, Eds., pp. 113–147., Springer, Boston, Mass, USA, 2008. View at: Google Scholar
 A. Bari, A. Jaekel, and S. Bandyopadhyay, “Clustering strategies for improving the lifetime of twotiered sensor networks,” Computer Communications, vol. 31, no. 14, pp. 3451–3459, 2008. View at: Publisher Site  Google Scholar
 O. Younis, M. Krunz, and S. Ramasubramanian, “Node clustering in wireless sensor networks: recent developments and deployment challenges,” IEEE Network, vol. 20, no. 3, pp. 20–25, 2006. View at: Publisher Site  Google Scholar
 A. A. Abbasi and M. Younis, “A survey on clustering algorithms for wireless sensor networks,” Computer Communications, vol. 30, no. 1415, pp. 2826–2841, 2007. View at: Publisher Site  Google Scholar
 L. S. Jayashree, S. Arumugam, and N. Rajathi, “E2LBC: an energy efficient load balanced clustering technique for heterogeneous wireless sensor networks,” in IEEE IFIP International Conference on Wireless and Optical Communications Networks, pp. 1–7, 2006. View at: Google Scholar
 N. Dimokas, D. Katsaros, and Y. Manolopoulos, “Energyefficient distributed clustering in wireless sensor networks,” Journal of Parallel and Distributed Computing, vol. 70, no. 4, pp. 371–383, 2010. View at: Publisher Site  Google Scholar
 M. K. Watfa, O. Mirza, and J. Kawtharani, “BARC: a Battery Aware Reliable Clustering algorithm for sensor networks,” Journal of Network and Computer Applications, vol. 32, no. 6, pp. 1183–1193, 2009. View at: Publisher Site  Google Scholar
 Y.Y. W. Jie Jia, J. Chen, G. R. Chang, and Y. Y. Wen, “Efficient cover set selection in wireless sensor networks,” Acta Automatica Sinica, vol. 34, no. 9, pp. 1157–1162, 2008. View at: Publisher Site  Google Scholar
 W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An applicationspecific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660–670, 2002. View at: Publisher Site  Google Scholar
 K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Maximum lifetime data gathering and aggregation in wireless sensor networks,” in Proceedings of the Joint International Conference on Wireless LANs and Home Networks (ICWLHN '02) and Networking (ICN '02), pp. 685–696, 2002. View at: Google Scholar
 Y. Yang, M. I. Fonoage, and M. Cardei, “Improving network lifetime with mobile wireless sensor networks,” Computer Communications, vol. 33, no. 4, pp. 409–419, 2010. View at: Publisher Site  Google Scholar
 J. Rao and S. Biswas, “Networkassisted sink navigation for distributed data gathering: stability and delayenergy tradeoffs,” Computer Communications, vol. 33, no. 2, pp. 160–175, 2010. View at: Publisher Site  Google Scholar
 W. Alsalih, H. Hassanein, and S. Akl, “Placement of multiple mobile data collectors in wireless sensor networks,” Ad Hoc Networks, vol. 8, no. 4, pp. 378–390, 2010. View at: Publisher Site  Google Scholar
 A. A. Somasundara, A. Kansal, D. D. Jea, D. Estrin, and M. B. Srivastava, “Controllably mobile infrastructure for low energy embedded networks,” IEEE Transactions on Mobile Computing, vol. 5, no. 8, pp. 958–972, 2006. View at: Publisher Site  Google Scholar
 H. Li, S. Liu, and B. Hu, “Research on node sleep/wakeup mechanism in WSN based on energy threshold setting,” in Proceedings of the 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '09), pp. 1–4, September 2009. View at: Publisher Site  Google Scholar
 C. Y. Chang and H. R. Chang, “Energyaware node placement, topology control and MAC scheduling for wireless sensor networks,” Computer Networks, vol. 52, no. 11, pp. 2189–2204, 2008. View at: Publisher Site  Google Scholar
 T. Banerjee, B. Xie, J. H. Jun, and D. P. Agrawal, “Increasing lifetime of wireless sensor networks using controllable mobile cluster heads,” Wireless Communications and Mobile Computing, vol. 10, no. 3, pp. 313–336, 2010. View at: Publisher Site  Google Scholar
 W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energyefficient communication protocol for wireless microsensor networks,” in Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, January 2000. View at: Google Scholar
Copyright
Copyright © 2013 Theodore C. Kotsilieris and George T. Karetsos. 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.