ions of networks, called structures, are studied. A structure co nsists of a set of nodes and a set of lines, such that each line connects two nodes. Lin are considered undirected: if a pair of nodes (u, v) is connected by a line, so is (v, u). A path between a source node u and a destination node v is a set of nodes and lines (u = u0), e1, u1, e2, u2, en−1, un−1, en, (un = v), where each lineei connects the nodesui−1 andui. The path length is determined by the number of lines between the source and destination node; in the case above, the path is of length n. The distance between two nodes u andv is writtend(u, v) and is equal to the length of the shortest path betweenu andv. Note thatd(u, v) = 0 if and only if u = v. The size of a structure is equal to the number of nodes it contains. The degree of a nod e is the number of lines joined to it.

/pdf/structural-quality-of-service-in-large-scale-networks-2l2mh41rfy.pdf

Structural Quality of Service in Large-Scale Networks

In this article, the feasibility of realization of optimal circulant topologies in networks-on-chip was researched. The software for automating the synthesis of circulant topologies of various dimensions and of any number of generatrices is presented. The implemented methods to speed up the synthesis process, based on the properties of circulants, as well as improving the algorithm for calculation of the distance between nodes and caching the adjacency matrix to achieve an acceptable search speed, are proposed. The efficiency and correctness of the proposed algorithm were verified. The proposed algorithm and methods allow designing networks-on-chip with improved characteristics of diameter, average distance between nodes, edges count, and, as a result, reducing the area, occupied by network-on-chip, and other characteristics, in comparison with analogues based on other widespread regular topologies.

Development of a Universal Adaptive Fast Algorithm for the Synthesis of Circulant Topologies for Networks-on-Chip Implementations

Recently, nature-inspired techniques have become valuable tomany intelligent systems in different fields of technology and science. Among these techniques, Ant Systems (AS) have become a valuable technique for intelligent systems in different fields. AS is a computational system inspired by the foraging behavior of ants and intended to solve practical optimization problems. In this paper, we introduce the AntStar algorithm, which is swarm intelligence based. AntStar enhances the optimization and performance of an AS by integrating the AS and A* algorithm. Applying the AntStar algorithm to the single-source shortest-path problem has been done to ensure the efficiency of the proposed AntStar algorithm. The experimental result of the proposed algorithm illustrated the robustness and accuracy of the AntStar algorithm.

/pdf/antstar-enhancing-optimization-problems-by-integrating-an-rsoe76pcpt.pdf

AntStar: enhancing optimization problems by integrating an Ant System and A * algorithm

In this paper the comparison of modified chordal rings fourth nodal degree to sixth nodal degree has been given. In the first part of the paper analysis of chordal rings of sixth nodal degree has been presented. In the second part of the paper the comparison of the basic graphs parameters, diameter and average path length has been shown.

http://ieeexplore.ieee.org/iel5/4658782/4747505/04747574.pdf

Comparison of modified chordal rings fourth degree to chordal rings sixth degree

This paper presents an analysis of degree 5 chordal rings, from a network topology point of view. The chordal rings are mainly evaluated with respect to average distance and diameter. We derive approximation expressions for the related ideal graphs, and show that these matches the real chordal rings fairly well. Moreover, the results are compared to that of a reference graph which presents a lower bound for average distance and diameter among all regular graphs of degree 5. It turns out that this reference graph has significantly lower distances than the degree 5 chordal rings. Based on that, we suggest that future research could deal with either finding degree 5 topologies with average distance and diameter closer to these of the reference graph, or to develop more realistic bounds than those presented by these reference graphs.

Analysis of Degree 5 Chordal Rings for Network Topologies

Analysis of 4th Degree Chordal Rings.

In this paper, we present some results of long-term measurement in the 433 MHz, wireless telemetric network dedicated to watt-hour meter reading. The RSSI of received packets was measured by the sink. The sink was equipped with a half wave, 4 dBi antenna. Received and recorded data enabled us to make analysis of PER versus RSSI from all nodes within range of the sink, simultaneously. With knowledge of how many packets sink expected to receive, during the query and how long frames were, we propose the designation of the value of FER estimator. Lack of relationship between FER and frame length prompted us to investigate errors at bits level. Both the sink and other nodes were equipped with CC1101 low power RF transceiver. The paper concludes with the areas of the results application.

Antoni Zabludowski

Papers

Analysis of 4th Degree Chordal Rings.

Comparison of modified chordal rings fourth degree to chordal rings sixth degree

Analysis of Degree 5 Chordal Rings for Network Topologies

Errors Nature in Indoors Low Power 433 MHz Wireless Network

Analysis of transmission properties of 3rd degree chordal rings