Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1066
Monitoring of military base station using flooding and ACO technique: an efficient approach
Статья научная
Rapid development of Wireless sensor network led to applications ranging from industry to military fields. These sensors are deployed in the military base station such as battlefield surveillances. The important issues like security & DoS attacks play crucial role for wireless sensor network. Due to the limitations of resources, traditional security scheme cannot be employed efficiently. Therefore, designing a framework that can operate securely using smart intelligence technique is the best option. In this paper, an efficient way of detecting an intrusion using Flooding and Ant colony is proposed. The flooding technique enables the master agents to track the activity of intruder tampering the part of the network. The ACO identifies the path followed by the nodes and also the intruder, who wants to jam the whole wireless sensor network. The architecture strategically enables the Bait agents to detect the intruders threatening the network. The proposed framework is designed for the military station. It helps the base station to detect the intrusion and decide whether the activity is normal or terrestrial and send the signal to the nearest missile station situated near the intrusion location and destroy it in minimum time. The process of detecting the intrusion earlier not only helps to learn future attacks, but also a defense counter measures.
Бесплатно
Multi Duty Cycle Scheduled Routing in Wireless Sensor Network-lifetime Maximization
Статья научная
Cluster-based protocols are best for applications that require reliability and a continuous functioning environment with a sustainable lifetime of WSN. The dynamic nature of the sensor node makes energy conservation a challenging issue. Sensor node scheduled based on sensing error for energy conservation compromise the accuracy of prediction. The high data accuracy achieved using a single duty cycle controller at each node with compromised throughput and increased routing overhead. Duty Cycle Controller managing a more number of control messages at the network level leads to control packet interference with data packet transmission, increasing packet drop and minimizing throughput. Also, the single-duty cycle controller at the network level leads to increased control overhead. The proposed multilevel cluster-based approach focuses on the appropriate cluster design, selection of cluster head, and sensor nodes scheduling based on sensing error. The proposed method applies a multi-duty cycle controller at each cluster level, and control messages handled are related to nodes in a cluster. Thus has less interference and packet drop leading to maximum throughput than existing methods. The simulation results demonstrated that the proposed method with sensor nodes scheduled at individual cluster levels using a multi-duty cycle controller exhibited improved network lifetime, throughput, and reduced energy consumption compared with the state-of-the-art techniques.
Бесплатно
Multi-User Quantum Key Distribution Using Wavelength Division Multiplexing
Статья научная
Quantum cryptography, exclusively known as Quantum key distribution (QKD), has attracted a lot of attention in the recent years with the discovery that it can provide absolute secrecy for communications. We report a new architecture for constructing a fiber-based network of quantum key distribution using optical wavelength division multiplexing in the fiber, and also using some wavelength protocols. The advantages are discussed in detail for demonstrating the experimental report in the way of feasibility for the proposed architecture.
Бесплатно
Multi-dimensional Range Query on Outsourced Database with Strong Privacy Guarantee
Статья научная
Cloud services have provided important solutions for drastically reducing the cost of data management and maintenance. However, data outsourcing not only deprives clients of direct control over their data but also allows the server to gain direct access to the client data. Data encryption has been recognized as the solution to the privacy issue, but it also creates new challenges for both industry and academia. A naive question is whether the client still has the capability to query and obtain useful information when the data are encrypted and stored remotely. This paper investigates a solution to one of the most important types of query operations over encrypted data, namely multi-dimensional range queries. Our solution combines cryptographic techniques with the bucketization approach. We leverage a three-party architecture and secure multiparty computation to design and analyze the security of the protocols. Further, we discuss solutions for both static and dynamic datasets where new data records can be appended. First, we present the solutions for the case when the set of attributes in the query is pre-defined. Subsequently, we discuss the generalization.
Бесплатно
Multi-layer Masking of Character Data with a Visual Image Key
Статья научная
Information is one of the single most important factor for understanding a situation as well as deciding upon a solution by effectively devising a working method. Thus the magnitude of securely delivering information to the correct individual or organization has always been a prime concern. The field of Cryptography deals with such necessities as to encrypt the information in such a way so that only the intended receiver, equipped with the right armoury, can decipher the message. Here in this paper a method for encrypting character data has been presented whereby the ASCII values of individual character is converted into their Hex values before they are turned into their binary form, and randomly assigned a single digit Odd integer value for a 1 and single digit Even integer value for a 0. Going forward we do some more processing of the data to make it even more secure, these will be discussed in due course. The receiver must possess a valid Image key in order to decrypt the text. This image is generated during encryption from two RGB (Red, Green and Blue) values- having a difference of a random number produced within the range of total length of the plaintext.
Бесплатно
Multicast Due Date Round-Robin Scheduling Algorithm for Input-Queued Switches
Статья научная
In recent years, the Internet has incremented the several incipient applications that rely on multicast transmission. This paper discusses the challenges of scheduling algorithms for multicast in high-speed switches that reduces the overhead of adaptation by selecting a HOL (Head of Line Cell) using Round Robin pointer. The objective of this paper is to design a scheduling algorithm called MDDR (Multicast Due Date Round-Robin) scheduling to achieve maximum throughput and low delay that has two phases request and grant. In request phase, MDDR assigns a Due Date (Request Time Slot) for HOL cells of each queue in the input port. Round Robin Pointer is utilized in the grant phase to select a request if HOL occurs. MDDR achieves more preponderant performance than MDRR (Multicast Dual Round-Robin), since the request shall be made when the Due Date is reached. MDDR mainly minimizes many requests made for output ports and time complexity. The simulation results show that the proposed algorithm has good switching performance in throughput and average time delay under Bernoulli and bursty traffic conditions.
Бесплатно
Статья научная
In this paper, we propose to optimize energy and overheads of a network by reducing the copies of messages in the network. The key idea behind the proposed scheme is to select the distance of encountered node from the destination to decide the relay nodes. This limits the number of relay nodes and thus reduces the communication energy and message overheads by producing lesser number of copies of the messages in the network. Further to maintain delivery of messages, the proposed protocol evaluates delivery probability of relay nodes. The measures of probability are inter-contact delay and variance in delay between the nodes. This probability is used to decide how many copies of a message is transferred to the encountered node. This further reduces the communication energy as well as message overheads. The simulation results show that our proposed strategy reduces message overheads and energy consumption as compared to the previous existing strategy while maintaining comparable delivery probability.
Бесплатно
Статья научная
Modern children are active Internet users. However, in the context of information abundance, they have little knowledge of which information is useful and which is harmful. To make the Internet a safe place for children, various methods are used at the international and national levels, as well as by experts, and the ways to protect children from harmful information are sought. The article proposes an approach using a multi-criteria decision-making process to prevent children from encountering harmful content on the Internet and to make the Internet more secure environment for children. The article highlights the age characteristics of children as criteria. Harmless information, Training information, Entertainment information, News, and Harmful information are considered as alternatives. Here, a decision is made by comparing the alternatives according to the given criteria. According to the trials, harmful information is rated in the last position. There is no child protection issue on the Internet using the AHP method. This research is important to protect children from harmful information in the virtual space. In the protection of minors Internet users is a reliable approach for educational institutions, parents and other subjects related to child safety.
Бесплатно
Статья научная
Many applications of mobile ad-hoc networks like conferencing, handling emergency situations, military operations require the multicast routing. Moreover, in such applications there is a demand for multimedia traffic such as audio/video calls or audio/video conferencing. For mobile ad-hoc environments, it is accepted that the on-demand reactive routing protocol AODV has become default. Moreover, to get the benefits of using a single protocol for both unicast and multicast routing, in this work, the multicast routing protocol MAODV (multicast extension of AODV) has been considered and its performance is observed for CBR, VoIP and video data traffics. Since to accommodate multimedia traffic, a routing protocol demands for stringent QoS requirements in terms of delay, jitter and packet losses; the performance of the protocol is measured in terms of QoS performance metrics such as average delay, average jitter and packet delivery ratio. Further, a modified version of MAODV (called M-MAODV) is taken and its performance is also evaluated for multimedia traffic. A fair comparison of MAODV and M-MAODV protocols is achieved through the use of same network conditions for the evaluation. From the results, the improved values of delay, jitter and packet delivery ratio have been observed for M-MAODV irrespective of node speeds and for all data traffic types.
Бесплатно
Статья научная
This paper represents The Ant Colony Optimization for MTSP and Swarm Inspired Multipath Data Transmission with Congestion Control in MANET using Total Queue Length based on the behavioral nature in the biological ants. We consider the problem of congestion control for multicast traffic in wireless networks. MANET is multi hop wireless network in which the network components such as PC, mobile phones are mobile in nature. The components can communicate with each other without going through its server. One kind of agent (salesman) is engaged in routing. One is Routing agent (salesman), who collects the information about network congestion as well as link failure and same is message agent (salesman) that uses this information to get his destination nodes. Though a number of routing protocols exists, which aim to provide effecting routing but few provide a plausible solution to overall network congestion. We attempt to explore the property of the pheromone deposition by the real ant for MTSP. The proposed algorithm using path pheromone scents constantly updates the goodness of choosing a particular path and measuring the congestion in the network using total queue length and Hop-distance.
Бесплатно
Multiple Information Hiding using Cubical Approach on Random Grids
Статья научная
The exponential growth of data and our dependence on it has increased security concerns over the protection of data. Various methodologies have been suggested to meet the security services namely; confidentiality, authentication and authorization. The (k:n) secret sharing scheme was recommended to isolate the dependence on a single entity for the safety of data. Random Grids Visual Secret Sharing (RGVSS), a category of a Visual Cryptography Secret Sharing scheme aims at encrypting a secret image into several shares using a simple algorithm. The encrypted information can be revealed by stacking the shares which can be recognized by the Human Visual System (HVS). The proposed VSS scheme exploits the geometrical configuration of the cube without distorting any of the secret information embedded on the shares. The rest of the secrets are decrypted by stacking the cubes and changing the orientation of one of the cube over the fixed one. Each side of the cube encrypts up to four secrets, the first secret can be decrypted by stacking the two cubical shares and rotating the stacked face of the cube at 90 degrees, 180 degrees and 270 degrees, reveals the other three shares respectively The proposed scheme increases the capacity of secret communication avoiding the pixel expansion problem which in turn reduces the overhead of storage and communication significantly without compromising on security and authenticity of the secret information.
Бесплатно
Статья научная
Space Division Multiplexing (SDM) based Elastic Optical Networks (EONs) (SDM-b-EONs) have been envisioned as a solution to both, the required upgradation of the single-mode fiber’s network capacity which is constrained by the non-linear Shannon’s limit and the capacity provisioning which will be necessitated by future diverse Internet traffic. The current SDM-b-EON designs are based on the use of Multiple Fibers (MF) technology; however, recently the Multiple Core Fiber (MCF) technology has gained momentum after laboratory experiments conducted on the MCF models established much lower inter-core crosstalk values. In the current work, we focus on the design of a MCF enabled SDM-b-EON for which, we formulate an Integer Linear Programming (ILP) model and then propose a heuristic algorithm to obtain the solutions for large sized networks in reasonable execution times. We then proceed to the performance comparison of the MCF and the MF enabled SDM-b-EON under the consideration of realistic parameters and network topologies which are characterized by different node(s) numbers and link distances. The obtained results demonstrate that the performance of the MCF enabled SDM-b-EON is very close to that of a MF enabled SDM-b-EON which implies that the network operators can benefit by utilizing the existing components for the MCFs rather than incurring any extra expense to provision the same traffic amount.
Бесплатно
Статья научная
Public–key digital certificates are being used in public key infrastructure to provide authentication of the user's public key. Public key digital certificates like X.509 are used to bind a public key to its user. This kind of certificates cannot be used for user authentication. Such use may lead to forgery of user's identity. Lein et al proposed a authentication scheme based on Generalized Digital Certificates (GDC). A GDC consists of user's public information like digital birth certificate, digital identity, etc. and the digital signature of trusted third party generated from that public information. The GDC based scheme provides user authentication and allows for session key establishment. The scheme is secure against forgery of user's identity but it does not provide mutual authentication. The scheme proposed in this paper not only provides mutual authentication and session key but also it preserves the security strength of Lein et al's GDC based scheme.
Бесплатно
Named Data Networking: Investigate of New Infrastructure for Future of Internet
Статья научная
The Internet main goals are largely achieved, majority of using Internet, are data retrieval and access to services. Whereas host-to-host architecture is designed for applications. According to this problem that existing Internet is like a tree of physical equipment which is established to outflow in packets from each leaf to another leaf, despite having effective communication it has problems in scalability. Also the content-centric network can recognize large amount of information that is produced for first time and used after saving it. The change is using of host-to-host-centric to completely new architecture, that its design represents our understanding of strengths and limitations of architecture of the existing Internet. In NDN applications based data and Content-centric networks, packets are retrieved according to their names instead of their source and destination addresses. This performance is for scalability, security and ease access to data. This paper discussed methods of Internet architecture based data including TDRID, DONA, Netinf, CCN, and NDN.
Бесплатно
Need of Removing Delivered Message Replica from Delay Tolerant Network - A Problem Definition
Статья научная
Recent wireless networks observe number of deployments in various conditions where they come across different intensities of link disconnection. On the basis of extent of the operating circumstances these networks are termed as Intermittently Connected Networks (ICNs). The prevailing TCP/IP protocol cannot be operational in ICNs thus providing number of new stimulating problems that are appealing the focus of the researchers. The multi-copy routing schemes achieve higher delivery probability as compared to the single copy routing scheme. This improvement is achieved at the cost of higher resource utilization i.e. multi-copy routing protocols requires more buffer space, more bandwidth, incur more overheads and consume other vital network resources. Contribution of this work is the deletion of useless replicas of the messages which are already delivered to the intended destination. We evaluate our proposed method by simulation, on four major DTNs routing algorithms: Epidemic, Spray and Wait, ProPHET and MaxProp.
Бесплатно
Network Packet Inspection to Identify Contraband File Sharing Using Forensic Tools
Статья научная
This Paper discusses the digital forensic tool that uses a field Programmable Gate Array [FPGA] based software for deep packet inspection in network Router for a Bit Torrent Handshake message. Extracts the "Information Hashing" of the file being shared, compares the hash against a list of known contraband files for forensic analysis and it matches the message to a log file. Forensic analysis gives several optimization techniques for reducing the CPU time required for reducing the CPU time required to process packets are investigated along with their ability to improve packet capture performance. Experiments demonstrate that the system is able to successfully capture and process Bit Torrent Handshake message with a probability of at least 99.0% under a network traffic load of 89.6 Mbps on a 100 Mbps network.
Бесплатно
Network Traffic Prediction with Reduced Power Consumption towards Green Cellular Networks
Статья научная
The increased number of cellular network subscribers is giving rise to the network densification in next generation networks further increasing the greenhouse gas emission and the operational cost of network. Such issues have ignited a keen interest in the deployment of energy-efficient communication technologies rather than modifying the infrastructure of cellular networks. In cellular network largest portion of the power is consumed at the Base stations (BSs). Hence application of energy saving techniques at the BS will help reduce the power consumption of the cellular network further enhancing the energy efficiency (EE) of the network. As a result, BS sleep/wake-up techniques may significantly enhance cellular networks' energy efficiency. In the proposed work traffic and interference aware BS sleeping technique is proposed with an aim of reducing the power consumption of network while offering the desired Quality of Service (QoS) to the users. To implement the BS sleep modes in an efficient manner the prediction of network traffic load is carried out for future time slots. The Long Short term Memory model is used for prediction of network traffic load. Simulation results show that the proposed system provides significant reduction in power consumption as compared with the existing techniques while assuring the QoS requirements. With the proposed system the power saving is enhanced by approximately 2% when compared with the existing techniques. His proposed system will help in establishing green communication networks with reduced energy and power consumption.
Бесплатно
Статья научная
The density of traffic is increasing on the daily basis in the world. As a result, congestion, accidents and pollution are also increasing. Vehicular Ad-hoc Network (VANET), a sub class of Mobile Ad-Hoc Network (MANET), is introduced as solutions to manage congestion and accidents on roads. VANET is gaining attention among researchers due to its wide-range applications in the field of Intelligent Transportation System (ITS). The paper focus on communication architectures along with its components and access technologies, challenges and security attacks in VANET. Furthermore, it deals with broad categorization various research domains, research methodologies and research models in VANET. At last, paper explores various application area of VANET.
Бесплатно
Network intrusion detection system based PSO-SVM for cloud computing
Статья научная
Cloud computing provides and delivers a pool of on-demand and configurable resources and services that are delivered across the usage of the internet. Providing privacy and security to protect cloud assets and resources still a very challenging issue, since the distributed architecture of the cloud makes it vulnerable to the intruders. To mitigate this issue, intrusion detection systems (IDSs) play an important role in detecting the attacks in the cloud environment. In this paper, an anomaly-based network intrusion detection system (NIDS) is proposed which can monitor and analyze the network traffics flow that targets a cloud environment. The network administrator should be notified about the nature of these traffics to drop and block any intrusive network connections. Support vector machine (SVM) is employed as the classifier of the network connections. The binary-based Particle Swarm Optimization (BPSO) is adopted for selecting the most relevant network features, while the standard-based Particle Swarm Optimization (SPSO) is adopted for tuning the SVM control parameters. The benchmark NSL-KDD dataset is used as the network data source to build and evaluate the proposed system. Acceptable evaluation results state that the proposed system is characterized by detecting the intrusive network connections with high detection accuracy and low false alarm rates (FARs).
Бесплатно
Neuro Fuzzy Model Based Routing Protocol in Mobile Ad-Hoc Networks
Статья научная
Mobile Ad-Hoc Networks (MANETs for short) are gaining the importance in the field of wireless communication. The promising feature of MANET is that it can be deployed immediately in demanding situations as they do not require the infrastructure or any centralized structures as compared to traditional wired and wireless networks.An intelligent system has been designed to select an optimum route for various contexts.An efficient protocol is designed to overcome the limits of route finding and link formation in MANET’s. This can be done by making use of the application of soft-computing techniques such as artificial neural networks, fuzzy logic and genetic algorithms. Traditional techniques are based on statistical techniques such as regression models and probabilistic methods.It can be seen from the simulation outcomes that the route finding time using the HYPER-NF-NET simulator which use soft computingtechniques is 20% to the routing finding time using NS-2 simulator. It is also seen from the simulation results that the HYPER-NF-NET protocol performance is better compared to AODV, DSR and OLSR routing protocols for different node population and various degree of congestion. The simulation results showcase a superiority of HYPER-NF-NET simulator over NS-2 and associated HFNET protocol over other existing protocols.
Бесплатно
