Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1110
Congestion Control in 4G Wireless Networks Using Coalition Game
Статья научная
In 4G-domain multi home mobile host (MH) will have access to different wireless networks. In this 4G wireless networks real time applications are initiated to support services like VOIP, videoconference. These applications use RTP over UDP. These protocols are unresponsive to congestion events. Our proposed congestion management scheme minimizes congestion level in 4G domains using coalition game. Its main objective is to decide target networks for handoff with minimum congestion level. Our mechanism is based on the coalition game formation. It aims at maximizing the utilization of the resources available and meeting QoS requirement of users as much as possible. This will reduce congestion level with vertical handoff initiation.
Бесплатно
Статья научная
The main intention of this paper is focus on mechanism for reducing congestion in the network by free resources to set accurate rates and priority data needs. If two nodes send their packets in the shortest path to the parent node in a crowded place, a source node must prioritize the data and uses data that have lower priorities of a suitable detour nodes consisting of low or non- active consciously. The proposed algorithm is applied to the nodes near the base station (which convey more traffic) after the congestion detection mechanism detected the congestion. Obtained results from simulation test done by NS-2 simulator demonstrate the innovation and validity of proposed method with better performance in comparison with CCF, PCCP and DCCP protocols.
Бесплатно
Constraint Based Periodicity Mining in Time Series Databases
Статья научная
The search for the periodicity in time-series database has a number of application, is an interesting data mining problem. In real world dataset are mostly noisy and rarely a perfect periodicity, this problem is not trivial. Periodicity is very common practice in time series mining algorithms, since it is more likely trying to discover periodicity signal with no time limit. We propose an algorithm uses FP-tree for finding symbol, partial and full periodicity in time series. We designed the algorithm complexity as O (kN), where N is the length of input sequence and k is length of periodic pattern. We have shown our algorithm is fixed parameter tractable with respect to fixed symbol set size and fixed length of input sequences. Experiment results on both synthetic and real data from different domains have shown our algorithms' time efficient and noise-resilient feature. A comparison with some current algorithms demonstrates the applicability and effectiveness of the proposed algorithm.
Бесплатно
Construction for searchable encryption with strong security guarantees
Статья научная
We present a construction for searchable symmetric encryption (SSE). We consider a wide range of attacks and hardness assumptions and fulfill the strongest security requirements. The "standard" privacy requirement against searchable encryption is message indistinguishability under an adaptively chosen keyword attack (IND-CKA2). We consider to protect the data and the keyword(s) together, i.e. privacy of the data is not considered as a separate problem (as the latter is typical in research papers). Beside the CKA model, we consider also the adaptively chosen trapdoor attack (CTA). Against active attacks (such as swapping attack) we add integrity protection for the (data, keyword) pair. By guaranteeing existential unforgeability (EU) for trapdoor keys we give protection against Keyword Guessing Attack (KGA). Attacks via searching for patterns in the database is prevented by randomized keyword encryption and trapdoor generation. Our construction is secure in the standard model of computation assuming bilinear groups with the widely used Symmetric eXternal Diffie Hellmann (SXDH) assumption.
Бесплатно
Container-to-fog Service Integration using the DIS-LC Algorithm
Статья научная
Containers have newly emerged as a potential way to encapsulate and execute programs. In contrast to virtual machines, each container does not have its own kernel and instead shares the host systems. Containers on the other hand are more lightweight, need fewer data to be sent between network nodes and boot up faster than VM. This makes containers a feasible choice, particularly for hosting and extending the services across the fog computing architecture. The major purpose of this paper is to describe the Distributed Intelligent Scheduling based Lightweight Container algorithm (DIS-LC), which is a revolutionary way for container to fog-services integration and resource optimization. In this proposed algorithm is compared to the least connection algorithm, round-robin algorithm and Ant Colony Optimization-based Light Weight Container (ACO-LWC). Operating cost and traffic cost are used to validate the suggested algorithm. Fog node running costs are divided into two categories: CPU and memory. When compared to current algorithms, quantitative research demonstrates that the proposed DIS-LC scheme gets the greatest performance in terms of all metrics. This demonstrate the algorithm is efficient. Finally, the performance of containerized services and resource management systems is evaluated using the iFogSim simulator.
Бесплатно
Статья научная
Conventional approaches for adapting security enforcement in the face of attacks rely on administrators to make policy changes that will limit damage to the system. Paradigm shifts in the capabilities of attack tools demand supplementary strategies that can also adjust policy enforcement dynamically. We extend the current research by proposing an approach for integrating real-time security assessment data into access control systems. Critical application scenarios are tested to examine the impact of using risk data in policy evaluation and enforcement.
Бесплатно
Context-Sensitive Grammars and Linear-Bounded Automata
Статья научная
Linear-bounded automata (LBA) accept context-sensitive languages (CSLs) and CSLs are generated by context-sensitive grammars (CSGs). So, for every CSG/CSL there is a LBA. A CSG is converted into normal form like Kuroda normal form (KNF) and then corresponding LBA is designed. There is no algorithm or theorem for designing a linear-bounded automaton (LBA) for a context-sensitive grammar without converting the grammar into some kind of normal form like Kuroda normal form (KNF). I have proposed an algorithm for this purpose which does not require any modification or normalization of a CSG.
Бесплатно
Contextual Risk-based Decision Modeling for Vehicular Networks
Статья научная
A vehicular ad hoc network (VANET) is the emerging technology that allows the drivers to keep the road safety throughout the journey. In VANETs, vehicles can collaborate with each other by exchanging the messages. When these messages are incorrect, drivers will have to face many serious problems which include traffic congestion and minor to fatal road accidents. Therefore, drivers need a method which provides the correct decision using risk analysis calculated from the vehicle context. For this purpose, we propose a new contextual risk-based decision methodology for vehicular networks. This methodology can be used to provide robust and reliable decisions.
Бесплатно
Controlling Information Flows in Net Services with Low Runtime Overhead
Статья научная
This paper presents the information flow control model NetIFC to prevent information leakage when a net service is being executed. NetIFC offers the following features: (1) it blocks at least statements as possible and (2) it reduces runtime overhead. To achieve the first feature, NetIFC strictly controls output statements because only output may leak information. To achieve the second feature, NetIFC is executed in parallel with a service in different sites to monitor the service. This monitoring style substantially reduce runtime overhead when comparing with embedding a model in a net service.
Бесплатно
Cooperative MAC Protocol based on Best Data Rate (CMAC-DR)
Статья научная
As wireless signals are broadcast in nature, which implies that, a broadcast communication purposive to a predetermined destination may be received by a non-intended intermediate station. Cooperative transference, which employ interposed stations to pass on the eavesdropped data to attain the contrast gains, has a substantial capability to revamp the channeling effectiveness in wireless systems. In this it is evident that having cooperation amid stations in a wireless systems can accomplish higher throughput with enhanced network lifetime. Proffered work bestows a model for medium access layer called Cooperative MAC protocol based on optimal Data Rate (CMAC-DR). In the proffered work, stations with more data rate aid stations having lesser data rate in their communication by redirecting their congestion. In CMAC-DR model, utilizing the conveyance of eavesdropped information, potential helper stations with more data rate Send out Helper Ready To Send (HRTS), the stations with less data rate maintains a table, called Co-op table of potential helper stations, that can aid in its transmissions. During communication, the source station with low data rate chooses either transmitting by the way of a helper station, so that it lowers the end to end transference delay and increases the throughput or opt only direct transmission, if no potential helper is found or if CMAC-DR becomes an overhead. By analyzing varied simulated scenarios, CMAC-DR evaluates the elevation in the overall network lifetime, throughput and minimization of delay. The CMAC-DR protocol is unambiguous and in accordant with legacy 802.11 also when compared to this, we find improved performance in terms of delay throughput and network lifetime since data rate is considered as relay selection condition.
Бесплатно
Статья научная
This paper presents a new technique for copyright protection of images using integer wavelet transform (IWT), singular value decomposition (SVD) and Arnold transform. We divide the cover image into four sub-images by picking alternate pixels from consecutive rows and columns and embed the copyright mark into the sub-image having the largest sum of singular values. The embedding is done by modifying singular values of the IWT coefficients of the selected sub-image. The use of Arnold transform and SVD increases security and robustness against geometric and several signals processing attacks, while IWT provides computational efficiency. We compare the performance of our technique with state-of-the-art-methods. The experimental results show that the proposed technique is more imperceptible and achieves higher security and robustness against various signal processing (filtering, compression, noise addition, histogram equalization and motion blur) and geometrical (cropping, resizing, rotation) attacks.
Бесплатно
Статья научная
In many cases side channel attacks complexity are estimated by considering attack simulations only. Regarding this estimations, parameters of cryptographic devices are set so the attack is infeasible. This work shows that this approach to secure cryptographic equipment can be dangerous because real attacks can be much better than expected according to simulations. This observation is presented on very generic Correlation Power Attack using Hamming Distance Power Model. This attack is aimed against integer multiplier implemented in FPGA. In cryptography, an integer multiplier power consumption can sometimes be exploited to reveal a secret. Very often it is in asymmetric cryptography that is used in PKI as a fundamental building block. As an example, there are DSA and its various derivations.
Бесплатно
Cost Optimization based Resource Allocation Scheme for Vehicular Cloud Networks
Статья научная
Efficient Resource management in an Vehicular Cloud Networks (VCN) results in an increase resource utilization and reduction of the cost. Proper resource allocation schemes in VCN provides the better performance in terms the reduction of cost, reduction in the waiting time of vehicle (client) and also the waiting queue length. Resources are required to provide more efficiently by the cloud providers for the requested services by the vehicle. For this reason it is necessary to design proper resource allocation schemes in VCN. The aim of resource allocation scheme in VCN is to allocate the appropriate computing resources for the client vehicle application. Efficient resource allocation scheme in VCN plays a major role in the overall performance of the system. Members of VCN change dynamically due to the mobility in their movement. Vehicles may face high costs or issue related to the performance parameter when proper resource allocation schemes are not applied. In this work, we proposed the cost effective based resource allocation in VCN. The proposed cost model provides the resource to vehicle by considering the lesser expensive approach hence by achieving in the reduction of cost. We compare the results of the cost optimization with the generic algorithm that uses a combination of best fit and first fit techniques for resource allocation in VCN.
Бесплатно
Cost-Aware Task Scheduling in Cloud Computing Environment
Статья научная
Cloud computing is a new generation of computing environment which delivers the applications as a service to users over the internet. The users can select any service from a list provided by service providers depending on their demands or needs. The nature of this new computing environment leads to tasks scheduling and load balancing problems which become a booming research area. In this paper, we have proposed Scheduling Cost Approach (SCA) that calculates the cost of CPU, RAM, bandwidth, storage available. In this approach, the tasks will be distributed among the VMs based on the priority given by user. The priority depends on the user budget satisfaction. The proposed SCA will try to improve the load balance by selecting suitable VM for each task. The results of SCA are compared with the results of FCFS and SJF algorithms which proves that, the proposed SCA approach significantly reduces the cost of CPU, RAM, bandwidth, storage compared to FCFS and SJF algorithms.
Бесплатно
