Displaying similar documents to “Sensor Location Problem for a Multigraph”

Localization in wireless sensor networks: Classification and evaluation of techniques

Ewa Niewiadomska-Szynkiewicz (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

Recent advances in technology have enabled the development of low cost, low power and multi functional wireless sensing devices. These devices are networked through setting up a Wireless Sensor Network (WSN). Sensors that form a WSN are expected to be remotely deployed in large numbers and to self-organize to perform distributed sensing and acting tasks. WSNs are growing rapidly in both size and complexity, and it is becoming increasingly difficult to develop and investigate such large...

Optimization schemes for wireless sensor network localization

Ewa Niewiadomska-Szynkiewicz, Michał Marks (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

Many applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Self-organization and localization capabilities are one of the most important requirements in sensor networks. This paper provides an overview of centralized distance-based algorithms for estimating the positions of nodes in a sensor network. We discuss and compare three approaches: semidefinite programming, simulated annealing and two-phase stochastic optimization-a...

Local dependency in networks

Miloš Kudělka, Šárka Zehnalová, Zdeněk Horák, Pavel Krömer, Václav Snášel (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network's nodes...

Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems

Grzegorz Chmaj, Krzysztof Walkowiak, Michał Tarnawski, Michał Kucharzak (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational...

On network models and the symbolic solution of network equations

Kurt Reinschke (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper gives an overview of the formulation and solution of network equations, with emphasis on the historical development of this area. Networks are mathematical models. The three ingredients of network descriptions are discussed. It is shown how the network equations of one-dimensional multi-port networks can be formulated and solved symbolically. If necessary, the network graph is modified so as to obtain an admittance representation for all kinds of multi-ports. N-dimensional...

On designing connected rapid transit networks reducing the number of transfers

Laureano Fernando Escudero, Susana Muñoz (2011)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network...

On designing connected rapid transit networks reducing the number of transfers

Laureano Fernando Escudero, Susana Muñoz (2012)

RAIRO - Operations Research

Similarity:

In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a...