A Novel Charging and Accounting Scheme In Mobile Ad-Hoc Networks

Inna Kofman1 and Nurul Huda2

1University of Duesseldorf, Department of Computer Science,

Duesseldorf, Germany

2Ted Rogers School of Information Technology Management,

Ryerson University, Toronto

ABSTRACT

Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and may be reluctant to forward packets for other nodes. One approach to encourage co-operations among nodes is to reward nodes that forward data for others. Such an incentive-based scheme requires a charging and accounting framework to control and manage rewards and fines (collected from users committing infractions). In this paper, we propose a novel charging and accounting scheme for MANETs. We present a detailed description of the proposed scheme and demonstrate its effectiveness via formal proofs and simulation results [15]. We develop a theoretical game model that offers advice to network administrators about the allocation of resources for monitoring mobile nodes. The solution provides the optimal monitoring probability, which discourages nodes from cheating because the gain would be compensated by the penalty.

KEYWORDS

Mobile Ad-hoc Networks, Cooperation, Security, Game Theory, Inspection Game.


MORE.......

Intrusion Detection System Using Discrete Fourier Transform with Window Function

Yusuke Tsuge and HidemaTanaka

National Defense Academy of Japan

Hashirimizu 1-10-20 Yokosuka, Kanagawa Japan 239-8686,

ABSTRACT

An Intrusion Detection System (IDS) is counter measure against network attack. There are mainly two Types of detections; signature-based and anomaly-based. And there are two kinds of error; false negative and false positive. In development of IDS, establishment of a method to reduce such false is a major issue. In this paper; we propose a new anomaly-based detection method using Discrete Fourier Transform (DFT) with window function. In our method, we assume fluctuation of payload in ordinary sessions as random. On the other hand, we can see fluctuation in attack sessions have bias. From the view point of spectrum analysis based on such assumption, we can find out different characteristic in spectrum of attack sessions. Using the characteristic, we can detect attack sessions. Example detection against Kyoto2006+ dataset shows 12.0% of false positive at most, and 0.0% of false negative.

KEYWORDS

Intrusion Detection System, Discrete Fourier Transform, window function, Kyoto2006+ dataset

MORE.......

Trends Toward Real-Time Network Data Steganography

James Collins, Sos Agaian

The University of Texas at San Antonio, San Antonio, Texas, USA

Abstract

Network steganography has been a well-known covert data channeling method for over three decades. The basic set of techniques and implementation tools have not changed significantly since their introduction in the early 1980’s. In this paper, we review the predominant methods of classical network steganography, describing the detailed operations and resultant challenges involved in embedding data in the network transport domain. We also consider the various cyber threat vectors of network steganography and point out the major differences between classical network steganography and the widely known end-point multimedia embedding techniques, which focus exclusively on static data modification for data hiding. We then challenge the security community by introducing an entirely new network data hiding methodology, which we refer to as real-time network data steganography. Finally, we provide the groundwork for this fundamental change of covert network data embedding by introducing a system-level implementation for real-time network data operations that will open the path for even further advances in computer network security.

KEYWORDS

Network Steganography, Real-time Networking, TCP/IP Communications, Network Protocols

MORE ....

Authentication Using Trust To Detect Misbehaving Nodes In Mobile Ad Hoc Networks Using Q-Learning

S.Sivagurunathan1, K.Prathapchandran2 and A.Thirumavalavan3

1, 2 Department of Computer Science and Applications

Gandhigram Rural Institute-Deemed University, Gandhigram-624 302

Tamilnadu, India

3Department of Computer Science

Arignar Anna Government Arts College, Attur

Tamilnadu, India

ABSTRACT

Providing security in Mobile Ad Hoc Network is crucial problem due to its open shared wireless medium,multi-hop and dynamic nature, constrained resources, lack of administration and cooperation. Traditionally routing protocols are designed to cope with routing operation but in practice they may be affected by misbehaving nodes so that they try to disturb the normal routing operations by launching different attacks with the intention to minimize or collapse the overall network performance. Therefore detecting a trusted node means ensuring authentication and securing routing can be expected. In this article we have proposed a Trust and Q-learning based Security (TQS) model to detect the misbehaving nodes over Ad Hoc On Demand Distance-Vector (AODV) routing protocol. Here we avoid the misbehaving nodes by calculating an aggregated reward, based on the Q-learning mechanism by using their historical forwarding and responding behaviour by the way misbehaving nodes can be isolated.

KEYWORDS

Mobile Ad hoc Networks Security, Routing, AODV, Historical, Response, Trust, Authentication &

Q-Learning

MORE......

Y-Hamiltonian Layers Broadcast Algorithm

Amnah El-Obaid1 and Nagham_Al-Madi2

1Department of Basic Science, Faculty of Science and Information Technology, Al-

Zaytoonah University of Jordan, Amman, Jordan

2Department of Computer Science, Faculty of Science and Information Technology, Al-

Zaytoonah University of Jordan, Amman, Jordan

ABSTRACT:

Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most important process in communication and parallel computer is broadcast approach.. The approach of this case of Broadcasting is to send the message from one source to all destinations in the network which corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our simulation results show the average of our proposed algorithm over the other algorithms that presented.

KEYWORDS

Broadcasting communication, Wormhole routing, Hamiltonian model, 3-D mesh, Deadlock-free

MORE.....