Computing diameter constrained reliability of a network with junction points

Over the past few years wireless sensor networks applications have evolved from a stage where these networks were designed in a technology-dependent manner to a stage where some conceptual understanding issues now exist. As wireless sensor networks are deployed, energy consumption emerges as a core requirement. Recent advances in energy harvesting technology for wireless devices have increased the lifetime and performance of wireless sensor node. It is useful to get a tradeoff between the duration of energy harvesting and network reliability. Previous investigations are mostly focused on duty cycle optimizing. An interrelation of energy harvesting schedule and network reliability has not been considered. To fill this gap we formulate optimizing problems for operation strategy of Energy Harvesting Wireless Sensor Networks. A problem solving approach is considered as well.

show abstract

“…a polynomial time algorithm can be applied. In general case, proper approximation technique has to be used [12]- [14].…”

Section: Else Go Tomentioning

confidence: 99%

Operation strategy for energy harvesting wireless sensor networks

Shakhov¹,

Migov²,

Rodionov³

2015

Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication

View full text Add to dashboard Cite

show abstract

“…In our previous work [10] we have obtained the method for computing R d s,t (G), which based on graph decomposition into biconnected components. Suppose that graph G includes junction node x dividing the graph in two G1 and G2 subgraphs ( fig.…”

Section: Using Junction Nodesmentioning

confidence: 99%

“…The best known method of computation for the wellstudied reliability measure, the probability of graph connectivity, is the factoring method [6,1]. Our main results on the subject are presented in [7,8,9,10]. In [2] the modification of factoring method is proposed for calculating a probabilistic connectivity with the diameter constraint.…”

Section: Introductionmentioning

confidence: 99%

Decomposing graph with 2-node cuts for diameter constrained network reliability calculation

Migov

Rodionov

2013

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

View full text Add to dashboard Cite

We consider a network with unreliable communication channels and perfectly reliable nodes. The diameter constrained reliability for such a network is defined as a probability that a set of terminals of a network are linked by operational paths with number of included edges less or equal to given integer. The problem of computing this characteristic is known to be NP-hard, just like the problem of computing the probability of a network connectivity. We propose a new method that allows using node cuts to compute the reliability of a two-terminal network with diameter constraints, which makes the computations faster.

show abstract

“…Further on, under the network reliability will be assumed this index, unless stated otherwise. This measure is quite well examined, various exact and approximate reliability calculation methods have been proposed [3][4][5][6][7].…”

Section: Imcom'15mentioning

confidence: 99%

Speeding up of genetic algorithm for network topology optimization with use of cumulative updating of network reliability

Nechunaeva

Migov

2015

Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication

View full text Add to dashboard Cite

Network optimization problems in conditions of constraints are NP-hard problems mostly. Genetic Algorithms are applicable solution for network structure optimization and for obtaining good results within acceptable periods of time.In this study we consider the problem of network topology optimization with unreliable communication channels and perfectly reliable nodes in order to obtain the most reliable structure. The problem of reliability computing for such networks is NP-hard so exact algorithm demands enormous computational effort. However, the method based on cumulative updating of lower and upper bounds of network reliability allows to decide the feasibility of a given network without performing exhaustive calculation of reliability. Relying on this technique we propose a new method which speed up network optimization process by the genetic algorithm.

show abstract

Computing diameter constrained reliability of a network with junction points

Cited by 14 publications

References 5 publications

Operation strategy for energy harvesting wireless sensor networks

Operation strategy for energy harvesting wireless sensor networks

Decomposing graph with 2-node cuts for diameter constrained network reliability calculation

Speeding up of genetic algorithm for network topology optimization with use of cumulative updating of network reliability

Contact Info

Product

Resources

About