Research Article | Open Access
Fatma Bouabdallah, "Selection of Optimal Deployment and Routing Configurations in Underwater Acoustic Sensor Networks for Avoiding Energy Holes", Mobile Information Systems, vol. 2019, Article ID 3597304, 13 pages, 2019. https://doi.org/10.1155/2019/3597304
Selection of Optimal Deployment and Routing Configurations in Underwater Acoustic Sensor Networks for Avoiding Energy Holes
Improving the energy efficiency of underwater acoustic sensor networks (UW-ASNs) is a crucial issue due to the reduced and nonrechargeable energy resource of the underwater sensor nodes. In this work, we address the energy sink hole problem in UW-ASNs while considering the unique and harsh characteristics of the underwater channel. Our goal is to determine the optimal deployment and routing settings that surmount the energy sink hole problem and hence maximize the network lifetime. We prove that sensors can evenly consume their initial battery power provided that first they adjust their transmission power when they transmit the route through traffic and second they are appropriately placed while deployed. Mainly, we propose a deployment scheme and the corresponding balanced routing strategy that lead to uniform energy consumption among all underwater sensors subject to a predefined reliability level at the sink. Specifically, we look for the optimal deployment settings especially in terms of nodes’ separation distances that help achieving uniform energy consumption in the network while satisfying the application requirement especially in terms of desired information reliability. Jointly, at the routing layer, we assume that each sensor is provided with the possibility of dynamically adjusting its transmission power up to a given number of levels N. To this goal, we mainly deal with two main cases: fixed and variable nodes separation distance. For the fixed case, we suppose that any two successive nodes in the network are equally spaced, and we strive for deriving the optimal distance as well as the optimal number of transmission power levels along with optimal load weight corresponding to every possible transmission power level for every sensor node. For the variable case, we deal with two subcases: first, we suppose that the distance separating successive nodes follows an arithmetic progression, and second, we assume that the distance separating successive nodes is following a geometric sequence. Note that for both cases, namely, fixed and variable, we succeed to determine the optimal distances separating successive nodes and the optimal number N of transmission power levels along with the corresponding optimal load weight that overcome the energy holes problem, and hence the network lifespan is maximized while respecting the desired reliability level.
Underwater sensor networks are attracting an increasing interest of the research community since they enable a broad range of applications in various domains such as military, environmental, and scientific . Acoustic communication is the most appropriate technology for these applications.
An underwater channel requires exclusive and tough characteristics. Indeed, the channel’s bandwidth is limited, the attenuation is frequency-dependent and significant, the propagation delays are high and variable, and the battery power is limited . For these reasons, proposing network protocols specifically dedicated for the underwater environment confronts serious challenges. Moreover, the initially provided battery power for underwater sensors is limited. Even worse, the battery cannot be recharged, since it is impossible to use solar energy. In addition to that, replacing flat sensors risks to cost too much since the underwater sensors deployment is quite difficult. Even worse, acoustic underwater communications use much more energy than the terrestrial sensor networks using radio communications. Indeed, the deployment is quite sparse in underwater environment. This makes the underwater communication involve transmission over long distances. Moreover, in order to surmount the impairments of the underwater channel, more developed signal-processing solutions are needed at receivers.
For the above reasons, UW-ASNs need protocols that pertinently consume the limited initial battery power of the underwater sensor nodes. To this end, load balancing is the most efficient yet delicate technique that prolongs the UW-ASN lifetime. Its ultimate objective is to guarantee to the most possible extent the equitable and soft energy consumption among all the sensors. Note that, wireless sensor networks research community showed that the nearest sensors to the sink suffer from a harsh depletion of their initially provided battery power [3–7], as these sensors are relays of all the other sensors in the network. This may result in energy holes which cause drastic reduction of the network lifespan. Consequently, balancing the energy utilization in the network, by evenly distributing the traffic load, is the most promising energy efficient technique.
In this paper, we address the energy sink holes problem in UW-ASNs while considering the unique and characteristics of the underwater channel. Our goal is to jointly determine the optimal deployment and routing settings that surmount the energy hole problem and hence maximize the lifetime of UW-ASNs. To this aim, we strive for determining the optimal distances separating subsequent sensor nodes during deployment that helps achieving uniform energy expenditure among all sensor nodes while satisfying the desired information reliability. Jointly, we propose variable transmission range-based data forwarding task. Accordingly, each underwater sensor is allowed to dynamically adjust its transmission range (or interchangeably transmission power) among several possible levels (N). Indeed, the number of transmission power levels (N) is a key factor influencing the energy consumption. First, increasing N allows the network traffic load distribution to be more balanced giving a more uniform energy utilization of the network’s sensors. Second, adopting a large value for N augments the transmission energy utilization since the farthest nodes may be reached. Therefore, the number N has an optimal value for which the energy consumption is optimized, and hence the network lifetime is maximized. In this study, we propose a joint optimization problem that aims at deriving the optimal deployment configuration along with the optimal value of the number N’s of transmission levels and their corresponding optimal load weights for each sensor in the network that surmounts the sink hole problem, and hence the network energy efficiency is maximized. As a recap, our work is a three-fold optimization study where the optimal distances between subsequent sensors and the optimal value of power levels N along with the optimal load weights are jointly derived.
A recap of our contributions can be stated as follows. First, we propose a study case deployment pattern for UW-ASN for which we aim at deriving the optimal settings that surmount the energy hole problem. More precisely, considering this proposed deployment strategy, our goal is to determine the optimal distances separating subsequent sensors that help achieving uniform energy consumption through the network while satisfying the reliability requirement at the sink. Second, at the routing layer, we suppose that each sensor node is capable to dynamically tune its transmission power up to a predefined number N of levels while sending or forwarding data. Consequently, we determine the optimal value of N, with the corresponding optimal load weights that balance the energy depletion among the network’s sensors. Therefore, the network lifetime is maximized since the energy hole problem is solved. To summarize, we endeavor to determine the optimal deployment configuration along with the optimal value of N and their corresponding optimal load weight distribution that balance the energy depletion among sensor nodes. Our joint optimization solution is specifically tailored for the underwater environment as it considers the intrinsic features of the underwater acoustic propagation. More precisely, in this work, we adopt the underwater channel model proposed by Qarabaqi and Stojanovic in  and implemented in  which is considered in the literature as one of the most recent and pertinent mathematical analyses that meticulously describes the underwater acoustic time-varying channel model.
The rest of the paper is organized as follows. Section 2 summarizes work related to the focus of this paper. Section 3 describes the network and channel models under study. Section 4 formally states the general energy-balancing optimization problem. Different study cases are addressed in Section 5. Numerical results are provided in Section 6 for all proposed study cases. Section 7 concludes this paper.
2. Related Work
Underwater acoustic networks are gaining a noteworthy interest within the research community. The unique and severe features of the underwater channel usually impose the design of dedicated strategies. Pompili et al.  and Climent et al.  present a state-of-the-art networking protocols for underwater networks. While extensive routing protocols have been conducted up to date [12, 13], much less work has been dedicated to surmount the energy hole problem, and thus there is still much room for innovation . Note however that the energy hole problem has been recently investigated in industrial WSNs and the Internet of things [15–19] but rather from a coverage point of view. Indeed, authors in [15, 18, 19] focus on how to detect and localize coverage holes while taking into consideration the network energy efficiency. However, studies proposed in [16, 17] strive to overcome the coverage hole problem using mobile sensor nodes. More precisely, they aim at optimally selecting a subset of the randomly deployed mobile sensors to overcome the coverage holes. It is worth pointing out that authors in  solve the coverage holes problem while taking into consideration also the network connectivity. Although the aforementioned approaches may be inspiring, some fundamental differences with our objective and context impose the design of a new approach. Indeed, in this work, rather than dealing with coverage holes, we are interested in overcoming the energy sink hole problem that may lead to sink isolation and hence network partition. Moreover, in this paper, instead of using mobile sensors to heal the energy sink hole problem, we opt for evenly distributing the traffic load inside the network while equipping the sensors with multiple transmission power levels in order to alleviate the forwarding task of the one-hop away sensors, and hence the energy sink hole problem is surmounted.
In this section, we summarize work mainly related to energy-efficient routing and energy hole problem encountered in UW-ASNs.
2.1. Energy Efficient Routing in UW-ASNs
Energy efficiency is a crucial issue in UW-ASNs. Conceiving routing protocols that make wise utilization of the finite and nonrechargeable energy budget of the underwater sensor nodes is a decisive factor for the network lifetime. Many UW-ASNs routing protocols have been proposed to improve the energy efficiency but not from an energy-balancing point of view in order to surmount the energy hole problem which restrains their contributions. In , a geographical routing scheme was proposed for underwater acoustic networks and joined with a power-control approach in order to increase the protocol energy efficiency. Indeed, this routing strategy called FBR aims at dynamically establishing routes only on demand while preserving the scarce energy resources of the underwater sensors. In fact, by gradually and carefully increasing the transmission power, FBR tries to find the appropriate next hop toward the sink while reducing the total energy consumption. However, for its well functioning, FBR requires from every source node to know its own location as well as one of the final destinations. Another approach would rather rely on depth information in order to reduce energy consumption throughout the network, since depth information is much easier to acquire than location information in UW-ASNs. For instance, in , the authors propose a depth-based routing (DBR), which uses depth information to reduce the invalid broadcasts. Indeed, by only allowing nodes with lower depth to forward a packet destined to a surface sink, the number of forwarder is highly decreased, and hence energy saving is achieved. Another depth-based routing protocol called EUROP was introduced in . Thanks to the use of depth sensor, EUROP will eliminate the requirement of hello messages for control purposes which improves the energy efficiency. According to EUROP, underwater nodes are divided into different layers based on the depth information such that only nodes in the same layer (namely, in the same depth) can communicate with each other. The forwarding process is straightforward and simply dictates that data packets are forwarded from deeper layers to shallower layers. In addition to that, it is assumed that nodes can move to the upper layer and back to their predefined place for successful delivery to the surface sink. Although the use of the depth sensor will completely eliminate the need for control packets which may reduce the energy consumption, the use of these costly sensors may compromise the total energy consumption as these sensors consume a large amount of energy to move from one depth to another.
2.2. Sink Hole Solutions in UW-ASNs
One of the early studies on the sink hole problem in UW-ASNs was conducted by Chen et al. , who proposed an energy-efficient routing protocol, called REBAR, to surmount the sink hole problem. REBAR protocol supposes that by default, every generated data packet has to undergo a flooding process in order to reach the sink. Based on this, REBAR tries to highly reduce the flooding region for each source node by most importantly involving much less number of the sink one-hop away sensors while guaranteeing a high delivery rate. Therefore, the closest nodes to the sink are much less solicited especially compared to the integral flooding process. Consequently, the network lifetime is augmented. It is completely true that, thanks to REBAR protocol, the closest sensors to the sink are much less involved in the routing process especially compared to the complete flooding process, but they keep acting as relays on behalf of all other sensors, and hence keep suffering from severe energy depletion. Indeed, as it was shown by terrestrial wireless sensor networks research community, the energy sink hole problem is inevitable in static always-on sensor networks where sensors perform continuous monitoring of a given field using a nominal communication range [5, 24–28]. Consequently, using adjustable communication power was the most undertaken research strategy to make the energy consumption more uniform among the network’s sensors. Indeed, by endowing each sensor with the ability of dynamically adjusting its transmission power, the traffic load distribution among sensors is much more balanced, and thus sensors, which are in neighborhood of the sink, are eased from the relying task. In this perspective, authors in  have proposed a routing strategy assuming that every sensor node has two transmission ranges: the smallest one used to reach the next hop in a linear topology and the farthest one used to directly reach the sink. According to EBH, each sensor node has to alternate between the two possible transmission ranges based on the residual nodes’ energy such that the network lifetime is optimized. Indeed, accordingly, a sensor node has to keep sending to its upstream neighbor in the linear topology as long as its own residual energy is greater than the one of its neighbor. Otherwise, the node has to proceed sending directly to the sink node.
Another possible approach to surmount the sink hole problem is by using a mobile sink node such that the set of the closest node to the sink is constantly changing. In this direction, most of the research studies, especially in WSNs, will rather focus on finding the optimal sink trajectory to maximize the network lifetime. Similarly, authors in  consider a UW-ASN context where an autonomous underwater vehicle (AUV) is acting as a data collector and hence try to find the best trajectory by taking into consideration the underwater environment constraints. In the same way, another recent energy-efficient routing protocol proposed in  is MobiCast. This protocol also aims at maximizing data collection while overcoming the energy hole problem by the use of mobile AUVs acting as a data collector.
Authors in [32, 33] propose to surmount the energy sink hole problem by using multiple transmission power levels rather than the use of mobile sink. More precisely, and as a distinguishing feature, each sensor node is endowed with multiple transmission power levels in order to optimally distribute the traffic load through the network, and hence balanced uniform energy depletion is achieved among all sensors including the closest nodes to the sink. Authors in  strive for analytically deriving for each sensor node the optimal number N of transmission power levels as well as the optimal load weight corresponding to every possible transmission power such that uniform energy consumption is achieved. Indeed, in order to derive their optimal configuration settings, authors in  adopted the time-varying channel model proposed in , which closely reflects most of the underwater channel impairments such as bottom-surface reflections, frequency-dependent attenuation, and Doppler effects which are caused by random local displacements.
This paper can be seen as a continuation of , where we not only determine the optimal number of transmission levels N along with the corresponding load weights but also we seek the optimal deployment settings in terms of nodes initial positioning. In this study, we adopt the same channel model as in  since it is the most realistic one but we rather opt for the numerical resolution of our threefold optimization problem that aims at determining the optimal distance between two subsequent nodes as well as the optimal value of N along with the optimal corresponding load weights.
3. Network Model and Problem Statement
3.1. Recap of the Adopted Time-Varying Underwater Channel
In this study, we use the same underwater channel model adopted by  and initially proposed by . Accordingly, the transmitter and the receiver are subject to a uniform displacement around their nominal positions by some heights and and a distance . Moreover, we similarly suppose that the water surface level can vary by some height due to water waves. In particular, the sensors’ displacements are supposed to vary according to a random uniform distribution, each within the interval For instance, assume that two sensor nodes are initially placed at a height and within a distance of from each other where the water depth equals . We suppose that each sensor will undergo an independent random independent drift from their height by and due to water current and waves. Moreover, we suppose that this pair of node will be subject to random displacement from their nominal locations, where . Furthermore, we suppose that the water surface that initially equals may randomly vary by . Figure 1 clearly depicts the different parameters with their corresponding variation ranges.
As introduced in , in this work, we adopt an adaptive power allocation model where the transmit power is calculated according towhere is the average of the real channel gain , is an estimate of the true actual gain is a margin introduced to avoid any gap between the true and the estimated channel gains that may yield interruption, and denotes the minimum power needed to obtain a desired in the absence of fading ().
In this study, we also adopt the success probability definition as stated in . The success probability over a link denotes the probability that a node j successfully receives a packet transmission started by i using a transmission power over a bandwidth . is computed with the purpose of considering the impact of the underwater acoustic channel time variability on the successful reception of a transmitted packet. In order for this paper to be self-contained, we present next a recap on how to compute . For each link in the network, is numerically determined using the underwater acoustic simulator developed in . simply denotes the ratio of successfully received packets over a link . According to , a data packet is considered successfully received if the average reception power during the reception time is greater than a given threshold As expected, will affect the total amount of traffic received by each node. Therefore, the total energy expenditure will be impacted. Given that our goal is to closely approach the equitable and smooth energy depletion among sensor nodes in the network while taking into consideration the time variability of the underwater channel, along with will inevitably affect the load weights distribution for every sensor in the network as detailed in Sections 4 and 5.
3.2. Approach to Overcome the Energy Sink Hole Problem
In this paper, an exhaustive investigation of the energy sink hole problem in UW-ASNs is conducted. Specifically, the closest sensors, which are in the neighborhood of the sink, are excessively solicited in forwarding generated reports to it. Indeed, sensors in the vicinity of a static sink work as relays to it on behalf of all other sensors. Thus, those sensors are traffic hot spots enduring heavy energy depletion. Wadaa et al.  revealed that by the time the closest sensors to the sink exhaust their energy budget, the farthest sensors still store up to of their initially provided battery power. Another striking result reveals that the energy hole problem is inevitable in static always-on WSNs where the sensor nodes perform continuous monitoring using their nominal communication range [5, 24–28]. Hence, most of the past works dealing with balancing the energy consumption target adjustable communication range solutions aiming at relieving the sensors, which are in the sink’s neighborhood, from the relaying task.
Our approach to surmount the energy sink hole problem encountered in UW-ASNs revolves mainly around two axes: (i) deriving the optimal deployment settings that helps overcoming this problem and (ii) conceiving a multiple transmission power levels data forwarding strategy aiming at balancing the energy consumption among all sensor nodes. By thoroughly investigating the joint feasibility of these two methods, we aim at tightly approaching the perfect equitable energy utilization among all the underwater network’s sensors.
The goal of the first method is to pertinently deploy sensor nodes according to a well-studied deployment pattern that helps achieving fair energy utilization through the network while respecting the application reliability. Indeed, we aim at deriving the optimal deployment settings in terms of the optimal number of sensors along with the optimal distance separating subsequent nodes that give uniform energy consumption among all sensors in the network while satisfying the application reliability requirements.
The goal of the second method is to allow several subsets of sensors to work as relay runners to the sink such that the set of traffic hot spots is continuously changing over time. Indeed, by adopting a variable transmission powers solution, not only is the total data forwarding load (generated plus received) on each underwater sensor distributed uniformly but also the set of sink forwards will change.
To recapitulate, in our work, once the target deployment is obtained and thus the desired information reliability is satisfied, we provide each sensor with the set of possible next hops and their respective load weight that closely approach the perfect equitable energy consumption among underwater sensors.
3.3. Network and Energy Model
In this study, we opt for the manual deployment of the underwater acoustic sensor networks for the sake of closely approaching the uniform energy depletion among sensor nodes. Indeed, achieving perfect uniform energy consumption in a completely free-floating underwater sensor network is hard as in such network the objective is rather limited to the successful delivery of data packets to the sink. Seeking to achieve any further objectives especially in terms of optimization rather requires a barely static topology of the underwater sensor network. Thus, we turn to the task of studying the optimal deployment settings in order to closely approach the uniform energy depletion through the network, and hence the problem of the energy sink hole is better solved; thus, the network lifetime is maximized. That being said, conceiving the optimal deployment pattern of the underwater sensors should not be indefinitely sought after since it may break the reliability requirement of the application. For this reason, we aim at designing the optimal deployment settings such that the desired reliability level is satisfied.
In this paper, we consider a two-dimensional shallow underwater sensor network. Our deployment strategy states that sensors are anchored to the water bottom and tied with long cables. A floating buoy is used to keep the underwater node at the water surface. Note that in this study, the sensors are assumed to be maintained tied to their ropes, which will lightly restrict their displacement but not completely. Recall that, in this study, we assume that the water surface height, the transmitter, and the receiver heights as well as the distance separating them are slightly moved around their nominal locations by some heights , and , respectively, each on the interval . Consequently, assuming that sensor nodes will be attached to their cable, all the time, will only help to have a barely fixed network topology that allows the investigation of the optimal configuration parameters in terms of deployment and routing that surmount the energy hole problem.
Our network model suggests that sensors are placed in a circular field of radius R centered at the sink as shown in Figure 2. For mathematical modeling convenience, the sensor field is virtually partitioned into disjoint concentric coronas of variable widths obtained as follows. Let us consider K concentric circles of radiuses centered at the sink. For every i, (), corona is the subarea surrounded by the circles of radius and . According to our network model, the width of each corona should not exceed the maximum transmission range of a sensor in order to guarantee communication between adjacent coronas. For example, in Figure 2, . Thus, the sensor field is partitioned into six coronas , and . Hence, K denotes the number of coronas. The width of corona is . We assume that a sensor in corona uses a transmission range of to reach a sensor in corona
According to the abovementioned network pattern, routing is predictable. Each report is forwarded from the source to the sink by crossing upstream coronas in the same wedge W. Indeed, the field can be seen as a set of wedges. Each wedge W is virtually partitioned into K sectors, . The K sectors are the results of the wedge W intersection with the K coronas , as shown in Figure 3. In our work, we suppose that each sector contains exactly one sensor which is responsible of forwarding the cumulative traffic coming from its predecessors to one of its possible successors. According to our deployment pattern depicted in Figure 3, our circular field will be partitioned into sets of wedges where every wedge W represents a possible path to reach the sink. Thus, our circular field is seen as a set of linear nonintersecting paths. By doing so, we think that, first it is feasible from a practical point of view as underwater sensor networks are sparse by design, and hence the probability of having just one sensor in a given sector is relatively high. Second and most importantly, such deployment pattern will be of great help in order to mathematically and optimally configure our underwater sensor networks in order to surmount the energy hole problem. Indeed, analytically solving this problem in completely random meshed networks is extremely hard. To make it easier, and as a start, we proposed a rather simplified underwater network topology that can be first justified by the sparse deployment of the underwater sensors and second may be intentionally conceived to satisfy given application requirements especially in terms of energy efficiency and hence network lifetime. Indeed, our objective is to take advantage of the sparse deployment of UW-ASNs, in order to propose a target deployment pattern along with the offline-derived optimal load weight distribution which lead to balanced energy use among the network’s sensors, especially for severely energy constrained applications and hence maximize the network lifespan. Figure 3 depicts a possible path where a packet generated by the sensor in the outermost sector is routed to the sink by crossing adjacent sectors. Note that, in this example, each hop involves the immediately adjacent neighbor from the adjacent sector. However, according to our balanced routing strategy, this straightforward routing path can be modified by allowing sensor nodes to have more than one transmission power level, and hence the next hop forwarder can be located in a far away sector and not only the adjacent one. By doing so, we aim at fairly distributing the traffic load such that the energy hole problem is surmounted.
In this paper, we suppose that the two main sources of energy consumption are data reception and transmission. More precisely, the energy consumed in transmitting one packet of length bits over a distance d is given bywhere is the transmission time, which writeswhere denotes the channel capacity over the bandwidth and is derived as follows:where is the noise power over the link. .
Similarly, the consumed energy to receive a packet of size bits is given bywhere is the electronics power.
4. Balancing Energy Consumption
In this paper, we strive for deriving the optimal deployment configuration that satisfies the application reliability requirement along with the optimal traffic load distribution that balances the energy depletion throughout the network. Recall that, in this work, we target continuous-monitoring applications where every sensor periodically generates A reports per unit of time. In this section, we strive for determining the energy expenditure per sensor in an arbitrary corona of width where . According to our routing strategy, every node in a given wedge W and a generic corona , (), is supposed to forward two kinds of traffic:(i)accumulated traffic emanating from downstream sensors belonging to the same wedge W but located in a different sectors with (ii)traffic generated by the sensor itself which is located in sector
For each sensor node positioned at sector in a specific wedge W, the possible next hop to forward-accumulated traffic to sink S can be the sensor located in or , in the same wedge W where denotes the maximum number of coronas that can be reached by sensor i subject to . Let N be is a system parameter denoting the number of different transmission range levels that can be dynamically adjusted by each underwater sensor. In other words, in our study, we suppose that each underwater sensor can choose among N possible values of transmission range. We aim at deriving the optimal load weight for each possible transmission range that balances the energy utilization among all sensors in the network.
Let us consider a wedge and we associate with each possible next hop located in or or a respective weight and a respective probability of a successful reception such that , . Therefore, the total number of packets per unit of time, handled by a sensor in sector and wedge W, is given by
Accordingly, the average transmission energy, , consumed by a sensor in corona of width can be derived as shown in equation (9):
Note that the average transmission energy, , depends on the widths of all the possible upstream coronas , Consequently, as a key distinguishing feature from , in this study, the corona width is no longer fixed but it can be of any length. Most importantly, in this work, the corona width is a network parameter that will be integrated in our optimization problem and for which we seek to derive the optimal value that helps achieving smooth and uniform energy depletion through the network.
Similarly, the average reception energy, , consumed by a sensor in corona of width can be expressed as derived in equation (11). Expressly,
It is worth pointing out that here again the reception energy, , depends on the width of all the possible downstream coronas , Finally, the total energy consumed by a sensor in corona of width is
The objective of our study is to design the coronas widths such that the energy depletion is balanced across all the sensors while achieving the desired reliability level . Note that in our work, the reliability level is expressed in terms of the minimum required number of received reports at the sink per unit of time. is expressed in our study as just in order to impose a minimum number of coronas and hence a minimum number of deployed sensor nodes. Therefore, our optimization problem is stated as follows:
As opposed to the result in , our optimization problem is now threefold. Accordingly, we are seeking three optimal parameters: (i) the optimal distance separating any two subsequent nodes , (ii) the optimal number of transmission levels , and (iii) the optimal load utilization ratio, , for each possible transmission power level for every node in the network. It is worth pointing out that in this study, we rather opt for the numerical resolution as our optimization problem is now threefold. In what follows, we denote , , and. .
5. Optimizing the Energy Consumption
In this section, we try to solve the above-derived threefold optimization problem of equation (13). For this purpose, we mainly deal with two main cases: fixed and variable corona width. For the fixed corona width case, we suppose that all coronas in the network have fixed width and we aim at deriving the optimal corona width as well as the optimal number N of transmission levels along with optimal load weight corresponding to every possible transmission power level for every sensor node. For the variable corona width case, we deal with two subcases: first, we suppose that the corona width follows an arithmetic progression, and second, we assume that the corona width is following a geometric sequence. Note that, for both main cases, namely, fixed and variable corona width, the optimal value of N will be derived by browsing the interval . In other words, for each configuration, we derive that minimizes , for each value of Once done, we select the optimal N that further minimizes for the chosen configuration
5.1. Numerical Solution for the Fixed Corona Width Case
Let us start by considering that our network deployment follows a fixed corona width model where the corona width is set equal to . Consequently,and henceAs such, can be expressed as follows:and similarly
Thence, our problem can be stated as follows:
Accordingly, given the field radius R, the desired reliability level , and the maximum transmission range , we aim at deriving the optimal values for , and that balance the energy expenditure among all sensors in the deployed network while respecting the desired reliability level.
5.2. Numerical Solution for Variable Corona Width
Corona Width following an Arithmetic Progression. In this section, we suppose that the corona width is following an arithmetic progression with an initial term , which is the width of the first corona and a common difference In other words,
It is worth noting that if , then will be limited to only . In other words, once exceeds , the remaining field radius will be portioned into coronas of fixed size .
We aim at finding out the optimal configuration in terms of , and that minimizes . Hence, our optimization problem can be expressed as follows:
Note that our optimization problem is now fourfold as it seeks to determine four optimal parameter, namely, (i) , the initial term of the arithmetic progression which represents the first corona width, (ii) m, which is the common difference of the arithmetic progression, (iii) , the number of the transmission power levels to be adopted by each sensor, and (iv) , the utilization ratio of each possible transmission power level for every node in the network.
Corona Width following a Geometric Progression. Similar to the previous section, we now suppose that the corona width is following a geometric sequence with an initial term , which is the width of the first corona and a common ratio In other words,
Note that, here again, if exceeds , then will be limited to only . In other words, once exceeds , the remaining field radius will be partitioned into coronas of fixed size . Our ultimate goal is to determine the best configuration in terms of , and that minimizes . Hence, our optimization problem is now fourfold and can be expressed as follows:
A straightforward way to solve the above-stated constrained nonlinear optimization problems of equations (18), (20), and (22) is by using the MATLAB optimization toolbox. The MATLAB optimization toolbox is one of the useful toolboxes provided by MATLAB software  that provides numerical solutions. This toolbox minimizes a problem which is subjected to some specific constraints. One of the most used solvers of this toolbox is fmincon. Fmincon tries to find the minimum of constrained nonlinear multivariable function. The goal is finding a vector x that is a local minimum to a scalar function . More precisely, the optimal values of will be derived in a parametric way by browsing an appropriate interval, while we jointly use the fmincon solver to derive the optimal for each possible values of . It is worth pointing out that fmincon has been applied with several initial values in order to make sure that the obtained optimal values of are global ones.
6. Results and Discussion
In order to assess the performance of our proposal, we developed a simulator using MATLAB. This simulator implements the physical layer specifications including attenuation, delays, bandwidth, and power and energy consumption using the model presented in Sections 3–5. Note that this MATLAB simulator mainly uses the powerful MATLAB optimization toolbox in order to find the optimal deployment and routing configurations that balances the energy consumption among all underwater sensors in the network while satisfying the application desired reliability level.
We want to point out that in our work and for each case study, namely, fixed corona width and corona width following either arithmetic progression or geometric one, we have a number of nested optimization problems. More precisely, we have three nested optimization problems for the fixed corona width case and four nested ones for the corona width following either arithmetic progression or geometric progression cases. Fmincon is only used to determine which is a continuous function in . The other parameters like the optimal N and the optimal are derived in a parametric way as explained in the paper by browsing a given interval with a given step.
According to our network model, our circular sensor field, centered at the sink and of radius R, is virtually partitioned into disjoint concentric coronas of variable widths. The width of each corona is at most the maximum transmission range of an underwater acoustic sensor. Each underwater sensor periodically reports with rate packets/s. At each hop, the locally generated traffic along with the route-through traffic is transmitted from the source node by crossing upstream sensor nodes located in the same wedge till reaching the sink. Table 1 provides the parameters setting in our study.
6.1. Fixed Corona Width
Let us start by studying the fixed corona width case. It is worth pointing out that in order to derive the optimal configuration parameters, the corona width is varied in with a step of , where for each possible value of N is varied between in order to find using fmincon. Then the optimal parameters , , and are the ones that jointly achieve the minimum energy consumption among all the possible configurations.
By varying the corona width in , in , and the field radius R in , the optimization results show that the optimal corona width that minimizes the total energy consumption of the heavy loaded node is mainly achieved between as depicted in Table 2. Table 3 shows matrix when the field radius is set equal to . Note that, in this illustrative case, and as depicted in Figure 4. Accordingly, our sensor field is partitioned into 6 coronas where dictates that each sensor should send its accumulated traffic in equal proportions to all possible upstream coronas.
6.2. Corona Width following an Arithmetic Progression
In this section, we suppose that the corona width is following an arithmetic progression. More precisely, and while the field radius R varies in . Note that, in order to derive the optimal parameters for the arithmetic progression of corona width, , , and are varied each in a given interval with a given step in a nested parametric optimization problem where are obtained using fmincon for each possible configuration. Optimal values of , , , and are the ones that achieve the minimum energy consumption among all the possible configurations.
Table 4 shows matrix when the field radius is set equal to . Note that, in this illustrative case, , , and as depicted in Figure 5. Accordingly, our sensor field is partitioned into 5 coronas as shown in Table 5. According to Tables 4 and 5, optimal balanced energy consumption is achieved when the first corona has a width of , while the second has a width of , and it sends of its total traffic directly to the sink and the remaining to corona 1. Corona 4, for example, should have a width of and should transmit of its traffic to corona 3 and of traffic to corona 2, while the remaining traffic load should be transmitted directly to the sink, leading to no traffic from corona 4 to the first corona in order to alleviate the heavy forwarding task of the one-hop away sensors so that the sink hole problem is avoided.
The optimization results as shown in Table 6 reveal that the optimal that minimizes for various field radii has small values Recall that is actually the width of the first corona which is the closest one to the sink. Consequently, by reducing the width of the coronas in the close vicinity of the sink, their energy consumption is reduced since their transmission power is reduced. Hence, even if these coronas are handling more traffic compared to the far ones, they will not consume too much greater amount of energy since they will be transmitting over short distances. On the contrary, the farther the corona is from the sink, the higher is its width . Hence, these coronas will be in charge of sending over longer distance since they are handling a small amount of packet forwarding, and thus the energy consumption is balanced through the network. Consequently, having a field of radius R, the sensor nodes should be placed such that the closest ones should send at short distances to reach their upstream coronas while the farthest ones should transmit over much higher distances to reach their subsequent coronas. By doing so, the difference in the amount of forwarded traffic between the closest nodes and the farthest ones is balanced by the transmission power expenditure, and hence uniform energy consumption is achieved through the network. Jointly, the energy consumption can be further optimized by deriving the optimal and values.
6.3. Corona Width following a Geometric Progression
In this section, we assume that the corona width is following a geometric progression. Precisely, we vary in and the ration q in while the field radius R varies in . Note that, in order to derive the optimal parameters for the geometric progression of corona width, , q, and N are varied each in a given interval with a given step in a nested parametric optimization problem where are obtained using fmincon for each possible configuration. Optimal values of , , , and are the ones that achieve the minimum energy consumption among all the possible configurations.
The optimization results shown in Table 7 reveal that and that minimize the energy consumption are decreasing function of the field radius Indeed, for high field radius, selecting small with small q guarantees to create more coronas with reasonable widths, hence avoiding width explosion of the farthest coronas which may highly increase the transmission power. Recall that, according to Figure 5, the transmission power exponentially increases with distance. A further energy optimization can be achieved by jointly deriving the optimal and values. Table 8 shows matrix when the field radius is set equal to . Note that, in this illustrative case, , , and as depicted in Figure 4. Accordingly, our sensor field is partitioned into 5 coronas as shown in Table 9. According to Tables 8 and 9, balanced energy draining through the network is accomplished when the first corona width is set to while the second corona width is equal to , and the third corona width equals . For instance, a sensor in the fifth corona that has a width of should forward of its traffic to the fourth corona and another should be transmitted to the third corona, while the remaining should be transmitted directly to the sink, skipping corona 2 and corona 1 in order to alleviate their forwarding task as they are close to the sink so that the sink hole problem is overcome. Note that, for , the optimal parameters of the arithmetic and geometric progressions lead to almost the same coronas widths (Tables 5 and 9) which explains the similarities of and values.
Most importantly, according to the results shown in Tables 4, 5, 8, and 9, overcoming the energy hole problem in a given sensor field simply comes down to design the corona widths such that the closer the corona to the sink, the smaller its width, whereas the farther the corona from the sink, the larger its width. By doing so, the coronas that are close to the sink will compensate their higher traffic load by transmitting over shorter distances and hence consuming less transmission power. However, the far coronas will be in charge of transmitting over larger distances since their traffic load is reduced. Consequently, balanced energy consumption is achieved through the network, thanks not only to the load weight distribution (reported in Tables 4 and 8) but also to the optimal design of coronas widths (reported in Tables 5 and 9).
Now, and most importantly, let us compare the three approaches. First, observe that according to Figure 4, for the three approaches is decreasing as a function of the field radius. Indeed, the higher the field radius, the more the coronas created; using high N will inevitably lead to transmission over higher distances, drastically increasing the energy consumption. However, having relatively small field radius will ensure creating coronas of reasonable widths, and hence using large will balance the energy consumption through the network.
Figure 6 shows the energy consumption as function of the field radius R for the three approaches. Note that, every spot in the three curves represents the maximum consumed energy () among all the formed coronas for a given field radius. Knowing that our simulation results, for every spot, provide , we aim at determining which of the three approaches achieves the most balanced energy consumption by reducing at most . First, Figure 6 shows that the energy consumption is increasing as a function of the field radius R, for the three approaches Indeed, as the field radius increases, the number of coronas increases, and hence the traffic load grows leading to an increase in the energy consumption. Most importantly, note that the case of coronas widths following geometric progression is achieving the lowest energy consumption since the geometric progression is using higher as shown in Figure 4, and hence it ensures more balanced energy consumption. It is worth noting that for small values of the field radius the three approaches are using high values. Indeed, reducing the size of the field radius will reduce the number of the widths of the coronas, and hence increasing N is sought and justified. Observe also that, for small field radius, geometric and arithmetic progressions are almost achieving the same energy consumption; since as explained above (Tables 5 and 9), both approaches are achieving the same coronas width distribution, and hence they have similar and . Finally, notice that the arithmetic corona width progression is converging to the fixed width case since for large field radius for both approaches, and hence every node is restricted to send to its upstream node in the subsequent corona.
In this paper, we address the energy sink hole problem in UW-ASNs while taking into account the severe features of the underwater channel. We strive for determining the optimal distances separating subsequent sensor nodes during deployment that helps achieving fair energy expenditure among all sensor nodes while satisfying the desired information reliability. Jointly, we propose a variable transmission range-based data forwarding task. Accordingly, each underwater sensor is allowed to dynamically modify its transmission power among multiple possible levels N. Consequently, we derived for each sensor in the network the optimal transmission power levels and their corresponding optimal load weights that surmount the sink hole problem. To achieve this, we numerically solved well-stated optimization problems that jointly derive for each source sensor, the appropriate deployment configuration, and the optimal number of transmission power levels along with their associated optimal load weights that evenly consume the energy budget for each underwater sensor in the network, and hence, the network energy efficiency is maximized.
No data were used to support this study.
Conflicts of Interest
The author declares that there are no conflicts of interest.
- N. Javaid, H. Maqsood, A. Wadood et al., “A localization based cooperative routing protocol for underwater wireless sensor networks,” Mobile Information Systems, vol. 2017, Article ID 7954175, 16 pages, 2017.
- S. H. Bouk, S. H. Ahmed, and D. Kim, “Delay tolerance in underwater wireless communications: a routing perspective,” Mobile Information Systems, vol. 2016, Article ID 6574697, 9 pages, 2016.
- W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660–670, 2002.
- J. Li and P. Mohapatra, “Analytical modeling and mitigation techniques for the energy hole problem in sensor networks,” Pervasive and Mobile Computing, vol. 3, no. 3, pp. 233–254, 2007.
- J. Lian, K. Naik, and G. B. Agnew, “Data capacity improvement of wireless sensor networks using non-uniform sensor distribution,” International Journal of Distributed Sensor Networks, vol. 2, no. 2, pp. 121–145, 2016.
- V. Mhatre and C. Rosenberg, “Design guidelines for wireless sensor networks: communication, clustering and aggregation,” Ad Hoc Networks, vol. 2, no. 1, pp. 45–63, 2004.
- A. Wadaa, S. Olariu, L. Wilson, K. Jones, and M. Eltoweissy, “Training a sensor networks, MONET,” in Proceedings of 3rd International Workshop on Wireless, Mobile, and Ad Hoc networks, Nice, France, January 2005.
- P. Qarabaqi and M. Stojanovic, “Statistical characterization and computationally efficient modeling of a class of underwater acoustic communication channels,” IEEE Journal of Oceanic Engineering, vol. 38, no. 4, pp. 701–717, 2013.
- The simulator package is available for download at http://millitsa.coe.neu.edu/?q=projects.
- D. Pompili and I. F. Akyildiz, “Overview of networking protocols for underwater wireless communications,” IEEE Communications Magazine, vol. 47, no. 1, pp. 97–102, 2009.
- S. Climent, A. Sanchez, J. V. Capella, N. Meratnia, and J. J. Serrano, “Underwater acoustic wireless sensor networks: advances and future trends in physical, MAC and routing layers,” Sensors, vol. 14, no. 1, pp. 795–833, 2014.
- N. Li, J. F. Martinez, J. M. Meneses, and M. Eckert, “A survey on underwater acoustic sensor network routing protocols,” Sensors, vol. 16, no. 13, p. 414, 2016.
- M. Ayaz, I. Baig, A. Abdullah, and I. Review Faye, “A survey on routing techniques in underwater wireless sensor networks,” Journal of Network and Computer Applications, vol. 34, no. 6, pp. 1908–1927, 2011.
- I. Azam, N. Javaid, A. Ahmad, W. Abdul, A. Almogren, and A. Alamri, “Balanced load distribution with energy hole avoidance in underwater WSNs,” IEEE Access, vol. 5, pp. 15206–15221, 2017.
- X. Deng, L. T. Yang, L. Yi, M. Wang, and Z. Zhu, “Detecting confident information coverage holes in industrial Internet of Things: an energy-efficient perspective,” IEEE Communications Magazine, vol. 56, no. 9, pp. 68–73, 2018.
- X. Deng, Z. Tang, L. T. Yang, M. Lin, and B. Wang, “Confident information coverage hole healing in hybrid industrial wireless sensor networks,” IEEE Transactions on Industrial Informatics, vol. 14, no. 5, pp. 2220–2229, 2018.
- X. Deng, Z. Tang, L. Yi, and L. T. Yang, “Healing multimodal confident information coverage holes in NB-IoT-Enabled networks,” IEEE Internet of Things Journal, vol. 5, no. 3, pp. 1463–1473, 2018.
- L. Yi, X. Deng, M. Wang, D. Ding, and Y. Wang, “Localized confident information coverage hole detection in Internet of Things for radioactive pollution monitoring,” IEEE Access, vol. 5, pp. 18665–18674, 2017.
- L. Yi, X. Deng, Z. Zou, D. Ding, and L. T. Yang, “Confident information coverage hole detection in sensor networks for uranium tailing monitoring,” Journal of Parallel and Distributed Computing, vol. 118, pp. 57–66, 2018.
- J. M. Jornet, M. Stojanovic, and M. Zorzi, “Focused beam routing protocol for underwater acoustic networks,” in Proceedings of the 3rd ACM International Workshop on Underwater Network, pp. 75–82, San Francisco, CA, USA, September 2008.
- H. Yan, Z. J. Shi, and J. H. Cui, “DBR: depth-based routing for underwater sensor networks,” in Proceedings of 7th International IFIP-TC6 Networking Conference AdHoc and sensor Networks, Wireless Networks, Next Generation Internet, Singapore, May 2008.
- Y. Chun-Hao and S. Kuo-Feng, “An energy-efficient routing protocol in underwater sensor networks,” in Proceedings of 3rd International Conference on Sensing Technology, ICST, Taiwan, China, November 2008.
- J. M. Chen, X. B. Wu, and G. H. Chen, “REBAR: a reliable and energy balanced routing for UWSNs,” in Proceedings of 7th International Conference on Grid and Cooperative Computing, pp. 349–355, Shenzhen, China, October 2008.
- W. Guo, Z. Liu, and G. Wu, “An energy-balanced transmission scheme for sensor networks,” in Proceedings of 1st ACM Conference on Embedded Networked Sensor Systems, pp. 300-301, New York, NY, USA, November 2003.
- P. Leone, S. Nikoletseas, and J. Rolim, “An adaptive blind algorithm for energy balanced data propagation in wireless networks,” in Proceedings 1st IEEE International Conference on Distributed Computing in Sensor Systems, pp. 35–48, Marina del Rey, CA, USA, July 2005.
- S. Olariu and I. Stojmenovic, “Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting,” in Proceedings of IEEE INFOCOM ’06, vol. 1-12, Barcelona, Spain, January 2006.
- O. Powell, P. Leone, and J. Rolim, “Energy optimal data propagation in wireless sensor networks,” Journal of Parallel and Distributed Computing, vol. 3, no. 67, pp. 302–317, 2007.
- X. Wu, G. Chen, and S. K. Das, “On the energy hole problem of nonuniform node distribution in wireless sensor networks,” in Proceedings of Third IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS ’06), pp. 180–187, Boulder, CO, USA, November 2006.
- H. Luo, Z. Guo, K. Wu, F. Hong, and Y. Feng, “Energy balanced strategies for maximizing the lifetime of sparsely deployed underwater acoustic sensor networks,” Sensors, vol. 9, no. 9, pp. 6626–6651, 2009.
- N. Javaid, N. Ilyas, A. Ahmad et al., “An efficient data-gathering routing protocol for underwater wireless sensor networks,” Sensors, vol. 15, no. 11, pp. 29149–29181, 2015.
- Y. S. Chen and Y. W. Lin, “Mobicast routing protocol for underwater sensor networks,” IEEE Sensors Journal, vol. 13, no. 12, pp. 737–749, 2012.
- C. Zidi, F. Bouabdallah, and R. Boutaba, “Routing design avoiding energy holes in underwater acoustic sensor networks,” Wireless Communications and Mobile Computing, vol. 16, no. 14, pp. 2035–2051, 2016.
- F. Bouabdallah, C. Zidi, and R. Boutaba, “Joint routing and energy management in underwater acoustic sensor networks,” IEEE Transactions on Network and Service Management, vol. 14, no. 2, pp. 456–471, 2017.
- MATLAB help, R2009a, https://www.mathworks.com/.
Copyright © 2019 Fatma Bouabdallah. 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.