Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1110
Modeling GSM Based Network Communication in Vehicular Network
Статья научная
Obviously fair communication establishment in every technology increases the efficiency. As we know well, vehicles are used in day to day life of every human being to move from one location to another location. If network communication is formed between vehicles, mobile phones and home based telephones, it will increase the safety of the passengers by communicating with one another. In this paper, we propose GSM based network communication in vehicles, which will develop reliable network communication between vehicles, mobile phones and home based telephones. The added advantage GSM based network communication among vehicles will lead to safety of travel by tracking the vehicle's location, since GSM based network communication is established in vehicles.
Бесплатно
Modeling Prioritized Hard Handoff Management Scheme for Wireless Mobile Networks
Статья научная
The channel associated with the current connection serviced by a base station is changed while a call is in progress. Usually, continuous service is achieved by supporting handoff from one cell to another. It is often initiated either by crossing a cell boundary or by deterioration in quality of the signal in the current channel. The existing call is then changed to a new base station. For the traffics which are non stationary at and are away from the servicing base station, the chances of a call to be handed off are increasing. In this paper we propose a scheme MH_2S to modeling and implementing a traffic model with handoff behavior for wireless mobile networks . The simulation model MH_2S with priority is developed to investigate the performance behavior of hard handoff strategy. Novelty of the proposed model MH_2S results that it can improve call blocking rate of handoff calls. In addition to this, measurement of blocking probabilities for both originating calls and handoff calls is another impressive achievement of the model.
Бесплатно
Статья научная
The configuration of port’s loading-and-unloading equipment is an optimization problem, which endeavors to put limited handling equipment to each operating line to achieve the maximum overall production efficiency. We set up the T-stage decision-making model of loading-and-unloading line equipment configuration by using the method of Multi-stage Decision, and design the algorithm of the mathematical model. Research results in this paper lay the foundation for the development of loading-and-unloading equipment configuration system, and provide scientific basis for the decision of type selection and rational quantity of loading-and-unloading equipment.
Бесплатно
Modeling and Analysis on a DTN Based Wireless Sensor Network Topology Control
Статья научная
Wireless sensor networks (WSNs) have unlimited and extensive potential application in different areas. Due to WSNs’ work environments and nodes behavior, intermitted network connection may occur frequently, which lead packets delay and lose in the process of data transmission. Most related works on WSNs, seldom consider how to address the issue of intermitted network connection in WSNs. To the best of our knowledge, few papers did related work on how to utilize intermitted network connection to control the topology of WSNs and save the battery of nodes in WSNs. Although intermitted network connection in WSNs is not a good phenomenon, when it occurs, it indeed can keep some nodes in power saving mode. If we can intelligently control WSNs network topology and get intermitted network connection during the intervals of transmission, we will find another way to save the nodes energy to the maximum extent. Based on these ideas, we import the idea of Delay Tolerant Network (DTN) protocol to address the issue. In this paper, first we give the modeling and analysis on node behaviors in DTN WSNs, then we present the end to end performance analysis in DTN WSNs to get the parameters of optimistic hops, maximum hops and each node’s neighbor number, after that we give some basic rules on DTN parameters selection for DTN based WSNs topology control. Finally, we do a related simulation by our DTN based WSNs topology control approach and HER routing algorithm; simulation results show that our approach and algorithm gained better performance in WSN life span, nodes energy equilibrium consumption than DADC.
Бесплатно
Modeling and Verification of 802.16 MAC Protocol using Higher-Order Petri Nets
Статья научная
In this paper, we present a new Petri Net (PN) approach to model the IEEE 802.16 MAC Protocol called Higher-Order Stochastic Reward Net (HOSRN) and through the application of the proposed rule. HOSRN is used as a modeling formalism as it readily captures the quality of service requirements of the traffic classes. We apply HOSRN to verify the effectiveness of QoS of the protocol using Reachability graph.
Бесплатно
Статья научная
This paper proposes a new approach to estimating the contour of the coverage zone for a cellular communications base station that takes into account meaningful reflecting objects located out of the considering zone. Based on this approach, the procedure for modeling and designing the cellular system coverage area. Unlike known methods, the developed procedure considers the influence of electromagnetic wave reflection from external details of the relief, in particular essential reflecting objects located outside the considered cell. The effect of the external objects on the formation of the coverage area resulting contour is considered analytically, numerically and experimentally. The proposed solution leads to more accurate designing of the coverage area for each cell. This creates the opportunity for further development of designing techniques to more effective engineering solutions at developing and applying cellular communication systems in real situations and at various scenarios.
Бесплатно
Modelling and Implementation of Network Coding for Video
Статья научная
In this paper, we investigate Network Coding for Video (NCV) which we apply for video streaming over wireless networks. NCV provides a basis for network coding. We use NCV algorithm to increase throughput and video quality. When designing NCV algorithm, we take the deadline as well as the decodability of the video packet at the receiver. In network coding, different flows of video packets are packed into a single packet at intermediate nodes and forwarded to other nodes over wireless networks. There are many problems that occur during transmission on the wireless channel. Network coding plays an important role in dealing with these problems. We observe the benefits of network coding for throughput increase thanks to applying broadcast operations on wireless networks. The aim of this study is to implement NCV algorithm using C programming language which takes the output of the H.264 video codec generating the video packets. In our experiments, we investigated improvements in terms of video quality and throughput at different scenarios.
Бесплатно
Modification of RC4 Algorithm by using Two State Tables and Initial State Factorial
Статья научная
RC4 algorithm is one of the most significant stream and symmetric cryptographic algorithms, it is simple and used in various commercial products, it has many weaknesses such as a bias in the key stream that some key bytes are biased toward some values. In this paper, a new algorithm is proposed by using initial state factorial to solve the correlation issue between public known outputs of the internal state by using an additional state table with the same length as that of the state to contain the factorial of initial state elements. The analysis of RC4 and developed RC4 algorithm is done based on their single bias and double byte bias and shows that many keystream output bytes of RC4 are produced key stream bytes that are biased to many linear combinations while developed RC4 key bytes have no single and double biases. The results show that the series that is generated by developed RC4 is more random than that generated by RC4 and the developed algorithm is faster than RC4 execution time and requires less time. Additionally, the developed algorithm is robust against many attacks such as distinguishing attack.
Бесплатно
Modified ECC for Secure Data Transfer in Multi-Tenant Cloud Computing
Статья научная
Cloud computing technologies comprise various kinds of significant desirable constrains such as security, liability, government surveillance, telecommunications capacity, anonymity and privacy. The usage of cipher text technology is considered as a desired technique for performing the process of encryption in order to solve the issue of granting security to the data that are shared in the cloud. Similarly, the architecture of multi-tenant in the cloud computing system grants benefits to both the service providers and end-users which shares a common cloud platform to multiple tenants (i.e.) users and suitable resources are also computed by implementing proposed architecture. Therefore in this research work, the concept of cipher text multi-tenant are integrated for providing enhanced security to the data shared in the cloud environment. Hence a Modified Elliptic Curve Cryptography (MECC) based on Diffee Hellman algorithm is proposed in this research paper which provides enhanced security using alternate key generation. The encryption, decryption, upload and download time are calculated and it is concluded that the algorithm that is proposed in this research paper consumes less time for all these measures when comparing with other existing algorithms. Characteristics like less memory, high operational performance, small sized keys and rapid key generation process, and effective resource savings enable the modified ECC to obtain high efficiency. The encryption time of the proposed MECC system was 51ms with the key length 4096 bits, whereas existing method had 92ms as encryption time. Likewise With the key length of 4096 bits, the decryption time for the proposed model was 159ms. Accordingly the proposed system has reduced cipher text key size of 836KB when compared with the existing AES, Blow Fish, and Two Fish. Additionally, the key generation time (35 s) also seems to be considerably reduced when compared with the existing methods. These statements reveal that the proposed system outshine the state of art methods in terms of key generation time, encryption and decryption time and computational complexity.
Бесплатно
Статья научная
Randomness is an imperative component in every cryptographic algorithm to guarantee secret keys are unpredictable and secured against all forms of attacks. Speck generated sequence is non-random, a clear sign that it falls beyond the acceptable success rate when tested in statistical analysis. Thus, this study resolves the non-randomness by integrating a novel key derivation function that uses elementary operators designed for lightweight application. This design aims not to compromise performance when implemented on software and hardware. As a result, the modified Speck successfully passed the NIST SP 800 - 22 and Dieharder v3.31.0 Statistical Test Analysis as no p-value is flagged as failed during testing. Hence, making modified Speck cryptographically secured. Nevertheless, a 1.06% decrease in the figure of merit of the modified Speck still makes it worthier in a resource-constrained Internet of Things application as contrasted to Speck because it is proven to be beyond cryptographically secured.
Бесплатно
Modified LEACH-DT Algorithm with Hierarchical Extension for Wireless Sensor Networks
Статья научная
The selection of cluster heads is of immense importance in the cluster based protocols which are widely used in wireless sensor networks. However, for the random selection of cluster heads when the distance of cluster heads is also taken into account such as in LEACH-DT algorithm, the lifetime of the network is improved. In this paper, a new algorithm for selection of cluster heads is proposed where the residual energy of the cluster heads is also considered along with the distance to the base station. The proposed approach ensures better energy balance of the network nodes. The performance of the proposed algorithm is measured at various stages of network lifetime and a significant improvement over LEACH-DT has been observed. Also, a two-level heterogeneous hierarchical architecture of the proposed algorithm is investigated which further enhances the performance of the proposed algorithm.
Бесплатно
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 Attribute Trust Aware Routing for Adversary Detection in Wireless Sensor Networks
Статья научная
Security attacks has become major obstacles in Wireless Sensor Networks (WSN) and Trust Aware Routing is second line of defense. With an aim to improve on the existing routing mechanisms, in this paper, we propose Interactive, Onlooker and Capability Trust Aware Routing (IOC-TAR), a multi-trust attribute framework for trust management in WSNs. IOC-TAR employs three trust features to establish a trustworthy relationship between sensor nodes for their cooperation. Interactive trust uses communication interactions, onlooker trust uses neighbor node’s opinions and capability trust uses stability and fault tolerance for trust assessment. For, each node, one composite trust factor is formulated and decides its trustworthiness. Extensive simulation experiments are conducted to evaluate the effectiveness and efficiency of proposed IOC-TAR in the identification of malicious nodes and the provision of attack resilience. The results declare that the IOC-TAR enhances the attack resilience by improving Malicious Detection rate and reducing False Positive Rate.
Бесплатно
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.
Бесплатно
