Maximum Lifetime Problem in Sensor Networks with Limited Channel Capacity

Lipiński, Zbigniew

doi:10.1007/978-3-319-39630-9_13

Cited by 2 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. We show that for one dimensional, regular sensor network L N with the data transmission cost energy matrix of the form (12) there exists an equal energy solution of the maximum lifetime broadcasting problem for the nodes which are inside the network, i.e. i 2 ½2; N À 1, and non equal energy solution for the border nodes, i ¼ 1; N of L N .…”

Section: Solution Of the Mlb Problem In One Dimensional Networkmentioning

confidence: 99%

“…The solution of the maximum lifetime broadcasting problem (11), with the data cost energy matrix of the form (12), when the data is broadcasted by the k-th node, k 2 ½2; N À 1, is an equal energy solution and it is given by the N transmission trees T r , r 2 ½1; N …”

Section: Theoremmentioning

confidence: 99%

“…Namely, if each node of the network has a battery with the initial energy E 0 , then by finding the optimal energy utilization of each node in one cycle of network lifetime E opt i we can determine the number of cycles N cycles ¼ ½ E 0 E opt i 0 the network can perform its functions until the most overloaded node i 0 runs out of its energy. Various aspects of the lifetime problem in wireless sensor networks were discussed in the literature [6][7][8][9][10][11][12]. In [6] the maximum lifetime broadcasting problem in sensor networks with mobile nodes was analyzed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission

Lipiński

2018

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

In the article we discuss solutions of the maximum lifetime broadcasting problem in wireless sensor networks. Due to limited energy resources of the network nodes to find an optimal transmission route of the broadcasted data we minimize the maximum energy consumed by the nodes. We give an analytical solution of the problem in one dimensional regular sensor network for the point-to-point and point-to-multipoint data transmission scheme. We show that in such a network, when the cost of data transmission is a polynomial function of distance between transmitter and receiver, there exist solutions with an equal energy, i.e., all nodes of the network consume the same amount of energy. We assume that in the networks with sensors evenly distributed over some d-dimensional area there always exists an equal energy solution of the problem. To solve the maximum lifetime broadcasting problem in such networks we propose two algorithms. By means of the first algorithm the set of minimum node weight spanning trees in a given network is determined. The second algorithm allows to balance the energy consumption of the sensors for data transmitted along given minimum node weight spanning tree. We show, that the proposed algorithms find an approximate solution of the discussed problem in polynomial time.

show abstract

Section: Solution Of the Mlb Problem In One Dimensional Networkmentioning

confidence: 99%

Section: Theoremmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission

Lipiński

2018

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

show abstract

Stability Analysis of Routing Strategies for the Maximum Lifetime Problem in One-Dimensional Ad-Hoc Wireless Networks

Lipiński

2017

Advances on P2P, Parallel, Grid, Cloud and Internet Computing

Self Cite

View full text Add to dashboard Cite

We solve the maximum lifetime problem for a one-dimensional, regular ad-hoc wireless network with one data collector L N for any data transmission cost energy matrix which elements E i,j are superadditive functions, i.e., satisfy the inequality ∀ i≤j≤k E i,j +E j,k ≤ E i,k . We analyze stability of the solution under modification of two sets of parameters, the amount of data Q i , i ∈ [1, N ] generated by each node and location of the nodes x i in the network. We assume, that the data transmission cost energy matrix E i,j is a function of a distance between network nodes and thus the change of the node location causes change of E i,j . We say, that a solution q(t 0 ) of the maximum network lifetime problem is stable under modification of a given parameter t 0 in the stability region U (t 0 ), if the data flow matrix q(t) is a solution of the problem for any t ∈ U (t 0 ). In the paper we estimate the size of the stability region U (Q 0 , d 0 ) for the solution of the maximum network lifetime problem for the L N network in the neighborhoods of the pointsdescribes the shift of the nodes from their initial locationpartition', the second metric discussed in [3]. In this paper we utilize the fifth metric defined in [3], and we will minimize the maximum node costFor a one-dimensional, ad-hoc networks the metrics 'time to network partition' and 'the maximum node cost' are equivalent because the cutset, a set of nodes the removal of which will cause the network to partition, [4], consists of all nodes of the network. This means that obtained results in this paper are valid for network lifetime problems discussed in [1] and [2]. General formulation of the problem of extending the network lifetime depends on a number of initial parameters which characterize the nodes activity, available resources, the network environment or topology. It is known, that solutions of the problem are very sensitive under change of these parameters, [2]. In general even, if we know an exact solution of a given optimization problem there is a need to investigate its stability under change of these initial parameters to understand the structure of the solution and limitations of its applications, [5], [6]. In wireless ad-hoc networks which characterize limited power of energy, for example in sensor networks, the nodes most of their energy utilize for data transmission and extension of the network lifetime is achieved by designing energy efficient transmission protocols. Knowledge about stability of the exact solution of the maximum network lifetime problem allows to understand limitations of implemented transmission protocols in such networks.In the paper we are considering stability of a solution of the maximum network lifetime problem for a one-dimensional, regular ad-hoc wireless network with one data collector L N . The nodes of the regular network L N are located at the points x i = i, i ∈ [0, N ] of a half-line, where at the point x 0 = 0 there is located a data collector. We investigate stability of the solution under changes of two sets of...

show abstract

Maximum Lifetime Problem in Sensor Networks with Limited Channel Capacity

Cited by 2 publications

References 16 publications

Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission

Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission

Stability Analysis of Routing Strategies for the Maximum Lifetime Problem in One-Dimensional Ad-Hoc Wireless Networks

Contact Info

Product

Resources

About