Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1110
An Efficient Novel Key Management Scheme for Enhancing User Authentication in A WSN
Статья научная
The Wireless Sensor Networks are energy constrained and are normally low cost and low power devices. These nodes are deployed over a specific area for specific goals. Due to energy and memory constraints, secure communication among these sensors is challenging management issue. In order to ensure security, proper connectivity among nodes and resilience against node capture, we propose a scheme called as Random Pre-Key distribution scheme which takes advantage of the binomial key pattern while creating and distributing keys. The value of keys would develop the number of patterns, which is given by the binomial distribution, which would be helpful in maintaining a key pool which is all though random in nature and following a pattern leads to more probability of network connection links. This paper provides a secured communication in WSNs environment and pairing user authentication has been proposed. We employ the idea of dividing the sensor network field into scattered nodes. Inside the scenario, one of the sensor nodes is selected as a server sensor node which is responsible for delivering the key. The novelty of the proposed scenario lies behind the idea of incorporating the sensor nodes along with the proper user authentications. We calculate the throughput involving a periodic traffic and obtained results from the xgraph utility with the use of Network Simulator. The results of this key scheme are obtained and show that improvement in terms of connectivity.
Бесплатно
An Efficient Position based Power Aware Routing Algorithm in Mobile Ad-hoc Networks
Статья научная
In this paper we introduced an efficient scheme based on a weighted metric of remaining battery power, speed and distance of nodes for determining routes in wireless Mobile Ad hoc Networks (MANET). For the cases where significant difference in the velocities of the communicating nodes or the battery power of the intermediate nodes is low, traditional schemes fail to establish the communication among nodes with reliable QoS. We proposed a new algorithm that uses weighted combination of metrics of distance, velocity and battery power in selecting the route over earlier MFR (Most Forward within Radius) method. The proposed scheme encompasses the load balancing issues and eventually it increases the network lifetime and network performance. Simulation experiment showed that the proposed algorithm reduces the packet loss than that of existing MFR algorithm. Experimental results also revealed that besides packet loss, the proposed strategy achieves higher throughput (14.35%) rate than that of existing MFR. Furthermore, usages of these new metrics ensure the higher mean time to node failure.
Бесплатно
An Efficient Route Failure Detection Mechanism with Energy Efficient Routing (EER) Protocol in MANET
Статья
Mobile ad-hoc network (MANET) is a network with two or more number of nodes with restricted energy constraint. The high dynamic nature in MANET attracts needs to consider the energy efficient features in their construct. The routing protocol is an important criterion to be considered for evaluating the performance of the MANET. Energy consumption plays vital role in MANET. Hence designing the scheme that supports energy efficient is much needed for the high dynamic MANET environment concerned. This paper proposes the Energy Efficient Routing (EER) protocol based on efficient route failure detection. The Scope of this paper is to suggest a fresh routing procedure for Mobile Ad-hoc Network minimizes unsuccessful communication. The projected procedure practices three important criterions to locate the path that assure authentic communication. The channel caliber, connection caliber and node’s residual energy is important reason for the failure of the node in MANET. Hence, the suggested routing mechanism believes these three different parameters to choose the finest node in the route. The reliable transmission and reception are attained by transferring information through route nominated by the suggested system verified by means of NS-2 simulator.
Бесплатно
An Efficient and Secure Blockchain Consensus Algorithm Using Game Theory
Статья научная
Blockchain technology is a decentralized ledger system that finds applications in various domains such as banking, e-governance, and supply chain management. The consensus algorithm plays a crucial role in any blockchain network as it directly impacts the network's performance and security. There have been several proposed consensus mechanisms in the literature, including Proof of Work (PoW), Proof of Stake (PoS), Robust Proof of Stake (RPoS), and Delegated Proof of Stake (DPoS). Both Ethereum and Bitcoin utilize the PoW consensus mechanism, where nodes compete to solve puzzles in order to generate blocks, consuming significant processing power. On the other hand, the PoS consensus mechanism selects miners based on the stakes they hold, making it more energy efficient. However, PoS has drawbacks such as vulnerability to coin age accumulation attacks and the potential for partial centralization. In this work, we present a consensus mechanism known as Delegated Proof of Stake with Downgrading Mechanism using Game Theory (DDPoS (GT)). This mechanism employs a two-step game strategy to divide nodes into strong and weak nodes, as well as attack and non-attack nodes. Later, the results of the two games are combined to enhance protocol efficiency and security. Experimental results using a private Ethereum-based network demonstrate that DDPoS (GT) performs better than PoS and DPoS in terms of transaction latency, average block waiting time, and fairness.
Бесплатно
An Encryption Technique based upon Encoded Multiplier with Controlled Generation of Random Numbers
Статья научная
This paper presents an encryption technique based on independent random number generation for every individual message sent based upon a pass key which depends upon a secured telephonic conversation and the starting time of the conversation. . A multiplier technique is then applied on the plain text in order to generate the cipher text. The world runs on ciphers today and the generation of secure keys for producing a cipher asks for more simplicity yet requires much more effective cryptosystems which could generate a cipher with the most minimal complexity. Vedic Mathematics in itself offers a wide variety of techniques for encrypting a text which even involves concepts of elliptical curves, Vedic multiplier and so on. The Vedic Multiplier system is used for encoding and decoding and here we have used it to encrypt plain texts and generate a certain kind of cipher based on some random sequence of character equivalents and partial products. The objective of this paper will always resound for the development of a unique system which will ensure secrecy and authenticity for the private communication between two entities. The proposed idea can be implemented for inter-office message communication.
Бесплатно
Статья научная
UASN (Underwater Acoustic Sensor Network) has intrinsic impediments, since it is utilized and utilizes acoustic signs to impart in the sea-going world. Examples include long delays in propagation, limited bandwidth, high transmitting energy costs, very high attenuation in the signal, expensive implementation and battery replacement etc. The UASN routing schemes must therefore take account of these features to achieve balance energy, prevent void hole and boost network life. One of the significant issue in routing is the presence of void node. A void node is a node that does not have any forwarder node. The presence of void may cause the bundle conveyance in the steering time which prompts information misfortune. The gap during steering influences the network execution regarding proliferation delay, vitality utilization and network lifetime, and so forth. So with the objective to remove the void node in the networks, this work presents an energy efficient optimal path routing for void avoidance in underwater acoustic sensor networks. This work uses the concept of gray wolf optimization algorithm to calculate the fitness function and that fitness function is used to select the best forwarder node in the networks. This work only consider the vertical directions which further reduces the end to end delay. The proposed work has been simulated on MATLAB and performances are evaluated in terms of broadcast copies of data, energy tax, and packet delivery ratio, number of dead nodes, network lifetime and delay.
Бесплатно
An Energy Efficient and Secure Clustering Protocol for Military based WSN
Статья научная
Less contiguous nature of military applications demands for surveillance of widespread areas that are indeed harder to monitor. Unlike traditional Wireless Sensor Networks (WSNs), a military based large size sensor network possesses unique requirements/challenges in terms of self-configuration, coverage, connectivity and energy dissipation. Taking this aspect into consideration, this paper proposes a novel, efficient and secure clustering method for military based applications. In any clustering based approach, one of the prime concerns is appropriate selection of Cluster Heads and formation of balanced clusters. This paper proposes and analyzes two schemes, Average Energy based Clustering (AEC) and Threshold Energy based Clustering (TEC). In AEC, a node is elected as Cluster Head (CH) if its residual energy is above the average energy of its cluster whereas in case of TEC, a node is elected as Cluster Head if its residual energy is above the threshold energy. Further, both AEC and TEC choose nodes as CHs if their distance lies within safety zone of the Base Station. In this paper, aim is to come up with a solution that not only conserves energy but balance load while electing safe nodes as CHs. The performance of proposed protocols was critically evaluated in terms of network lifetime, average residual energy of nodes and uniformity in energy dissipation of nodes. Results clearly demonstrated that AEC is successful in incorporating security whilst increasing overall lifetime of network, load balance and uniform energy dissipation.
Бесплатно
An Energy-Aware Data-Gathering Protocol Based on Clustering using AUV in Underwater Sensor Networks
Статья научная
Underwater Wireless Sensor Networks (UWSNs) consist of certain number of sensors and vehicles interacting with each other to collect data. In recent years, the use of Autonomous Underwater Vehicle (AUV) has improved the data delivery ratio and maximized the energy efficiency in UWSNs. Clustering is one of the effective techniques in energy management which increases the lifetime of these networks. One of the most important parameters in creating optimized clusters is the choice of appropriate cluster head (CH), which not only increases the lifetime of the network and the received data in the sink, but also reduces energy consumption. Clustering of networks was primary done via distributed methods in previous researches. It spends too much energy and also involves too many nodes in the clustering process and fades their main functionality, which is gathering data in sensor networks. It also causes more damping of the network. However, in the proposed protocol, instead of having them distributed by the network and the nodes, the stages of clustering and selecting the appropriate CH is the task of the AUV (Autonomous Underwater Vehicle). Since all the necessary measures to cluster in the network will be carried out by the AUV by this method, many control overheads in the process of clustering the network will be removed and energy consumption caused by nodes reduces significantly. With this method, the network scalability will also be manageable and under control. For simulating and implementing our method we mainly used the OPNET software. The results show that energy consumption of nodes in the proposed algorithm has been significantly improved compared to previous results.
Бесплатно
An Enhanced Dynamic Mutual Authentication Scheme for Smart Card Based Networks
Статья научная
Network security is the prevailing and challenging factor in computer communications. Computer security and communication security are interrelated and essential features in the internetworking system. Network security is ascertained by many factors like authentication, authorization, digital signatures, cryptography, steganography etc. Among them authentication is playing an important role in networked communications, where the communicating partners are to be identified each other legitimately. Authentication process ensures the legitimacy of the communicating partners in networked communication. In an authentication process, the originator of the communication and the respondent transact some identification codes to each other, prior to start of the message transaction. Several methods have been proposed regarding the authentication process for computer communication and smart card based networks from time to time. We introduced a new scheme to enhance and ensure the remote authentication through secure and dynamic authentication using a smart card, which is relatively a different approach. This scheme discusses the authentication procedure for smart card based network systems. This article introduces a dynamic authentication scheme, which includes a number of factors, among them the password, password index, and date of modification are important factors, which decide the dynamicity in authentication. The static approach authentication schemes are vulnerable to different types of attacks in networked communication. This dynamic authentication scheme ensures the authentication, confidentiality, reliability, integrity and security in network communications. This article discusses the implementation of this scheme and to analyze the security and performance factors to ensure the dynamic mutual authentication and to enhance the security features in authentication for smart card based networks.
Бесплатно
An Enhanced Process Scheduler Using Multi-Access Edge Computing in An IoT Network
Статья научная
Multi-access edge computing has the ability to provide high bandwidth, and low latency, ensuring high efficiency in performing network operations and thus, it seems to be promising in the technical field. MEC allows processing and analysis of data at the network edges but it has finite number of resources which can be used. To overcome this restriction, a scheduling algorithm can be used by an orchestrator to deliver high quality services by choosing when and where each process should be executed. The scheduling algorithm must meet the expected outcome by utilizing lesser number of resources. This paper provides a scheduling algorithm containing two cooperative levels with an orchestrator layer acting at the center. The first level schedules local processes on the MEC servers and the next layer represents the orchestrator and allocates processes to nearby stations or cloud. Depending on latency and throughput, the processes are executed according to their priority. A resource optimization algorithm has also been proposed for extra performance. This offers a cost-efficient solution which provides good service availability. The proposed algorithm has a balanced wait time (Avg) and blocking percentage (Avg) of 2.37ms and 0.4 respectively. The blocking percentage is 1.65 times better than Shortest Job First Scheduling (SJFS) and 1.3 times better than Earliest Deadline First Scheduling (EDFS). The optimization algorithm can work on many kinds of network traffic models such as uniformly distributed and base stations with unbalanced loads.
Бесплатно
Статья научная
In general, Vehicular Ad hoc Networks (VANETs) are permitting the communication between one vehicle with neighboring vehicles, infrastructure, and Road-Side Unit (RSU). In this, vehicle platoon is commonly known as the vehicle driving pattern it categorizes the batching of the vehicle in the on the trot fashion. It has been reviewed as an effective resolution to mitigate the reduction in traffic blockage and to widen the opulence of the travel. However, the malicious activities of any unauthorized person in VANET are increased the damage to authorized vehicles. In this manuscript, the Identity based Conditional Privacy-Preserving Authentication (ID-CPPA) signature scheme is proposed to detect the malignant command vehicle very efficiently by the consumer vehicle. In this, the proposed ID-CPPA method uses one-way hash functions for improving the efficiency of Road-Side Unit (RSU) signing and verification of a messages. In order to provide better concealment to the vehicle, Phase Truncated Fourier Transform based asymmetric encryption algorithm (PTFT-AE) is proposed. Thus, the proposed ID-CPPA-PTFT-AE approach has achieved 28.96%, 37.58%, 31.36% higher security rate and 25.8%, 37.9%, 42.6% lower delay than the existing MPDC-LPNS, PPSR-GS, and WCAA-TST methods respectively.
Бесплатно
An Extended Approach for Efficient Data Storage in Cloud Computing Environment
Статья научная
In recent years, the advent of online data storage services has been enabled users to save their data and operational programs in cloud databases. Using an efficient and intelligent management helps to optimize quality of provided services. Also it is possible to increase throughput of services by eliminating repeated data. In following article we have offered a completely dynamic approach to detect and eliminate duplicated data which exist in shared storage resources among virtual machines. Results of simulation show that proposed approach, compared to the similar approaches, will save the storage space substantially by reducing usage of CPU, RAM, also will increase rate of de-duplication data up to 23 %.
Бесплатно
An Image Encryption Scheme Based on Chaotic Systems with Changeable Parameters
Статья научная
This paper proposes an image encryption scheme based on chaotic system with changeable parameters depending on plain-image. A generalized Arnold map, whose control parameters are changeable and image-dependent during the iteration procedure, is utilized to generate chaotic orbits applied to permute the pixel positions. A diffusion function is also designed to realize the diffusion effect by piece-wise linear chaotic map. In both the permutation process and the diffusion process, the keystreams generated by chaotic maps are all strongly dependent on plain-image, and thereby can improve the encryption security efficiently. The major merits of the proposed image encryption scheme include a huge key space, good statistical nature resisting statistical analysis attack, differential attack, and good resistance against known-plaintext attack and chosen-plaintext attack, etc. Experimental results have been carried out with detailed analysis to show that the proposed scheme can be a potential candidate for practical image encryption.
Бесплатно
An Image Encryption Scheme Based on Hybrid Orbit of Hyper-chaotic Systems
Статья научная
This paper puts forward a novel image encryption scheme based on ordinary differential equation system. Firstly, a hyper-chaotic differential equation system is used to generate two hyper-chaotic orbit sequences. Introducing the idea of hybrid orbit, two orbits are mixed to generate a hybrid hyper-chaotic sequence which is used to be the initial chaotic key stream. Secondly, the final encryption key stream is generated through two rounds of diffusion operation which is related to the initial chaotic key stream and plain-image. Therefore, the algorithm's key stream not only depends on the cipher keys but also depends on plain-image. Last but not least, the security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, peak signal-to-noise ratio analysis, key sensitivity analysis, differential analysis etc. All the experimental results show that the proposed image encryption scheme is secure and suitable for practical image and video encryption.
Бесплатно
An Improved Dynamic Probabilistic Packet Marking for IP Traceback
Статья научная
An improved dynamic probabilistic packet marking algorithm named IDPPM is presented, which not only can locate and attack a source rapidly and accurately, but also can reduce the marking overhead of routers near the attackers, which is its greatest contribution given by our technique. In contrast to previous work, the challenge of weakest node and weakest link is solved with the price of a little more numbers of packets to reconstruct the attack path. Theoretical analysis and NS2 simulation results in IPv4 and IPv6 testify that the approach is feasible and efficient respectively.
Бесплатно
An Improved Energy Aware Distributed Clustering Protocol for Wireless Sensor Networks
Статья научная
The present work considers energy aware distributed clustering protocol (EADC) which is commonly employed for balancing the energy consumption in non-uniformly deployed sensor networks. In the EADC, residual energy is considered as the primary clustering parameter and the clusters are constructed using uniform competition radius. However in non-uniform node distribution scenarios, more energy imbalance occurs in the network due to variation in intra-cluster energy consumption. For counter balancing it, an inter-cluster energy-efficient multi-hop routing protocol is utilized. In the EADC protocol, cluster heads select the relay node based on residual energy and cluster member count information. But this approach is less efficient in energy balancing. In this paper, an improved energy aware distributed equal clustering protocol is projected. Our scheme considers the relay metric directly in terms of energy expense in relaying the sensed data to the base station taking into account not only the residual energy and member count information but also distance information. It provides better balancing of energy in comparison with the existing approach. Three different scenarios created by varying node distribution are used for evaluating the performance of the proposed protocol and comparison is made with the EADC protocol. The results show that the proposed scheme extends network lifetime in all the scenarios.
Бесплатно
An Improved Hybrid Mechanism for Secure Data Communication
Статья научная
The In today's era with increase in the use of internet and networking devices, there is an increase in demand for more secure data communication. This problem has led to development of hybrid security mechanisms. Various techniques are available in literature that makes use of different steganography and cryptographic mechanisms which has certain pros and cons. In this paper, we propose a new hybrid security mechanism that tries to choose the best cryptographic and steganography mechanism. In addition, to increase the embedding capacity of the proposed mechanism, Huffman encoding scheme is used. The proposed strategy is implemented in MATLAB-09. In order to check the efficacy of the proposed technique three types of analysis were performed named as: security, robustness and efficiency analysis. It is found from the simulation and results that the proposed scheme outperforms other techniques in literature in every aspect.
Бесплатно
An Improved Machine Learning-Based Short Message Service Spam Detection System
Статья научная
The use of Short Message Services (SMS) as a mechanism of communication has resulted to loss of sensitive information such as credit card details, medical information and bank account details (user name and password). Several Machine learning-based approaches have been proposed to address this problem, but they are still unable to detect modified SMS spam messages more accurately. Thus, in this research, a stack- ensemble of four machine learning algorithms consisting of Random Forest (RF), Logistic Regression (LR), Multilayer Perceptron (MLP), and Support Vector Machine (SVM), were employed to detect more accurately SMS spams. The simulation was carried out using Python Scikit- learn tools. The performance evaluation of the proposed model was carried out by benchmarking it with an existing model. The evaluation results showed that the proposed model has an increase of 3.03% of accuracy, 8.94% of Recall, 2.17% of F-measure; and a decrease of 4.55% of Precision over the existing model. This indicates that the proposed model reduces the false alarm rate and thus detects spams more accurately. In conclusion, the ensemble method performed better than any individual algorithms and can be adopted by the Network service providers for better Quality of Service.
Бесплатно
An Improved Non-Repudiate Scheme-Feature Marking Voice Signal Communication
Статья научная
Guaranteeing the ownership or copyright of digital communication is of extreme importance in this digital era. Watermarking is the technique which confirms the authenticity or integrity of communication by hiding relevant information in specified areas of the original signal such that it might render it difficult to distinguish one from the other. Thus, the digital watermark can be defined as a type of indicator secretly embedded in a noise tolerant signal such as image, audio or video data. The paper presents a voice signal authentication scheme by employing signal features towards the preparation of the watermark and by embedding it in the transform domain with the Walsh transforms. Watermark used in this technique is unique for each member participating in this communication system and makes it is very imperative in the context of signal authentication.
Бесплатно
An Improved Trusted Greedy Perimeter Stateless Routing for Wireless Sensor Networks
Статья научная
In this paper, an improvement over Trusted Greedy Perimeter Stateless Routing (T-GPSR) is presented. T-GPSR employs heuristic weight values to evaluate total trust value of neighboring nodes. However, heuristic assignment of weights provide flexibility but it is not suitable in presence of several security attacks such as Grey hole, selfish behavior, on-off attack etc., are launched in the network in different proportions. To overcome this limitation, an improvement is suggested with an emphasis on trust update, lightweight trust computation and storage to reduce communication and storage overhead. The simulation study indicates that the packet delivery ratio of the improved T-GPSR has improved by 10% over T-GPSR in the presence of 50% of malicious nodes in the network.
Бесплатно
