Interval based transaction record keeping mechanism for adaptive 3d network-on-chip routing

Due to technology scaling, network-on-chip (NoC) become the viable solution for on-chip many-core systems. The most critical concern of NoC is congestion management caused due to heavy communication traffic between nodes. Without an appropriate congestion resolution strategy for reducing heavy in-network traffic, the efficiency of the entire network is damaged severely. In this paper, an interval based record-keeping mechanism is presented to reduce network traffic and congestion by maintaining a history table and previous packet transaction records at each node. Proposed method performs certain validity checks before allowing using previous transaction record from history table. The performance of the technique is investigated in terms of average delay and compared to the state-of-the-art routing algorithms using the Access Noxim simulator. The simulation results demonstrate that the proposed method has outperformed in terms of global average delay, with 8-12% improvement, the average number of hits is 26-61% greater than misses under different synthetic traffic. The proposed algorithm has been tested under various topological configurations for efficiency evaluation

Survey on end to end congestion control techniques in different network scenarios

Most of the traffic on the Internet is depend upon the Transmission Control Protocol (TCP), so the performance of TCP is directly related to Internet. Many TCP variants are developed and modified according to the environment and communication needs. Most of current TCP variants have set of algorithms which control the congestion in critical situations and maintain the throughput and efficiency of network. Now a day’s TCP is facing fast growth of Internet with the demands of faster data communication techniques on high speed links. In last 15 years many computer systems and cellular networks become linked together with protocol stack used in TCP. TCP variants with different congestion control techniques are working in different operating systems but a very small number of techniques are able to minimize the congestion in the network. This paper presents a survey on end-to-end congestion control techniques used in different TCP versions. The main purpose of this study is to review the characteristics and behavior of TCP variants with different techniques to control the congestion in the different network scenarios

Secure and authenticated key agreement protocol with minimal complexity of operations in the context of identity-based cryptosystems

Recently, a large variety of Identity-Based Key Agreement protocols have tried to eliminate the use of Bilinear Pairings in order to decrease complexity of computations through performing group operations over Elliptic Curves. In this paper we propose a novel pairing-free Key Agreement protocol over elliptic curve based algebraic groups. The results show that our proposed protocol is significantly less complex than related works from complexity of computation perspective

A performance improved certificateless key agreement scheme over elliptic curve based algebraic groups

Due to the importance of key in providing secure communication, various Key Agreement protocols have been proposed in the recent years. The latest generation of Public Key Cryptosystems (PKC) called Certificateless PKC played an important role in the transformation of Key Agreement protocols. In this scientific area, several Key Agreement protocols have been proposed based on Bilinear Pairings. However, pairing operation is known as an expensive cryptographic function. Hence, utilization of pairing operation in the mentioned works made them complex from overall computational cost perspective. In order to decrease the computational cost of Key Agreement protocols, several Certificateless Key Agreement protocols have been proposed by the use of operations over Elliptic Curve based Algebraic Groups instead of using Bilinear Pairings. In this paper, we propose a Pairing-free Certificateless two-party Key Agreement protocol. Our results indicate that our secure protocol is significantly more lightweight than existing related works

Dynamic mobile anchor path planning for underwater wireless sensor networks

In an underwater wireless sensor network (UWSN), the location of the sensor nodes plays a significant role in the localization process. The location information is obtained by using the known positions of anchor nodes. For underwater environments, instead of using various static anchor nodes, mobile anchor nodes are more efficient and cost-effective to cover the monitoring area. Nevertheless, the utilization of these mobile anchors requires adequate path planning strategy. Mzost of the path planning algorithms do not consider irregular deployment, caused by the effects of water currents. Consequently, this leads towards the inefficient energy consumption by mobile anchors due to unnecessary transmission of beacon messages at unnecessary areas. Therefore, an efficient dynamic mobile path planning (EDMPP) algorithm to tackle the irregular deployment and non-collinear virtual beacon point placement, targeting the underwater environment settings is presented in this paper. In addition, EDMPP controls the redundant beacon message deployment and overlapping, for beacon message distribution in mobile assistant localization. The simulation results show that the performance of the EDMPP is improved by increasing the localization accuracy and decreasing the energy consumption with optimum path length

Road-based multi-metric forwarder evaluation for multipath video streaming in urban vehicular communication

In video streaming over vehicular communication, optimal selection of a video packet forwarder is a daunting issue due to the dynamic nature of Vehicular Ad-hoc NETworks (VANETs)and the high data rates of video. In most of the existing studies, extensive considerations of the essential metrics have not been considered. In order to achieve quality video streaming in vehicular network, important metrics for link connectivity and bandwidth efficiency need to be employed to minimize video packet error and losses. In order to address the aforementioned issues, a Road-based Multi-metric Forwarder Evaluation scheme for Multipath Video Streaming (RMF-MVS) has been proposed. The RMF-MVS scheme is adapted to be a Dynamic Self-Weighting score (DSW) (RMF-MVS+DSW) for forwarder vehicle selection. The scheme is based on multipath transmission. The performance of the scheme is evaluated using Peak Signal to Noise Ratio (PSNR), Structural SIMilarity index (SSIM), Packet Loss Ratio (PLR) and End-to-End Delay (E2ED) metrics. The proposed scheme is compared against two baseline schemes including Multipath Solution with Link and Node Disjoint (MSLND) and Multimedia Multi-metric Map-aware Routing Protocol (3MRP) with DSW (3MRP+DSW). The comparative performance assessment results justify the benefit of the proposed scheme based on various video streaming related metrics

Image encryption algorithm based on chaotic mapping

Images are routinely used in diverse areas such as medical, military, science, engineering, art, entertainment, advertising, education as well as training. With the increasing use of digital techniques for transmitting and storing images, the fundamental issue of protecting the confidentiality, integrity as well as the authenticity of images has become a major concern. This paper discusses an alternative symmetric-key encryption algorithm for securing images, namely Secure Image Encryption (SIP) that is based on chaos. Unlike other popular encryption algorithms such as Triple-DES and IDEA, SIP manipulates pixels rather than bits. Generally, SIP comprises of three main components: (1) horizontalvertical transformation function (HVT); (2) shift function (S), and (3) gray scale function (GS). HVT function is based on a two-dimensional chaotic map that utilized Baker’s map algorithm. GS function extends the algorithm to three-dimension, whereby, the third dimension refers to the level of the grayscale of a pixel. The algorithm supports two modes of operation namely Electronic Code Book (ECB) and Cipher Block Chaining (CBC). From the analysis done, SIP manage to encrypt images of various sizes even with the usage of weak keys that exist in Baker’s map encryption algorithm

Thermal-aware dynamic weighted adaptive routing algorithm for 3D network-on-chip

3D Network-on-Chip NoC based systems have severe thermal problems due to the stacking of dies and disproportionate cooling efficiency of different layers. While adaptive routing can help with thermal issues, current routing algorithms are either thermally imbalanced or suffer from traffic congestion. In this work a novel thermal aware dynamic weighted adaptive routing algorithm has been proposed that takes traffic and temperature information into account and prevents packets being routed across congested and thermally aggravated areas. Dynamic weighted model will consider parameters related to congestion and thermal issues and provide a balanced suitable approach according to the current scenario at each node. The efficiency of the proposed algorithm is analyzed and evaluated with state-of-the-art thermal-aware routing algorithms using a simulation environment. Results obtained from the simulation shows that the proposed algorithm has performed better in terms of global average delay with 17-33 percent improvement and better thermal profiling under various synthetic traffic conditions