A novel communication system which simultaneously achieves the mobility of wireless communication and the low-power performance of wireline communication is developed with a printable sheet. By combining meter-scale wireline communication and micrometer-scale wireless capacitive-coupling communication, the proposed communication system enables multiple electronic objects scattered over tables, ...

a sensor network is made up of a large number of sensors with limited energy. sensors collect environmental data then send them to the sink. energy efficiency and thereby increasing the lifetime of sensor networks is important. direct transfer of the data from each node to the central station will increase energy consumption. previous research has shown that the organization of nodes in cluster...

This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete binary tree of height H is adjacent such that the communication of information in the organization becomes the most efficient. For a model of adding an edge between a node with a depth M and its descendant with a depth N , we formulated the total shortening distance ...

Abstract—This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete K-ary tree of height H is adjacent such that the communication of information in the organization becomes the most efficient. For a model of adding an edge between a node with a depth M and its descendant with a depth N, we formulated the total shortening di...

This paper is intended as a summary of combinatorial and computational properties of a Diameterconstrained network reliability model. Classical network reliability models are based on the existence of end-toend paths between network nodes, not taking into account the length of these paths; for many applications this is inadequate because the connection will only be established or attain the req...

Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a Group-based Shortest Path Routing algorithm (GSR) for the HCCR. Network properties of HCCR are compared with Spidergon, THIN, 2-D Mesh and Hypercube. It is shown that...

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearestneighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the “proximity” or the “distance” between any two nodes in the graph. To that en...

We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication and computation time. Broadcasting algorithm may run on one-port communication model of hypercube and is suitable for both the asynchronous (MIMD, or distributed) and synchronous (SIMD, or parallel) hypercube models. Routing and broadcasting procedures have optimal d...

For any xed rational parameter t 1, a (tree) t{spanner of a graph G is a spanning subgraph (tree) T in G such that the distance between every pair of vertices in T is at most t times their distance in G. General t{spanners and their variants have multiple applications in the eld of communication networks, distributed systems, and network design. In this paper, we combine the two concepts of sim...