No abstract

No abstract

Due to the ever-increasing complexity of System on Chip (SoC) design, and non-efficiency of electric bus to exchange data between IP cores in Giga scale, the Network on Chip (NoC) is presented with more flexible, scalable and reliable infra-structure. As mapping of IP cores on a given platform is one of three aspects of NoC design, with the focus on tile-based NoC architecture, we have introduced a heuristic method for mapping cores on mesh platform. Onyx 1 algorithm is a method with less complexity, and it minimizes hop count between IP cores, leading to improving energy consumption and other performance parameters. We have used this method with two real applications, i.e. VOPD 2 , and MPEG-4 and compared it with some existing algorithms. The results show that our developed method is more efficient. Keywords: Network on Chip, topology, mapping, core graph, NoC architecture graph, communication cost, bandwidth constraints Classification: Integrated circuits References[1] S. Kumar, A. Jantsch, J. P. Sonioen, M. Forsell, M. Millberg, J. Oeberg, K. Tiensirja, and A. Hemani, "A network on chip architecture and design methodology," IEEE Symp.

Cooperation between nodes is an effective technology for network throughput in the Internet of Things. The nodes that do not cooperate with other nodes in the network are called selfish and malicious nodes. Selfish nodes use the facilities of other nodes of the network for raising their interests. But malicious nodes tend to damage the facilities of the network and abuse it. According to reviews of the previous studies, in this paper, a mechanism is proposed for detecting the selfish and malicious nodes based on reputation and game theory. The proposed method includes three phases of setup and clustering, sending data and playing the multi-person game, and update and detecting the selfish and malicious nodes. The process of setup and clustering algorithm are run in the first phase. In the second phase, the nodes of each cluster cooperate with each other in order to execute an infinite repeated game while forwarding their own or neighbor nodes' data packets. In the third phase, each node monitors the operation of its neighbor nodes for sending the data packets, and the process of cooperation is analyzed for determining the selfish or malicious nodes which forwarded the data packets with delay or even not sent them. The other nodes reduce the reputation of the nodes which does not cooperate with them, and they do not cooperate with the selfish and malicious nodes, as punishment. So, selfish and malicious nodes are stimulated to cooperate. The results of simulation suggest that the detection accuracy of the selfish and malicious nodes has been increased by an average of 12% compared with the existing methods, and the false-positive rate has been decreased by 8%.

No abstract