Adil Erzin | Novosibirsk State University (original) (raw)

Papers by Adil Erzin

Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication - IMCOM '16, 2016

2015 Twelve International Conference on Electronics Computer and Computation (ICECCO), 2015

Most network-based multimedia applications require multicasting with constraintssuch as bandwidth... more Most network-based multimedia applications require multicasting with constraintssuch as bandwidth and delay in order to support group communicationand their quality of services (QoS). This can be considered as the problem ofconstructing a multicast tree with delay and bandwidth constraints over a givennetwork topology.This paper proposes a novel algorithm to solve this problem with a smallpolynomial time complexity. The algorithm covers

International Conference on Information, Communications and Signal Processing, 1997

We propose a novel polynomial algorithm for constructing a min-cost communication tree to connect... more We propose a novel polynomial algorithm for constructing a min-cost communication tree to connect the subset of network nodes which forms the multicast group of destinations in such way that the delays along each path from the source vertex to the sinks do not exceed the given delay bounds. From the mathematical point of view this is a Steiner tree

Proceedings of the 2nd international conference on Ubiquitous information management and communication - ICUIMC '08, 2008

Page 1. Maximizing Lifetime for a Sensor Network Adil I. Erzin Sobolev Institute of Mathematics R... more Page 1. Maximizing Lifetime for a Sensor Network Adil I. Erzin Sobolev Institute of Mathematics Russian Academy of Sciences Novosibirsk, Russia +7-383-333-3788adil@math.nsc.ru Vyacheslav V. Zalyubovskiy Sobolev Institute ...

Lecture Notes in Computer Science, 2011

A problem of min-density covering of a stripe by the disks of one, two and three radii is conside... more A problem of min-density covering of a stripe by the disks of one, two and three radii is considered. New regular covers are proposed and studied. The developed methods and the obtained results are important theoretically and may be used as a tool for power-efficient monitoring of lengthy objects by sensor networks.

The problem of power-efficient regular covering of a plane region by sensors with two adjustable ... more The problem of power-efficient regular covering of a plane region by sensors with two adjustable sensing ranges is considered. We improve and strengthen previously known results on the properties of covers as well as optimize the total energy consumption for sensing and data transmission between the elements of a sensor network. From the mathematical point of view, we formulate and solve several problems of covering the plane by discs as in the classical papers of L. F. Toth about arrangement on the plane. The considered problems relate to special types of covers but give also some sense of the general case.

From the introduction: Self-organizing models are under study, in particular, models in conflict ... more From the introduction: Self-organizing models are under study, in particular, models in conflict theory. For fixed strategies of the players, we find limit states of the system; in particular, we look for Nash equilibrium limit states. We propose an iterative method for analytical derivation of limit and equilibrium states.

In applications such as design of integrated circuits (chips), it is sometimes required to connec... more In applications such as design of integrated circuits (chips), it is sometimes required to connect the terminals (receivers) and the central vertex (source) by a weight-minimal tree where the signal delays between the source and the terminals are the same or differ by a minimal value. Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminals for which these conditions are not satisfied, and a new polynomial algorithm to determine an approximate solution were presented.

Lecture Notes in Computer Science, 2011

Abstract. We consider a wireless sensor network's lifetime maximiza-tion problem as an integ... more Abstract. We consider a wireless sensor network's lifetime maximiza-tion problem as an integer linear programming problem when the redun-dant set of covers is given, and it is necessary to choose a lifetime of each cover subject to the limited sensor's resources. Irrespective of ...

Sensors, 2009

In wireless sensor networks, density control is an important technique for prolonging a network's... more In wireless sensor networks, density control is an important technique for prolonging a network's lifetime. To reduce the overall energy consumption, it is desirable to minimize the overlapping sensing area of the sensor nodes. In this paper, we study the problem of energy-efficient area coverage by the regular placement of sensors with adjustable sensing and communication ranges. We suggest a more accurate method to estimate efficiency than those currently used for coverage by sensors with adjustable ranges, and propose new density control models that considerably improve coverage using sensors with two sensing ranges. Calculations and extensive simulation show that the new models outperform existing ones in terms of various performance metrics.

Applied Mathematics and Computation, 2014

Routing is a very important step in VLSI physical design. A set of nets are routed under delay an... more Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of Oðn 2 log nÞ complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity Oðn 4 Þ and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed.

2011 Second International Conference on Emerging Applications of Information Technology, 2011

ABSTRACT The multi-net Global Routing Problem (GRP) is a problem of routing a set of nets subject... more ABSTRACT The multi-net Global Routing Problem (GRP) is a problem of routing a set of nets subject to resources and delay constraints. Many modern routers use FLUTE (Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design) as the basic method to construct Steiner trees. Here we first give another method MAD (Modified Algorithm Dijkstra) to construct timing-driven Steiner trees for each net. The Elmore delays of the trees constructed by MAD and FLUTE are almost same. Next we describe the Gradient algorithm which is used to reduce the congestion. We implemented our algorithm on ISPD 98 benchmarks and compared the wire length and maximum overflow of our router with Labyrinth Predictable Router. Our router performs better in terms of wire length and is much faster.

18th International Symposium on VLSI Design and Test, 2014

ABSTRACT The multi-net rectilinear Steiner tree construction with the objective of wirelength min... more ABSTRACT The multi-net rectilinear Steiner tree construction with the objective of wirelength minimization for routing in VLSI has received a lot of attention in the last few decades. And as it has been observed now that non-Manhattan routing reduces the wirelength more than the traditional Manhattan routing, the routing in alternate directions are gaining increased interest. But there has not been much work on timing-driven non-Manhattan routing. In this paper, we propose an Elmore delay based method for construction of uniform λ-geometry Steiner trees. Also we have used a strategy to reduce the set of Steiner points as only a small fraction of it actually remains in the final tree. We have implemented the algorithm for creating rectilinear and hexagonal Steiner trees on OR library benchmarks. Both delay and wirelength improvement of Y routing over M routing is observed. Using the reduced Steiner set, our algorithm runs quite fast on nets with large number of pins for which the existing methods even fail to generate a solution. Since our method is not dependent on the routing architecture, it can be applied to any uniform orientation.

In Proceedings of the 5-th Int. Conf. On VLSI and …, 1997

This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree o... more This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree of minimum total cost (the cost of the edge (i; j) equal to the rectilinear distance between these nodes) with di erent requirements on delays along each path to destination.

Most network-based multimedia applications require multicasting with constraintssuch as bandwidth... more Most network-based multimedia applications require multicasting with constraintssuch as bandwidth and delay in order to support group communicationand their quality of services (QoS). This can be considered as the problem ofconstructing a multicast tree with delay and bandwidth constraints over a givennetwork topology.This paper proposes a novel algorithm to solve this problem with a smallpolynomial time complexity. The algorithm covers not only the problem withuniform bandwidth and...

Optimization, 2013

The article considers models for monitoring a band with a preset width using sensor networks shap... more The article considers models for monitoring a band with a preset width using sensor networks shaped as disc covers. Every cover disc is a centred sensor operation area. The researchers determine a min-density band cover with the discs of one, two and three radii. The specific requirement for the cover is that the disc centres shall not be inside the band (external monitoring). Various efficient cover models are proposed and their characteristics are determined.

Optimization, 2013

ABSTRACT This paper is devoted to the construction of regular min-density plane coverings with el... more ABSTRACT This paper is devoted to the construction of regular min-density plane coverings with ellipses of one, two and three types. This problem is relevant, for example, to power-efficient surface sensing by autonomous above-grade sensors. A similar problem, for which discs are used to cover a planar region, has been well studied. On the one hand, the use of ellipses generalizes a mathematical problem; on the other hand, it is necessary to solve these types of problems in real applications of wireless sensor networks. This paper both extends some previous results and offers new regular covers that use a small number of ellipses to cover each regular polygon; these covers are characterized by having minimal known density in their classes and give the new upper bounds for densities in these classes as well.

Automation and Remote Control, 2000

For the problem arising in the design of integrated chips, an efficient heuristic approach was pr... more For the problem arising in the design of integrated chips, an efficient heuristic approach was proposed. It unites the stages of placing the logical elements (devices) on the chip and performing their detailed routing. At that, it minimizes both the critical (maximum) delay and the chip area required for routing.

Automation and Remote Control, 2009

Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication - IMCOM '16, 2016

2015 Twelve International Conference on Electronics Computer and Computation (ICECCO), 2015

Most network-based multimedia applications require multicasting with constraintssuch as bandwidth... more Most network-based multimedia applications require multicasting with constraintssuch as bandwidth and delay in order to support group communicationand their quality of services (QoS). This can be considered as the problem ofconstructing a multicast tree with delay and bandwidth constraints over a givennetwork topology.This paper proposes a novel algorithm to solve this problem with a smallpolynomial time complexity. The algorithm covers

International Conference on Information, Communications and Signal Processing, 1997

We propose a novel polynomial algorithm for constructing a min-cost communication tree to connect... more We propose a novel polynomial algorithm for constructing a min-cost communication tree to connect the subset of network nodes which forms the multicast group of destinations in such way that the delays along each path from the source vertex to the sinks do not exceed the given delay bounds. From the mathematical point of view this is a Steiner tree

Proceedings of the 2nd international conference on Ubiquitous information management and communication - ICUIMC '08, 2008

Page 1. Maximizing Lifetime for a Sensor Network Adil I. Erzin Sobolev Institute of Mathematics R... more Page 1. Maximizing Lifetime for a Sensor Network Adil I. Erzin Sobolev Institute of Mathematics Russian Academy of Sciences Novosibirsk, Russia +7-383-333-3788adil@math.nsc.ru Vyacheslav V. Zalyubovskiy Sobolev Institute ...

Lecture Notes in Computer Science, 2011

A problem of min-density covering of a stripe by the disks of one, two and three radii is conside... more A problem of min-density covering of a stripe by the disks of one, two and three radii is considered. New regular covers are proposed and studied. The developed methods and the obtained results are important theoretically and may be used as a tool for power-efficient monitoring of lengthy objects by sensor networks.

The problem of power-efficient regular covering of a plane region by sensors with two adjustable ... more The problem of power-efficient regular covering of a plane region by sensors with two adjustable sensing ranges is considered. We improve and strengthen previously known results on the properties of covers as well as optimize the total energy consumption for sensing and data transmission between the elements of a sensor network. From the mathematical point of view, we formulate and solve several problems of covering the plane by discs as in the classical papers of L. F. Toth about arrangement on the plane. The considered problems relate to special types of covers but give also some sense of the general case.

From the introduction: Self-organizing models are under study, in particular, models in conflict ... more From the introduction: Self-organizing models are under study, in particular, models in conflict theory. For fixed strategies of the players, we find limit states of the system; in particular, we look for Nash equilibrium limit states. We propose an iterative method for analytical derivation of limit and equilibrium states.

In applications such as design of integrated circuits (chips), it is sometimes required to connec... more In applications such as design of integrated circuits (chips), it is sometimes required to connect the terminals (receivers) and the central vertex (source) by a weight-minimal tree where the signal delays between the source and the terminals are the same or differ by a minimal value. Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminals for which these conditions are not satisfied, and a new polynomial algorithm to determine an approximate solution were presented.

Lecture Notes in Computer Science, 2011

Abstract. We consider a wireless sensor network's lifetime maximiza-tion problem as an integ... more Abstract. We consider a wireless sensor network's lifetime maximiza-tion problem as an integer linear programming problem when the redun-dant set of covers is given, and it is necessary to choose a lifetime of each cover subject to the limited sensor's resources. Irrespective of ...

Sensors, 2009

In wireless sensor networks, density control is an important technique for prolonging a network's... more In wireless sensor networks, density control is an important technique for prolonging a network's lifetime. To reduce the overall energy consumption, it is desirable to minimize the overlapping sensing area of the sensor nodes. In this paper, we study the problem of energy-efficient area coverage by the regular placement of sensors with adjustable sensing and communication ranges. We suggest a more accurate method to estimate efficiency than those currently used for coverage by sensors with adjustable ranges, and propose new density control models that considerably improve coverage using sensors with two sensing ranges. Calculations and extensive simulation show that the new models outperform existing ones in terms of various performance metrics.

Applied Mathematics and Computation, 2014

Routing is a very important step in VLSI physical design. A set of nets are routed under delay an... more Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of Oðn 2 log nÞ complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity Oðn 4 Þ and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed.

2011 Second International Conference on Emerging Applications of Information Technology, 2011

ABSTRACT The multi-net Global Routing Problem (GRP) is a problem of routing a set of nets subject... more ABSTRACT The multi-net Global Routing Problem (GRP) is a problem of routing a set of nets subject to resources and delay constraints. Many modern routers use FLUTE (Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design) as the basic method to construct Steiner trees. Here we first give another method MAD (Modified Algorithm Dijkstra) to construct timing-driven Steiner trees for each net. The Elmore delays of the trees constructed by MAD and FLUTE are almost same. Next we describe the Gradient algorithm which is used to reduce the congestion. We implemented our algorithm on ISPD 98 benchmarks and compared the wire length and maximum overflow of our router with Labyrinth Predictable Router. Our router performs better in terms of wire length and is much faster.

18th International Symposium on VLSI Design and Test, 2014

ABSTRACT The multi-net rectilinear Steiner tree construction with the objective of wirelength min... more ABSTRACT The multi-net rectilinear Steiner tree construction with the objective of wirelength minimization for routing in VLSI has received a lot of attention in the last few decades. And as it has been observed now that non-Manhattan routing reduces the wirelength more than the traditional Manhattan routing, the routing in alternate directions are gaining increased interest. But there has not been much work on timing-driven non-Manhattan routing. In this paper, we propose an Elmore delay based method for construction of uniform λ-geometry Steiner trees. Also we have used a strategy to reduce the set of Steiner points as only a small fraction of it actually remains in the final tree. We have implemented the algorithm for creating rectilinear and hexagonal Steiner trees on OR library benchmarks. Both delay and wirelength improvement of Y routing over M routing is observed. Using the reduced Steiner set, our algorithm runs quite fast on nets with large number of pins for which the existing methods even fail to generate a solution. Since our method is not dependent on the routing architecture, it can be applied to any uniform orientation.

In Proceedings of the 5-th Int. Conf. On VLSI and …, 1997

This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree o... more This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree of minimum total cost (the cost of the edge (i; j) equal to the rectilinear distance between these nodes) with di erent requirements on delays along each path to destination.

Most network-based multimedia applications require multicasting with constraintssuch as bandwidth... more Most network-based multimedia applications require multicasting with constraintssuch as bandwidth and delay in order to support group communicationand their quality of services (QoS). This can be considered as the problem ofconstructing a multicast tree with delay and bandwidth constraints over a givennetwork topology.This paper proposes a novel algorithm to solve this problem with a smallpolynomial time complexity. The algorithm covers not only the problem withuniform bandwidth and...

Optimization, 2013

The article considers models for monitoring a band with a preset width using sensor networks shap... more The article considers models for monitoring a band with a preset width using sensor networks shaped as disc covers. Every cover disc is a centred sensor operation area. The researchers determine a min-density band cover with the discs of one, two and three radii. The specific requirement for the cover is that the disc centres shall not be inside the band (external monitoring). Various efficient cover models are proposed and their characteristics are determined.

Optimization, 2013

ABSTRACT This paper is devoted to the construction of regular min-density plane coverings with el... more ABSTRACT This paper is devoted to the construction of regular min-density plane coverings with ellipses of one, two and three types. This problem is relevant, for example, to power-efficient surface sensing by autonomous above-grade sensors. A similar problem, for which discs are used to cover a planar region, has been well studied. On the one hand, the use of ellipses generalizes a mathematical problem; on the other hand, it is necessary to solve these types of problems in real applications of wireless sensor networks. This paper both extends some previous results and offers new regular covers that use a small number of ellipses to cover each regular polygon; these covers are characterized by having minimal known density in their classes and give the new upper bounds for densities in these classes as well.

Automation and Remote Control, 2000

For the problem arising in the design of integrated chips, an efficient heuristic approach was pr... more For the problem arising in the design of integrated chips, an efficient heuristic approach was proposed. It unites the stages of placing the logical elements (devices) on the chip and performing their detailed routing. At that, it minimizes both the critical (maximum) delay and the chip area required for routing.

Automation and Remote Control, 2009