International Journal of Computer Network and Information Security @ijcnis
Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1148
Effect of Short-Term Synaptic Plasticity on Correlated firing in Feedback Networks
Статья научная
The firing activity of a neuronal population is correlated, which has been linked to information coding and exchanging. Short-term synaptic plasticity allows synapses to increase (facilitate) or decrease (depress) over a wide range of time scales. It is critical to understand the characteristics and mechanisms of the correlated firing and the role of short-term synaptic plasticity in regulating firing activity. The short-term synaptic depression and facilitation are examined at the synapses in the inhibitory feedback loop of feedback neural networks. Numerical simulations reveal that the modulation of the correlated firing by dynamics of depression and facilitation is due to their effects on the synaptic strength. By varying synaptic time constants, the enhancement in either firing rate or intensity of oscillations can improve the correlated firing. Our study thus provides a general computational analysis of the sequential interaction of short-term plasticity with neuronal firing.
Бесплатно
Effective Congestion Avoidance Scheme for Mobile Ad Hoc Networks
Статья научная
Mobile nodes are organized randomly without any access point in Mobile Ad hoc Networks (MANETs). Due to the mobility of nodes, the network congestion occurs. So many congestion control mechanisms were proposed to avoid the congestion avoidance or reducing the congestion status. In this research work, we proposed to develop the Effective Congestion Avoidance Scheme (ECAS), which consists of congestion monitoring, effective routing establishment and congestionless based routing. The overall congestion status is measured in congestion monitoring. In routing establishment, we propose the contention metric in the particular channel in terms of, queue length of packet, overall congestion standard, packet loss rate and packet dropping ratio to monitor the congestion status. Based on the congestion standard, the congestionless based routing is established to reduce the packet loss, high overhead, long delay in the network. By extensive simulation, the proposed scheme achieves better throughput, packet delivery ratio, low end-to-end delay and overhead than the existing schemes.
Бесплатно
Effective Hybrid Intrusion Detection System: A Layered Approach
Статья научная
Although there are different techniques proposed for intrusion detection in the literature, most of them consider standalone misuse or anomaly intrusion detection systems. However, by taking the advantages of both systems a better hybrid intrusion detection system can be developed. In this paper, we present an effective hybrid layered intrusion detection system for detecting both previously known and zero-day attacks. In particular, a two layer system that combines misuse and anomaly intrusion detection systems is proposed. The first layer consists of misuse detector which can detect and block known attacks and the second layer comprises of anomaly detector which can efficiently detect and block previously unknown attacks. The misuse detector is modeled based on random forests classifier and the anomaly detector is built using bagging technique with ensemble of one-class support vector machine classifiers. Data pre-processing is done using automatic feature selection and data normalization. Experimental results show that the proposed intrusion detection system outperforms other well-known intrusion detection systems in detecting both previously known and zero-day attacks.
Бесплатно
Effective use method of cloudlet resources by mobile users
Статья научная
The paper explores the architecture of mobile cloud technologies. The advantages and the problems emerging during the use of this technology are analyzed. The study analyzes the establishment of network infrastructure based on cloudlets at the second level of mobile computation clouds with hierarchic structure. At the same time, the issues of computation and meeting the demand for memory resources of mobile devices are investigated by employing this technology. The paper presents the solution of the linking problem of cloudlets located in the proximity of base stations of wireless metropolitan area networks (WMAN). The study also determines the number of communication channels among cloudlets for the purpose of effective utilization of cloudlet resources. The issue of uploading necessary program extensions to a corresponding cloudlet by using the possible number specifying the importance of cloudlets was investigated and a method was proposed.
Бесплатно
Efficient Cloud Computing Security Using Hybrid Optimized AES-IQCP-ABE Cryptography Algorithm
Статья научная
Data management has been revolutionized because cloud computing technologies have increased user barriers to expensive infrastructure and storage limits. The advantages of the cloud have made it possible for significant cloud implementation in major businesses. However, the privacy of cloud-based data remains the significant and most crucial problem for data owners due to various security risks. Many researchers have proposed various methods to maintain the confidentiality of the data, including attribute-based encryption (ABE). Though, the cloud is still dogged mainly by the security issue. To protect data privacy, the new encryption model "Advanced Encryption Standard- Improved Quantum Ciphertext Policy and Attribute-based Encryption" (AES-IQCP-ABE) is introduced in the present research. The suggested method twice encrypts the data and the attributes using the ABE at first. Second, using the AES technique, the encrypted data is encrypted before being delivered to authorized users. The dynamic, chaotic map function is used in the proposed approach to protecting user attributes throughout the initialization of the key, encryption of data, and decryption of data processes. For the encryption process, the inputs used in the proposed research are both unstructured and structured extensive medical data. Regarding computational memory, time for cloud data encryption, and decryption, the proposed model outperforms the previous ABE-based encryption and decryption algorithms.
Бесплатно
Efficient Clustering Technique for Cooperative Wireless Sensor Network
Статья научная
The nodes of a wireless sensor network (WSN) collect the data of interest from the deployment area and cooperatively send it to sink in multiple hops. Recently, virtual multiple input multiple output (V-MIMO) technique has been introduced in which the node cooperation is extended to form a virtual antenna array and communication is accomplished using space time block coding. The present work extends the scope of V-MIMO by proposing a new clustering technique. It creates the temporary cluster heads and their respective cooperative nodes, collects information from them and then the final clustering is accordingly done. The simulation result shows significant improvement in the energy efficiency of the WSN.
Бесплатно
Efficient Dynamic Resource Allocation in OFDMA Systems by Firefly Pack Algorithm
Статья научная
The resource allocation of Orthogonal Frequency Division Multiple Access (OFDMA) is one of the core issues in the next generation mobile systems. The improvement in the performance and quality of service (QoS) of communication systems is relying upon the efficient utilization of the available communication resources. The resource allocation of the OFDMA systems is mainly depends on both power and subcarrier allocations of each user for different operation scenarios and channel conditions. This paper proposes and applies Firefly Pack Algorithm (FPA) to find the optimal or near optimal power and subcarrier allocations for OFDMA systems. It takes into consideration the power and subcarrier allocations constrains, channel and noise distributions, distance between users equipments and base station, user priority weight to approximate the most of the variables, constrains, and parameters that encounter in the OFDMA systems. Four important cases for the number of subcarriers and users are addressed, simulated, and analyzed with employing the FPA algorithm under specific operation scenarios to meet the standard specifications. The results demonstrate that FPA is an effective algorithm in finding the optimal or near optimal for both subcarrier and power allocation.
Бесплатно
Efficient FPGA Hardware Implementation of Secure Hash Function SHA-2
Статья научная
The Hash function has been studied by designers with the goal to improve its performances in terms of area, frequency and throughput. The Hash function is used in many embedded systems to provide security. It is become the default choice for security services in numerous applications. In this paper, we proposed a new design for the SHA-256 and SHA-512 functions. Moreover, the proposed design has been implemented on Xilinx Virtex-5 FPGA. Its area, frequency and throughput have been compared and it is shown that the proposed design achieves good performance in term of area, frequency and throughput.
Бесплатно
Статья научная
Research in Wireless Sensor Networks (WSNs) has made a significant progress recently, especially the area of key management, which plays a central role for protecting group communication in sensor networks. In sensor networks, the data are crucial and have to keep secrecy in data communication. To achieve data confidentiality, adversary should not have access to the group communication. Therefore due to the limited memory resources and energy constraints of sensor nodes, reducing the communication and storage overhead, and improving the resilience against the node capture attack become a must. In this paper we propose An Efficient Group Key Management using Symmetric Key and Threshold Cryptography for Cluster based Wireless Sensor Networks (EGKMST). The proposed scheme considers a hierarchical cluster structure of sensor network and adopts the pair-wise key management and group key management based on threshold key cryptography to generate and to distribute the keys efficiently within a cluster and updates periodically keys. By this way EGKMST provides continuous transmission security and avoids dangerous attacks from malicious nodes and mitigate the node compromise attack in WSNs communication. The security and performance analysis illustrate that EGKMST scheme achieves the requirement of group communication and provides efficient security with low communication cost, low memory overhead and energy saving compared with some existing key management schemes.
Бесплатно
Efficient Hand off using Fuzzy and Simulated Annealing
Статья научная
This paper presents an efficient method for the hand off mechanism in cellular networks using optimization algorithms. The proposed approach integrates a fuzzy logic approach with simulated annealing algorithm to automate the tuning process. The fuzzy controller carries out inference operation at high-speed, whereas the tuning procedure works at a much lower rate. For the implementation described in this paper, a two-input-one-output fuzzy controller is considered. Both the inputs and the output have 8- bit resolution, and up to seven membership functions for each input or output can be defined over the universe of discourse. The fuzzy controller has two levels of pipeline which allows overlapping of the arithmetic as well as inference operations. The SA tuning mechanism adjusts the triangular or singleton membership functions to minimize a cost function. The complete self-tuned fuzzy inference engine is implemented in a Xilinx SPARTAN3 XC3S200 series FPGA device. This paper describes various aspects of the implementation of the self-tuned hand off system.
Бесплатно
Статья научная
Steganography is a means to hide the existence of information exchange. Using this technique the sender embeds the secret information in some other media. This is done by replacing useless data in ordinary computer files with some other secret information. The secret information could be simple text, encoded text or images. The media used as the embedding plane could be an image, audio, video or text files. Using steganography ensures that no one apart from the sender and the receiver knows about the existence of the message. In this paper, a steganography method based on transforms used i.e. Wavelet and Contourlet. Devised algorithm was used against each transform. Blowfish Encryption method is also embedded to double the security impact. The major advantage of applying transforms is that the image quality is not degraded even if the number of embedded characters is increased. The proposed system operates well in most of the test cases. The average payload capacity is also considerably high.
Бесплатно
Статья научная
Researchers have been paying close attention to the wireless sensor (WSN) networks area because of its variety of applications, including industrial management, human detection, and health care management. In Wireless Sensor (WSN) Network, consumption of efficient energy is a challenging problem. Many clustering techniques were used for balancing the load of WSN network. In clustering, the cluster head (CH) is selected as a relay node with greater power which is compared with the nodes of non-CH. In the existing system, it uses LBC-COFL algorithm to reduce the energy consumption problem. To overcome this problem, the proposed system uses Quasi oppositional based Jaya load balancing strategy with cluster head (QOJ-LCH) selection protocol to boost the lifespan of network and energy consumption. The QOJ-LCH method improves the relay nodes life and shares the load on relay nodes equitably across the network to enhance the lifespan. It also reduces the load-balancing problems in Wireless Sensor networks. It uses two routing methods single-hop and multiple-hop. The proposed QOJ-LCH with cluster head selection method enhances the network’s lifespan, total amount of power utilization and the active sensor devices present in the Single-hop routing ,it worked with 1600 rounds in network and 300 sensor nodes, for Multiple-hop routing, it worked with 1800 rounds in network and 350 sensor nodes. It achieves better performance, scalability and reliability.
Бесплатно
Efficient Proxy Re-encryption with Private Keyword Searching in Untrusted Storage
Статья научная
Cloud computing is an important trend that in many ways is beginning to fulfill the early promise of the Internet and creating unanticipated change in computing paradigm. As promising as cloud computing is, this paradigm brings forth new security and privacy challenges when operating in the untrusted cloud scenarios. Motivated by the challenging problem “Private Searching over Encrypted Data”, we propose a new cryptographic primitive, Proxy Re-encryption with Private Searching (PRPS for short). The PRPS scheme enables the data users and owners efficiently query and access files stored in untrusted cloud, while keeping query privacy and data privacy from the cloud providers. The concrete construction is based on proxy re-encryption, public key encryption with keyword search and the dual receiver cryptosystem. Extensive analysis shows that our scheme is efficient and semantically secure under the BDH assumption.
Бесплатно
Efficient Resource Allocation to Enhance the Quality of Service in Cloud Computing
Статья научная
Pay-as-you-go models are used to grant users access to cloud services. While using the cloud, an imbalance workload on data centre resources degrades quality of service metrics like makespan, storage, high failure rate, and energy consumption. Hence proposed the heuristic based hybrid GA to enhance the QoS with resource allocation in cloud computing. The population is first initialized using the Binary encoding sorts the tasks according to priority. After that, the Best Fit algorithm compares the Best Fit with iterations of each fitness value depending on the computation time to shorten the make span. Heuristic crossover approach and mutation are then used to update the probability of the existing population with the new population lowers the failure rate by using the fitness value. Therefore, the proposed heuristic-based hybrid GA technique balanced the load and allocate the resources effectively to improve QoS performances. The outcome reveals that the proposed method of QoS performances attained less makespan, energy consumption, failure rate and execution time with effectively allocated the resources of 1% to 39% when compared to the previous methods in cloud computing.
Бесплатно
Efficient Resource Management for Multicast Ad Hoc Networks: Survey
Статья научная
Group communication over multicast ad hoc network suffers from insufficient utilization of limited resources, i.e. shared channel, battery, data processing capabilities and storage space etc. Multicast routing protocol should be able to manage all these resources because their consumption depends upon different factors, i.e. Unicast/Multicast network operations, dynamic topology due to mobility, control overhead due to scalability, packet loss and retransmission due to collision and congestion etc. All these factors may cause unnecessary network load, delay and unfair resource utilization. However, multicast ad hoc routing protocols are more efficient than Unicast routing protocols, but they also suffer from performance degradation factors discussed above. Researchers have developed various layer wise solutions for resource optimization. In this paper, we will explore the different schemes for fair utilization of network resources.
Бесплатно
Efficient Scalar Multiplication over Elliptic Curve
Статья научная
Elliptic Curve Scalar multiplication is the method of adding a point on the curve to itself every time[1]. In recent years, research in Scalar Multiplication over Elliptic curves (EC) over a finite fields attracted many researchers, working in field of cryptography, to find out how elliptic curves cryptography (ECC) can be implemented and how to reduce its complexity [4]. The efficient techniques used in Elliptic curve cryptography are Elliptic curve scalar multiplication using point-halving algorithm [2], then double-base (DB) chain algorithm, and after that step multi-base representation (SMBR), but these techniques have their drawbacks. So, it become imperative to find out a new approach which can be efficiently used for implementation of ECC and further reducing its complexity. The paper proposes a new algorithm Treble algorithm for affine coordinates. We continued doing work using the binary concept or double and add operation with the help of treble approach to make it more efficient which relates to the use of all input values in producing any type of output, including how much time and energy are required The results show that our contribution can significantly enhance EC scalar multiplication.
Бесплатно
Статья научная
In this paper we investigate traffic-engineering issues in Wavelength Division Multiplexing (WDM) all-optical networks. In such networks, the wavelength continuity constraint along with the wavelength clash constraint, lead to poor network performances when dealing with the lightpath provisioning problem. The impact of these constraints is especially severe when traffic demands are unpredictable and characterized by random arrivals and departures. In order to alleviate the impact of these constraints, we propose to employ intentional/active rerouting. Active lightpath rerouting is to intentionally reroute already established lightpaths, during their life period, so as to achieve a better blocking performance. We here assume that due to the large geographic area an optical WDM network can cover, upgrading such a network to support the huge demand for network bandwidth can be costly. Thereby, it is extremely important for network operators to apply traffic-engineering strategies to cost-effectively optimize network throughput. Two new routing and wavelength assignment (RWA) algorithms applying intentional rerouting are proposed. Both algorithms dynamically reroute some already established lightpaths from longer paths to vacant shorter ones so as to reduce the network resources consumption and hence improve the network throughput. The first algorithm, namely, Timer-Based Active Lightpath Rerouting (TB-ALR) initiates the rerouting procedure every time a timer expires. The second algorithm, namely, Sequential Routing with Active Lightpath Rerouting (SeqRwALR) initiates the rerouting procedure when a connection leaves and its lightpaths are released. To the best of our knowledge, our global approach has not already been investigated in the literature. Simulation results show that the proposed active rerouting algorithms yield much lower connection rejection ratios than rerouting algorithms previously presented in the literature while rerouting a small number of already established lightpaths. By rerouting a small number of existing lightpaths, we hope that the disruption period incurred due to rerouting is minimized.
Бесплатно
Efficient multimedia transmission over scalable IoT architecture
Статья научная
Today the new technology concept, called “Internet of Things” (IoT), presents a significant field of research, due to the fact that it promises many advantages to the users worldwide. Besides this, multimedia file streaming tends to be a daily user habit, as a result of the evolution of the internet and the capabilities of devices, such as mobile phones and computers. This tendency has established Cloud Computing (CC) as a vital technology due to the fact that it reduces economic costs, improves accessibility and flexibility, while it increases the total network performance too. This paper demonstrates a new technological approach for IoT architecture, where a layered implementation with the use of many cloud servers can offer optimized streaming and download, because of the significant reduction of the transfer time costs and the storage space of the Main Cloud Server (MCS). Moreover, users will have the ability to choose or adapt to their devices’ restrictions, between low - up to - Ultra-High Definition (UHD) quality for multimedia access and downloading, thanks to a new quality scalability feature which is introduced and is based on the new High-Efficiency Video Coding (HEVC) compression standard. Experimental results show the efficiency of the proposed approach with math formulas and graphs.
Бесплатно
Embedded Real-Time HTTP Server
Статья научная
This paper presents the architecture of embedded real-time web server. Unlike existing web servers, in our approach, requests are processed not in the "first in first out" order but according to their deadlines and the expected server load. For this purpose the Least Laxity First scheduling method is used. First, requests with imposed hard real-time constraints are served. Then requests enclosed by soft deadlines are processed. Finally, request without time requirements are served in the order they arrived. We also present real-time extensions to the Hypertext Transfer Protocol. We propose headers that enable defining hard and soft deadlines, as well as responses containing time information, that are being sent to the client application. The experimental results showed that in case of real-time applications our server misses significantly fewer requests, due to time out, then existing solutions. The presented server may be very useful for implementing real-time services supported by embedded systems, e.g. in future real-time "Internet of things" applications.
Бесплатно
Статья научная
Researchers have already shown the way, how to improve and compare the existing MANET routing protocols that help us to understand the basic feature and functionality of the various routing protocols. However, while these routing protocols have been proposed from different research groups in the literature, which shows the existing routing protocols, are not consistent to common framework to evaluate its performance. Moreover, these protocols are vulnerable to many collaborative attacks, due to its cooperative nature of routing algorithms. Hence, it is difficult for one to choose a proper routing protocol for a given application; therefore, we initially study and review to compare the different existing routing protocols in adversarial environment with varying traffic and mobility simulation scenarios. This paper addresses the comparison of various reactive routing protocols in adversarial environment. To achieve this, we had investigated with widely used NS-2 simulators for fair comparisons of different routing protocols. Furthermore, we also develop a collaborative adversary model for these existing routing protocols that can interfere with communications to subvert the normal operation of the network. Specifically, Our extensive simulation results shows the relative quantitative analysis for comparing the performance of reactive routing protocols such as AODV, DSR under adversarial environments with varying traffic and mobility simulation scenarios. Moreover, the performance of these protocols is measured with the various metrics such as throughput, end-to-end delay, packet delivery ratio, and routing overhead.
Бесплатно
