submit Opinions CrossRef Open Access Subscribe New Journal Ideal

Click on image to enlarge

Indexed in Scopus

Journal of Cyber Security and Mobility

Editors-in-Chief:
Ashutosh Dutta, AT&T, USA
Ruby Lee, Princeton University, USA
Neeli R. Prasad, International Technological University, San Jose, USA
Wojciech Mazurczyk, Warsaw University of Technology, Poland

Associate Editor:
Debdeep Mukhopadhyay, Indian Institute of Technology Kharagpur, India


ISSN: 2245-1439 (Print Version),

ISSN: 2245-4578 (Online Version)
Vol: 2   Issue: 2

Published In:   April 2013

Publication Frequency: Quarterly

Search Available Volume and Issue for Journal of Cyber Security and Mobility


Journal Description        Editorial Foreword        Read Full Articles        Editorial Board        Subscription        Indexed       Opinions

MoCCA: A Mobile Cellular Cloud Architecture

doi: 10.13052/jcsm2245-1439.221
Amitabh Mishra and Gerald Masson

Johns Hopkins University Information Security Institute, Baltimore, Maryalnd, USA

Abstract: [+]    |    Download File [ 1175KB ]   |    Read Article Online

Abstract: This paper presents MoCCA–a cellular cloud architecture for buildingmobile clouds using small-footprint micro-servers running on cellphones. We provide details of this architecture which is based on GSMstandard, discuss several challenges, and include performance results to validate the assumptions that a mobile cellular cloud can indeed be inthe realm of possibilities.

Keywords: Mobile cellular networks, cloud computing, performance

Ivy: Interest-based Data Delivery in VANET through Neighbor Caching

doi: 10.13052/jcsm2245-1439.222
Tan Yan and Guiling Wang

Department of Computer Science, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA

Abstract: [+]    |    Download File [ 525KB ]   |    Read Article Online

Abstract: In this paper, we study the problem of interest-based data delivery inVehicular Ad Hoc Networks (VANETs), which is to efficiently forward datato a vehicle that owns the given interest without knowing its IDbeforehand. Such problem is generally challenging in large-scaledistributed networks, because it usually requires to query a huge numberof nodes in the network to find a node of interest out of them, which iscostly. To tackle the problem, we design an interest-based data delivery(Ivy) scheme through neighbor caching to boost the efficiency inquerying information of the vehicle with given interest. We let eachvehicle cache the information of all the neighbor vehicles it meetsduring driving, such that by just querying a few vehicles, a vehicle canretrieve the information of a large amount of vehicles, which greatly reduces the message overhead. To further reduce the message cost inroute establishment, we calculate an estimated current location of theinterested vehicle and forward data towards the calculated location,which avoids broadcasting blindly to search for the vehicle. Simulationresult shows Ivy is both efficient and effective, and outperformsexisting data delivery schemes with higher delivery ratio, lowerdelay and smaller message overhead.

Keywords: interest-based, data delivery, neighbor caching.

Performance metrics for self-positioning autonomous MANET nodes

doi: 10.13052/jcsm2245-1439.223
Janusz Kusyk1, Jianmin Zou2, Stephen Gundry2, Cem Safak Sahin3 and M.ÜmitUyar2

1The United States Patent and Trademark Office, Alexandria, VA, USA
2The Department of Electrical Engineering, The City College of New York, NY, USA
3BAE Systems – AIT, Burlington, MA, USA

Abstract: [+]    |    Download File [ 4075KB ]   |    Read Article Online

Abstract: We present quantitative techniques to assess the performance of mobile ad hoc network (MANET) nodes with respect to uniform distribution, the total terrain covered by the communication areas of all nodes, and distance traveled by each node before a desired network topology is reached.Our uniformity metrics exploit information from a Voronoi tessellation generated by nodes in a deployment territory.Since movement is one of the most power consuming tasks that mobile nodes execute, the average distance traveled by each node (ADT) before the network reaches its final distribution provides an important performance assessment tool for power-aware MANETs.Another performance metric, network area coverage (NAC) achieved by all nodes, can demonstrate how efficient the MANET nodes are in maximizing the area of operation.Using these metrics, we evaluate our node-spreading bio-inspired game (BioGame), that combines our force-based geneticalgorithm (FGA) and game theory to guide autonomous mobile nodes in making movement decisions.Our simulation experiments demonstrate that these performance evaluation metrics are good indicators for assessing the efficiency of node distribution methods.

Keywords: Topology control, MANETs, node-spreading, uniformity measures, Voronoi tessellation, area coverage, game theory, bio-inspired algorithms.

Detecting Targeted Attacks By Multilayer Deception

doi: 10.13052/jcsm2245-1439.224
Wei Wang, Jeffrey Bickford, Ilona Murynets, Ramesh Subbaraman, Andrea G. Forte, Gokul Singaraju

AT&T Security Research Center, New York, USA

Abstract: [+]    |    Download File [ 1548KB ]   |    Read Article Online

Abstract: Over the past few years, enterprises are facing a growing number of highly customized and targeted attacks that use sophisticated techniques and seek after important company assets, such as customer data and intellectual property. Unlike conventional attacks, targeted attacks are operated by experts who use multiple steps to gain access to sensitive assets, and most of time, leave very few network traces behind for detection. In this paper, we propose a multi-layer deception system that provides an in depth defense against such sophisticated targeted attacks. Specifically, based on previous knowledge and patterns of such attacks, we model the attacker as trying to compromising an enterprise network via multiple stages of penetration and propose defenses at each of these layers using deception based detection. Due to multiple layers of deception, the probability of detecting such an attack will be greatly enhanced. We present a proof of concept implementation of one of the key deception methods proposed. Due to various financial constraints of an enterprise, we also model the design of the deception system as an optimization problem in order to minimize the total expected loss due to system deployment and asset compromise.We find that there is an optimal solution to deploy deception entities,and even over spending budget on more entities will only increase the total expected loss to the enterprise. Such a system can be coupled with existing detection techniques to protect enterprises from sophisticated attacks.

Keywords: deception, honeypot, honeynet, optimization

River Publishers: Journal of Cyber Security and Mobility