Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

wireless sensor networks, due to the characteristics of sensors such as wireless communication channels, the lack of infrastructure and targeted threats, are very vulnerable to the various attacks. routing attacks on the networks, where a malicious node from sending data to the base station is perceived. in this article, a method that can be used to transfer the data securely to prevent attacks...

It is known (see e.g. [2], [4], [5], [6]) that continuous variations in the entries of a complex square matrix induce its eigenvalues. If such variation arises from one real parameter α∈[0,1], then eigenvalues follow paths plane as α shifts 0 to 1. The intent here study nature these eigenpaths, including their behavior under small perturbations variations, well resulting eigenpairings matrices ...

In this contribution, current developments in packet-based HD-voice communication are summarized. Moreover, the, usually problematic, issue of interoperability with the already installed infrastructure is addressed. Therefore, several algorithmic approaches—including embedded coding, receiveror network-based parameter estimation, and steganographic parameter transmission—are discussed based on ...

Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the ...

between source and destination satisfying the QoS requirements which efficiently using the network resources and underlying routing algorithm and to find low-cost paths that satisfy given QoS constraints. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining feasible path that satisfies a number of QoS constraints. We present a Optimized Multi-Constraine...

For n ∈ N and D ⊆ N, the distance graph P n has vertex set {0, 1, . . . , n− 1} and edge set {ij | 0 ≤ i, j ≤ n − 1, |j − i| ∈ D}. Note that the important and very well-studied circulant graphs coincide with the regular distance graphs. A fundamental result concerning circulant graphs is that for these graphs, a simple greatest common divisor condition, their connectivity, and the existence of ...