International Journal of Computer Network and Information Security @ijcnis
Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1130
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.
Бесплатно
Empowering Information Retrieval in Semantic Web
Статья научная
Until the inception of Web 1.0, the Information Retrieval was the center of the stage for library and it was defined as search and passive. Later on, the emergence of Web 2.0 was encouraged into the community, social interaction and user-generated content. Web 3.0 is a modern phenomenon and also known to “3D Web or the Semantic Web”, and it often used for specifically to formats and the technologies. The advanced Web 4.0 is the Ultra-Intelligent Agent Interactions between humans and machines. Semantic web technology finds meanings from various sources to enabling the machines and people to understand and share knowledge. The semantic web technology helps to add, change and implement the new relationships or interconnecting programs in a different way which can be as simple as changing the external model that these programs are shared. To give an information need, the semantic technologies can directly search, capture, aggregate, and make a deduction to satisfy the user needs. The paper presents a framework for knowledge representation assembling semantic technology based on ontology, semantic web, and an intelligent agent algorithm as a connectivity framework to share the appropriate knowledge representation which includes the web ontology language that discovers related information's from various sources to serve the information needs. The research addresses the intelligent agent algorithm is the key contribution that reveals appropriate information and empowers Web 3.0 and embraces Web 4.0 into the coming semantic web technology.
Бесплатно
Статья научная
The use of vehicle ad hoc networks (VANET) is increasing, VANET is a network in which two or more vehicles communicate with each other. The VANET architecture is vulnerable to various attacks, such as DoS and DDoS attacks hence various strategies were previously employed to combat these attacks, but the presence of end-to-end transparency and N-to-1 mapping of different IP addresses create failure in the blockage and not able to determine the twelve variants of DDoS attacks hence a novel technique, Encrypted Access Hex-tuple Mapping Attack detection was proposed, which uses triple random hyperbolic encryption, which performs triple random encoding to encrypt traffic signals and obtains the public key by plotting random values in hyperbola to strengthen the access control in the middlebox and Deep auto sparse impasse NN is used to detect twelve variant DDoS attacks in the VANET architecture. Moreover, to provide immunity against attack, the existing approach uses various artificial immune systems to prevent DDoS attacks but the selection of positive and negative clusters generates too many indicator packets. Hence a novel technique, Stable Automatic Optimized Cache Routing proposed, which uses a Deep trust factorization NN to detect irrational nodes without requiring prior negotiation about local outliner factor and direct evidence by automatically extracting trust factors of each node to manage the packet flows and detecting transmission of dangerous malware files in the network to prevent various types of hybrid DDoS attacks at VANET architecture. The proposed model is implemented in NS-3 to detect and prevent hybrid DDoS attacks.
Бесплатно
Encryption Using Binary Key Sequences in Chaotic Cryptosystem
Статья научная
Transmission of images on the network is considered insecure which has security-related issues. In this paper, to provide security to digital images, an encryption system that uses four chaotic maps for binary key sequence generation is proposed. The system consists of stages namely, confusion, generation of random binary chaotic key sequence, pseudo-random number generation (RN), and diffusion. Keys for encryption are chosen randomly based on a pseudo random generator from the selected chaotic maps by the linear feedback shift register (LFSR). The algorithm achieves good results in terms of NPCR, UACI, and entropy values. The developed cryptosystem resists differential attacks, is sensitive to minor alterations in the keys, and has a large key space.
Бесплатно
Energy Aware Stable Multipath Disjoint Routing Based on Accumulated Trust Value in MANETs
Статья научная
Conserving energy and finding the stable path are the two vital issues in Mobile Ad Hoc Networks (MANETs) as the prior increases the network lifetime and the later increases the network throughput. The nodes which are not legitimate in terms of residual energy and packet forwarding history might be a threat to the path thereby making the path unstable. Thus, it results in frequent link failure, reduced throughput, reduced network and path life time. In order to reduce these hazards, authors have proposed an energy efficient, reliable path selecting protocol referred to as Trust Based Energy Aware Multipath Disjoint Routing Protocol (TEA-MDRP) for MANETS in this article. TEA-MDRP finds the optimum route between the source and the destination nodes using two parameters namely, the Accumulated Trust Value (ATV) and the node’s residual energy (N_res). ATV is calculated based on the packet forwarding status of the node which shows how good the node is in terms of packet forwarding point of view. TEA-MDRP allows only the nodes which have a good ATV and sufficient residual energy. A good ATV shows loyalty in forwarding the packets while a sufficiently large residual energy node avoids frequent path breakups and packet drops. Thus, the TEA-MDRP not only increases the network and path lifetime but also increases the throughput of the communication. Further, with the legitimate nodes in the paths, the TEA-MDRP considerably reduces the control packet overhead which might occur because of the frequent route re-discovery process. An extensive simulation is carried out using Network Simulator-2.35 for the quantitative and qualitative analysis of TEA-MDRP. The results obtained are compared with classical AOMDV and the results are satisfactory.
Бесплатно
Energy Based Route Prioritization for Optimum Multi-path Selection
Статья научная
Energy–aware routing in wireless ad hoc networks is one of the demanding fields of research. Nodes of the network are battery operated that are difficult to recharge and replace, that's why while developing a routing protocol energy consumption metric should always be at high priority. Nodes of mobile ad hoc networks are distributed in different directions forming arbitrary topology instantly. To propose an energy-efficient routing protocol for such a dynamic, self-organized, self-configured, and self-controlled network is certainly a challenge and an open research problem. Energy constraints and mobility leading to link breakage are the motivating factors behind the development of the proposed Optimized Priority-based Ad Hoc on Demand Multi-path Distance Vector Energy Efficient Routing Protocol (OPAOMDV-EE). The routing protocol added three fields (CE, MAX_E, MIN_E) to the traditional AOMDV RREQ and RREP packets, which are further used for calculating total priority field value. This value is used by the source node for selecting an optimal prioritized energy-efficient route. The proposed OPAOMDV-EE protocol has been simulated on Network Simulator-2 (NS-2) for two different scenarios that prove the effectiveness of OPAOMDV-EE in terms of various performance metrics with reduced energy consumption.
Бесплатно
Energy Conscious based Multipath Routing Algorithm in WSN
Статья научная
Wireless Sensor Network (WSN) is a collection of sensory nodes forming a provisional network without the assistance of any recognized infrastructure. Due to the minimal range of each node's transmissions, it may be essential for one sensory node to request for the aid of other sensory node in transferring a packet between the source and sink. The important issue while designing WSN is the routing protocol that makes the best use of the severely minimal resource, especially the energy consumption. We propose a Energy Conscious multipath Routing Algorithm designed to improve the latency, resiliency and efficiency through discovering multiple routes between the source and sink. A Sink Originated Route Discovery (SORD) process provides the locality information of the source to the sink. One dominant and multiple alternate routes are generated at the end of the route discovering process. Apart from the dominant route, all the other nodes are put to sleep mode in order to conserve energy and create a concussion free route. Data is transmitted between the source and sink through the dominant route and if there is a disturbance in the existing route, the next preferred alternate route is used. If the route doesn't exist between the source and sink, the process starts from the beginning. Further, we analyze how the proposed protocol overcomes the drawback of the existing protocols. This system is implemented by using NS-2.34. By altering route update guidelines of existing on-demand routing schemes the Performance gains in the order of 10-15 % could be achieved. The simulation results show that the proposed protocol has less control packet overhead, less average energy consumption and the algorithm is faster.
Бесплатно
Energy Conservation for Ad Hoc On-Demand Distance Vector Multipath Routing Protocol
Статья научная
Routing in ad hoc mobile networks is a problem which has not yet been satisfactorily solved. Traditional routing techniques are not well adapted to new networks. Indeed, their lack of reactivity with respect to the traffic and network changes means traditional routing techniques cannot easily be used except at the price of over-dimensioning of the network resources (network bandwidth, node memory utilization, node CPU load, etc.). In recent years the research community has been interested in the improvement of ad hoc routing, and among the solutions suggested multipath routing has been considered. Multiple paths are exploited in order to ensure reliability and a quick reaction to changes in topology with a low overhead generated by the control messages. In this article we present an extension of the well-known routing protocol AODVM (Ad hoc On-demand Distance Vector Multipath). We propose to improve the multipath routing strategy with a path classification to allow the paths with the best energy level to be chosen.
Бесплатно
Статья научная
The reduction of energy consumption in elastic optical networks is of major interest to the research community. As a result, several methods for solving this problem in combination with existing classical problems have been proposed. Elastic optical networks are subject to disturbance phenomena that degrade their quality and performance. To optimize resources, operators must recalculate new routes and plan the displacement of established connections towards these new routes to cope with these phenomena, it’s the reconfiguration. The problem addressed in this article is to reconfigure a set of unicast protected connections without interruption to a new routing calculated during the process. Knowing that the use of backup paths solves the interruption problem, but has an impact on the overall energy consumption, the goal is to find a good compromise between the two sub-problems when switching from old routes to new ones. To the best of our knowledge, there is no work on reconfiguration that uses energy-aware backup paths. In this work, we proposed an energy-aware EERA_EON rerouting algorithm using the backup paths. Simulations have shown the performance of this approach in terms of energy consumption compared to the work of our predecessors. Subsequently, we proposed a classical BRA_EON rerouting algorithm in elastic optical networks. Simulation results show that we perform BRA_EON in terms of the number of steps.
Бесплатно
Energy Efficient Clustering Protocol for Sensor Network
Статья научная
Energy efficiency is a very crucial issue for battery operated Wireless Sensor Networks (WSNs). Routing plays a major in energy dissipation and it is shown in the literature that Cluster based approach is the most energy effective in any network in comparison to direct or multi hop based approach. Therefore, optimized Clustering became a key point to achieve energy efficiency in Wireless Sensor networks. In this paper, we have designed and implemented a novel protocol in MATLAB in which Cluster Heads are chosen on the basis of energy threshold, minimum average distance from surrounding nodes and farthest distance among Cluster Heads to provide optimal coverage. This paper also compare results of randomly selected CHs and farthest CHs and results demonstrates that farthest chosen CHs provide much better results than randomly selected CHs. To further evaluate performance of our protocol, results of our protocol are compared with LEACH and proposed protocol dominates LEACH in terms of minimizing transmission distance, energy dissipation and hence increasing network lifetime. Apart from this, proposed protocol is based on Poisson distribution because simulation results clearly states that Poisson distribution is very well suited for WSN in comparison to Uniform and Random distribution.
Бесплатно
