International Journal of Computer Network and Information Security @ijcnis
Journal articles - International Journal of Computer Network and Information Security
All articles: 1227
Towards Performance Evaluation of Cognitive Radio Network in Realistic Environment
Scientific article
The scarcity of free spectrum compels us to look for alternatives for ever increasing wireless applications. Cognitive Radios (CR) is one such alternative that can solve this problem. The network nodes having CR capability is termed as Cognitive Radio Network (CRN). To have communication in CRN a routing protocol is required. The primary goal of which is to provide a route from source to destination. Various routing protocols have been proposed and tested in idealistic environment using simulation software such as NS-2 and QualNet. This paper is an effort in the same direction but the efficacy is evaluated in realistic conditions by designing a simulator in MATLAB-7. To make the network scenario realistic obstacles of different shapes, type, sizes and numbers have been introduced. In addition to that the shape of the periphery is also varied to find the impact of it on routing protocols. From the results it is observed that the outcomes in the realistic and idealistic vary significantly. The reason for the same has also been discussed in this paper.
Free
Traffic Adaptive Small Cell Planning in Heterogeneous Networks
Scientific article
Small cell is a key enabler for massive connectivity and higher data rate in the future generation of a cellular communication system. Few challenges in heterogeneous networks (HetNets) are effective resource utilization and de- ployment of optimal small base stations (SBSs) under dynamic mobile traffic patterns. In this paper, we design a traffic adaptive small cell planning (TASCP) schema to minimize the deployment of SBSs, enhancing the network energy efficiency without compromising the user equipment’s QoS (UEs). The proposed TASCP consists of two phases: small cell formation (SCF) and small Cell optimization (SCO). SCF creates the initial association between the UEs and SBS. The SCF operates the modes (active/sleep) of SBSs according to the dynamic traffic load. Changing the mode of SBS from an active mode to a sleep mode is based on the traffic load shared by other neighboring SBSs, cooperatively. The proposed TASCP method is compared with state-of-the-art algorithms, i.e., the Self-organized SBS Deployment Strategy (SSDS) and UE Association and SBS On/Off (USOF) algorithm. The network performance is calculated in terms of network energy efficiency, throughput, convergence time, and active small base stations. The performance of the proposed TASCP significantly increases as compared to state-of-the-art algorithms.
Free
Traffic Engineering with Specified Quality of Service Parameters in Software-defined Networks
Scientific article
A method of traffic engineering (TE) based on the method of multi-path routing is proposed in the study. Today, one of the main challenges in networking is to organize an efficient TE system that will provide such parameters of quality of service (QoS) as the allowable value of packet loss and time for traffic re-routing. Traditional one-way routing facilities do not provide the required quality of service (QoS) parameters for TE. Modern computer networks use static and dynamic routing algorithms, which are characterized by big time complexity and a large amount of service information. This negatively affects the overall state of the network, namely: leads to network congestion, device failure, loss of information during routing and increases the time for traffic re-routing. Research has shown that the most promising way to solve the TE problem in computer networks is a comprehensive approach, which consists of multi-path routing, SDN technology and monitoring of the overall situation of the network. This paper proposes a method of traffic engineering in a software-defined network with specified quality of service parameters, which has reduced the time of traffic re-routing and the percentage of packet loss due to the combination of the centralized TE method and multi-path routing. From a practical point of view, the obtained method, will improve the quality of service in computer networks in comparison with the known method of traffic construction.
Free
Scientific article
Cloud storage environment permits the data holders to store their private data on remote cloud computers. Ciphertext Policy Attribute Based Encryption (CP-ABE) is an advanced method that assigns fine-grained access control and provides data confidentiality for accessing the cloud data. CP-ABE methods with small attribute universe limit the practical application of CP-ABE as the public parameter length linearly increases with the number of attributes. Further, it is necessary to provide a way to perform complex calculations during decryption on outsourced devices. In addition, the state-of-art techniques found it difficult to trace the traitor as well as revoke their attribute due to the complexity of ciphertext updation. In this paper, a concrete construction of CP-ABE technique has been provided to address the above limitations. The proposed technique supports large attribute universe, proxy decryption, traitor traceability, attribute revocation and ciphertext updation. The proposed scheme is proven to be secure under random oracle model. Moreover, the experimental outcomes reveal that our scheme is more time efficient than the existing schemes in terms of computation cost.
Free
Transaction-based QoS management in a Hybrid Wireless Superstore Environment
Scientific article
Hybrid wireless networks are extensively used in the superstores, market places, malls, etc. and provide high QoS (Quality of Service) to the end-users has become a challenging task. In this paper, we propose a policy-based transaction-aware QoS management architecture in a hybrid wireless superstore environment. The proposed scheme operates at the transaction level, for the downlink QoS management. We derive a policy for the estimation of QoS parameters, like, delay, jitter, bandwidth, availability, packet loss for every transaction before scheduling on the downlink. We also propose a QoS monitor which monitors the specified QoS and automatically adjusts the QoS according to the requirement. The proposed scheme has been simulated in hybrid wireless superstore environment and tested for various superstore transactions. The results shows that the policy-based transaction QoS management is enhance the performance and utilize network resources efficiently at the peak time of the superstore business.
Free
Tree-Based Matched RFID Yoking Making It More Practical and Efficient
Scientific article
A Radio Frequency Identification (RFID) yoking proof allows an off-line verifier to make sure whether two tags are simultaneously present. Due to off-line property, a reader cannot differentiate valid from invalid proof records when it probes tags, and would generate lots of useless data. This paper proposes a tree-based matched RFID yoking scheme which enhances the cost of identification from O(log N) to O(1), where N is the number of tags, and allows the reader to collect only those matched tags such that it significantly reduces useless data for the verifier to validate off-line.
Free
Triple Layered Encryption Algorithm for IEEE 802.11 WLANs in E-Government Services
Scientific article
Wireless local area network (WLAN) can provide e-government services at all levels, from local to national as the WLAN enabled devices have the flexibility to move from one place to another within offices while maintaining connectivity with the network. However, government organizations are subject to strict security policies and other compliance requirements. Therefore, WLAN must ensure the safeguard the privacy of individual data with the strictest levels of security. The 802.11 MAC specifications describe an encryption protocol called Wired Equivalent Privacy (WEP) which is used to protect wireless communications from eavesdropping. It is also capable of preventing unauthorized access. However, the WEP protocol often fails to accomplish its security goal due to the weakness in RC4 and the way it is applied in WEP protocol. This paper focuses the improvement of existing WEP protocol using the varying secret key for each transmission. This will remove the insecurities that currently make the RC4 unattractive for secured networking and this will add further cryptographic strength if applied to Rijndael algorithm. Our result shows that the proposed algorithm is more suitable for small and medium packets and AES for large packets.
Free
Scientific article
Vehicle to Vehicle communication (V2V) is the foundation of intelligent transportation systems, but due to high mobility and frequent topology changes, reliable and secure routing is still a challenge, and it is further exacerbated when vehicles are potentially malicious. The existing trust-aware routing protocols, e.g., Trusted Context-aware Opportunistic Routing (TCOR), rely heavily on heuristic and deterministic trust aggregation mechanisms, which are less effective in achieving optimal tradeoff between trust and routing efficiency as vehicular environments change dynamically. In order to overcome these limitations, we model the trust-aware V2V routing as a multi-objective optimization problem and design a new routing scheme based on a Quantum Inspired Trust-Aware Opportunistic Routing (Q-TAOR). The proposed method adoptedly choose secure forwarding paths in the face of malicious by taking into account trust maximization and routing efficiency. An effective quantum-inspired probabilistic representation is employed to extend the solution search space and generate reliable routes more efficiently via convergence yet does not depend on static decision rules. Therefore, the routing scheme integrates both direct and indirect trust observations and embeds optimization within a robust path selection process under highly dynamic scenarios. Results obtained using OMNeT++ show the effectiveness of the proposed approach under realistic vehicular mobility and attack circumstances. Simulation outcomes are valid for the proposed quantum-inspired trust-aware routing algorithm to be optimal for secure V2V communication: when attacker nodes are produced, highest-performing packet delivery ratio and robustness in comparison to TCOR, TCOR-Rec and conventional routing protocols.
Free
Trust Establishment in SDN: Controller and Applications
Scientific article
Software Defined Networks (SDNs) is a network technology developed to deal with several limitations faced by the current traditional networks. However, SDN itself is confronted with security challenges which emanates specifically from its platform, given the explosive growth in network attacks and threats. Though many solutions have been developed and proposed, the continual lack of trust between the SDN controller and the applications running atop the control plane poses a great security challenge. SDN controller can easily be attacked by malicious/compromised applications which can result in network failure as the controller represents a single point of failure. Though trust mechanisms to certify network devices exist, mechanisms to certify management applications are still not well developed. Therefore, this paper proposes a novel direct trust establishment framework between an OpenFlow-based SDN controller and applications. The objective is to ensure that SDN controller is protected and diverse applications that consumes network resources are always trusted throughout their lifetime. Additionally, the paper introduce the concept of trust access matrix and application identity to ensure efficient control of network resources. We believe that, if the proposed trust model is adopted in the OpenFlow architecture, it could go a long way to improve the security of the SDN.
Free
Trust Metric based Soft Security in Mobile Pervasive Environment
Scientific article
In the decentralized and highly dynamic environment like Mobile Pervasive Environments (MPE) trust and security measurement are two major challenging issues for community researchers. So far primarily many of architectural frameworks and models developed and being used. In the vision of pervasive computing where mobile applications are growing immensely with the potential of low cost, high performance, and user centric solutions. This paradigm is highly dynamic and heterogeneous and brings along trust and security challenges regarding vulnerabilities and threats due to inherent open connectivity. Despite advances in the technology, there is still a lack of methods to measure the security and level of trust and framework for the assessment and calculation of the degree of the trustworthiness. In this paper, we explore security and trust metrics concerns requirement and challenges to decide the trust computations metric parameters for a self-adaptive self-monitoring trust based security assurance in mobile pervasive environment. The objective is to identify the trust parameters while routing and determine the node behavior for soft security trust metric. In winding up, we put our efforts to set up security assurance model to deal with attacks and vulnerabilities requirements of system under exploration.
Free
Scientific article
Mobile Ad hoc Networks (MANETs) are a rapidly developing technology, making their security a major concern. In order to enable trust-aware and attack-resilient routing, the goal of this research is to develop an intrusion detection system (S-IDS) based on deep learning (DL). By leveraging trust values of the nodes using Osprey Optimization Algorithm (OOA), the presented Dilated Convolutional Multi-Relational Graph Attention Network (DConMRG-Net) based Intrusion Detection System (IDS) identifies potential intruders, ensuring that the paths generated within the MANET are reliable and resilient. Additionally, a novel optimization algorithm namely, Hybrid Adaptive Genghis Khan Shark Gold Rush Optimization (HAGKS-GRO) Algorithm is introduced by combining the Adaptive Genghis Khan Shark Optimization (AGKSO) Algorithm with Gold Rush Optimization (GRO) Algorithm for optimal path selection. Two situations are examined: one in which there is no attack and the other in which there is an attack. Relevant performance metrics are evaluated in connection with these scenarios, including throughput, packet delivery ratio, attack identification rate, accuracy, error rate and computation time. Evaluation results demonstrate significant improvements, with a maximum detection rate of 99% with a minimum computational time of 55ms for with attack case and 51ms for without attack case. The proposed model surpasses the state-of-the-art attack detection techniques and achieves high efficiency, according to the simulation results.
Free
Two-Layer Security of Images Using Elliptic Curve Cryptography with Discrete Wavelet Transform
Scientific article
Information security is an important part of the current interactive world. It is very much essential for the end-user to preserve the confidentiality and integrity of their sensitive data. As such, information encoding is significant to defend against access from the non-authorized user. This paper is presented with an aim to build a system with a fusion of Cryptography and Steganography methods for scrambling the input image and embed into a carrier media by enhancing the security level. Elliptic Curve Cryptography (ECC) is helpful in achieving high security with a smaller key size. In this paper, ECC with modification is used to encrypt and decrypt the input image. Carrier media is transformed into frequency bands by utilizing Discrete Wavelet Transform (DWT). The encrypted hash of the input is hidden in high-frequency bands of carrier media by the process of Least-Significant-Bit (LSB). This approach is successful to achieve data confidentiality along with data integrity. Data integrity is verified by using SHA-256. Simulation outcomes of this method have been analyzed by measuring performance metrics. This method enhances the security of images obtained with 82.7528db of PSNR, 0.0012 of MSE, and SSIM as 1 compared to other existing scrambling methods.
Free
Two-factor Mutual Authentication with Fingerprint and MAC Address Validation
Scientific article
Mobile Ad hoc NETworks (MANET), unlike typical wireless networks, may be used spontaneously without the need for centralized management or network environment. Mobile nodes act as mediators to help multi-hop communications in such networks, and most instances, they are responsible for all connectivity tasks. MANET is a challenging endeavor because these systems can be attacked, which can harm the network. As a result, security concerns become a primary factor for these types of networks. This article aims to present an efficient two-factor smart card-based passcode authentication technique for securing legitimate users on an unprotected network. This scheme enables the password resetting feature. A secured mechanism for sharing keys is offered by using the hash function. We present a new two-factor mutual authentication technique based on an entirely new mechanism called the virtual smart card. Compared to authentication, the proposed method has fewer computation processes but is more time efficient since it is based on a hash function. Additionally, this approach is resistant to most attacker behaviors, such as Mutual authentication, Gateway node bypassing attacks, DoS attacks, replay attacks, Man in the middle attacks, and stolen smart device attacks. Experimental results validate the efficiency of this scheme, and its security is also analyzed.
Free
UML Based Integrated Multilevel Checkpointing Algorithms for Cloud Computing Environment
Scientific article
Main objective of this research work is to improve the checkpoint efficiency for integrated multilevel checkpointing algorithms and prevent checkpointing from becoming the bottleneck of cloud data centers. In order to find an efficient checkpoint interval, checkpointing overheads has also considered in this paper. Traditional checkpointing methods stores persistently snapshots of the present job state and use them for resuming the execution at a later time. The attention of this research is strategies for deciding when and whether a checkpoint should be taken and evaluating them in regard to minimizing the induced monetary costs. By varying rerun time of checkpoints performance comparisons are which will be used to evaluate optimal checkpoint interval. The purposed fail-over strategy will work on application layer and provide highly availability for Platform as a Service (PaaS) feature of cloud computing.
Free
Understanding the evolution of ransomware: paradigm shifts in attack structures
Scientific article
The devasting effects of ransomware have continued to grow over the past two decades which have seen ransomware shift from just being opportunistic attacks to carefully orchestrated attacks. Individuals and business organizations alike have continued to fall prey to ransomware where victims have been forced to pay cybercriminals even up to $1 million in a single attack whilst others have incurred losses in hundreds of millions of dollars. Clearly, ransomware is an emerging cyber threat to enterprise systems that can no longer be ignored. In this paper, we address the evolution of the ransomware and the associated paradigm shifts in attack structures narrowing down to the technical and economic impacts. We formulate an attack model applicable to cascaded network design structures common in enterprise systems. We model the security state of the ransomware attack process as transitions of a finite state machine where state transitions depict breaches of confidentiality, integrity, and availability. We propose a ransomware categorization framework that classifies the virulence of a given ransomware based on a proposed classification algorithm that is based on data deletion and file encryption attack structures. The categories that increase in severity from CAT1 to CAT5 classify the technical prowess and the overall effectiveness of potential ways of retaining the data without paying the ransom demand. We evaluate our modeling approach with a WannaCry attack use case and suggest mitigation strategies and recommend best practices based on these models.
Free
Scientific article
The deployment of sensor nodes in underwater environment is constrained by some resources of sensor node like: energy, processing speed, cost and memory and also affected by dynamic nature of water. The main purpose of node deployment is to get the sensed data from the underwater environment. One of the major tasks is to cover the whole area in underwater and also there must be a full connectivity in the network so that each sensor nodes are able to send their data to the other sensor node. Some researchers use the concept of node mobility for better coverage and connectivity. This work proposes an efficient node deployment technique for enhancing the coverage and connectivity in underwater sensor network. Simulation results show good performance in terms of area coverage and connectivity.
Free
Scientific article
This work focuses on developing a universal onboard neural network system for restoring information when helicopter turboshaft engine sensors fail. A mathematical task was formulated to determine the occurrence and location of these sensor failures using a multi-class Bayesian classification model that incorporates prior knowledge and updates probabilities with new data. The Bayesian approach was employed for identifying and localizing sensor failures, utilizing a Bayesian neural network with a 4–6–3 structure as the core of the developed system. A training algorithm for the Bayesian neural network was created, which estimates the prior distribution of network parameters through variational approximation, maximizes the evidence lower bound of direct likelihood instead, and updates parameters by calculating gradients of the log-likelihood and evidence lower bound, while adding regularization terms for warnings, distributions, and uncertainty estimates to interpret results. This approach ensures balanced data handling, effective training (achieving nearly 100% accuracy on both training and validation sets), and improved model understanding (with training losses not exceeding 2.5%). An example is provided that demonstrates solving the information restoration task in the event of a gas-generator rotor r.p.m. sensor failure in the TV3-117 helicopter turboshaft engine. The developed onboard neural network system implementing feasibility on a helicopter using the neuro-processor Intel Neural Compute Stick 2 has been analytically proven.
Free
User's Profile Replication Tree and On Demand Replica Update in Wireless Communication
Scientific article
Replication strategy is mostly useful for replicating the called mobile user's profile at selected locations where some caller mobile users have higher calling rate. It plays important role in personal communication services (PCS) in order to reduce call setup cost and call setup time. In prior replication schemes, replicated sites (visitor location registers) have no inter relationship. We have proposed a novel and innovative replication tree which is buildup from replicated VLRs (visitor location registers). VLRs are replicated based on effective replication probability of caller mobile user. Home location register (HLR) keeps update replica at root VLR in the replication tree and root VLR forwards update replica to a VLR in the replication tree on demand. The main objective of the proposed scheme is to reduce call setup time and call setup cost by enabling replication of called mobile user's location profile at certain visitor location registers (VLRs) where caller mobile user roams. We have presented analytical modeling which shows that setting inter-relationship among the replicated sites helps in further reducing the call setup cost.
Free
Using Adaptive Neuro-Fuzzy Inference System in Alert Management of Intrusion Detection Systems
Scientific article
By ever increase in using computer network and internet, using Intrusion Detection Systems (IDS) has been more important. Main problems of IDS are the number of generated alerts, alert failure as well as identifying the attack type of alerts. In this paper a system is proposed that uses Adaptive Neuro-Fuzzy Inference System to classify IDS alerts reducing false positive alerts and also identifying attack types of true positive ones. By the experimental results on DARPA KDD cup 98, the system can classify alerts, leading a reduction of false positive alerts considerably and identifying attack types of alerts in low slice of time.
Free
Using P systems to Solve the Discrete Logarithm Problem used in Diffie-Hellman Key Exchange Protocol
Scientific article
The discrete logarithm problem has been used as the basis of several cryptosystems, especially the Diffie- Hellman key exchange protocol. P systems are a cluster of distributed parallel computing devices in a biochemical type. This paper presents a P system with active membranes and strong priority to solve the discrete logarithm problem used in Diffie-Hellman key exchange protocol. To the best of our knowledge, it’s the first time to solve the problem using P systems.
Free
