International Journal of Communication Networks and Information Security (IJCNIS)
Not a member yet
1021 research outputs found
Sort by
Design and Implementation of ID Based MANET Autoconfiguration Protocol
Get PDFAuto-configuration protocols are used for assignment of unique IP addresses to nodes in Mobile ad hoc networks. Without the assignment of unique IP addresses, service provisioning between the nodes is not possible. Such protocols use various heuristics to ensure the uniqueness in IP address assignment; such aspects increase the overall complexity in MANET system design. Moreover the overriding role of IP address as an ID in Application layer and Locator in routing space is a bottleneck in future wireless network (FWN) design. Contemporary FWN research is focusing on ID/Locator split concept designs. In this paper we propose an ID/Locator based architecture for MANETs which also solves auto-configuration requirements for MANETs. Our proposed architecture is an adaptation from available ID/Locator split concepts for infrastructure oriented networks for usage in MANET context. The designed protocol uses identifiers for node identification, node discovery and traffic flow between end points. The protocol support provision for running contemporary IP oriented services. We have also verified various use cases of our proposed protocol through Linux based implementation
Deterministic Static Sensor Node Placement in Wireless Sensor Network based on Territorial Predator Scent Marking Behaviour
Get PDFAn optimum sensor node placement mechanism for Wireless Sensor Network (WSN) is desirable in ensuring the location of sensor nodes offers maximum coverage and connectivity with minimum energy consumption. This paper proposes a sensor node placement algorithm that utilizes a new biologically inspired optimization algorithm that imitates the behaviour of a territorial predator in marking their territories with their odours known as Territorial Predator Scent Marking Algorithm (TPSMA). The main objectives considered in this paper are to achieve maximum coverage and minimum energy consumption with guaranteed connectivity. A simulation study has been carried out to compare the performance of the proposed algorithm implemented in two different single objective approaches with an Integer Linear Programming based algorithm. The proposed single objective approaches of TPSMA studied in this paper are TPSMA with minimum energy and TPSMA with maximum coverage. Simulation results show that the WSN deployed using the proposed TPSMA sensor node placement algorithm is able to arrange the sensor nodes according to the objective required; TPSMA with maximum coverage offers the highest coverage ratio with fewer sensor nodes up to 100% coverage while TPSMA with minimum energy consumption utilized the lowest energy as low as around 4.85 Joules. Full connectivity is provisioned for all TPSMA approaches since the constraint of the optimization problem is to ensure the connectivity from all sensor nodes to the sink node
Improved Sensing Accuracy using Enhanced Energy Detection Algorithm with Secondary User Cooperation in Cognitive Radios
Get PDFSpectrum sensing is indispensable for cognitive radio to identify the available white spaces. Energy detection is considered as a preferred technique for spectrum sensing in cognitive radio networks. It is because of its simplicity, applicability and low computational complexity, energy detection is employed widely for spectrum sensing. This paper proposes an enhanced energy detection based spectrum sensing algorithm which incorporates the features of traditional energy detection and cooperative detection. The false alarm and detection probabilities of the proposed algorithm are derived theoretically under AWGN channel conditions. The performance of the proposed algorithm is evaluated analytically for various decision thresholds. The performance evaluations indicate that the proposed enhanced energy detection algorithm outshines the traditional energy detection algorithm and greatly improves the spectrum sensing accuracy under varying SNR conditions
Optimal Spectrum Sensing Threshold for Unequal Priors Case
Get PDFClassical spectrum sensing techniques utilize maximum likelihood (ML) detection for identification of spectrum holes. The approach is sub-optimal for the case of un-equal priors where the probabilities of channel occupation and vacancy are not the same. Such situations are bound to occur in most commercial bands such as GSM etc and hence are of more interest. The loss in performance has been disregarded as negligible in most of the work done on spectrum sensing techniques. This paper quantifies the effects of changing priors on classical energy detection and infers that the loss in spectrum sensing performance is not negligible. The deterioration is especially considerable at low SNR values and at low probabilities of channel occupation. An optimum threshold for achieving minimum probability of error has been derived in this work for unequal prior case. Detection based on the proposed threshold out-performs classical detectors under the assumption that priors are known at the receiver
Survey on Lightweight Primitives and Protocols for RFID in Wireless Sensor Networks
Get PDFThe use of radio frequency identification (RFID) technologies is becoming widespread in all kind of wireless network-based applications. As expected, applications based on sensor networks, ad-hoc or mobile ad hoc networks (MANETs) can be highly benefited from the adoption of RFID solutions. There is a strong need to employ lightweight cryptographic primitives for many security applications because of the tight cost and constrained resource requirement of sensor based networks. This paper mainly focuses on the security analysis of lightweight protocols and algorithms proposed for the security of RFID systems. A large number of research solutions have been proposed to implement lightweight cryptographic primitives and protocols in sensor and RFID integration based resource constraint networks. In this work, an overview of the currently discussed lightweight primitives and their attributes has been done. These primitives and protocols have been compared based on gate equivalents (GEs), power, technology, strengths, weaknesses and attacks. Further, an integration of primitives and protocols is compared with the possibilities of their applications in practical scenarios
Low Complexity Joint Sub-Carrier Pairing, Allocation and Relay Selection in Cooperative Wireless Networks
Get PDFMulti-carrier cooperative relay-based wireless communication is of particular interest in future wireless networks. In this paper we present resource allocation algorithm in which sub-carrier pairing is of particular interest along with fairness constraint in multi-user networks. An optimization of sub-carrier pair selection is formulated through capacity maximization problem. Sub-carrier pairing is applied in both two-hop Amplify & Forward (AF) and Decode & Forward (DF) cooperative multi-user networks. We develop a less complex centralized scheme for joint Sub-carrier pairing and allocation along with relay selection. The computational complexity of the proposed algorithms has been analyzed and performance is compared with Exhaustive Search Algorithm
Classification of Routing Algorithms in Volatile Environment of Underwater Wireless Sensor Networks
Get PDFThe planet earth is basically a planet of water with less than 30% land mass available for humans to live on. However, the areas covered with water are important to mankind for the various resources which have been proven to be valuable. Such resources are gas, oil, marine products which can be used as food, and other minerals. In view of the vast area in which these resources can be found, a network of sensors is necessary so that they can be explored. However, sensor networks may not be helpful in the exploration of these resources if they do not have a sufficiently good routing mechanism. Over the past few decades, several methods for routing have been suggested to address the volatile environment in underwater communications. These continue researches; have enhanced the performance along with time. Meanwhile, there are still challenges to deal with for a better and efficient routing of data packets. Large end-to-end delays, high error channel rates, limited bandwidth, and the consumption of energy in sensor network are some such challenges. A comprehensive survey of the various routing methods for the partially connected underwater communication environment are presented in this paper
Mitigating External Threats in Wireless Local Area Networks
Get PDFAs computer networks become more critical to enterprises, it is inevitable that efficient security policies are designed, case in point: wireless networks, in order to effectively ensure the confidentiality, availability, and integrity of the data traversing these networks. The primary objective of this paper is to appropriately simulate an enterprise network, and evaluate the threats, and possible mitigation approaches applicable. An analysis of an enterprise WLAN (Wireless Local Area Network) was carried out, to identify relevant vulnerabilities, and possible countermeasures against these threats. The primary threats analysed were those possible by an external adversary. Upon identification of said threats, a security model was developed, so as to improve enterprise network security, and ensure the levels are optimum. In addition, a number of the principles involved are applicable to non-wireless networks. Keywords: WLAN, Wireless, Security, WPA 2, IEEE 802.11.
EICIDS-Elastic and Internal Cloud-based Intrusion Detection System
Get PDFThe elasticity and abundant availability of computational resources are attractive to intruders exploit vulnerabilities of the cloud, thus being able to launch attacks against legitimate users to gain access to private and privileged information. The Intrusion Detection Systems are presented as a possible solution for protection; however, to effectively protect cloud users, it must have the ability to expand, rapidly increased or decreased the amount of sensors, according to the provisioning resources, and isolate the access to infrastructure and system levels. Protection against internal threats should also be planned, as most of the protection systems do not identify them properly. In order to solve these problems, we present the EICIDS - Elastic and Internal Cloud-based Intrusion Detection System, which monitors the internal environment of the cloud, entering sensor data capture in the local network of user´s VMs, thus being able to detect suspicious behavior of users. For this, the EICIDS uses the characteristics of virtual machines (such as fast boot, quick recovery, stop, migrate between different hosts and execution across multiple platforms) in order to monitor and protect the environment of cloud computing, with the growth or reduction of the cloud in order to save resources
A Deterministic Algorithm for the Deployment of Wireless Sensor Networks
Get PDFWireless sensor networks are made up by communicating sensor nodes that gather and elaborate information from real world in a distributed and coordinated way in order to deliver an intelligent support to human activities. They are used in many fields such as national security, surveillance, health care, biological detection, and environmental monitoring. However, sensor nodes are characterized by limited wireless communication and computing capabilities as well as reduced on-board battery power. Therefore, they have to be carefully deployed in order to cover the areas to be monitored without impairing network lifetime. This paper presents a new deterministic algorithm to solve the coverage problem of well-known areas by means of wireless sensor networks. The proposed algorithm depends on a small set of parameters and can control sensor deployment within areas even in the presence of obstacles. Moreover, the algorithm makes it possible to control the redundancy degree that can be obtained in covering a region of interest so as to achieve a network deployment characterized by a minimum number of wireless sensor nodes