International Journal of Computer Networks and Applications

Number V-2,I-5, 2015

203-211
A Survey on Potential Applications of Honeypot Technology in Intrusion Detection Systems

Authors: Muhammet Baykara, Resul Daş

Abstract

View in PDF

Number of views: 313

Information security in the sense of personal and institutional has become a top priority in digitalized modern world in parallel to the new technological developments. Many methods, tools and technologies are used to provide the information security of IT systems. These are considered, encryption, authentication, firewall, and intrusion detection and prevention systems. Moreover, honeypot systems are proposed as complementary structures. This paper presents the overall view of the publications in IDS, IPS and honeypot systems. Recently, honeypot systems are anymore used in connection with intrusion detection systems. So this paper describes possible implementation of honeypot technologies combined with IDS/IPS in a network. Studies in the literature have shown intrusion detection systems cannot find the 0-day vulnerabilities. The system provided by the honeypots and intrusion detection systems in the network, might detect new exploit and hacker attempt.

212-221
A Fine-Grained Spatial Cloaking With Query Probability Levels for Privacy in LBS

Authors: Albelaihy Abdullah, Jonathan Cazalas

Abstract

View in PDF

Number of views: 291

In the technology of LBS i.e. location based services, location related queries are submitted to the mobile users. These queries are submitted to untrusted server of LBS for obtaining service. However, these queries considerably stimulate and produce privacy issues associated with mobile users. FGcloak has been proposed so as to address this privacy related issue. It has been revealed that the FGcloak is considered as the fine grained spatial cloaking method based on the query probability levels to generate k-anonymity used for the privacy aware mobile users in the location based services. The modified Hilbert Curve is used so as to efficiently guarantee k-anonymity and simultaneously offers bigger cloaking region.

222-231
Efficient Collaborative Technique using Intrusion Detection System for Preserving Privacy in Location-based Services

Authors: Muhammad Jawad Ikram, Jonathan Cazalas

Abstract

View in PDF

Number of views: 309

The ubiquitous nature of smartphones and GPS-enabled devices, coupled with the increasingly popular usage of location-based services, has effectively created an environment where data access truly is anywhere at any time. While said environment is indeed convenient and quite useful, the unfortunate reality is that users are exposed to a variety of privacy and security threats. User location information can be tracked and then used in malicious ways by non-trusted applications and adversaries. We address this problem by proposing an efficient, collaborative technique that is integrated with an intrusion detection system and rekeying techniques. The algorithm is parameterized by defining performance and security metrics, which can then be used to find optimal settings, both in terms of privacy and quality of service. Based on the proposed performance-security metrics, the tradeoff between privacy and quality of service can be quantified.

232-241
Application of Modified ACO Meta heuristic in Spray and Wait Routing

Authors: Vinuraj.R, Sweta Jain

Abstract

View in PDF

Number of views: 296

Routing decision plays a vital role in delivering a message to its destination in a network, especially in an opportunistic network where connectivity between nodes is unpredictable i.e. intermittent connectivity; routing decision dominates in measuring the network performance parameters. Delay Tolerant Networking (DTN) was proposed to address the technical communication problems in heterogeneous networking ranging from extreme terrestrial environments to planned networks in space. Designing a routing policy for such a network should ideally feature proper handling of the implementation risk and must increase the delivery ratio maintaining a cost of minimum overhead. This paper elucidates a new routing policy based on Swarm intelligence specifically Ant colony optimization technique. An existing routing algorithm in DTN called Spray and Wait (SnW) Routing has been modified by changing the spray phase where the ant colony algorithm will make decisions about the number of copies to be sprayed at each relay node. Proposed method gives much more effective results when compared to existing spray and wait mechanism and Ant colony based protocol in DTN. Spray and wait mechanism lags behind in terms of overhead ratio while the latter lingers with regard to both; delivery ratio as well as overhead ratio. The results obtained through simulations open the gates of great opportunities for the successful implementation and desired performance of the proposed algorithm in real life scenarios as well.