Deployment-based lifetime optimization for linear wireless sensor networks considering both retransmission and discrete power control

A sophisticated method for node deployment can efficiently reduce the energy consumption of a Wireless Sensor Network (WSN) and prolong the corresponding network lifetime. Pioneers have proposed many node deployment based lifetime optimization methods for WSNs, however, the retransmission mechanism and the discrete power control strategy, which are widely used in practice and have large effect on the network energy consumption, are often neglected and assumed as a continuous one, respectively, in the previous studies. In this paper, both retransmission and discrete power control are considered together, and a more realistic energy-consumption-based network lifetime model for linear WSNs is provided. Using this model, we then propose a generic deployment-based optimization model that maximizes network lifetime under coverage, connectivity and transmission rate success constraints. The more accurate lifetime evaluation conduces to a longer optimal network lifetime in the realistic situation. To illustrate the effectiveness of our method, both one-tiered and two-tiered uniformly and non-uniformly distributed linear WSNs are optimized in our case studies, and the comparisons between our optimal results and those based on relatively inaccurate lifetime evaluation show the advantage of our method when investigating WSN lifetime optimization problems.


Introduction
As wireless communication and electronic miniaturization techniques have developed, wireless sensor networks (WSNs) are increasingly used in a wide variety of applications, such as industrial, military, business, habitat, health and environmental monitoring [1][2][3][4][5][6][7]. Many applications (e.g., monitoring oil, gas and water pipelines, railroads and subway tunnels, border surveillance, etc.) require placing sensors in a straight line. Such deployments are termed "linear WSNs" [8]. Usually, such WSNs include three types of nodes: (1) sensor nodes (SN), which can monitor the surrounding information, such as temperature, humidity, pressure and a1111111111 a1111111111 a1111111111 a1111111111 a1111111111 vibration, and transfer them as needed; (2) relay nodes (RN), which collect data from SNs, and deliver them to the base station; and (3) base station (BS) nodes, also called sink nodes, which collect data for further analysis. From a hierarchical point of view, linear WSNs can be classified into two categories: (1) one-tiered linear WSNs, which consist of only SNs and BSs, where the SNs transfer sensed information to the BS based on a routing protocol in hop by hop fashion; and (2) two-tiered linear WSN, which include all three of the node types described above, in which SNs collect information and transmit it to their parent RN, and the RNs forward the data to the BS (see Fig 1).
Because sensor and relay node batteries usually have limited capacity and are difficult to replenish or replace, the lifetime of a WSN is largely determined by its energy consumption [9][10][11][12]. Pioneers provided lots of methods to reduce the energy consumption, for example, energy-efficient data routing [13][14][15][16], data aggregation [17], effective node deployment and topology control [18], duty cycling, etc. Among such methods, the deployment based lifetime optimization attracts a lot of researchers. It has been reported that data communication (which involves both data transmission and reception) consumes the maximum energy in the life cycle of WSNs [1]. According to Stemm and Katz [19], the longer the transmission distance is, the more energy will be consumed. Therefore, pioneers focused on finding a node deployment that maximizes network lifetime [20,21], Yao et al. [22] proposed a source location privacy protection strategy to ensure the security of the network. Several deployment strategies have been proposed to achieve load balance and avoid energy holes [23,24]. For linear WSNs, Cheng et al. [25] proposed two greedy sensor placement and data transmission schemes for both linear and planar WSNs that balance the average energy consumption of each sensor to maximize the network lifetime or minimize the network cost. Chen et al. [26] provided a sensor deployment optimization problem for one-tiered linear WSNs that maximized network lifetime per cost using coverage and energy balance constraints. This problem is solved using a two-step solution: (1) optimize the sensor placement using a greedy strategy similar to [25], and (2) use numerical approximation to determine the optimal number of sensors. Ganesan et al. [27] studied the joint optimization of sensor placement and transmission structure that minimized energy consumption under a given number of nodes and a tolerable distortion rate. Liu and Mohapatra [28] studied how to optimally deploy back-haul nodes (i.e., RNs) for a two-tiered linear WSN. They provided a greedy deployment scheme that used the maximum coverage distance. Cao et al. [29], addressing one-tiered linear WSNs, developed a Lagrangemultiplier-based energy-efficient node placement scheme that balanced per-node energy consumption to maximize network lifetime. Hossain et al. [30] analyzed energy consumption in linear wireless camera sensor networks and proposed a node placement scheme that yielded equal energy dissipation over the network. Although the optimization models in [25,29] are for one-tiered linear WSNs, the authors also declared their methods suitable for two-tiered linear WSNs, in which the node deployment can be optimized in two tiers. Only RN deployment -including the number of RNs and the node distances between them-is optimized for the higher tier. In the lower tier, each cluster is regarded as a separate sensor network in which RNs are regarded as sink nodes. SN deployment can be optimized in the same manner. Additional linear WSN lifetime optimization studies can be found in [31][32][33].
Considering that WSNs are usually deployed in harsh environments, data transmission is often unreliable; therefore, retransmission is commonly applied to improve the transmission success rate. She et al. [34] proposed an analytical method to quantify the energy consumption of hop-by-hop and end-to-end retransmission schemes, demonstrating that hop-by-hop retransmission consumes less energy under different bit-error-rates. Li et al. [35,36] proposed deployment-based lifetime optimization models for one-tiered linear and flat WSNs under hop-by-hop retransmission. Their results illustrated that optimal node deployments with and without retransmission are quite different; therefore, retransmission should be considered when studying deployment-based lifetime optimization problems.
On the other hand, the power of nodes in WSN are usually limited to a limited number of values in practical settings, and cannot be infinitely tunable [37][38][39][40]. For example, the Mica2 [41], Mica3 [42], MicaZ [43], and Tmote Sky Sensor [44] all have discrete power levels. However, in most works, linear deployment-based optimization models are built based on the widely used continuous power model proposed by Heinzelman et al. [45], in which both the free space (power loss) and multipath fading (power loss) channel models were considered. This ideal power model facilitates deployment-based optimization but may lead to misleading results. Aslam et al. [46] and Banerjee et al. [47] compared the continuous and discrete power models available from sensor manufacturers in terms of energy consumption and lifetime calculations, and the results show large differences. Guo et al. [48] studied the lifetime optimization problem for a one-tiered linear WSN used to monitor oil pipelines and proposed two efficient placement heuristics that minimized the energy consumption using the realistic discrete power model. They found that the optimal sensor deployment scheme obtained when using the discrete power model was different from the one they obtained using the ideal power model; therefore, the realistic power model should also be considered when studying WSN deployments. Table 1 compares these deployment-based optimization approaches for linear WSNs. None of these approaches considers both realistic discrete power model and retransmission model deployments. Consequently, in this paper, we combine the two models in the deploymentbased lifetime optimization for linear WSNs and focus on how they influence the optimal deployment. To the best of our knowledge, our lifetime model and deployment-based lifetime optimization model for linear WSNs are among the first generic models to consider retransmission and discrete power level. Together, these provide a more accurate estimation of network lifetime and better node deployment.

Problem description
This paper aims at combining retransmission and discrete power control in the deployment based lifetime optimization for linear WSNs. To clearly discuss such problem, the node deployment, data sensing and transmission, retransmission, discrete power control are described as follows for further analysis.
Node deployment. Fig 2 shows typical one-tiered and two-tiered linear WSNs, where all nodes are arrayed in lines as a structured network to monitor a linear space with length D. We consider that the network includes only one BS located at one end of the line; if the BS is located between nodes, the network can be split into two independent deployment-based optimizations, one each for nodes on either side of the links with the BS at one end. Let n h and n l denote the numbers of nodes in the higher and lower tiers, respectively. For a one-tiered WSN, there is no hierarchy, and we denote SNs as nodes in the higher tier. For the two-tiered WSN, RNs are in the higher tier, and SNs are in the lower tier.
In Fig 2, n h nodes located in the higher tier are denoted as N 1 ; N 2 ; . . .; N n h , and the BS is denoted as N n h þ1 . For the two-tiered WSN, the SNs in the lower tier have a parent node (i.e, the neighboring RN closer to the BS or the BS itself, where the BS is denoted as N n h þ1 ), and their sensing data will be transmitted to the parent node for further forwarding. Each parent node N i serves n i child SNs denoted as N i;1 ; N i;2 ; . . . ; N i;n i ; therefore, the number of nodes in the lower layer can be calculated as n l ¼ X n h þ1 i¼1 n i . Let d i and d i,j denote the distances from Node N i to its next hop in the higher layer and from Node N i,j to its next hop in the lower layer, respectively.
Data sensing and transmission. In WSNs such as those in Fig 2, the SNs are responsible for sensing, and each SN has a sensing range of R s . Each node in the WSNs has the ability to (1) the period of time from network initialization until the first sensor death occurs; (2) the network lifetime (see 1) divided by the number of sensors deployed in the network; and transmit and relay data according to the routing protocol. Nodes in the higher and lower layers have communication ranges of R t,h and R t,l , respectively. In our paper, we assume that data transmission follows the shortest path routing. In the higher layer, Node N i can transmit the sensing data only to Node N i+1 . In the lower layer, Node N i,j can transmit the sensing data only to Node N i,j+1 (the parent node N i can also be denoted as N i;n i þ1 ). The data transmission mode can also be seen in Fig 1. Retransmission. According to the packet reception rate model of Zuniga and Krishnamachari [49], the retransmission rate can be obtained according to the sensor modulation, encoding scheme and path loss models. Consider Mica2 (with non-coherent FSK modulation and encoded by Manchester code) as an example. Using the one slope log-distance path loss model from [49], the retransmission rate for MICA2 motes can be obtained as follows: where PL(d) is the path loss model, d is the transmission distance, P n is the noise floor (in dB), B N is the noise bandwidth, r is the data transmission rate (bit/sec), PL(d 0 ) is the path loss at the reference distance d 0 , α is the path loss exponent (2 α 4) depending on different channel models, X δ is a lognormal variable with standard deviation δ (in dB), and m and l are the lengths of the packet and preamble (in bits), respectively. Discrete power control. Node datasheets provide a data source for the discrete power levels. For example, the datasheet [41] of Mica2 which uses CC1000 chips provides 26 different transmission power levels and their corresponding consumption. The transmission power consumption at different power levels can be computed using the current consumption  Table 2 presents the transmission power consumption for various Mica2 output power levels.

Optimization model
Considering both retransmission and discrete power consumption, this section presents an optimization model to find the optimal node deployment that maximizing the network lifetime, subject to coverage, connectivity, and transmission success rate constraints as well as the maximum allowable number of nodes and target length. The node deployment scheme includes both the number of nodes placed in the linear sensor network and the distance between nodes. Both objective and constrains are discussed as follows.

Objective: Maximizing the network lifetime
In our paper, we assume that data are being sensed and transmitted periodically in the WSN, and that no nodes will fail until their energy is exhausted. This assumption is reasonable, because WSN lifetimes range from only hundreds of days to several years due to their limited energy capacity, but node mean time between failures (MTBF) is calculated in tens of years. Therefore, energy consumption largely determines the lifetime of WSNs, and we adopt the common definition of lifetime as the duration between the time network begins operating and the time when the first node has exhausted all its energy and dies [50], which is equivalent to the minimum node lifetime. This lifetime definition is now widely used in WSN lifetime optimization research, because network lifetime is optimized when the energy consumptions of different sensors are nearly balanced. In other words, when the first node dies, the energy of other nodes will also run out very soon. We suppose that the capacity of the BS is unlimited; therefore, we have the following: where L i and L i,j are the lifetime of Node N i in the higher layer (1 i n h ) and Node N i,j (1 i n h + 1, 1 j n i ) in the lower layer, respectively. These nodes are powered by non-rechargeable batteries with an initial energy of E hjl (0), which will be consumed as E i and E i,j during a data-gathering cycle t. Generally, there are three main ways for energy consumption: data transmission, data reception and idle [19]. The energy consumed during data sensing or sleep are ignored. This approach is consistent with node datasheets [41][42][43], in which one can see that the energy consumption in power-down mode and during sensing is negligible compared to the energy consumption during transmit, receive and idle modes. During transmission and reception, there are two types of data, sensing data and control data, and retransmissions caused by harsh environments should also be considered. The data amount depends on the data sensed during the sensing period, the routing protocol and the MAC protocol. For example, if the CSMA/CA protocol is used without RTS/CTS, two types of data are transmitted (sensing data and acknowledgement data). After the sensing data is transmitted, if it is received successfully, the receiver sends an ACK response back to the transmitter; otherwise, the transmitter will retransmit the sensing data until a maximum retry threshold is reached. The data transmitted and received by Node N y can be seen in Fig 3. Using the discrete power model, the energy consumed for data transmission, reception and idle at Node N y of Layer x during a data-gathering cycle t can be calculated as follows: E t;y ¼ P t;x ðd y Þt t;sd þ P t;x ðd y À Þt t;ack ; E r;y ¼ P r;x ðt r;sd;y þ t r;ack Þ; E id;y ¼ P id;x ðt À t t;sd À t t;ack À t r;sd À t r;ack Þ; where x represents 'hjl 0 in the higher or lower layer, y represents node i in the higher layer or node i, j in the lower layer; P t;x ðd y j d y À Þ is the power consumed by nodes in layer x to transmit data over a certain distance d y or d y À (the transmission power consumption at different power levels can be obtained from the sensor datasheet shown in Table 2); P r,x and P id,x are the power consumed at data receiving state and idle state for nodes of Layer x, respectively, and are both constants obtainable from the node datasheet; t tjr,sdjack is the time duration of sensing data or ACK transmitted from or received by Node N y in a data gathering cycle t, they can be where m sdjack;yjy À and o sdjack ðd yjy À Þ are the amount and the expected number of transmission attempts for sensing data or ACK needed to transmit between Nodes N y and N y þ with distance d y or between Nodes N y À and N y with distance d y À (see Fig 3), and r x is the data processing rate of the nodes in Layer x. For RNs, note that two types of sensing data reception and ACK transmission (i.e., the data transmission from the last RN or SN to that RN and the ACK response) exist. The expected numbers of transmission attempts between two hops can be obtained by enumerating all the possibilities shown in S1 Appendix. According to Eq (3), the energy consumption at Node N y of Layer x during a data-gathering cycle can be written as Constraint 1: Coverage. The coverage of a linear WSN can be measured by the coverage percentage, which is the ratio of the length covered by the sensors to the target length. The coverage of the WSN is determined by the sensing range of the sensors and the distance between nodes. The segments between two sensors are covered by the sensors at both ends, while those segments at both ends of the linear WSN are covered by only one sensor. For one-tiered linear WSN, the coverage length of the segment between Node N i and Node N i+1 (the BS at one end is regarded as Node N h+1 , and the other end is regarded as Virtual Node N 0 ) can be computed by For a two-tiered linear WSN, the coverage length of the segment between Node N i,j and the next SN (the BS at one end is regarded as the next SN of Node N n h þ1;n n h þ1 , and the other end is regarded as Node N 1,0 ) can be computed by minfd i;n i þ d iþ1;0 ; 2R S g; ð1 i n h Þ; minfd i;j ; 2R S g; ðothersÞ: Dividing the sum of the coverage lengths for all segments by the target length D, the coverage percentage can be obtained. The coverage percentage constraint for one-tiered and two tiered linear WSNs can be denoted as follows: where the numerator and denominator of the equations are the covered length and the target length, respectively, and Cov Ã wsn is the coverage percentage constraint. Specifically, if Cov Ã wsn ¼ 1, Eq (8) can be simplified to for one-tiered and two-tiered linear WSNs, respectively. In this paper, the coverage is defined as a percentage. For other coverage measures, such as k-coverage, we refer readers to [51] and [52] for details. Constraint 2: Connectivity. Similar to coverage, WSN connectivity can be measured as the connectivity percentage, which is the number of connected SNs divided by their total number. The connectivity of a linear WSN depends on the transmission range of the nodes and the distance between hops. The connectivity between Node N y and its next hop is defined as where d y is the distance between Node N y and its next hop (see Fig 3).
As the data are transmitted hop by hop, if data on Node N y cannot transmit to its next hop, i.e., d y > R t,x , all sensors further away than N y cannot be connected with the BS and vice versa. For one-tiered or two-tiered linear WSNs, the connectivity constraint of the whole network can be calculated as where the numerators are the number of connected SNs, and Con i is the number of SNs that can be connected to a parent node N i in the two tiered WSN, and can be calculated as for 1 i n h + 1.
In particular, if Con Ã wsn ¼ 1, Eq (12) can be simplified to and d i;j R t;l ; ð1 i n h þ 1 and 1 j n i Þ; for one-tiered and two-tiered linear WSNs, respectively. Constraint 3: Transmission success probability. In harsh environments, not all data sent from connected sensors can be transmitted to the sink node successfully, and the transmission success probability is the amount of sensing data successfully transmitted to BS divided by the total amount of sensed data. According to the retransmission model and the communication protocol, we can calculate the transmission success probability between any two adjacent hops by enumerating and adding all the transmission success probabilities together. See S1 Appendix for details.
Let S i and S i,j denote the transmission success probability from Node N i to its next hop in the higher layer and from Node N i,j to its next hop in the lower layer, respectively. In a onetiered linear WSN, the transmission success probability from Node N i to the BS can be computed as Q n h k¼i S k . While the success probability from SN N i,j to its parent node N i can be calculated as Q n i k¼j S i;k for the two-tiered linear WSN. The transmission success probability constraint for the entire WSN can be denoted as follows: for one-tiered and two-tiered linear WSNs, respectively. Here, m sd,i is the data sensed by Node N i , Suc Ã wsn is the connectivity constraint, Suc i is the amount of sensing data that can be successfully transmitted to node N i in the two tiered WSN, and can be calculated as for 1 i n h + 1, where m sd,i,j is the data sensed by SN N i,j .

Constraint 4: The maximum allowable number of nodes.
In our optimization problem, the constraint of the number of nodes can be denoted as follows: where n Ã hjl is the maximum allowable number of nodes in the higher or lower layer. Constraint 5: The target length. For a linear WSN used to monitor a linear space with length D, the constraint of the target length can be denoted as and for one-tiered and two-tiered WSNs, respectively. Optimization model. Using the above models, we can achieve our optimization model by maximizing Eq (2) and setting the above constraints as Eqs (8), (12), (16), (18) and (19) (or (20)). This optimization model aims to find the optimal node deployment, including the number of different types of nodes and the distance between nodes.

Results and discussion
In this section, we present the use of our optimization model to find an optimal node deployment scheme that maximizes network lifetime. To illustrate the effectiveness of our method, the optimal results obtained through our model are compared with the ones using previous models.

One-tiered example
In our example, MICA2 motes each with a CC1000 chip are used as the SNs. We assume that each sensor can obtain the same amount of sensing data (m sd ) during a data-gathering cycle t, and transmit it to the BS using the shortest path routing algorithm (i.e., SN N 1 sends its data to its neighbor N 2 , and N 2 sends its own data as well as the relayed data of N 1 to node N 3 , and so on). The transmission power control scheme reported in [53] is adopted (see Table 2), and different transmission power levels result in different maximum transmission ranges. The MAC protocol adopts the CSMA/CA protocol without RTS/CTS, and the maximum number of retry threshold is specified to be 2 for any one sensing data transmission. To save energy, the zero-idle protocol described in [54] is adopted. Other parameters of our onetiered linear WSN are shown in Tables 3 and 4, where the latter shows values for SNs in the higher level.
Here, the values of β 1 , β 2 , β 3 and β 4 are provided for comparison with the continuous power model proposed by [45], see S2 Appendix for details. To ensure basic data consistency between the continuous and discrete power models, the values of these parameters are modified using curve fitting with 95% confidence bounds.
In the linear WSN deployment-based lifetime optimization problem, there are two typical situations, i.e., WSNs with sensors uniformly and non-uniformly distributed along the line [32,36,48]. In this section, we mainly discuss non-uniformly distributed WSNs, which is used to solve the "energy hole" problem [25]. The uniformly situation can be regarded as a similar problem with an extra constraint d i ¼ DÀ R s n h . The optimization model can be written as follows: subject to Using this optimization model, we can find the optimal lifetime of the WSN under certain given number of sensors, and the optimal value of n h is obtained at 16 (see the blue dotted line in Fig 4(a)). The optimal lifetime of the network does not always increase along with the number of sensors, because the reduced energy consumption from a decrease in transmission distance is offset by the increased energy consumption from transmitting the additional sensing data monitored by excessive SNs. The blue crosses in Fig 4(b) presents the optimal node deployment. To avoid the energy-hole problem, the distances between adjacent SNs are smaller for the nodes closer to the BS.
As the importance of considering the retransmission in the lifetime optimization problem has been verified in our previous studies (see [35,36]). Here, we focus on comparing the optimal lifetimes using our model that considering the discrete power control and the ones under the continuous power model . Fig 4(a) shows the big difference of optimal lifetimes using discrete and continuous power models. From the red solid line, we can see that the optimal value of n h is obtained at 15 with the continuous power model, and the corresponding optimal deployment is shown as red stars in Fig 4(b). One can see that the optimal results are quite different. Using the optimal node deployment obtained with the continuous power model (the red stars in Fig 4(b)), the actual network lifetime is only 14,429 hours (i.e., 601.2 days). This result is different from the optimal lifetime in Fig 4(a), as the nodes cannot truly adjust their output power continuously, and the continuous power model is substituted by the discrete one to find the actual lifetime. This actural lifetime is much shorter than the optimal lifetime of 16,031 hours (i.e., 668.0 days) obtained directly with the discrete power model. The large difference shows the importance of using an accurate power model in the deployment-based lifetime optimization.  the discrete power model. However, if the optimal uniform deployment scheme obtained with the continuous power model is used for a WSN whose nodes actually use a discrete power model, the network lifetime is only 10,256 hours-181 hours shorter than the optimal lifetime obtained based on the discrete power model itself. Moreover, the WSN lifetime can be noticeably improved using the non-uniform deployment scheme. The optimal lifetime of a WSN with uniformly deployed nodes is 10,438 hours; however, the lifetime can be increased to 16,031 hours using the nonuniform deployment scheme (i.e., the network can live 7.8 months longer under the non-uniform deployment). Note that a black rectangle in Fig 4(c) means that the deployment under such number of nodes cannot satisfy the constraint of the transmission success rate. In this figure, the lifetime of a uniformly deployed WSN is not a continuous curve, because the power consumed under different transmission distances also has a stepwise function.

Two-tiered example
In this example, MICA2 motes with CC1000 chips are used as SNs, and CC1101 chips are used as the radio modules of the RNs. In a two-tiered linear WSN, an SN transmits sensing data to its RN hop by hop; the sensing data is aggregated at the RNs into one (i.e., of m sd data), and the aggregated sensing data is then relayed to the BS by the RNs hop by hop. Because CC1101 chips use binary FSK modulation and are encoded by Manchester code, the retransmission rates for RNs can be calculated using Eq (1). As with the case presented in the one tiered example, the MAC protocol of the RNs adopts the CSMA/CA protocol without RTS/CTS and the zero-idle protocol. The transmission power and range for the CC1101 chip are listed in Table 5, and other RN parameters are shown in Table 6. The values of β 1 , β 2 , β 3 and β 4 were obtained using curve fitting with 95% confidence bounds.
According to the optimization model in the Method section, the optimization model in this case can be written as Similarly, when Cov Ã wsn ¼ 1, Con Ã wsn ¼ 1 and all m sd (i) = m sd , Eq (25) can be simplified to Based on the optimization model above, the optimal network lifetime with different numbers of RNs is illustrated in Fig 5(a). The optimal values for n h and n l are obtained at 4 and 13 with the discrete power model and at 2 and 13 with the continuous one, respectively. The optimal node deployments are illustrated in Fig 5(b). Similar to the one-tiered WSN, those nodes closer to the BS and/or RN are separated by smaller distances. If the optimal deployment scheme obtained with the continuous power model is used a WSN with nodes that truly use a discrete power model, the lifetime of the WSN will be 3,708.19 hours (i.e., 154.5 days) less than the optimal lifetime obtained by using the discrete model directly. In contrast, the optimal lifetime of the two-tiered WSN is 28,427.76 hours using the discrete power model, extending the optimal lifetime of the one-tiered network by 12,396.3 hours. This result clearly shows the effectiveness of using RNs to relay the sensing data. The optimal lifetime is obtained at n h = 3 and n l = 16 using either a discrete or continuous power model. However, one still can see that the two optimal curves under different RNs are quite different. For example, using the continuous power model, the optimal lifetime with 4 RNs is much longer than the one with 2 RNs, however, in reality, using the discrete power model, the two lifetimes are quite close.

Conclusions
In this study, both retransmission and discrete power control, which largely influence the lifetime of the WSN but usually ignored and substituted by the continues power model respectively, are considered in the deployment based network lifetime optimization problem. To maximize the lifetime of both one-tiered and two-tiered linear WSNs, optimization models are provided with considerations of coverage, connectivity and transmission success rate. The case study verifies the importance of considering retransmission and discrete transmit power levels in the deployment based lifetime optimization problem.
The contributions of our paper include the followings: (1) the energy consumption based lifetime model is developed using the discrete power model while considering the need for data retransmissions for linear WSNs, making the lifetime evaluation more realistic; (2) the constraints of the node deployment, including the coverage, the connectivity and the transmission success probability, are analyzed for both one tiered and two tiered linear WSNs, and generic computation models are provided for these three constraints; and (3) an optimization model is developed for the deployment based lifetime problem using the more realistic network lifetime evaluation method, and the optimal result provides a longer lifetime in practice.
This paper focused on linear WSNs. In a future extension, we plan to study deploymentbased lifetime optimization for WSNs with planar and hierarchical structures.