A Monte Carlo method for the spread of mobile malware

A new model for the spread of mobile malware based on proximity (i.e. Bluetooth, ad-hoc WiFi or NFC) is introduced. The spread of malware is analyzed using a Monte Carlo method and the results of the simulation are compared with those from mean field theory.Comment: 11 pages, 2 figure

Optimal Non-uniform Deployments in Ultra-Dense Finite-Area Cellular Networks

Network densification and heterogenisation through the deployment of small cellular access points (picocells and femtocells) are seen as key mechanisms in handling the exponential increase in cellular data traffic. Modelling such networks by leveraging tools from Stochastic Geometry has proven particularly useful in understanding the fundamental limits imposed on network coverage and capacity by co-channel interference. Most of these works however assume infinite sized and uniformly distributed networks on the Euclidean plane. In contrast, we study finite sized non-uniformly distributed networks, and find the optimal non-uniform distribution of access points which maximises network coverage for a given non-uniform distribution of mobile users, and vice versa.Comment: 4 Pages, 6 Figures, Letter for IEEE Wireless Communication

Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs

What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is to define both an environment with obstacles and a mobility model for the stations in such an environment. The present paper focuses on a new way of considering the mobility within environments with obstacles, while keeping the core ideas of the well-known Random WayPoint mobility model (a.k.a RWP). Based on a mesh-partitioning of the space, we propose a new model called RSP-O-G for which we compute the spatial distribution of stations and analyse how the presence of obstacles impacts this distribution compared to the distribution when no obstacles are present. Coupled with a simple model of radio propagation, and according to the density of stations in the environment, we study the mean degree of the connection graphs corresponding to such mobile ad hoc networks

Simulation study on the impact of the transmission power on the performance of routing protocols under different mobility models

© 2014 IEEE. the dynamic topology of a mobile ad hoc network poses a real challenge in designing the routing protocol. This paper examine through simulation the fundamental factors, mobility models and transmission power which have a major impacts on the performance of position based routing protocols. We analyse the effect of the transmission power of on the performance of protocols under two different mobility models. Using OPNET simulation tool, results show the evaluation and performance of the proposed protocol under a unified simulation environment for different scenarios

Reliability of Mobile Agents for Reliable Service Discovery Protocol in MANET

Recently mobile agents are used to discover services in mobile ad-hoc network (MANET) where agents travel through the network, collecting and sometimes spreading the dynamically changing service information. But it is important to investigate how reliable the agents are for this application as the dependability issues(reliability and availability) of MANET are highly affected by its dynamic nature.The complexity of underlying MANET makes it hard to obtain the route reliability of the mobile agent systems (MAS); instead we estimate it using Monte Carlo simulation. Thus an algorithm for estimating the task route reliability of MAS (deployed for discovering services) is proposed, that takes into account the effect of node mobility in MANET. That mobility pattern of the nodes affects the MAS performance is also shown by considering different mobility models. Multipath propagation effect of radio signal is considered to decide link existence. Transient link errors are also considered. Finally we propose a metric to calculate the reliability of service discovery protocol and see how MAS performance affects the protocol reliability. The experimental results show the robustness of the proposed algorithm. Here the optimum value of network bandwidth (needed to support the agents) is calculated for our application. However the reliability of MAS is highly dependent on link failure probability

PERFORMANCE ANALYSIS OFADAPTIVE MULTIPLE QUEUING DISCIPLINES (AMQD) FORVOIPROUTING IN RANDOM WAY POINT MOBILITY MODEL OVER MANET SCENARIO

In Mobile Ad hoc Network (MANET), QOS (Quality of Services) in VOIP application plays anextremelysignificantresponsibility. Queuing disciplinesis anissue of concentratedconversation and research in the wireless network field for development of packets from dissimilar traffic flow for dispensation at anexactnode.Hence Mobility takes an important rolein networks to evaluate the presentation of AMQD with different Codec's for voice Over Internet. VOIPis arisingaccepted Internet application toprovidehigh-quality services through Mobile Adhoc Network (MANET).Based on the analysis and assessment of different mobility models such as Random Waypoint Models, Reference point group models,Manhattan Mobility models , it is pointing out that this network also facea lot of challenges on QOS issueupon the node movement of different mobility. The QoS issues such as packet loss, less throughput, more delay, jitter issues and high energy consumption, Combine these issues together with mobility models, in this paper the researcherestimate the performance of various VOIP codec with Adaptive Multiple Queuing Disciplines (AMQD) namely, IAE3, DBPQ, CBCRTQ over MANET. Simulation and GUI experiments demonstrate thecomparative analysis of different queuing in quality of services parameter

A New Framework for Constructing Realistic Mobility Models

A good mobility model can help researchers to study the user mobility issues in many areas (wireless LAN context switching). In this paper, we propose a new framework for constructing a realistic mobility model incorporating decision and operation models. We use the revised social force model to simulate the realistic mobile users’ movements and artificial neural networks (ANN) models to create a decision model within the proposed mobility framework

Improving Network Performance with Affinity based Mobility Model in Opportunistic Network

Opportunistic network is a type of Delay Tolerant Network which is characterized by intermittent connectivity amongst the nodes and communication largely depends upon the mobility of the participating nodes. The network being highly dynamic, traditional MANET protocols cannot be applied and the nodes must adhere to store-carry-forward mechanism. Nodes do not have the information about the network topology, number of participating nodes and the location of the destination node. Hence, message transfer reliability largely depends upon the mobility pattern of the nodes. In this paper we have tried to find the impact of RWP (Random Waypoint) mobility on packet delivery ratio. We estimate mobility factors like number of node encounters, contact duration(link time) and inter-contact time which in turn depends upon parameters like playfield area (total network area), number of nodes, node velocity, bit-rate and RF range of the nodes. We also propose a restricted form of RWP mobility model, called the affinity based mobility model. The network scenario consists of a source and a destination node that are located at two extreme corners of the square playfield (to keep a maximum distance between them) and exchange data packets with the aid of mobile 'helper' nodes. The source node and the destination node are static. The mobile nodes only help in relaying the message. We prove how affinity based mobility model helps in augmenting the network reliability thereby increasing the message delivery ratio and reduce message delivery latency.Comment: IJWMN Journal, Opportunistic Network, 14 pages, 10 figures with Appendi