WorldWideScience

Sample records for ad hoc mobile

  1. Security Threats in Mobile Ad Hoc Network

    Biswas, Kamanashis; Ali, Md. Liakat

    2007-01-01

    Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure and pre-determined organization of available links. The nodes in MANET themselves are responsible for dynamically discovering other nodes to communicate. Although the ongoing trend is to adopt ad hoc networks for commercial uses due to their certain unique properties, the main challenge is the vulnerability to security attacks. A number of challenges like o...

  2. Data Confidentiality in Mobile Ad hoc Networks

    Aldabbas, Hamza; Janicke, Helge; Al-Bayatti, Ali; 10.5121/ijwmn.2012.4117

    2012-01-01

    Mobile ad hoc networks (MANETs) are self-configuring infrastructure-less networks comprised of mobile nodes that communicate over wireless links without any central control on a peer-to-peer basis. These individual nodes act as routers to forward both their own data and also their neighbours' data by sending and receiving packets to and from other nodes in the network. The relatively easy configuration and the quick deployment make ad hoc networks suitable the emergency situations (such as human or natural disasters) and for military units in enemy territory. Securing data dissemination between these nodes in such networks, however, is a very challenging task. Exposing such information to anyone else other than the intended nodes could cause a privacy and confidentiality breach, particularly in military scenarios. In this paper we present a novel framework to enhance the privacy and data confidentiality in mobile ad hoc networks by attaching the originator policies to the messages as they are sent between nod...

  3. Data Confidentiality in Mobile Ad hoc Networks

    Hamza Aldabbas

    2012-03-01

    Full Text Available Mobile ad hoc networks (MANETs are self-configuring infrastructure-less networks comprised of mobile nodes that communicate over wireless links without any central control on a peer-to-peer basis.These individual nodes act as routers to forward both their own data and also their neighbours’ data by sending and receiving packets to and from other nodes in the network. The relatively easy configuration and the quick deployment make ad hoc networks suitable the emergency situations (such as human or natural disasters and for military units in enemy territory. Securing data dissemination between these nodes in such networks, however, is a very challenging task. Exposing such information to anyone else other than the intended nodes could cause a privacy and confidentiality breach, particularly in military scenarios. In this paper we present a novel framework to enhance the privacy and data confidentiality in mobile ad hoc networks by attaching the originator policies to the messages as they are sent between nodes. We evaluate our framework using the Network Simulator (NS-2 to check whether the privacy and confidentiality of the originator are met. For this we implemented the Policy Enforcement Points (PEPs, as NS-2 agents that manage and enforce the policies attached to packets at every node in the MANET.

  4. Mobility Prediction Based Neighborhood Discovery for Mobile Ad Hoc Networks

    Li, Xu; Mitton, Nathalie; Simplot-Ryl, David

    2010-01-01

    Hello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/aliveness by periodic `hello' messages. Central to any hello protocol is the determination of `hello' message transmission rate. No fixed optimal rate exists in the presence of node mobility. The rate should in fact adapt to it, high for high mobility and low for low mobility. In this paper, we propose a novel mobility prediction based hello protocol, named ...

  5. Mobility Prediction Based Neighborhood Discovery in Mobile Ad Hoc Networks.

    Li, Xu; Mitton, Nathalie; Simplot-Ryl, David

    2011-01-01

    International audience Hello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/ aliveness by periodic 'hello' messages. Central to a hello protocol is the determination of 'hello' message transmission rate. No fixed optimal rate exists in the presence of node mobility. The rate should in fact adapt to it, high for high mobility and low for low mobility. In this paper, we propose a novel mobility prediction bas...

  6. Ad hoc mobile wireless networks principles, protocols, and applications

    Sarkar, Subir Kumar

    2013-01-01

    The military, the research community, emergency services, and industrial environments all rely on ad hoc mobile wireless networks because of their simple infrastructure and minimal central administration. Now in its second edition, Ad Hoc Mobile Wireless Networks: Principles, Protocols, and Applications explains the concepts, mechanism, design, and performance of these highly valued systems. Following an overview of wireless network fundamentals, the book explores MAC layer, routing, multicast, and transport layer protocols for ad hoc mobile wireless networks. Next, it examines quality of serv

  7. Geocasting and Multicasting Routing Operation in Mobile Ad Hoc Network

    R.Kruthika

    2013-01-01

    The paper considers, the different multicasting routing protocols in wireless mobile Ad hoc network (MANET).An Ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure .In this environment routing/multicasting protocols are faced with the challenge of producing multihop router under host mobility and band constraints. Various approaches and routing protocol have been proposed to address Ad hoc networking problems and multiple standardization effort wit...

  8. Ad hoc mobile wireless networks principles, protocols and applications

    Sarkar, Subir Kumar; Puttamadappa, C

    2007-01-01

    Ad hoc mobile wireless networks have seen increased adaptation in a variety of disciplines because they can be deployed with simple infrastructures and virtually no central administration. In particular, the development of ad hoc wireless and sensor networks provides tremendous opportunities in areas including disaster recovery, defense, health care, and industrial environments. Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications explains the concepts, mechanisms, design, and performance of these systems. It presents in-depth explanations of the latest wireless technologies

  9. MobileMAN: Mobile Metropolitan Ad hoc Networks

    Conti, Marco

    2003-01-01

    The project aims to define and develop a metropolitan area, self-organizing and totally wireless network that we call Mobile Metropolitan Ad-hoc Network (MobileMAN). In a MobileMAN the users device are the network, no infrastructure is strictly required. A MobileMAN is finalized at providing, at a low cost and where and when is needed, the communication and interaction platform for people inside a man. It will support a kind of citizens network by which people could avoid the operators infras...

  10. A mobile ad-hoc network (MANET) implementation on android

    Mohammed, Mohammed Khalid Hassan

    2014-01-01

    The continual changing of self-organizing nodes located in an infrastructure-less mesh network is called ad hoc network. The recent years have witnessed a rapid growth of interest in ad hoc networking. This research with the aid of Java Native Interface (JNI) and UNIX kernel tools for network, a method to build a Mobile Ad hoc Network (MANET) has been implemented for Android devices to provide supplementary way of communication in certain situations where network infrastructure does not exist...

  11. A Review of Anonymity in Mobile Ad Hoc Networks

    KERNÁCS János; SZILÁGYI Szabolcs

    2010-01-01

    An ad hoc network is a self-organizingnetwork of wireless links connecting mobile nodes.The mobile nodes can communicate without aninfrastructure. They form an arbitrary topology, wherethe nodes play the role of routers and are free to moverandomly. Mobile ad hoc networks requireanonymous communications, in order to thwart newwireless passive attacks, and to protect new assets ofinformation such as nodes’ locations, motion patterns,network topology and traffic patterns in addition toconventio...

  12. Hierarchical Approach for Key Management in Mobile Ad hoc Networks

    A, Renuka; Shet, K. C.

    2009-01-01

    Mobile Ad-hoc Network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. The conventional security solutions to provide key management through accessing trusted authorities or centralized servers are infeasible for this new environment since mobile ad hoc networks are characterized by the absence of any infrastructure, frequent mobility, and wireless links. We p...

  13. Dynamic Mobile IP routers in ad hoc networks

    Kock, B.A.; Schmidt, J.R.

    2005-01-01

    This paper describes a concept combining mobile IP and ad hoc routing to create a robust mobile network. In this network all nodes are mobile and globally and locally reachable under the same IP address. Essential for implementing this network are the dynamic mobile IP routers. They act as gateways

  14. Coping With Misbehavior in Mobile Ad-hoc Networks

    Buchegger, Sonja

    2004-01-01

    In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward correctly? Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. Existing approaches such as economic incentives or secure routing by cryptographic means allevi...

  15. Hierarchical Approach for Key Management in Mobile Ad hoc Networks

    A., Renuka

    2009-01-01

    Mobile Ad-hoc Network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. The conventional security solutions to provide key management through accessing trusted authorities or centralized servers are infeasible for this new environment since mobile ad hoc networks are characterized by the absence of any infrastructure, frequent mobility, and wireless links. We propose a hierarchical group key management scheme that is hierarchical and fully distributed with no central authority and uses a simple rekeying procedure which is suitable for large and high mobility mobile ad hoc networks. The rekeying procedure requires only one round in our scheme and Chinese Remainder Theorem Diffie Hellman Group Diffie Hellmann and Burmester and Desmedt it is a constant 3 whereas in other schemes such as Distributed Logical Key Hierarchy and Distributed One Way Function Trees, it depends on the num...

  16. Vehicular Ad Hoc Network Mobility Model

    Budi Rahmadya

    2014-01-01

    Full Text Available Indonesia is one of developing countries with high land traffic density. This traffic density could cause traffic jam, traffic accidents and other disturbances. This research had developed a simulator that could calculate the traffic density of roads in urban areas. With the use of this simulator, the researcher could calculate the time needed if the source node transports the message to the destination node by using the ad hoc network communication facility. In this research, every vehicle utilizes multi-hop communication in a communication network. The vehicle sends the message through flooding message and passes on the received message to other vehicles. Based on the simulation done on map size 10 km x 10 km with a total of 20 vehicles on the road, it was calculated that the simulator could transmit the message to its destination on the 106th second from node 3 and with the total of 200 vehicles on the road, the simulator could transmit the message to its destination on the 22nd second from node 5. 

  17. Energy Aware OLSR-Based Mobile Ad Hoc Networks

    Wardi

    2012-01-01

    OLSR is a well-known proactive routing protocol designed for mobile ad hoc networks (MANETs). OLSR adopts a concept of an MPR mechanism where only mobile nodes selected as MPR nodes can retransmit broadcast packets received from other mobile nodes. Although OLSR reduces the number of broadcast packets, MPR nodes consume more energy than other mobile nodes. Since mobile nodes in MANETs are powered by battery with limited energy, energy efficiency is a critical issue in designing a routing prot...

  18. Mobile Ad Hoc Networks Current Status and Future Trends

    Loo, Jonathan

    2011-01-01

    Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility o

  19. Information Sharing Modalities for Mobile Ad-Hoc Networks

    de Spindler, Alexandre; Grossniklaus, Michael; Lins, Christoph; Norrie, Moira C.

    2009-01-01

    Current mobile phone technologies have fostered the emergence of a new generation of mobile applications. Such applications allow users to interact and share information opportunistically when their mobile devices are in physical proximity or close to fixed installations. It has been shown how mobile applications such as collaborative filtering and location-based services can take advantage of ad-hoc connectivity to use physical proximity as a filter mechanism inherent to the application logi...

  20. Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks

    Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

    2016-01-01

    Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. PMID:27258013

  1. Performance Comparison of Routing Protocols in Mobile Ad Hoc Networks

    Er. Rakesh Kumar,

    2010-08-01

    Full Text Available hoc networks are self configuring network and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol can accommodate such an environment. Different protocols govern the mobile ad hoc networks and to improve the packet delivery ratio of Destination-Sequenced Distance Vector (DSDV routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used. Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay routing overhead in different environment; varying number of nodes, speed and pause time. Simulation results show that IDSDVcompared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still compete with AODV in higher node speed and number of node.

  2. A Reactive Location Service for Mobile Ad Hoc Networks

    Käsemann, Michael; Füßler, Holger; Hartenstein, Hannes; Mauve, Martin

    2002-01-01

    We present and analyze a reactive location service RLS for mobile ad hoc networks. RLS provides a mobile node in a wireless ad-hoc network with the means to inquire the current geographical position of another node on-demand and can be used as a building block for location-based routing. We provide a comparison of RLS to an ideal omniscient location service as well as to the complex Grid Location Service (GLS). In addition, we compare the performance of greedy location-based routing in combin...

  3. Routing Protocol for Mobile Ad-hoc Wireless Networks

    I. M. B. Nogales

    2007-09-01

    Full Text Available Bluetooth is a cutting-edge technology used for implementing wireless ad hoc networks. In order to provide an overall scheme for mobile ad hoc networks, this paper deals with scatternet topology formation and routing algorithm to form larger ad hoc wireless Networks. Scatternet topology starts by forming a robust network, which is less susceptible to the problems posed by node mobility. Mobile topology relies on the presence of free nodes that create multiple connections with the network and on their subsequently rejoining the network. Our routing protocol is a proactive routing protocol, which is tailor made for the Bluetooth ad hoc network. The connection establishment connects nodes in a structure that simplifies packet routing and scheduling. The design allows nodes to arrive and leave arbitrarily, incrementally building the topology and healing partitions when they occur. We present simulation results that show that the algorithm presents low formation latency and also generates an efficient topology for forwarding packets along ad-hoc wireless networks.

  4. Evolutionary algorithms for mobile ad hoc networks

    Dorronsoro, Bernabé; Danoy, Grégoire; Pigné, Yoann; Bouvry, Pascal

    2014-01-01

    This comprehensive guide describes how evolutionary algorithms (EA) may be used to identify, model, and optimize day-to-day problems that arise for researchers in optimization and mobile networking. It provides efficient and accurate information on dissemination algorithms, topology management, and mobility models to address challenges in the field. It is an ideal book for researchers and students in the field of mobile networks.

  5. Secure Multicast Key Distribution for Mobile Ad Hoc Networks

    SuganyaDevi, D

    2010-01-01

    Many emerging applications in mobile adhoc networks involve group-oriented communication. Multicast is an efficient way of supporting group oriented applications, mainly in mobile environment with limited bandwidth and limited power. For using such applications in an adversarial environment as military, it is necessary to provide secure multicast communication. Key management is the fundamental challenge in designing secure multicast communications. In many multicast interactions, new member can join and current members can leave at any time and existing members must communicate securely using multicast key distribution within constrained energy for mobile adhoc networks. This has to overcome the challenging element of "1 affects n" problem which is due to high dynamicity of groups. Thus this paper shows the specific challenges towards multicast key management protocols for securing multicast key distribution in mobile ad hoc networks, and present relevant multicast key management protocols in mobile ad hoc n...

  6. Address allocation to mobile ad hoc networks

    Sakander, Zeeshan

    2006-01-01

    Addressing in MANETs is of significant importance, as a mobile device cannot participate in unicast communications until it is assigned a conflict-free IP address. All routing protocols assume nodes to be configured a priori with a unique IP address. Allocating addresses to mobile nodes is a fundamental and difficult problem. Unlike infrastructure based networks, MANETs support autonomous and spontaneous networking and therefore, should be capable of self-organization and self-configuration. ...

  7. A WMPLS Based Multicast Mechanism in Mobile Ad hoc Network

    Li Mengyang

    2011-02-01

    Full Text Available Merging MPLS into multicast routing protocol in Mobile Ad hoc network is an elegant method to enhance the network performance and an efficient solution for multicast scalability and control overhead problems. Based on the Wireless MPLS technology, the mechanism and evaluation of a new multicast protocol, the Label Switching Multicast Routing Protocol (LSMRP is presented in this paper.

  8. A Survey of Mobile Ad Hoc Network Attacks

    PRADIP M. JAWANDHIYA,

    2010-09-01

    Full Text Available Security is an essential requirement in mobile ad hoc network (MANETs. Compared to wired networks, MANETs are more vulnerable to security attacks due to the lack of a trusted centralized authority and limited resources. Attacks on ad hoc networks can be classified as passive and active attacks, depending on whether the normal operation of the network is disrupted or not. In this paper, we are describing the all prominent attacks described in literature in a consistent manner to provide a concise comparison on attack types. To the best of our knowledge, this is the first paper that studies all the existing attacks on MANETs.

  9. An Analysis of Collaborative Attacks on Mobile Ad hoc Networks

    Vu, Cong Hoan; Soneye, Adeyinka

    2009-01-01

    A Mobile Ad hoc Network (MANET) consists of a set of communicating wireless mobile nodes or devices that do not have any form of fixed infrastructure or centralized authority. The security in MANET has become a significant and active topic within the research community. This is because of high demand in sharing streaming video and audio in various applications, one MANET could be setup quickly to facilitate communications in a hostile environment such as battlefield or emergency situation lik...

  10. A Survey on Trust Management for Mobile Ad Hoc Networks

    K.Seshadri Ramana; A.A. Chari; N.Kasiviswanth

    2010-01-01

    Mobile Ad Hoc Network (MANETs) is a Collection of mobile nodes connected with wireless links.MANET has no fixed topology as the nodes are moving constantly form one place to another place. All the nodes must co-operate with each other in order to route the packets. Cooperating nodes must trust each other. In defining and managing trust in a military MANET, we must consider the interactions between the composite cognitive, social, information and communication networks, and take into account t...

  11. Cost management based security framework in mobile ad hoc networks

    2006-01-01

    Security issues are always difficult to deal with in mobile ad hoc networks. People seldom studied the costs of those security schemes respectively and for some security methods designed and adopted beforehand, their effects are often investigated one by one. In fact, when facing certain attacks, different methods would respond individually and result in waste of resources.Making use of the cost management idea, we analyze the costs of security measures in mobile ad hoc networks and introduce a security framework based on security mechanisms cost management. Under the framework, the network system's own tasks can be finished in time and the whole network's security costs can be decreased. We discuss the process of security costs computation at each mobile node and in certain nodes groups. To show how to use the proposed security framework in certain applications, we give examples of DoS attacks and costs computation of defense methods. The results showed that more secure environment can be achieved based on the security framework in mobile ad hoc networks.

  12. A Timed Calculus for Mobile Ad Hoc Networks

    Mengying Wang

    2012-12-01

    Full Text Available We develop a timed calculus for Mobile Ad Hoc Networks embodying the peculiarities of local broadcast, node mobility and communication interference. We present a Reduction Semantics and a Labelled Transition Semantics and prove the equivalence between them. We then apply our calculus to model and study some MAC-layer protocols with special emphasis on node mobility and communication interference. A main purpose of the semantics is to describe the various forms of interference while nodes change their locations in the network. Such interference only occurs when a node is simultaneously reached by more than one ongoing transmission over the same channel.

  13. Bandwidth Estimation For Mobile Ad hoc Network (MANET

    Rabia Ali

    2011-09-01

    Full Text Available In this paper we presents bandwidth estimation scheme for MANET, which uses some components of the two methods for the bandwidth estimation: 'Hello Bandwidth Estimation 'Listen Bandwidth Estimation. This paper also gives the advantages of the proposed method. The proposed method is based on the comparison of these two methods. Bandwidth estimation is an important issue in the Mobile Ad-hoc Network (MANET because bandwidth estimation in MANET is difficult, because each host has imprecise knowledge of the network status and links change dynamically. Therefore, an effective bandwidth estimation scheme for MANET is highly desirable. Ad hoc networks present unique advanced challenges, including the design of protocols for mobility management, effective routing, data transport, security, power management, and quality-of-service (QoS provisioning. Once these problems are solved, the practical use of MANETs will be realizable.

  14. A Robust Reputation System for Mobile Ad-hoc Networks

    Buchegger, Sonja; Le Boudec, Jean-Yves

    2003-01-01

    Reputation systems in mobile ad-hoc networks can be tricked by the spreading of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one`s own direct observations have drawbacks, as they do not make use of all the information available. We propose a fully distributed reputation system that can cope with false disseminated information. In our approach, everyone maintains a reputation rating and a trust rating about everyone ...

  15. Power control algorithms for mobile ad hoc networks

    Nuraj L. Pradhan

    2011-07-01

    We will also focus on an adaptive distributed power management (DISPOW algorithm as an example of the multi-parameter optimization approach which manages the transmit power of nodes in a wireless ad hoc network to preserve network connectivity and cooperatively reduce interference. We will show that the algorithm in a distributed manner builds a unique stable network topology tailored to its surrounding node density and propagation environment over random topologies in a dynamic mobile wireless channel.

  16. Integrating Mobile Ad Hoc Network to the Internet

    WANG Mao-ning

    2005-01-01

    A novel scheme is presented to integrate mobile ad hoc networks (MANETs) with the Internet and support mobility across wireless local area networks (WLANs) and MANETs. The mobile nodes, connected as a MANET, employ the optimize d link state routing (OLSR) protocol for routing within the MANET. Mobility management across WLANs and MANETs is achieved through the hierarchical mobile IPv6 (HMIPv6) protocol. The performance is evaluated on a HMIPv6 based test-bed composed of WLANs and MANETs. The efficiency gain obtained from using HMIPv6 in such a hybrid network is investigated. The investigation result shows that the use of HMIPv6 can achieve up to 27% gain on reducing the handoff latency when a mobile roams within a domain. Concerning the reduction of the signaling load on the Internet, the use of HMIPv6 can achieve at least a 54% gain and converges to 69%.

  17. Realistic Mobility Modeling for Vehicular Ad Hoc Networks

    Akay, Hilal; Tugcu, Tuna

    2009-08-01

    Simulations used for evaluating the performance of routing protocols for Vehicular Ad Hoc Networks (VANET) are mostly based on random mobility and fail to consider individual behaviors of the vehicles. Unrealistic assumptions about mobility produce misleading results about the behavior of routing protocols in real deployments. In this paper, a realistic mobility modeling tool, Mobility for Vehicles (MOVE), which considers the basic mobility behaviors of vehicles, is proposed for a more accurate evaluation. The proposed model is tested against the Random Waypoint (RWP) model using AODV and OLSR protocols. The results show that the mobility model significantly affects the number of nodes within the transmission range of a node, the volume of control traffic, and the number of collisions. It is shown that number of intersections, grid size, and node density are important parameters when dealing with VANET performance.

  18. Energy Consumption Model in Ad Hoc Mobile Network

    Maher HENI

    2012-06-01

    Full Text Available The aim of this work is to model the nodes battery discharge in wireless ad hoc networks. Many work focus on the energy consumption in such networks. Even, the research in the highest layers of the ISO model, takes into account the energy consumption and efficiency. Indeed, thenodes that form such network are mobiles, so no instant recharge of battery. Also with special type of ad hoc networks are wireless sensors networks using non-rechargeable batteries. All nodes with an exhausted battery are considered death and left the network. To consider the energy consumption, in this work we model using a Markov chain, the discharge of the battery considering of instant activation and deactivation distribution function of these nodes.

  19. Implementing Smart Antenna System in Mobile Ad Hoc Networks

    Supriya Kulkarni P

    2014-06-01

    Full Text Available As the necessity of exchanging and sharing data increases, users demand easy connectivity, and fast networks whether they are at work, at home, or on the move. Nowadays, users are interested in interconnecting all their personal electronic devices (PEDs in an ad hoc fashion on the move. This type of network is referred to as Mobile Ad hoc NETwork (MANET. When in such network a smart antenna System (SAS is implemented then we can achieve maximum capacity and improve the quality and coverage. So we are intended to implement such a SAS in the MANET. In this paper we have shown significance of Throughput and Bit Error Rate by implementing SAS in MANET using MATLABR2010a.

  20. AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks

    彭伟; 卢锡城

    2001-01-01

    Broadcast is an important operation in many network protocols. It is utilized to discover routes to unknown nodes in mobile ad hoc networks (MANETs) and is the key factor in scaling on-demand routing protocols to large networks. This paper presents the Ad Hoc Broadcast Protocol (AHBP) and its performance is discussed. In the protocol, messages are only rebroadcast by broadcast relay gateways that constitute a connected dominating set of the network. AHBP can efficiently reduce the redundant messages which make flooding-like protocols perform badly in large dense networks. Simulations are conducted to determine the performance characteristics of the protocol. The simulation results have shown excellent reduction of broadcast redundancy with AHBP. It also contributes to a reduced level of broadcast collision and congestion.

  1. Enhancement of Mobile Ad-hoc Network Models by Using Realistic Mobility and Access Control Mechanisms

    Sabah, Nasser M. A.

    2012-01-01

    ABSTRACT: A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other preexisting network infrastructure. Ad-hoc networking received a great interest due to its low cost, high flexibility, fast network establishment, self-reconfiguration, high speed for data services, rapid deployment and support for mobility. However, in a wireless network without a fixed infrastructure and with nodes’ mobility enabl...

  2. Distributed Intrusion Detection System for Ad hoc Mobile Networks

    Muhammad Nawaz Khan

    2012-01-01

    Full Text Available In mobile ad hoc network resource restrictions on bandwidth, processing capabilities, battery life and memory of mobile devices lead tradeoff between security and resources consumption. Due to some unique properties of MANETs, proactive security mechanism like authentication, confidentiality, access control and non-repudiation are hard to put into practice. While some additional security requirements are also needed, like cooperation fairness, location confidentiality, data freshness and absence of traffic diversion. Traditional security mechanism i.e. authentication and encryption, provide a security beach to MANETs. But some reactive security mechanism is required who analyze the routing packets and also check the overall network behavior of MANETs. Here we propose a local-distributed intrusion detection system for ad hoc mobile networks. In the proposed distributed-ID, each mobile node works as a smart agent. Data collect by node locally and it analyze that data for malicious activity. If any abnormal activity discover, it informs the surrounding nodes as well as the base station. It works like a Client-Server model, each node works in collaboration with server, updating its database each time by server using Markov process. The proposed local distributed- IDS shows a balance between false positive and false negative rate. Re-active security mechanism is very useful in finding abnormal activities although proactive security mechanism present there. Distributed local-IDS useful for deep level inspection and is suited with the varying nature of the MANETs.

  3. Scalable Overlay Multicasting in Mobile Ad Hoc Networks (SOM

    Pariza Kamboj

    2010-10-01

    Full Text Available Many crucial applications of MANETs like the battlefield, conference and disaster recovery defines the needs for group communications either one-to-many or many-to-many form. Multicast plays an important role in bandwidth scarce multihop mobile ad hoc networks comprise of limited battery power mobile nodes. Multicast protocols in MANETs generate many controls overhead for maintenance of multicast routingstructures due to frequent changes of network topology. Bigger multicast tables for the maintenance of network structures resultsin inefficient consumption of bandwidth of wireless links andbattery power of anemic mobile nodes, which in turn, pose thescalability problems as the network size is scaled up. However,many MANET applications demands scalability from time to time. Multicasting for MANETs, therefore, needs to reduce the state maintenance. As a remedy to these shortcomings, this paper roposes an overlay multicast protocol on application layer. In the proposed protocol titled “Scalable Overlay Multicasting in Mobile Ad Hoc Networks (SOM” the network nodes construct overlay hierarchical framework to reduce the protocols states and constrain their distribution within limited scope. Based on zone around each node, it constructs a virtual structure at application layer mapped with the physical topology at network layer, thus formed two levels of hierarchy. The concept of two level hierarchies reduces the protocol state maintenance and hence supports the vertical scalability. Protocol depends on the location information obtained using a distributed location service, which effectively reduces the overhead for route searching and updating the source based multicast tree.

  4. Mobility Models for Vehicular Ad-hoc Network Simulation

    Vaishali D. Khairnar; Pradhan, S. N.

    2013-01-01

    One of the emerging applications that belong to ambient systems is to transparently and directly interconnect vehicles on roads, making an ad hoc network that enables a variety of applications through distributed software without the need of any fixed and dedicated infrastructure. The network as well as the embedded computers and sensors in the vehicle will be invisible to the driver, who will get the required services during his journey. New type of ad hoc network is the Vehicular Ad hoc Net...

  5. Recovery from Wormhole Attack in Mobile Ad Hoc Network (MANET)

    JI Xiao-jun; TIAN Chang; ZHANG Yu-sen

    2006-01-01

    Wormhole attack is a serious threat against MANET (mobile ad hoc network) and its routing protocols.A new approach-tunnel key node identification (TKNI) was proposed. Based on tunnel-key-node identification and priority-based route discovery, TKNI can rapidly rebuild the communications that have been blocked by wormhole attack. Compared to previous approaches, the proposed approach aims at both static and dynamic topology environment, involves addressing visible and invisible wormhole attack modes, requires no extra hardware, has a low overhead, and can be easily applied to MANET.

  6. Effective Congestion Avoidance Scheme for Mobile Ad Hoc Networks

    Ramachandra.V.Pujeri

    2013-01-01

    Full Text Available Mobile nodes are organized randomly without any access point in Mobile Ad hoc Networks (MANETs. Due to the mobility of nodes, the network congestion occurs. So many congestion control mechanisms were proposed to avoid the congestion avoidance or reducing the congestion status. In this research work, we proposed to develop the Effective Congestion Avoidance Scheme (ECAS, which consists of congestion monitoring, effective routing establishment and congestionless based routing. The overall congestion status is measured in congestion monitoring. In routing establishment, we propose the contention metric in the particular channel in terms of, queue length of packet, overall congestion standard, packet loss rate and packet dropping ratio to monitor the congestion status. Based on the congestion standard, the congestionless based routing is established to reduce the packet loss, high overhead, long delay in the network. By extensive simulation, the proposed scheme achieves better throughput, packet delivery ratio, low end-to-end delay and overhead than the existing schemes.

  7. A Survey on Trust Management for Mobile Ad Hoc Networks

    K.Seshadri Ramana

    2010-04-01

    Full Text Available Mobile Ad Hoc Network (MANETs is a Collection of mobile nodes connected with wireless links.MANET has no fixed topology as the nodes are moving constantly form one place to another place. All the nodes must co-operate with each other in order to route the packets. Cooperating nodes must trust each other. In defining and managing trust in a military MANET, we must consider the interactions between the composite cognitive, social, information and communication networks, and take into account the severe resource constraints (e.g., computing power, energy, bandwidth, time, and dynamics (e.g., topology changes, mobility, node failure, propagation channel conditions. Therefore trust is important word which affects the performance of MANET. There are several protocols proposed based on the trust. This paper is a survey of trust based protocols and it proposes some new techniques on trust management in MANETs

  8. Probabilistic Models and Process Calculi for Mobile Ad Hoc Networks

    Song, Lei

    Due to the wide use of communicating mobile devices, mobile ad hoc networks (MANETs) have gained in popularity in recent years. In order that the devices communicate properly, many protocols have been proposed working at different levels. Devices in an MANET are not stationary but may keep moving......, thus the network topology may undergo constant changes. Moreover the devices in an MANET are loosely connected not depending on pre-installed infrastructure or central control components, they exchange messages via wireless connections which are less reliable compared to wired connections. Therefore...... issues in MANETs e.g. mobility and unreliable connections. Specially speaking, 1. We first propose a discrete probabilistic process calculus with which we can model in an MANET that the wireless connection is not reliable, and the network topology may undergo changes. We equip each wireless connection...

  9. Flying Ad-Hoc Networks: Routing Protocols, Mobility Models, Issues

    Muneer Bani Yassein

    2016-06-01

    Full Text Available Flying Ad-Hoc Networks (FANETs is a group of Unmanned Air Vehicles (UAVs which completed their work without human intervention. There are some problems in this kind of networks: the first one is the communication between (UAVs. Various routing protocols introduced classified into three categories, static, proactive, reactive routing protocols in order to solve this problem. The second problem is the network design, which depends on the network mobility, in which is the process of cooperation and collaboration between the UAV. Mobility model of FANET is introduced in order to solve this problem. In Mobility Model, the path and speed variations of the UAV and represents their position are defined. As of today, Random Way Point Model is utilized as manufactured one for Mobility in the greater part of recreation situations. The Arbitrary Way Point model is not relevant for the UAV in light of the fact that UAV do not alter their course and versatility, speed quickly at one time because of this reason, we consider more practical models, called Semi-Random Circular Movement (SRCM Mobility Model. Also, we consider different portability models, Mission Plan-Based (MPB Mobility Model, Pheromone-Based Model. Moreover, Paparazzi Mobility Model (PPRZM. This paper presented and discussed the main routing protocols and main mobility models used to solve the communication, cooperation, and collaboration in FANET networks.

  10. Cluster Based Topology Control in Dynamic Mobile Ad Hoc Networks

    T. Parameswaran

    2014-05-01

    Full Text Available In Mobile Ad hoc NETworks (MANETs, mobility of nodes, resource constraints and selfish behavior of nodes are important factors which may degrade the performance. Clustering is an effective scheme to improve the performance of MANETs features such as scalability, reliability, and stability. Each cluster member (CM is associated with only one cluster head (CH and can communicate with the CH by single hop communication. Mobility information is used by many existing clustering schemes such as weighted clustering algorithm (WCA Link expiration time prediction scheme and k-hop compound metric based clustering. In scheme 1 the CH election is based on a weighted sum of four different parameters such as node status, neighbor’s distribution, mobility, and remaining energy which brings flexibility but weight factor for each parameter if difficult. In scheme 2 lifetime of a wireless link between a node pair is predicted by GPS location information. In scheme 3 the predicted mobility parameter is combined with the connectivity to create a new compound metric for CH election. Despite various efforts in mobility clustering, not much work has been done specifically for high mobility nodes. Our proposed solution provides secure CH election and incentives to encourage nodes to honestly participating in election process. Mobility strategies are used to handle the various problems caused by node movements such as association losses to current CHs and CH role changes, for extending the connection lifetime and provide more stable clusters. The conducted simulation results shows that the proposed approach outperforms the existing clustering schemes.

  11. Distributed intrusion detection for mobile ad hoc networks

    Yi Ping; Jiang Xinghao; Wu Yue; Liu Ning

    2008-01-01

    Mobile ad hoc networking(MANET)has become an exciting and important technology in recent years,because of the rapid proliferation of wireless devices.Mobile ad hoc networks is highly vulnerable to attacks due to the open medium,dynamically changing network topology,cooperative algorithms,and lack of centralized monitoring and management point.The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features.A distributed intrusion detection approach based on timed automata is given.A cluster-based detection scheme is presented,where periodically a node is elected as the monitor node for a cluster.These monitor nodes can not only make local intrusion detection decisions,but also cooperatively take part in global intrusion detection.And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing(DSR).The monitor nodes can verify the behaviour of every nodes by timed automata,and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent,the approach is much more efficient while maintaining the same level of effectiveness.Finally,the intrusion detection method is evaluated through simulation experiments.

  12. Identification of node behavior for Mobile Ad-hoc Network

    Khyati Choure , Sanjay Sharma

    2012-12-01

    Full Text Available In present scenario, in ad-hoc network, the behavior of nodes are not very stable. They do not work properly and satisfactory. They are not cooperative and acting selfishly. They show their selfishness to share their resources like bandwidth to save life of battery, they are not hasitate to block thepackets sent by others for forwarding and transmit their own packets. Due to higher Mobility of the different nodes makes the situation even more complicated. Multiple routing protocols especially for these conditions have been developed during the last few years, to find optimized routes from a source to some destination.But it is still difficult to know the actual shortest path without attackers or bad nodes. Ad-hoc network suffer from the lot of issues i.e. congestion, Throughput, delay, security, network overhead. Packet delivery ratio is the issues of ongoing research. Cause of node failure may be either natural failure of node links or it may be due to act of an attacker or bad node which may degrade performance of network slowly or drastically, which also need to identify or determined. In this paper, we identify the good and bad nodes. A simulation has been performed to achieve better performance of modified AODV. Good result has been obtained in terms of Throughout, Packet Delivery Ratio.

  13. Simulation study for Mobile Ad hoc Networks Using DMAC Protocol

    Vikas Sejwar

    2012-01-01

    Full Text Available This paper addresses the issue of deafness problem in Mobile Ad Hoc Networks (MANETs using directional antennas. Directional antennas arebeneficial for wireless ad hoc networks consisting of a collection of wireless hosts. A suitable Medium Access Control (MAC protocol must be designed to best utilize directional antennas. Deafness is caused whentwo nodes are in ongoing transmission and a third node (Deaf Node wants to communicate with one of that node. But it get no response because transmission of two nodes are in process. Though directional antennas offer better spatial reuse, but this problem can have a serious impact on network performance. A New DMAC (Directional Medium Access Control protocol uses flags in DNAV (Directional Network Allocation Vector tables to maintain information regarding the transmissionbetween the nodes in the network and their neighbor’s location. Two performance matrices have been used to show the impact of New DMAC algorithm on Deafness problem using simulator. These are RTS Failure Ratio and RTS Retransmission due to timeout

  14. Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

    Kumar, Sumit; Mehfuz, Shabana

    2016-08-01

    In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

  15. A Group Vehicular Mobility Model for Routing Protocol Analysis in Mobile Ad Hoc Network

    Kulkarni, Shrirang Ambaji

    2010-01-01

    Performance of routing protocols in mobile ad-hoc networks is greatly affected by the dynamic nature of nodes, route failures, wireless channels with variable bandwidth and scalability issues. A mobility model imitates the real world movement of mobile nodes and is central component to simulation based studies. In this paper we consider mobility nodes which mimic the vehicular motion of nodes like Manhattan mobility model and City Section mobility model. We also propose a new Group Vehicular mobility model that takes the best features of group mobility models like Reference Point Group mobility model and applies it to vehicular models. We analyze the performance of our model known as Group Vehicular mobility model (GVMM) and other vehicular mobility models with various metrics. This analysis provides us with an insight about the impact of mobility models on the performance of routing protocols for ad-hoc networks. The routing protocols are simulated and measured for performance and finally we arrive at the co...

  16. Mobile Advertisement in Vehicular Ad-Hoc Networks

    Dobre, Ciprian

    2012-01-01

    Mobile Advertisement is a location-aware dissemination solution built on top of a vehicular ad-hoc network. We envision a network of WiFi access points that dynamically disseminate data to clients running on the car's smart device. The approach can be considered an alternative to the static advertisement billboards and can be useful to business companies wanting to dynamically advertise their products and offers to people driving their car. The clients can subscribe to information based on specific topics. We present design solutions that use access points as emitters for transmitting messages to wireless-enabled devices equipped on vehicles. We also present implementation details for the evaluation of the proposed solution using a simulator designed for VANET application. The results show that the application can be used for transferring a significant amount of data even under difficult conditions, such as when cars are moving at increased speeds, or the congested Wi-Fi network causes significant packet loss...

  17. Collaboration Layer for Robots in Mobile Ad-hoc Networks

    Borch, Ole; Madsen, Per Printz; Broberg, Jacob Honor´e; Hede, Søren Thorhauge; Mikkelsen, Simon Bjerg; Pedersen, Jesper Ellgaard; Sørensen, Christian Br¨auner

    2009-01-01

    In many applications multiple robots in Mobile Ad-hoc Networks are required to collaborate in order to solve a task. This paper shows by proof of concept that a Collaboration Layer can be modelled and designed to handle the collaborative communication, which enables robots in small to medium size...... provided to the application running on the robot. The services are generic because they can be used by many different applications, independent of the task to be solved. Likewise, specific services are requested from the underlying Virtual Machine, such as broadcast, multicast, and reliable unicast. A...... prototype of the Collaboration Layer has been developed to run in a simulated environment and tested in an evaluation scenario. In the scenario five robots solve the tasks of vacuum cleaning and entrance guarding, which involves the ability to discover potential co-workers, form groups, shift from one group...

  18. On service differentiation in mobile Ad Hoc networks

    张顺亮; 叶澄清

    2004-01-01

    A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the Received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile.Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.

  19. Rethinking Information Theory for Mobile Ad Hoc Networks

    Andrews, Jeff; Haenggi, Martin; Berry, Randy; Jafar, Syed; Guo, Dongning; Shakkottai, Sanjay; Heath, Robert; Neely, Michael; Weber, Steven; Yener, Aylin

    2007-01-01

    The subject of this paper is the long-standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundamental performance limits of mobile ad hoc networks (MANETs). A MANET is a peer-to-peer network with no pre-existing infrastructure. MANETs are the most general wireless networks, with single-hop, relay, interference, mesh, and star networks comprising special cases. The lack of a MANET capacity theory has stunted the development and commercialization of many types of wireless networks, including emergency, military, sensor, and community mesh networks. Information theory, which has been vital for links and centralized networks, has not been successfully applied to decentralized wireless networks. Even if this was accomplished, for such a theory to truly characterize the limits of deployed MANETs it must overcome three key roadblocks. First, most current capacity results rely on the allowance of unbounded delay and reliability. Second, ...

  20. Robust message routing for mobile (wireless) ad hoc networks.

    Goldsby, Michael E.; Johnson, Michael M.; Kilman, Dominique Marie (Sandia National Laboratories, Albuquerque, NM); Bierbaum, Neal Robert; Chen, Helen Y.; Ammerlahn, Heidi R.; Tsang, Rose P.; Nicol, David M. (University of Illinois, Urbana, IL)

    2004-01-01

    This report describes the results of research targeting improvements in the robustness of message transport in wireless ad hoc networks. The first section of the report provides an analysis of throughput and latency in the wireless medium access control (MAC) layer and relates the analysis to the commonly used 802.11 protocol. The second section describes enhancements made to several existing models of wireless MAC and ad hoc routing protocols; the models were used in support of the work described in the following section. The third section of the report presents a lightweight transport layer protocol that is superior to TCP for use in wireless networks. In addition, it introduces techniques that improve the performance of any ad hoc source routing protocol. The fourth section presents a novel, highly scalable ad hoc routing protocol that is based on geographic principles but requires no localization hardware.

  1. Connectivity-driven Attachment in Mobile Cellular Ad Hoc Networks

    Boite, Julien; Leguay, Jérémie

    2014-01-01

    International audience Cellular wireless technologies (e.g. LTE) can be used to build cellular ad hoc networks. In this new class of ad hoc networks, nodes are equipped with two radio interfaces: one being a terminal, the other one being an access point. In this context, attachment decisions based on traditional criteria (e.g. signal quality) may lead to network partitions or suboptimal path lengths, thus making access point selection critical to ensure efficient network connectivity. This...

  2. TCP Issues in Mobile Ad Hoc Networks: Challenges and Solutions

    Wei-Qiang Xu; Tie-Jun Wu

    2006-01-01

    Mobile ad hoc networks (MANETs) are a kind of very complex distributed communication systems with wireless mobile nodes that can be freely and dynamically self-organized into arbitrary and temporary network topologies. MANETs inherit several limitations of wireless networks, meanwhile make new challenges arising from the specificity of MANETs, such as route failures, hidden terminals and exposed terminals. When TCP is applied in a MANET environment, a number of tough problems have to be dealt with. In this paper, a comprehensive survey on this dynamic field is given. Specifically, for the first time all factors impairing TCP performance are identified based on network protocol hierarchy, I.e., lossy wireless channel at the physical layer; excessive contention and unfair access at the MAC layer; frail routing protocol at the network layer, the MAC layer and the network layer related mobile node; unfit congestion window size at the transport layer and the transport layer related asymmetric path. How these factors degrade TCP performance is clearly explained. Then, based on how to alleviate the impact of each of these factors listed above, the existing solutions are collected as comprehensively as possible and classified into a number of categories, and their advantages and limitations are discussed. Based on the limitations of these solutions, a set of open problems for designing more robust solutions is suggested.

  3. Securing Mobile Ad hoc Networks:Key Management and Routing

    Chauhan, Kamal Kumar; 10.5121/ijans.2012.2207

    2012-01-01

    Secure communication between two nodes in a network depends on reliable key management systems that generate and distribute keys between communicating nodes and a secure routing protocol that establishes a route between them. But due to lack of central server and infrastructure in Mobile Ad hoc Networks (MANETs), this is major problem to manage the keys in the network. Dynamically changes in network's topology causes weak trust relationship among the nodes in the network. In MANETs a mobile node operates as not only end terminal but also as an intermediate router. Therefore, a multi-hop scenario occurs for communication in MANETs; where there may be one or more malicious nodes in between source and destination. A routing protocol is said to be secure that detects the detrimental effects of malicious node(s in the path from source to destination). In this paper, we proposed a key management scheme and a secure routing protocol that secures on demand routing protocol such as DSR and AODV. We assume that MANETs ...

  4. Similarity-Based Clustering Strategy for Mobile Ad Hoc Multimedia Databases

    Bo Yang; Ali R. Hurson

    2005-01-01

    Multimedia data are becoming popular in wireless ad hoc environments. However, the traditional content-based retrieval techniques are inefficient in ad hoc networks due to the multiple limitations such as node mobility, computation capability, memory space, network bandwidth, and data heterogeneity. To provide an efficient platform for multimedia retrieval, we propose to cluster ad hoc multimedia databases based on their semantic contents, and construct a virtual hierarchical indexing infrast...

  5. Control Based Mobile Ad Hoc Networking for survivable, dynamic, mobile Special Operation Force communications

    Masacioglu, Mustafa.; McBride, Marlon

    2009-01-01

    Approved for public release, distribution unlimited In the next generation of wireless communication systems, there will be a need for the rapid deployment of independent mobile users. Significant examples include establishing survivable, efficient, dynamic mobile communication for tactical Special Operation Force (SOF) networks, as well as SOF units that are ad hoc networking with first responders conducting emergency/rescue and disaster relief operations. Such network scenarios cannot re...

  6. A Clustering Algorithm Based on Mobility Properties in Mobile Ad Hoc Networks

    Young-jun Oh; Kang-whan Lee

    2015-01-01

    We propose a context-awareness routing algorithm—the DDV- (Dynamic Direction Vector-) hop algorithm—in mobile ad hoc networks. The existing algorithm in MANET has the limitations of the dynamic network topology and the absence of network expandability of the mobility of nodes. The proposed algorithm performs cluster formation for the base station using the range of direction and threshold of velocity. We calculate the exchange of the cluster head node probability using the direction and veloc...

  7. Mobile ad hoc networking the cutting edge directions

    Basagni, Stefano; Giordano, Silvia; Stojmenovic, Ivan

    2013-01-01

    ""An excellent book for those who are interested in learning the current status of research and development . . . [and] who want to get a comprehensive overview of the current state-of-the-art.""-E-Streams This book provides up-to-date information on research and development in the rapidly growing area of networks based on the multihop ad hoc networking paradigm. It reviews all classes of networks that have successfully adopted this paradigm, pointing out how they penetrated the mass market and sparked breakthrough research. Covering both physical issues and applica

  8. Analysis of Fuzzy Logic Based Intrusion Detection Systems in Mobile Ad Hoc Networks

    A. Chaudhary

    2014-01-01

    Full Text Available Due to the advancement in wireless technologies, many of new paradigms have opened for communications. Among these technologies, mobile ad hoc networks play a prominent role for providing communication in many areas because of its independent nature of predefined infrastructure. But in terms of security, these networks are more vulnerable than the conventional networks because firewall and gateway based security mechanisms cannot be applied on it. That’s why intrusion detection systems are used as keystone in these networks. Many number of intrusion detection systems have been discovered to handle the uncertain activity in mobile ad hoc networks. This paper emphasized on proposed fuzzy based intrusion detection systems in mobile ad hoc networks and presented their effectiveness to identify the intrusions. This paper also examines the drawbacks of fuzzy based intrusion detection systems and discussed the future directions in the field of intrusion detection for mobile ad hoc networks.

  9. Mobile Codes Localization in Ad hoc Networks: a Comparative Study of Centralized and Distributed Approaches

    Zafoune, Youcef; kanawati, Rushed; 10.5121/ijcnc.2010.2213

    2010-01-01

    This paper presents a new approach in the management of mobile ad hoc networks. Our alternative, based on mobile agent technology, allows the design of mobile centralized server in ad hoc network, where it is not obvious to think about a centralized management, due to the absence of any administration or fixed infrastructure in these networks. The aim of this centralized approach is to provide permanent availability of services in ad hoc networks which are characterized by a distributed management. In order to evaluate the performance of the proposed approach, we apply it to solve the problem of mobile code localization in ad hoc networks. A comparative study, based upon a simulation, of centralized and distributed localization protocols in terms of messages number exchanged and response time shows that the centralized approach in a distributed form is more interesting than a totally centralized approach.

  10. Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy

    Badarneh OsamahS; Kadoch Michel

    2009-01-01

    Abstract Multicasting plays a crucial role in many applications of mobile ad hoc networks (MANETs). It can significantly improve the performance of these networks, the channel capacity (in mobile ad hoc networks, especially single-channel ones, capacity is a more appropriate term than bandwidth, capacity is measured in bits/s and bandwidth in Hz) and battery power of which are limited. In the past couple of years, a number of multicast routing protocols have been proposed. In spite of being d...

  11. Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols

    Qazi Javed Ahmed; Mirza Aamir Mehmood; Abdul Qudoos

    2012-01-01

    Mobile ad hoc network (MANET) is an organization of static and wireless mobile nodes having no any central administration and fixed infrastructure. In MANET, each node can acts as routing and hosting device. Performance comparison and analysis has been conducted by using four different scenarios in NS2 (Network Simulator) for which two reactive (AODV, DSR) and two proactive (OLSR, DSDV) ad hoc routing protocols have been selected by utilizing 802.11 wireless standard. The main goal is to find...

  12. An Agent Based Intrusion Detection Model for Mobile Ad Hoc Networks

    Reshmi, B. M.; Manvi, S. S.; Bhagyavati

    2006-01-01

    Intrusion detection has over the last few years, assumed paramount importance within the broad realm of network security, more so in case of wireless mobile ad hoc networks. The inherently vulnerable characteristics of wireless mobile ad hoc networks make them susceptible to attacks in-spite of some security measures, and it may be too late before any counter action can take effect. As such, there is a need to complement traditional security mechanisms with efficient intrusion detection and r...

  13. Improve performance of tcp new reno over mobile ad-hoc network using abra

    Dhananjay Bisen; Sanjeev Sharma

    2011-01-01

    In a mobile ad hoc network, temporary link failures and route changes occur frequently. With the assumption that all packet losses are due to congestion, TCP performs poorly in such an environment. There are many versions of TCP which modified time to time as per need. In this paper modifications introduced on TCP New Reno over mobile ad-hoc networks using calculation of New Retransmission Time out (RTO), to improve performance in term of congestion control. To calculate New RTO, adaptive bac...

  14. An Optimal Path Management Strategy in Mobile Ad Hoc Network Using Fuzzy and Rough Set Theory

    P. Seethalakshmi; M. J.A. Jude; Rajendran, G

    2011-01-01

    Problem statement: Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes that dynamically forms a network. Most of the existing ad-hoc routing algorithms select the shortest path using various resources. However the selected path may not consider all the network parameters and this would result in link instability in the network. The problems with existing methods are frequent route change with respect to change in topology, congestion as result of traffic and battery limitat...

  15. COMPARATIVE REVIEW FOR ROUTING PROTOCOLS IN MOBILE AD-HOC NETWORKS

    Hatem S. A. Hamatta

    2016-04-01

    Full Text Available Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the last decade. it surrounded by much challenges that should be solved the improve establishment of such networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc Networks (MANETs. As this type of networks does not require any pre-exist hardware. As well as, every node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the network internal structure will be unpredictably changed frequently according to continuous activities between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This model puts the functionality of routing operation in crucial angle in the area of research under mobile adhoc network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are designed for mobile ad-hoc networks by describing their structures, operations, features and then comparing their various characteristics.

  16. Review of Artificial Immune System to Enhance Security in Mobile Ad-hoc Networks

    Tarun Dalal

    2012-04-01

    Full Text Available Mobile Ad-hoc Networks consist of wireless host that communicate with each other. The routes in a Mobile Ad-hoc Network may consist of many hops through other hosts between source and destination. The hosts are not fixed in a Mobile Adhoc Network; due to host mobility topology can change any time. Mobile Ad-hoc Networks are much more vulnerable to security attacks. Current research works on securing Mobile Adhoc Networks mainly focus on confidentiality, integrity,authentication, availability, and fairness. Design of routingprotocols is very much crucial in Mobile Ad-hoc Network. There are various techniques for securing Mobile Ad-hoc Network i.e. cryptography. Cryptography provides efficient mechanism to provide security, but it creates very much overhead. So, an approach is used which is analogous to Biological Immune System, known as Artificial Immune System (AIS. There is a reason of AIS to be used for security purposes because the Human Immune System (HIS protects the body against damage from an extremely large number of harmfulbacteria, viruses, parasites and fungi, termed pathogens. It doesthis largely without prior knowledge of the structure of thesepathogens. AIS provide security by determining non-trusted nodes and eliminate all non-trusted nodes from the network.

  17. A Cluster Maintenance Algorithm Based on Relative Mobility for Mobile Ad Hoc Network Management

    SHENZhong; CHANGYilin; ZHANGXin

    2005-01-01

    The dynamic topology of mobile ad hoc networks makes network management significantly more challenging than wireline networks. The traditional Client/Server (Manager/Agent) management paradigm could not work well in such a dynamic environment, while the hierarchical network management architecture based on clustering is more feasible. Although the movement of nodes makes the cluster structure changeable and introduces new challenges for network management, the mobility is a relative concept. A node with high relative mobility is more prone to unstable behavior than a node with less relative mobility, thus the relative mobility of a node can be used to predict future node behavior. This paper presents the cluster availability which provides a quantitative measurement of cluster stability. Furthermore, a cluster maintenance algorithm based on cluster availability is proposed. The simulation results show that, compared to the Minimum ID clustering algorithm, our algorithm successfully alleviates the influence caused by node mobility and make the network management more efficient.

  18. Malware-Propagative Mobile Ad Hoc Networks: Asymptotic Behavior Analysis

    Vasileios Karyotis; Anastasios Kakalis; Symeon Papavassiliou

    2008-01-01

    In this paper, the spreading of malicious software over ad hoe networks, where legitimate nodes are prone to propagate the infections they receive from either an attacker or their already infected neighbors, is analyzed. Considering the Susceptible-Infected-Susceptible (SIS) node infection paradigm we propose a probabilistic model, on the basis of the theory of closed queuing networks, that aims at describing the aggregated behavior of the system when attacked by malicious nodes. Because of its nature, the model is also able to deal more effectively with the stochastic behavior of attackers and the inherent probabilistic nature of the wireless environment. The proposed model is able to describe accurately the asymptotic behavior of malware-propagative large scale ad hoc networking environments. Using the Norton equivalent of the closed queuing network, we obtain analytical results for its steady state behavior, which in turn is used for identifying the critical parameters affecting the operation of the network. Finally, through modeling and simulation, some additional numerical results are obtained with respect to the behavior of the system when multiple attackers are present, and regarding the time-dependent evolution and impact of an attack.

  19. Dynamic ad hoc networks

    Rashvand, Habib

    2013-01-01

    Motivated by the exciting new application paradigm of using amalgamated technologies of the Internet and wireless, the next generation communication networks (also called 'ubiquitous', 'complex' and 'unstructured' networking) are changing the way we develop and apply our future systems and services at home and on local, national and global scales. Whatever the interconnection - a WiMAX enabled networked mobile vehicle, MEMS or nanotechnology enabled distributed sensor systems, Vehicular Ad hoc Networking (VANET) or Mobile Ad hoc Networking (MANET) - all can be classified under new networking s

  20. The Realistic Mobility Evaluation of Vehicular Ad-Hoc Network for Indian Automotive Networks

    V.S.Dhaka

    2014-04-01

    Full Text Available In recent years, continuous progress in wireless communication has opened a new research field in computer networks. Now a day’s wireless ad-hoc networking is an emerging research technology that needs attention of the industry people and the academicians. A vehicular ad-hoc network uses vehicles as mobile nodes to create mobility in a network. It’s a challenge to generate realistic mobility for Indian networks as no TIGER or Shapefile map is available for Indian Automotive Networks. This paper simulates the realistic mobility of the Vehicular Ad-hoc Networks (VANETs. The key feature of this work is the realistic mobility generation for the Indian Automotive Intelligent Transport System (ITS and also to analyze the throughput, packet delivery fraction (PDF and packet loss for realistic scenario. The experimental analysis helps in providing effective communication for safety to the driver and passengers.

  1. Directory-based incentive management services for ad-hoc mobile clouds

    Yousafzai, Abdullah; Chang, Victor; Gani, Abdullah; Noor, Rafidah Md

    2016-01-01

    Mobile cloud computing is envisioned as a promising approach to augment the computational capabilities of mobile devices for emerging resource-intensive mobile applications. This augmentation is generally achieved through the capabilities of stationary resources in cloud data centers. However, these resources are mostly not free and sometimes not available. Mobile devices are becoming powerful day by day and can form a self-organizing mobile ad-hoc network of nearby devices and offer their re...

  2. PERFORMANCE EVALUATION AND COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD-HOC NETWORK

    Chirag Jain; Vikas Raghuwanshi

    2016-01-01

    A Network which is form spontaneously by the collection of wireless nodes without any centralized administration or already existing network infrastructure called Mobile Ad-hoc Network (MANET). Performance evaluation of different Ad-Hoc networks routing protocols viz. DSDV, AODV & DSR on the basis of four parameter such as Packet delivery ratio, throughput, packet drop and routing overhead is main objective of this paper. NS-2, which is a discrete event simulation tool, is used in which T...

  3. Review Strategies and Analysis of Mobile Ad Hoc Network- Internet Integration Solutions

    Rakesh Kumar

    2010-07-01

    Full Text Available The desire to be connected anytime and anywhere has led to the development of wireless networks, opening new vista of research in pervasive and ubiquitous computing. Mobile Ad Hoc Networks (MANETs use portable devices such as mobile phones, laptops or personal digital assistants (PDAs for spontaneous establishment of communication. Most existing research in the area of mobile Ad Hoc Networks is limited to stand-alone isolated networks. But connectivity of a mobile Ad Hoc network to the Internet is also desirable as more and more applications and services in our society now depend on fixed infrastructure networks. It is therefore important that dynamically deployed wireless Ad Hoc networks should also gain access to these fixed networks and their services. The integration of MANETs into Internet increases the networking flexibility and coverage of existing infrastructure networks. Although researchers have proposed many solutions, but it is still unclear which one offer the best performance compared to the others. When an Ad Hoc network is connected to Internet, it is important for the mobile nodes to detect efficiently available Internet gateways providing access to the Internet. Internet gateway discovery time and handover delay have strong influence on packet delay and throughput. The key challenge in providing connectivity is to minimize the overhead of mobile IP and Ad Hoc routing protocol between Internet and Ad Hoc networks. There, this paper focuses on proposed technical solutions on Internet gateway discovery and also we briefly describe different ways to provide global Internet access for MANETs. Finally, some challenges are also mentioned which need in depth investigation.

  4. Decentralized Dynamic Load Balancing and Intersection Trust in Mobile Ad Hoc Grids

    Don Abraham

    2011-07-01

    Full Text Available A mobile ad hoc network is an autonomous system connected through wireless links. It does not have any fixed infrastructure, and the mobile nodes in the network coordinate among themselves for communication. This network can be formed by heterogeneous mobile devices like laptops, PDAs, cell phones etc. Highly capable device provides some services to low capability device and this will bring in a grid environment into the mobile ad hoc networks. A balanced allocation of load is a critical issue in such grids, considering its limitations in terms of power and availability. A decentralized approach is favored for a dispersed functioning of the grid, without draining a single chosen node. It is also essential to augment the resource allocation with an effective authorization mechanism, as the ad hoc grids lack permanent trusted central authority. In this paper, dynamic virtual organizations are constructed within this grid based on the resource commonalities of devices.

  5. Improvement of Performance of Mobile AD HOC Network using K- Path Splittable Traffic flow Scheme

    Sushil Chandra Dimri

    2011-11-01

    Full Text Available Mobile ad hoc network (MANET is a set of wireless mobile computer forming a temporary network with out any wired infrastructure, due to dynamic nature of topology and other constraints transmission routing is a challenging task in MANET. k path splittable routing establish at most k paths between single source and single destination node, this scheme provides better load balancing and increase in reliability of data transmission. This paper presents a comparative study of single path routing and k path routing in mobile ad hoc network

  6. LINK STABILITY WITH ENERGY AWARE AD HOC ON DEMAND MULTIPATH ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS

    Senthil Murugan Tamilarasan

    2013-01-01

    Full Text Available Mobile Ad Hoc Network is one of the wireless network in which mobile nodes are communicate with each other and have no infrastructure because no access point. The MANET protocols can be classified as proactive and reactive routing protocol. The proactive routing protocols, all nodes which participated in network have routing table. This table updated periodically and is used to find the path between source and destination. The reactive routing protocol, nodes are initiate route discovery procedure when on-demand routes. In order to find the better route in MANET, many routing protocols are designed in the recent years. But those protocols are not concentrating about communication links and battery energy. Communication links between nodes and energy of nodes are very important factor for improving quality of routing protocols. This study presents innovative Link Stability with Energy Aware (LSEA multipath routing protocol. The key idea of the protocol is find the link quality, maximum remaining energy and lower delay. Reflections of these factors are increasing the qualities like packet delivery ratio, throughputs and reduce end-to-end delay. The LSEAMRP was simulated on NS-2 and evaluation results also shown.

  7. A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

    Huang Chenn-Jung; Chuang Yi-Ta; Yang Dian-Xiu; Chen I-Fan; Chen You-Jia; Hu Kai-Wen

    2008-01-01

    Abstract With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, n...

  8. Ant Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc Network

    B. Kalaavathi

    2008-01-01

    Full Text Available Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure and frequent node mobility. A class of ant colony based routing protocols has recently gained attention because of their adaptability to the network changes. AntHocNet is ant colony based hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. Multi-path routing represents a promising routing method for mobile ad hoc network. Multi-path routing achieves load balancing and is more resilient to route failures. This research introduces node disjoint multi-path property to AntHocNet routing algorithm. A virtual class room is one that can be established by using mobile devices and whose members can be dynamically added or removed. The implementation of virtual class room for lesson handling and query discussion using mobile ad hoc network is analyzed. The data are spread among the N (here N = 3 node disjoint routes from the beginning of the data transmission session. The performance metrics, average end-to-end delay, packet delivery ratio and load balancing have been analyzed for various pause times. The average end-to-end delay and packet delivery ratio have not varied significantly. Optimal load distribution is achieved by spreading the load among different node disjoint routes.

  9. Power and Mobility-Aware Adaptive Dynamic Source Routing in Mobile Ad Hoc Network

    XULi; ZHENGBaoyu; YANGZhen

    2005-01-01

    MANET (Mobile ad hoc network) is characterized by a highly dynamic network topology. This makes routing discovery and maintenance challenging for routing protocol design. On the other hand, energy efficient routing may be another important design criterion for MANET since most of nodes are usually powered by battery with limited capacity. With optimization of DSR (Dynamic source routing) protocol, this paper proposes Power and mobility-aware adaptive dynamic source routing (PMADSR). The new routing protocol can be aware of the mobility and remaining battery capacity of nodes. Performance simulation results show that the proposed PMADSR protocol can dynamically balance the traffic load inside the whole network, so as to prolong the network lifetime, as well as achieve higher throughput.

  10. Analysis of Efficient Address Allocation Schemes In Mobile Ad Hoc Networks

    S.Zahoor Ul Huq

    2010-03-01

    Full Text Available A Mobile Ad-hoc Network (MANET can be implemented anywhere where there is little or no communication infrastructure, or the existing infrastructure is inconvenient to use. A number of mobile devices may connect together to form one network. Address auto-configuration is an important issue for ad hoc networks in order to provide autonomous networking and self-management. In this paper we take into account various parameters for designing an efficient address allocation scheme in MANETs and consider the best of them to build an efficient protocol for Address allocation in MANETs.

  11. Performance Analysis of TORA & DSR Routing Protocols in Mobile Ad-hoc Networks

    Geetha, D; T SARIKA

    2013-01-01

    Mobile ad hoc network (MANET) is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new ro...

  12. A Comparison of the TCP Variants Performance over different Routing Protocols on Mobile Ad Hoc Networks

    S. R. Biradar

    2010-03-01

    Full Text Available We describe a variant of TCP (Tahoe, Vegas, TCP is most widely used transport protocol in both wired and wireless networks. In mobile ad hoc networks, the topology changes frequently due to mobile nodes, this leads to significant packet losses and network throughput degradation. This is due to the fact that TCP fails to distinguish the path failure and network congestion. In this paper, the performances of TCP over different routing (DSR, AODV and DSDV protocols in ad hoc networks wasstudied by simulation experiments and results are reported.

  13. A Mobility and Traffic Generation Framework for Modeling and Simulating Ad Hoc Communication Networks

    Chris Barrett; Martin Drozda; Marathe, Madhav V; Ravi, S. S.; Smith, James P.

    2004-01-01

    We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad~hoc networks. Three components of this framework, namely a mobility data generator (MDG), a graph structure generator (GSG) and an occlusion modification tool (OMT) allow a variety of mobility models to be incorporated into the tool. The MDG module generates positions of transceivers at specified time instants. The GSG module constructs the graph corre...

  14. Replica Dissemination and Update Strategies in Cluster-Based Mobile Ad Hoc Networks

    Denko, Mieso K.; Hua Lu

    2006-01-01

    A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that forms a temporary network without the aid of a fixed communication infrastructure. Since every node can be mobile and network topology changes can occur frequently, node disconnection is a common mode of operation in MANETs. Providing reliable data access and message delivery is a challenge in this dynamic network environment. Caching and replica allocation within the network can improve data accessibility by storin...

  15. Highly Dynamic Nature of Mobile AD-HOC Networks (MANETs): Requirement of Stringent Security Measures

    P. Balagangadhar Rao

    2011-01-01

    Wireless mobile AD-HOC networks (MANETs) can be established on demand and disappear when there is no need. Each mobile node in the network acts both as a terminal and also as a router. Thus, each mobile node is having a capability of forwarding packets of information to other peer nodes. The nodes are, basically, self-organized wireless interconnecting communication devices which can either extend or operate in concert with the wired networking infrastructure. Lot of research is going on, in ...

  16. Auction-based Incentive Mechanisms for Dynamic Mobile Ad-Hoc Crowd Service

    Zhang, Honggang; Liu, Benyuan; Susanto, Hengky; Xue, Guoliang

    2015-01-01

    We investigate a type of emerging user-assisted mobile applications or services, referred to as Dynamic Mobile Ad-hoc Crowd Service (DMACS), such as collaborative streaming via smartphones or location privacy protection through a crowd of smartphone users. Such services are provided and consumed by users carrying smart mobile devices (e.g., smartphones) who are in close proximity of each other (e.g., within Bluetooth range). Users in a DMACS system dynamically arrive and depart over time, and...

  17. Study of Impact of Mobile Ad hoc Networking and its Future Applications

    Ashema Hasti

    2012-01-01

    Full Text Available Today, many people carry numerous portable devices, such as laptops, mobile phones, PDAs and mp3 players, for use in their professional and private lives. For the most part, these devices are used separately-that is, their applications do not interact. Imagine, however, if they could interact directly: participants at a meeting could share documents or presentations; all communication could automatically be routed through the wireless corporate campus network. These examples of spontaneous, ad hoc wireless communication between devices might be loosely defined as a scheme, often referred to as ad hoc networking, which allows devices to establish communication, anytime and anywhere without the aid of a central infrastructure. This paper describes the concept of mobile ad hoc networking (MANET and points out some of its applications that can be envisioned for future. Also, the paper presents two of the technical challenges MANET poses, which include Geocasting and QoS.

  18. AN EFFICIENT AUTONOMOUS KEY MANAGEMENT WITH REDUCED COMMUNICATION/COMPUTATION COSTS IN MOBILE AD HOC NETWORK

    M. Devi

    2013-01-01

    Full Text Available A primary concern in Mobile Ad Hoc Networks (MANETs is security. Secret sharing is an effective way to distribute a secret among n parties, where each party holds one piece of the secret. A number of key management schemes have been proposed for MANETs. However the secret sharing to control key hierarchy needs larger message transmission costs in many techniques. Existing research in key management can only handle very limited number of nodes and are inefficient, insecure, or unreliable when the nodes increases. Here this study modifies Autonomous key management scheme is proposed to address both for security and efficiency for key management in Mobile Ad hoc Network (MANET. It also reduces communication and computational cost in Ad-Hoc Network and works for large number of nodes.

  19. A Survey of Congestion Control in Proactive Source Routing Protocol in Mobile Ad Hoc Networks

    Bhagyashree S kayarkar

    2014-12-01

    Full Text Available In mobile ad hoc networks (MANET congestion can take place between the two intermediate nodes, when the packet is transferred from the source to the destination. The congestion in MANET is mainly due to frequent change to topology and high mobility of nodes, which lead to high loss of packet. In ad hoc network the congestion control techniques with TCP becomes difficult to handle since in ad hoc network there is high density of nodes in the network and there is frequent change to topology in the network. In this paper to control the congestion in proactive source routing protocol an error message is generated by the receiver to reduce the packet sending rate. We are using a new control message i.e., Packet Error Announcing Message called (PEAM messages.

  20. A Secure and Pragmatic Routing Protocol for Mobile Ad hoc Networks

    LIU Zhi-yuan

    2008-01-01

    An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Because of node mobility and power limitations, the network topology changes frequently. Routing protocol plays an important role in the ad hoc network. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. As an optimization for the current Dynamic Source Routing Protocol, a secure and pragmatic routes selection scheme based on Reputation Systems was proposed. We design the Secure and Pragmatic Routing protocol and implement simulation models using GloMoSim. Simulation results show that the Secure and Pragmatic Routing protocol provides better experimental results on packet delivery ratio, power consumption and system throughput than Dynamic Source Routing Protocol.

  1. A New Scheme for Minimizing Malicious Behavior of Mobile Nodes in Mobile Ad Hoc Networks

    Rizvi, Syed S

    2009-01-01

    The performance of Mobile Ad hoc networks (MANET) depends on the cooperation of all active nodes. However, supporting a MANET is a cost-intensive activity for a mobile node. From a single mobile node perspective, the detection of routes as well as forwarding packets consume local CPU time, memory, network-bandwidth, and last but not least energy. We believe that this is one of the main factors that strongly motivate a mobile node to deny packet forwarding for others, while at the same time use their services to deliver its own data. This behavior of an independent mobile node is commonly known as misbehaving or selfishness. A vast amount of research has already been done for minimizing malicious behavior of mobile nodes. However, most of them focused on the methods/techniques/algorithms to remove such nodes from the MANET. We believe that the frequent elimination of such miss-behaving nodes never allowed a free and faster growth of MANET. This paper provides a critical analysis of the recent research wok and ...

  2. A Globally Accessible List (GAL Based Recovery Concept In Mobile Ad-hoc Network

    A.K.Daniel,

    2011-04-01

    Full Text Available A mobile ad-hoc network is a mobile, multi-hop wireless network which is capable of autonomous operation whose primary role is to provide a reliable end to end communication between nodes in the network.However achieving reliable transmission in mobile wireless network is crucial due to change in the network topology caused by node mobility. Modern communication network is becoming increasing & diverse. This is the consequence of an increasing array of devices & services both wired & wireless. There are various protocols to facilitate communication in ad hoc network like DSR and TORA. However these approaches end up in the inefficient utilization of resources after link failure and congestion. This paper proposes an approach to get over this problem .We have added some static nodes which only keeps information related to the current working path and also helps in quick recovery in case of link failure .

  3. Enabling Adaptive Rate and Relay Selection for 802.11 Mobile Ad Hoc Networks

    Mehta, Neil; Wang, Wenye

    2011-01-01

    Mobile ad hoc networks (MANETs) are self-configuring wireless networks that lack permanent infrastructure and are formed among mobile nodes on demand. Rapid node mobility results in dramatic channel variation, or fading, that degrades MANET performance. Employing channel state information (CSI) at the transmitter can improve the throughput of routing and medium access control (MAC) protocols for mobile ad hoc networks. Several routing algorithms in the literature explicitly incorporate the fading signal strength into the routing metric, thus selecting the routes with strong channel conditions. While these studies show that adaptation to the time-variant channel gain is beneficial in MANETs, they do not address the effect of the outdated fading CSI at the transmitter. For realistic mobile node speeds, the channel gain is rapidly varying, and becomes quickly outdated due the feedback delay. We analyze the link throughput of joint rate adaptation and adaptive relay selection in the presence of imperfect CSI. Mor...

  4. Similarity-Based Clustering Strategy for Mobile Ad Hoc Multimedia Databases

    Bo Yang

    2005-01-01

    Full Text Available Multimedia data are becoming popular in wireless ad hoc environments. However, the traditional content-based retrieval techniques are inefficient in ad hoc networks due to the multiple limitations such as node mobility, computation capability, memory space, network bandwidth, and data heterogeneity. To provide an efficient platform for multimedia retrieval, we propose to cluster ad hoc multimedia databases based on their semantic contents, and construct a virtual hierarchical indexing infrastructure overlaid on the mobile databases. This content-aware clustering scheme uses a semantic-aware framework as the theoretical foundation for data organization. Several novel techniques are presented to facilitate the representation and manipulation of multimedia data in ad hoc networks: 1 using concise distribution expressions to represent the semantic similarity of multimedia data, 2 constructing clusters based on the semantic relationships between multimedia entities, 3 reducing the cost of content-based multimedia retrieval through the restriction of semantic distances, and 4 employing a self-adaptive mechanism that dynamically adjusts to the content and topology changes of the ad hoc networks. The proposed scheme is scalable, fault-tolerant, and efficient in performing content-based multimedia retrieval as demonstrated in our combination of theoretical analysis and extensive experimental studies.

  5. Specification and Validation of an Edge Router Discovery Protocol for Mobile Ad Hoc Networks

    Kristensen, Lars Michael; Jensen, Kurt

    2004-01-01

    core network in assigning network address prefixes to gateways in mobile ad-hoc networks. This paper focuses on how CP-nets and the CPN computer tools have been applied in the development of ERDP. A CPN model has been constructed that constitutes a formal executable specification of ERDP. Simulation...

  6. A Multicast Routing Mechanism in Mobile Ad Hoc Network Through Label Switching

    Li MengYang

    2011-10-01

    Full Text Available Merging MPLS into multicast routing protocol in Mobile Ad hoc network is an elegant method to enhance the network performance and an efficient solution for multicast scalability and control overhead problems. Based on the Wireless MPLS technology, the mechanism and evaluation of a new multicast protocol, the Label Switching Multicast Routing Protocol (LSMRP is presented in this paper.

  7. Design of a Smart Antenna for Mobile Ad Hoc Network Applications

    Marco Di Filippo; Leonardo Lucci; Dania Marabissi; Stefano Selleri

    2015-01-01

    Among the mobile ad hoc networks appealing characteristics there are network reconfigurability and flexibility. In this context a smart antenna capable of self-configuring multiple high-directivity beams provides a major advantage in terms of power saving, increased range, and spatial reuse of channels. In this paper a smart antenna made of a cylindrical array of patches suitable for MANETs is presented.

  8. SPIZ: An Effective Service Discovery Protocol for Mobile Ad Hoc Networks

    Noh Donggeon

    2007-01-01

    Full Text Available The characteristics of mobile ad hoc networks (MANETs require special care in the handling of service advertisement and discovery (Ad/D. In this paper, we propose a noble service Ad/D technique for MANETs. Our scheme avoids redundant flooding and reduces the system overhead by integrating Ad/D with routing layer. It also tracks changing conditions, such as traffic and service popularity levels. Based on a variable zone radius, we have combined push-based Ad/D with a pull-based Ad/D strategy.

  9. SPIZ: An Effective Service Discovery Protocol for Mobile Ad Hoc Networks

    Donggeon Noh

    2006-11-01

    Full Text Available The characteristics of mobile ad hoc networks (MANETs require special care in the handling of service advertisement and discovery (Ad/D. In this paper, we propose a noble service Ad/D technique for MANETs. Our scheme avoids redundant flooding and reduces the system overhead by integrating Ad/D with routing layer. It also tracks changing conditions, such as traffic and service popularity levels. Based on a variable zone radius, we have combined push-based Ad/D with a pull-based Ad/D strategy.

  10. Mobility Models for Next Generation Wireless Networks Ad Hoc, Vehicular and Mesh Networks

    Santi, Paolo

    2012-01-01

    Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networks provides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also: Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and

  11. Calculation and Analysis of Destination Buffer for Multimedia Service in Mobile Ad Hoc Network

    ZHOU Zhong; MAO Yu-ming; JIANG Zhi-qong

    2005-01-01

    Jitter is one of the most important issues for multimedia real time services in future mobile ad hoc networks(MANET). A thorough theoretical analysis of the destination buffer for smoothing the jitter of the real time service in MANET is given. The theoretical results are applied in moderate populated ad hoc networks in our simulation, the simulation results show that by predicting and adjusting destination buffer in our way, Jitter will be alleviated in large part and this will contribute much to the quality of service (QOS) in MANET.

  12. Contention-based forwarding for mobile ad-hoc networks

    Füßler, Holger; Käsemann, Michael; Mauve, Martin; Hartenstein, Hannes; Widmer, Jörg

    2003-01-01

    Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a s...

  13. Survey: Comparison Estimation of Various Routing Protocols in Mobile Ad-Hoc Network

    Priyanshu

    2014-06-01

    Full Text Available MANET is an autonomous system of mobile nodes attached by wireless links. It represents a complex and dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into an ad-hoc network topology. The devices in the network may have limited transmission range therefore multiple hops may be needed by one node to transfer data to another node in network. This leads to the need for an effective routing protocol. In this paper we study various classifications of routing protocols and their types for wireless mobile ad-hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast Protocols. In this paper we also compare different routing protocols on based on a given set of parameters Scalability, Latency, Bandwidth, Control-overhead, Mobility impact.

  14. A Novel Routing Technique For Mobile Ad Hoc Networks (Manet

    Kirtikumar K. Patel

    2014-03-01

    Full Text Available Actual network size depends on the application and the protocols developed for the routing for this kind of networks should be scalable and efficient. Each routing protocol should support small as well as large scale networks very efficiently. As the number of node increase, it increases the management functionality of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here, we designed all identical nodes in the cluster except the cluster head and this criterion reduces the management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend. It is applied to both intra-cluster communications as well as inter-cluster communications. The performance shows that having a multi-hop connectivity for intra-cluster communications is more power efficient compared to broadcast of information with maximum power coverage. We also showed the total number of required intermediate nodes in the transmission from source to destination. However, dynamic behavior of the nodes requires greater understanding of the node degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that the proposed graph theoretic routing approach will reduce the overall delay and improves the physical layer data

  15. Intrusion Detection in Mobile Ad Hoc Networks Using Classification Algorithms

    Mitrokotsa, Aikaterini; Douligeris, Christos

    2008-01-01

    In this paper we present the design and evaluation of intrusion detection models for MANETs using supervised classification algorithms. Specifically, we evaluate the performance of the MultiLayer Perceptron (MLP), the Linear classifier, the Gaussian Mixture Model (GMM), the Naive Bayes classifier and the Support Vector Machine (SVM). The performance of the classification algorithms is evaluated under different traffic conditions and mobility patterns for the Black Hole, Forging, Packet Dropping, and Flooding attacks. The results indicate that Support Vector Machines exhibit high accuracy for almost all simulated attacks and that Packet Dropping is the hardest attack to detect.

  16. Clustering in mobile ad hoc network based on neural network

    CHEN Ai-bin; CAI Zi-xing; HU De-wen

    2006-01-01

    An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clustering algorithm, then a training set was created and a neural network was trained. In this algorithm, several system parameters were taken into account, such as the ideal node-degree, the transmission power, the mobility and the battery power of the nodes. The algorithm can be used directly to test whether a node is a cluster-head or not. Moreover, the clusters recreation can be speeded up.

  17. Data Security in Mobile Ad Hoc Networks using Genetic Based Biometrics

    B. Shanthini; S. Swamynathan

    2010-01-01

    A mobile ad hoc network (MANET) is a self-configuring, dynamic, multi hop radio network without any fixed infrastructure. MANETs are collections of wireless mobile devices with restricted broadcast range and resources and communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. The main challenge in the design of such networks is how to prevent the a...

  18. Maintains Secure Intrusion Detection System for Mobile Ad-hoc Network

    B.Reddy Sumanth; T.Venkataramana

    2014-01-01

    Now a day’s mobile ad hoc networks (MANETs) are very popular research area. MANET is one of the mainly essential and unique applications. The mobility and scalability brought by wireless network made it possible in many applications. MANET does not require a fixed network infrastructure; every single node works as both a transmitter and a receiver. When the nodes are both within the same communication range then they communicate directly each other. These are significant factors i...

  19. A Decentralized VPN Service over Generalized Mobile Ad-Hoc Networks

    Fujita, Sho; Shima, Keiichi; Uo, Yojiro; Esaki, Hiroshi

    We present a decentralized VPN service that can be built over generalized mobile ad-hoc networks (Generalized MANETs), in which topologies can be represented as a time-varying directed multigraph. We address wireless ad-hoc networks and overlay ad-hoc networks as instances of Generalized MANETs. We first propose an architecture to operate on various kinds of networks through a single set of operations. Then, we design and implement a decentralized VPN service on the proposed architecture. Through the development and operation of a prototype system we implemented, we found that the proposed architecture makes the VPN service applicable to each instance of Generalized MANETs, and that the VPN service makes it possible for unmodified applications to operate on the networks.

  20. Preventive Aspect of Black Hole Attack in Mobile AD HOC Network

    Kumar Roshan

    2012-06-01

    Full Text Available Mobile ad hoc network is infrastructure less type of network. In this paper we present the prevention mechanism for black hole in mobile ad hoc network. The routing algorithms are analyzed and discrete properties of routing protocols are defined. The discrete properties support in distributed routing efficiently. The protocol is distributed and not dependent upon the centralized controlling node. Important features of Ad hoc on demand vector routing (AODV are inherited and new mechanism is combined with it to get the multipath routing protocol for Mobile ad hoc network (MANET to prevent the black hole attack. When the routing path is discovered and entered into the routing table, the next step is taken by combined protocol to search the new path with certain time interval. The old entered path is refreshed into the routing table. The simulation is taken on 50 moving nodes in the area of 1000 x 1000 square meter and the maximum speed of nodes are 5m/sec. The result is calculated for throughput verses number of black hole nodes with pause time of 0 sec. to 40 sec., 120 sec. and 160 sec. when the threshold value is 1.0.

  1. Sybil Attack on Lowest Id Clustering Algorithm in The Mobile Ad Hoc Network

    Manu Sood

    2012-10-01

    Full Text Available It is quite a challenging task to achieve security in a mobile ad hoc network because of its open nature,dynamically changing topology, lack of infrastructure and central management. A particular harmfulattack that takes the advantage of these characteristics is the Sybil attack, in which a malicious nodeillegitimately claims multiple identities. This attack can exceedingly disrupt various operations of themobile ad hoc networks such as data aggregation, voting, fair resource allocation scheme, misbehaviordetection and routing mechanisms etc. Two routing mechanisms known to be vulnerable to the Sybilattack in the mobile ad hoc networks are multi-path routing and geographic routing. In addition to theserouting protocols, we show in this paper that the Sybil attack can also disrupt the head selectionmechanism of the lowest ID cluster-based routing protocol. To the best of our knowledge, this is for thefirst time that a Sybil attack is shown to disrupt this cluster based routing protocol. To achieve this, weillustrate to have introduced a category of Sybil attack in which the malicious node varies itstransmission power to create a number of virtual illegitimate nodes called Sybil nodes, for the purpose ofcommunication with legitimate nodes of the Mobile Ad Hoc Network. The variation in the transmissionpower makes the Sybil attack more deadly and difficult to be detected.

  2. Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks

    Garetto, Michele

    2008-01-01

    In this paper, we analyze asymptotic delay-throughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spatial heterogeneity has the ability to drastically improve upon existing scaling laws established under the assumption that nodes are identical and uniformly visit the entire network area. In particular, we consider the situation in which each node moves around its own home-point according to a restricted mobility process which results into a spatial stationary distribution that decays as a power law of exponent delta with the distance from the home-point. For such restricted mobility model, we propose a novel class of scheduling and routing schemes, which significantly outperforms all delay-throughput results previously obtained in the case of identical nodes. In particular, for delta = 2 it is possible to achieve almost constant delay and almost constant per-node throughput (except for a poly-logarithmic factor) as the number of nodes increas...

  3. Effect of Mobility Models on Reinforcement Learning Based Routing Algorithm Applied for Scalable AD HOC Network Environment

    Shrirang.Ambaji.Kulkarn

    2010-11-01

    Full Text Available Mobile Ad Hoc Network faces the greatest challenge for better performances in terms of mobilitycharacterization. The mobility of nodes and their underlying mobility models have a profound effect on theperformances of routing protocols which are central to the design of ad hoc networks. Most of thetraditional routing algorithms proposed for ad hoc networks do not scale well when the traffic variationincreases drastically. To model a solution to this problem we consider a reinforcement learning basedrouting algorithm for ad hoc network known as SAMPLE. Most the scalability issues for ad hoc networkperformance investigation have not considered the group mobility of nodes. In this paper we modelrealistic group vehicular mobility model and analyze the robustness of a reinforcement learning basedrouting algorithm under scalable conditions.

  4. A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

    Kai-Wen Hu

    2008-04-01

    Full Text Available With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, namely, particle swarm optimization and fuzzy logic systems, are incorporated into the proposed schemes to enhance the accuracy of prediction of link break and congestion occurrence. The experimental results verify the effectiveness and feasibility of the proposed schemes.

  5. A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

    Huang Chenn-Jung

    2008-01-01

    Full Text Available Abstract With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, namely, particle swarm optimization and fuzzy logic systems, are incorporated into the proposed schemes to enhance the accuracy of prediction of link break and congestion occurrence. The experimental results verify the effectiveness and feasibility of the proposed schemes.

  6. Secured 7 Layer Security Architecture (S7LSA For Mobile Ad Hoc Network

    Manu Srivastava

    2014-04-01

    Full Text Available Mobile Ad hoc Networks (MANET constitutes a group of wireless mobile nodes that transmit information without any centralized control. MANETs are infrastructure-less and are dynamic in nature that is why; they require peremptorily new set of networking approach to put through to provide efficacious and successful end-to-end communication. The wireless and distributed nature of MANET poses a great challenge to system security designers. Although security problems in MANET have attracted much attention in the last few years, most research efforts have been focused on specific security areas, such as establishing trust infrastructure, securing routing protocols, or intrusion detection and response, none of the previous work proposes security solutions from a system architectural view. In this paper, we propose seven-layer security architecture for mobile ad hoc networks. A general description of functionalities in each layer is given.

  7. Multicasting along Energy—Efficient Meshes in Mobile Ad Hoc Networks

    JIANGHai; CHENGShixin; HEYongming

    2003-01-01

    In consideration that current mesh-based multicast routing protocols for mobile ad hoc networks don't tend to form energy-efficient multicast infrastruc-ture, we propose a new Energy-efficient multicast rout-ing protocol (E2MRP) for mobile ad hoc networks. The two main characteristics of E2MRP are: (1) using in turn the criteria for minimum energy consumed per packet and minimum maximum node cost during the course of relaying group (RG) creation and maintenance; (2)forming a graph-based multicast infrastructure instead of a tree-based one. Compared to multicast incremen-tal power (MIP) and on-demand multicast routing pro-tocol (ODMRP), as the simulation results show, E2MRP tremendously reduces the energy consumption rate of nodes and hence prolongs the lifetime of nodes and net-works, especially when the size of multicast group is small and node mobility is low.

  8. Impact of Rushing attack on Multicast in Mobile Ad Hoc Network

    Palanisamy, V

    2009-01-01

    A mobile ad hoc network (MANETs) is a self-organizing system of mobile nodes that communicate with each other via wireless links with no fixed infrastructure or centralized administration such as base station or access points. Nodes in a MANETs operate both as host as well as routers to forward packets for each other in a multihop fashion. For many applications in wireless networks, multicasting is an important and frequent communication service. By multicasting, since a single message can be delivered to multiple receivers simultaneously. It greatly reduces the transmission cost when sending the same packet to multiple recipients. The security issue of MANETs in group communications is even more challenging because of involvement of multiple senders and multiple receivers. At that time of multicasting, mobile ad hoc network are unprotected by the attacks of malicious nodes because of vulnerabilities of routing protocols. Some of the attacks are Rushing attack, Blackhole attack, Sybil attack, Neighbor attack ...

  9. Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm

    Marimuthu Murugesan

    2011-01-01

    Full Text Available Problem statement: Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. Unlike in a wired network, a packet transmitted by a node in ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (Forwarding nodes used as the cost criterion for broadcasting. Approach: This study proposes a reliable and efficient broadcasting algorithm using minimized forward node list algorithm which uses 2-hop neighborhood information more effectively to reduce redundant transmissions in asymmetric Mobile Ad hoc networks that guarantees full delivery. Among the 1-hop neighbors of the sender, only selected forwarding nodes retransmit the broadcast message. Forwarding nodes are selected such a way that to cover the uncovered 2-hop neighbors. Results: Simulation results show that the proposed broadcasting algorithm provides high delivery ratio, low broadcast forward ratio, low overhead and minimized delay. Conclusion: In this study, reliable and efficient broadcasting algorithm in asymmetric Mobile Ad Hoc Networks using minimized forward node list algorithm has been proposed which provides low forward ratio, high delivery ratio while suppressing broadcast redundancy.

  10. Highway Mobility and Vehicular Ad-Hoc Networks in NS-3

    Arbabi, Hadi

    2010-01-01

    The study of vehicular ad-hoc networks (VANETs) requires efficient and accurate simulation tools. As the mobility of vehicles and driver behavior can be affected by network messages, these tools must include a vehicle mobility model integrated with a quality network simulator. We present the first implementation of a well-known vehicle mobility model to ns-3, the next generation of the popular ns-2 networking simulator. Vehicle mobility and network communication are integrated through events. User-created event handlers can send network messages or alter vehicle mobility each time a network message is received and each time vehicle mobility is updated by the model. To aid in creating simulations, we have implemented a straight highway model that manages vehicle mobility, while allowing for various user customizations. We show that the results of our implementation of the mobility model matches that of the model's author and provide an example of using our implementation in ns-3.

  11. An Agent Based Intrusion Detection Model for Mobile Ad Hoc Networks

    B. M. Reshmi

    2006-01-01

    Full Text Available Intrusion detection has over the last few years, assumed paramount importance within the broad realm of network security, more so in case of wireless mobile ad hoc networks. The inherently vulnerable characteristics of wireless mobile ad hoc networks make them susceptible to attacks in-spite of some security measures, and it may be too late before any counter action can take effect. As such, there is a need to complement traditional security mechanisms with efficient intrusion detection and response systems. This paper proposes an agent-based model to address the aspect of intrusion detection in cluster based mobile wireless ad hoc network environment. The model comprises of a set of static and mobile agents, which are used to detect intrusions, respond to intrusions, and distribute selected and aggregated intrusion information to all other nodes in the network in an intelligent manner. The model is simulated to test its operation effectiveness by considering the performance parameters such as, detection rate, false positives, agent overheads, and intrusion information distribution time. Agent based approach facilitates flexible and adaptable security services. Also, it supports component based software engineering components such as maintainability, reachability, reusability, adaptability, flexibility, and customization.

  12. DYNAMIC K-MEANS ALGORITHM FOR OPTIMIZED ROUTING IN MOBILE AD HOC NETWORKS

    Zahra Zandieh Shirazi

    2016-04-01

    Full Text Available In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks (MANETs is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre-existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K-means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K-means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the performance of routing process in Mobile ad-hoc networks.

  13. An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

    Nidhi Lal

    2014-12-01

    Full Text Available Mobile ad hoc network (MANET is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay.

  14. Guard against cooperative black hole attack in Mobile Ad-Hoc Network

    Harsh Pratap Singh

    2011-07-01

    Full Text Available A mobile ad-hoc network is an autonomous network that consists of nodes which communicate with each other with wireless channel. Due to its dynamic nature and mobility of nodes, mobile ad hoc networks are more vulnerable to security attack than conventional wired and wireless networks. One of the principal routing protocols AODV used in MANETs. The security of AODV protocol is influence by the particular type of attack called Black Hole attack. In a black hole attack, a malicious node injects a faked route reply claiming to havethe shortest and freshest route to the destination. However, when the data packets arrive, the malicious node discards them. To preventing black hole attack, this paper presents RBS (Reference Broadcast Synchronization & Relative velocity distance method for clock synchronization process in Mobile ad-hoc Network for removal of cooperative black hole node. This paper evaluates the performance in NS2 network simulator and our analysis indicates that this method is very suitable to remove black hole attack.

  15. Exploiting Mobile Ad Hoc Networking and Knowledge Generation to Achieve Ambient Intelligence

    Anna Lekova

    2012-01-01

    Full Text Available Ambient Intelligence (AmI joins together the fields of ubiquitous computing and communications, context awareness, and intelligent user interfaces. Energy, fault-tolerance, and mobility are newly added dimensions of AmI. Within the context of AmI the concept of mobile ad hoc networks (MANETs for “anytime and anywhere” is likely to play larger roles in the future in which people are surrounded and supported by small context-aware, cooperative, and nonobtrusive devices that will aid our everyday life. The connection between knowledge generation and communication ad hoc networking is symbiotic—knowledge generation utilizes ad hoc networking to perform their communication needs, and MANETs will utilize the knowledge generation to enhance their network services. The contribution of the present study is a distributed evolving fuzzy modeling framework (EFMF to observe and categorize relationships and activities in the user and application level and based on that social context to take intelligent decisions about MANETs service management. EFMF employs unsupervised online one-pass fuzzy clustering method to recognize nodes' mobility context from social scenario traces and ubiquitously learn “friends” and “strangers” indirectly and anonymously.

  16. Performance Comparison Study of Connected Dominating Set Algorithms for Mobile Ad hoc Networks under Different Mobility Models

    Natarajan Meghanathan

    2013-05-01

    Full Text Available The high-level contribution of this paper is an exhaustive simulation-based comparison study of three categories (density, node id and stability-based of algorithms to determine connected dominating sets (CDS for mobile ad hoc networks and evaluate their performance under two categories (random node mobility and grid-based vehicular ad hoc network of mobility models. The CDS algorithms studied are the maximum density-based (MaxD-CDS, node ID-based (ID-CDS and the minimum velocity-based (MinV-CDS algorithms representing the density, node id and stability categories respectively. The node mobility models used are the Random Waypoint model (representing random node mobility and the City Section and Manhattan mobility models (representing the grid-based vehicular ad hoc networks. The three CDS algorithms under the three mobility models are evaluated with respect to two critical performance metrics: the effective CDS lifetime (calculated taking into consideration the CDS connectivity and absolute CDS lifetime and the CDS node size. Simulations are conducted under a diverse set of conditions representing low, moderate and high network density, coupled with low, moderate and high node mobility scenarios. For each CDS, the paper identifies the mobility model that can be employed to simultaneously maximize the lifetime and minimize the node size with minimal tradeoff. For the two VANET mobility models, the impact of the grid block length on the CDS lifetime and node size is also evaluated.

  17. Simulation of Efficiency in Mobile Ad Hoc Networks using OMNeT++

    Varun Manchikalapudi

    2015-08-01

    Full Text Available A network is a group of two or more computer systems linked together. There are many types of computer networks which are categorized based on topology, protocol and architecture. A Mobile Ad hoc Network (MANET is a self-configuring infrastructure less network of mobile devices connected by wireless. Ad hoc networks maintain an unfair behavior in flow control especially when considered in the case of IEEE 802.11 Mac layer. Introducing efficiency in 802.11 is not an easy task. It reduces the overall global throughput. The network is to be designed in such a way that it deals with the fairness and throughput by maximizing aggregate throughput. Such kind of network design can be efficiently implemented on an evolving simulation tool named OMNet++.

  18. Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols

    Qazi Javed Ahmed

    2012-03-01

    Full Text Available Mobile ad hoc network (MANET is an organization of static and wireless mobile nodes having no any central administration and fixed infrastructure. In MANET, each node can acts as routing and hosting device. Performance comparison and analysis has been conducted by using four different scenarios in NS2 (Network Simulator for which two reactive (AODV, DSR and two proactive (OLSR, DSDV ad hoc routing protocols have been selected by utilizing 802.11 wireless standard. The main goal is to find out the better performing protocol by measuring three metrics Packet Delivery Ratio, Throughput and Routing Overhead. As the results show that the performance of reactive protocols is better than proactive protocols.

  19. An Efficient Weight Based Clusterhead Selection Algorithm for Mobile ad hoc Network

    R. Gunavathi

    2011-02-01

    Full Text Available Clustering can improve the network management and energy saving. In the clustered network organization the clusters are formed by grouping the mobile nodes with one special role node termed as clusterhead. Cluster based communication protocols have been proposed for ad hoc networks for various reasons. In the proposed algorithm all clusterheads spread across the network. In this paper the high-weight node is act as a clusterhead with minimum 3-hop count distance between each other. We also investigate to minimize the clusterhead change, increase in lifetime of clusterheads, less energy conservation. The simulation results are compared with On-Demand Weighted Clustering Algorithm (ODWCA and it shows that the Efficient Weight based Clusterhead Selection Algorithm (EWCSA that improves the network performance for Mobile ad hoc Network.

  20. Neighbor Attack And Detection Mechanism In Mobile Ad-Hoc Networks

    S. Parthiban

    2012-04-01

    Full Text Available In Mobile Ad-Hoc Networks (MANETs, security is one of the most important concerns because a MANETs system is much more vulnerable to attacks than a wired or infrastructure-based wireless network. Designing an effective security protocol for MANET is a very challenging task. This is mainlydue to the unique characteristics of MANETs, namely shared broadcast radio channel, insecure operatingenvironment, lack of central authority, lack of association among users, limited availability of resources, and physical vulnerability. In this paper we present simulation based study of the impact of neighbor attack on mesh-based Mobile Ad-Hoc Network (MANET. And also we study the number of attackers and position affects the performance metrics such as packet delivery ratio and throughput. The study enables us to propose a secure neighbor detection mechanism (SNDM. A generic detection mechanism against neighbor attack for On Demand Routing Protocols is simulated on GlomoSim environment.

  1. SD-AODV: A Protocol for Secure and Dynamic Data Dissemination in Mobile Ad Hoc Network

    Rajender Nath

    2010-11-01

    Full Text Available Security remains as a major concern in the mobile ad hoc networks. This paper presents a new protocol SD-AODV, which is an extension of the exiting protocol AODV. The proposed protocol is made secure and dynamic against three main types of routing attacks-wormhole attack, byzantine attack and blackhole attack. SD-AODV protocol was evaluated through simulation experiments done on Glomosim and performance of the network was measured in terms of packet delivery fraction, average end-to-end delay, global throughput and route errors of a mobile ad hoc network where a defined percentage of nodes behave maliciously. Experimentally it was found that the performance of the network did not degrade in the presence of the above said attacks indicating that the proposed protocol was secure against these attacks.

  2. Global Consistency Management Methods Based on Escrow Approaches in Mobile ad Hoc Networks

    Takahiro Hara

    2010-01-01

    Full Text Available In a mobile ad hoc network, consistency management of data operations on replicas is a crucial issue for system performance. In our previous work, we classified several primitive consistency levels according to the requirements from applications and provided protocols to realize them. In this paper, we assume special types of applications in which the instances of each data item can be partitioned and propose two consistency management protocols which are combinations of an escrow method and our previously proposed protocols. We also report simulation results to investigate the characteristics of these protocols in a mobile ad hoc network. From the simulation results, we confirm that the protocols proposed in this paper drastically improve data availability and reduce the traffic for data operations while maintaining the global consistency in the entire network.

  3. A Distributed Protocol for Detection of Packet Dropping Attack in Mobile Ad Hoc Networks

    Sen, Jaydip; Balamuralidhar, P; G., Harihara S; Reddy, Harish

    2011-01-01

    In multi-hop mobile ad hoc networks (MANETs),mobile nodes cooperate with each other without using any infrastructure such as access points or base stations. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of clear lines of defense. Among the various attacks to which MANETs are vulnerable, malicious packet dropping attack is very common where a malicious node can partially degrade or completely disrupt communication in the network by consistently dropping packets. In this paper, a mechanism for detection of packet dropping attack is presented based on cooperative participation of the nodes in a MANET. The redundancy of routing information in an ad hoc network is utilized to make the scheme robust so that it works effectively even in presence of transient network partitioning and Byzantine failure of nodes. The proposed scheme is fully cooperative an...

  4. Survey on Simulation for Mobile Ad-Hoc Communication for Disaster Scenarios

    Erika Rosas; Nicolas Hidalgo; Veronica Gil-Costa; Carolina Bonacic; Mauricio Marin; Hermes Senger; Luciana Arantes; Cesar Marcondes; Olivier Marin

    2016-01-01

    Mobile ad-hoc communication is a demonstrated solution to mitigate the impact of infrastructure failures during large-scale disasters. A very complex issue in this domain is the design validation of software applications that support decision-making and communication during natural disasters. Such disasters are irreproducible, highly unpredictable, and impossible to scale down, and thus extensive assessments cannot be led in situ. In this context, simulation constitutes the best approach towards the testing of software solutions for natural disaster responses. The present survey reviews mobility models, ad-hoc network architectures, routing protocols and network simulators. Our aim is to provide guidelines for software developers with regards to the performance evaluation of their applications by means of simulation.

  5. An energy efficient adaptive HELLO algorithm for mobile ad hoc networks

    He, Danping; Mitton, Nathalie; Simplot-Ry, David

    2013-01-01

    International audience HELLO protocol or neighborhood discovery is essential in wireless ad hoc networks. It makes the rules for nodes to claim their existence/aliveness. In the presence of node mobility, no x optimal HELLO frequency and optimal transmission range exist to maintain accurate neighborhood tables while reducing the energy consumption and bandwidth occupation. Thus a Turnover based Frequency and transmission Power Adaptation algorithm (TFPA) is presented in this paper. The met...

  6. Surrogate-Assisted Optimisation of Composite Applications in Mobile Ad hoc Networks

    Efstathiou, Dionysios; Mcburney, Peter; Zschaler, Steffen; Bourcier, Johann

    2014-01-01

    Infrastructure-less mobile ad hoc networks enable the development of collaborative pervasive applications. Within such dynamic networks, collaboration between devices can be realised through service-orientation by abstracting device resources as services. Recently, a framework for QoS-aware service composition has been introduced which takes into account a spectrum of orchestration patterns, and enables compositions of a better QoS than traditional centralised orchestration approaches. In thi...

  7. Virtual closed networks: A secure approach to autonomous mobile ad hoc networks

    Darren P Smith; Wetherall, Jodie; Adekunle, Andrew

    2015-01-01

    The increasing autonomy of Mobile Ad Hoc Networks (MANETs) has enabled a great many large-scale unguided missions, such as agricultural planning, conservation and similar surveying tasks. Commercial and military institutions have expressed great interest in such ventures; raising the question of security as the application of such systems in potentially hostile environments becomes a desired function of such networks. Preventing theft, disruption or destruction of such MANETs through cyber-at...

  8. Analysis of Fuzzy Logic Based Intrusion Detection Systems in Mobile Ad Hoc Networks

    Chaudhary, A.; V. N. Tiwari; Kumar, A

    2014-01-01

    Due to the advancement in wireless technologies, many of new paradigms have opened for communications. Among these technologies, mobile ad hoc networks play a prominent role for providing communication in many areas because of its independent nature of predefined infrastructure. But in terms of security, these networks are more vulnerable than the conventional networks because firewall and gateway based security mechanisms cannot be applied on it. That’s why intrusion detection systems are us...

  9. A Review of routing protocols for mobile cognitive radio ad hoc networks

    Selvakanmani, S.; Sumathi, M.

    2012-01-01

    Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The basic idea of cognitive radio networks is that the unlicensed devices (cognitive radio users or secondary users) need to vacate the spectrum band once the licensed device (p...

  10. OVERVIEW AND LITERATURE SURVEY ON ROUTING PROTOCOLS FOR MOBILE COGNITIVE RADIO AD HOC NETWORKS

    Selvakanmani, S.; Sumathi, Dr. M.

    2012-01-01

    Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The basic idea of cognitive radio networks is that the unlicensed devices (cognitive radio users or secondary users) need to vacate the spectrum band once the lic...

  11. Building hierarchical public key infrastructures in mobile ad-hoc networks

    Satizábal Echavarría, Isabel Cristina; Forné Muñoz, Jorge; Hernández Serrano, Juan; Pegueroles Vallés, Josep R.

    2006-01-01

    Dynamism of mobile ad-hoc networks implies changing trust relationships among their nodes that can be established using peer-to-peer PKIs. Here, certification paths can be built although part of the infrastructure is temporarily unreachable because there can be multiple paths between two entities but certification path discovery is difficult since all the options do not lead to the target entity. On the contrary, in hierarchical PKIs, there is only one path between two entities and certificat...

  12. Cluster Based Node Misbehaviour Detection, Isolation and Authentication Using Threshold Cryptography in Mobile Ad Hoc Networks

    R. Murugan; Shanmugam, A.

    2012-01-01

    In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resultingin damage of other nodes. In order to establish secure communication with the group members ofa network, use of a shared group key for confidentiality and authentication is required. Distributingthe shares of secret group key to the group members securely is another challenging task inMANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authenticationscheme using threshold cryp...

  13. Cluster Based Misbehaviour Detection and Authentication Using Threshold Cryptography in Mobile Ad Hoc Networks

    R. Murugan; Shanmugam, A.

    2012-01-01

    In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold...

  14. A Combined Solution for Routing and Medium Access Control Layer Attacks in Mobile Ad Hoc Networks

    R. Murugan; Shanmugam, A.

    2010-01-01

    Problem statement: In Mobile Ad hoc Network (MANET), both the routing layer and the Medium Access Control (MAC) layer are vulnerable to several attacks. There are very few techniques to detect and isolate the attacks of both these layers simultaneously. In this study, we developed a combined solution for routing and MAC layer attacks. Approach: Our approach, makes use of three techniques simultaneously which consists of a cumulative frequency based detection technique for&...

  15. RISM -- Reputation Based Intrusion Detection System for Mobile Ad hoc Networks

    Trivedi, Animesh Kr; Kapoor, Rishi; Arora, Rajan; Sanyal, Sudip; Sanyal, Sugata

    2013-01-01

    This paper proposes a combination of an Intrusion Detection System with a routing protocol to strengthen the defense of a Mobile Ad hoc Network. Our system is Socially Inspired, since we use the new paradigm of Reputation inherited from human behavior. The proposed IDS also has a unique characteristic of being Semi-distributed, since it neither distributes its Observation results globally nor keeps them entirely locally; however, managing to communicate this vital information without accretio...

  16. Secure and Usable Out-Of-Band Channels for Ad Hoc Mobile Device Interactions

    Kainda, Ronald; Flechais, Ivan; Roscoe, A. W.

    2010-01-01

    Protocols for bootstrapping security in ad hoc mobile device interactions rely on users' ability to perform specific tasks such as transferring or comparing fingerprints of information between devices. The size of fingerprints depends on the level of technical security required by a given application but, at the same time, is limited by users' inability to deal with large amounts of data with high levels of accuracy. Large fingerprints provide high technical security but potentially reduce us...

  17. A Survey of TCP Reno, New Reno and Sack Over Mobile Ad-Hoc Network

    Md Nazmul Islam Khan; Rashed Ahmed; Md. Tariq Aziz

    2012-01-01

    Transmission Control Protocol (TCP) is often preferred to be implemented at the transport layer of a Mobile Ad-hoc Network (MANET) because of its wide range of applications, which enjoys the advantage of reliable data transmission in the Internet. However, because of some unique characteristics of MANET, TCP cannot offer reliable services while using e-mail, internet search and file transmission insuch a network. The research investigates how well the different versions of TCP respond to var...

  18. Design of a Smart Antenna for Mobile Ad Hoc Network Applications

    Marco Di Filippo

    2015-01-01

    Full Text Available Among the mobile ad hoc networks appealing characteristics there are network reconfigurability and flexibility. In this context a smart antenna capable of self-configuring multiple high-directivity beams provides a major advantage in terms of power saving, increased range, and spatial reuse of channels. In this paper a smart antenna made of a cylindrical array of patches suitable for MANETs is presented.

  19. New horizons in mobile and wireless communications, v.4 ad hoc networks and pans

    Prasad, Ramjee

    2009-01-01

    Based on cutting-edge research projects in the field, this book (part of a comprehensive 4-volume series) provides the latest details and covers the most impactful aspects of mobile, wireless, and broadband communications development. These books present key systems and enabling technologies in a clear and accessible manner, offering you a detailed roadmap the future evolution of next generation communications. Other volumes cover Networks, Services and Applications; Reconfigurability; and Ad Hoc Networks.

  20. AUTHENTICATION ARCHITECTURE USING THRESHOLD CRYPTOGRAPHY IN KERBEROS FOR MOBILE AD HOC NETWORKS

    Hadj Gharib; Kamel Belloulata

    2014-01-01

    The use of wireless technologies is gradually increasing and risks related to the use of these technologies are considerable. Due to their dynamically changing topology and open environment without a centralized policy control of a traditional network, a mobile ad hoc network (MANET) is vulnerable to the presence of malicious nodes and attacks. The ideal solution to overcome a myriad of security concerns in MANET’s is the use of reliable authentication architecture. In this paper we propose a...

  1. InstantSocial : social networking in mobile ad-hoc environments

    Halvorsen, Henrik

    2009-01-01

    This report covers the research, design and prototype implementation of a social application for mobile ad-hoc networks, InstantSocial. The main goals of this project has been to look at this exciting field and examine how the European scientific collaborative project MUSIC can be used to develop such an application. The project has been conducted using a Design Science approach. First the field of interest, existing similar applications and technology was examined to get a good view of the ...

  2. Predicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networks

    Pervis Fly; Natarajan Meghanathan

    2010-01-01

    We propose an algorithm to determine stable connecteddominating sets (CDS), based on the predicted link expiration time(LET), for mobile ad hoc networks (MANETs). The proposed LETbasedCDS algorithm is the first such algorithm that constructs a CDSbased on edge weights represented by predicted link expiration time,rather the traditional approach of using node weights like the wellknownmaximum density-based CDS (MaxD-CDS) algorithm. Theconstruction of the LET-CDS starts with the inclusion of th...

  3. Using a history-based approach to predict topology control information in mobile ad hoc networks

    Millán, Pere; Molina Clemente, Carlos Maria; Meseguer Pallarès, Roc; Ochoa, Sergio; Santos, Rodrigo

    2014-01-01

    Several social computing participation strategies, such as crowdsensing and crowdsourcing, use mobile ad hoc or opportunistic networks to support the users activities. The unreliability and dynamism of these communication links make routing protocols a key component to achieve efficient and reliable data communication in physical environments. Often these routing capabilities come at expenses of flooding the network with a huge amount of topology control information (TCI), which can overload ...

  4. A New Strategy to Improve Proactive Route Updates in Mobile Ad Hoc Networks

    Abolhasan Mehran; Wysocki Tadeusz; Lipman Justin

    2005-01-01

    This paper presents two new route update strategies for performing proactive route discovery in mobile ad hoc networks (MANETs). The first strategy is referred to as minimum displacement update routing (MDUR). In this strategy, the rate at which route updates are sent into the network is controlled by how often a node changes its location by a required distance. The second strategy is called minimum topology change update (MTCU). In this strategy, the route updating rate is proportional to t...

  5. A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks

    Sasson, Yoav; Cavin, David; Schiper, André

    2005-01-01

    In this paper we propose a novel location management scheme tailored for multicasting in Mobile Ad-hoc Networks (MANETs). We furthermore propose AMDLM, a location-based multicast algorithm relying on the location management service. Such an approach avoids fragile data structures such as trees or DAGs to manage multicast groups, without reverting to more reliable, yet overhead-prone mesh-based algorithms. AMDLM additionally enables us to derive analytical bounds due to its location-base...

  6. URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks

    Luo, Haiyun; Kong, Jiejun; Zerfos, Petros; Lu, Songwu; Zhang, Lixia

    2004-01-01

    Restricting network access of routing and packet forwarding to well-behaving nodes and denying access from misbehaving nodes are critical for the proper functioning of a mobile ad-hoc network where cooperation among all networking nodes is usually assumed. However, the lack of a network infrastructure, the dynamics of the network topology and node membership, and the potential attacks from inside the network by malicious and/or noncooperative selfish nodes make the conventional network access...

  7. Intrusion Detection System for Mobile Ad - Hoc Network Using Cluster-Based Approach

    Nisha Dang

    2012-06-01

    Full Text Available Today Mobile Ad-hoc Networks have wide spread use in normal as well as mission critical applications. Mobile ad hoc networks are more likely to be attacked due to lack of infrastructure and no central management. To secure Manets many traditional security solutions like encryption are used but not find to be promising. Intrusion detection system is one of the technologies that provide some goodsecurity solutions. IDS provide monitoring and auditing capabilities to detect any abnormality in security of the system. IDS can be used with clustering algorithms to protect entire cluster from malicious code. Existing clustering algorithms have a drawback of consuming more power and they are associated with routes. The routeestablishment and route renewal affects the clusters and asa consequence, the processing and traffic overhead increases due to instability of clusters. The ad hoc networks are battery and power constraint, and therefore IDS cannot be run on all the nodes. A trusted monitoring node can be deployed to detect and respond against intrusions in time. The proposed simplified clustering scheme has been used to detect intrusions, resulting in high detection rates and low processing and memory overhead irrespective of the routes, connections, traffic types and mobility of nodes inthe network.

  8. Cross-Layer Service Discovery Mechanism for OLSRv2 Mobile Ad Hoc Networks

    M. Isabel Vara

    2015-07-01

    Full Text Available Service discovery plays an important role in mobile ad hoc networks (MANETs. The lack of central infrastructure, limited resources and high mobility make service discovery a challenging issue for this kind of network. This article proposes a new service discovery mechanism for discovering and advertising services integrated into the Optimized Link State Routing Protocol Version 2 (OLSRv2. In previous studies, we demonstrated the validity of a similar service discovery mechanism integrated into the previous version of OLSR (OLSRv1. In order to advertise services, we have added a new type-length-value structure (TLV to the OLSRv2 protocol, called service discovery message (SDM, according to the Generalized MANET Packet/Message Format defined in Request For Comments (RFC 5444. Each node in the ad hoc network only advertises its own services. The advertisement frequency is a user-configurable parameter, so that it can be modified depending on the user requirements. Each node maintains two service tables, one to store information about its own services and another one to store information about the services it discovers in the network. We present simulation results, that compare our service discovery integrated into OLSRv2 with the one defined for OLSRv1 and with the integration of service discovery in Ad hoc On-demand Distance Vector (AODV protocol, in terms of service discovery ratio, service latency and network overhead.

  9. Analysis of AODV and DSR in Presence of Wormhole Attack in Mobile Ad-hoc Network

    VIVEK SHARMA,

    2010-11-01

    Full Text Available An ad hoc network is a collection of mobile nodes that dynamically form a temporary network. It operates without the use of existing infrastructure. As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe security attack in ad hocnetworks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits at one location in the network, tunnels them (possiblyselectively to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many ad hoc network routing protocols and locationbased wireless security systems. This paper analyses the performance of AODV and DSR routing protocols with and without wormhole attack. This would be a great help for the people conducting research on real world problems in MANET security.

  10. A New Proposal for Route Finding in Mobile AdHoc Networks

    H.Vignesh Ramamoorthy

    2013-06-01

    Full Text Available Mobile Ad hoc Network (MANET is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers (and associated hosts connected by wireless links – the union of which forms an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily, thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. There are various routing protocols available for MANETs. The most popular ones are DSR, AODV and DSDV. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV and the Ad hoc On- Demand Distance Vector routing (AODV. Generally, the routing algorithms can be classified into Reactive and Proactive. A Hybrid algorithm combines the basic properties of reactive and proactive into one. The proposed approach is a novel routing pattern based on Ant Colony Optimization and Multi Agent System. This pattern integrates two different algorithms together and helps to get optimum routes for a particular radio range. The approaches used here are Ant Colony Optimization (ACO and Multi Agent System (MAS. The proposed integrated approach has a relatively short route establishment time while using a small number of control messages which makes it a scalable routing approach. The overhead of this routing approach will be inexpensive and also will enable to have an alternate route during route failure. This proposed route finding scheme in order to provide high connectivity of nodes, will minimize the route discovery latency and the end-to-end delay.

  11. Mobile Agent as an Approach to Improve QoS in Vehicular Ad Hoc Network

    Kumar, Rakesh

    2011-01-01

    Vehicular traffic is a foremost problem in modern cities. Huge amount of time and resources are wasted while traveling due to traffic congestion. With the introduction of sophisticated traffic management systems, such as those incorporating dynamic traffic assignments, more stringent demands are being placed upon the available real time traffic data. In this paper we have proposed mobile agent as a mechanism to handle the traffic problem on road. Mobile software agents can be used to provide the better QoS (Quality of Service) in vehicular ad hoc network to improve the safety application and driver comfort.

  12. ECDSA - Performance improvements of intrusion detection in Mobile Ad-hoc Networks

    Vijayakumar R

    2015-10-01

    Full Text Available mobile nodes without an underlying infrastructure. In this network, the occurrences of misbehavior nodes are a main problem that degrades the network performance. In previous technique watchdog is used to detect nodes misbehaviors in the mobile ad-hoc network, but it contains some of potential issues. To avoid these issues we propose a novel algorithm named as Elliptic Curve Digital Signature Algorithm (ECDSA particularly designed for increases the security in network.

  13. Link Stability and Node Energy Conscious Local Route-Repair Scheme for Mobile Ad Hoc Networks

    Anuradha Banerjee; Paramartha Dutta

    2010-01-01

    Problem statement: A mobile ad hoc network is a self-configuring network of mobile nodes connected by wireless links. As the nodes are free to move randomly, topology of the network may change rapidly and unpredictably. As a result, intermediate nodes in the communication routes tend to lose connection with each other during the communication process. In order to repair a broken link, an end-to-end (from source to destination) route discovery is typically performed to establish a new route fo...

  14. Improving VANETs Connectivity with a Totally Ad Hoc Living Mobile Backbone

    Joilson Alves Junior

    2015-01-01

    Full Text Available The vehicular ad hoc network (VANET for intelligent transportation systems is an emerging concept to improve transportation security, reliability, and management. The network behavior can be totally different in topological aspects because of the mobility of vehicular nodes. The topology can be fully connected when the flow of vehicles is high and may have low connectivity or be invalid when the flow of vehicles is low or unbalanced. In big cities, the metropolitan buses that travel on exclusive lanes may be used to set up a metropolitan vehicular data network (backbone, raising the connectivity among the vehicles. Therefore, this paper proposes the implementation of a living mobile backbone, totally ad hoc (MOB-NET, which will provide infrastructure and raise the network connectivity. In order to show the viability of MOB-NET, statistical analyses were made with real data of express buses that travel through exclusive lanes, besides evaluations through simulations and analytic models. The statistic, analytic, and simulation results prove that the buses that travel through exclusive lanes can be used to build a communication network totally ad hoc and provide connectivity in more than 99% of the time, besides raising the delivery rate up to 95%.

  15. Key Management and Authentication in Ad Hoc Network based on Mobile Agent

    Yi Zhang

    2009-08-01

    Full Text Available Key management and authentication is important to security of Mobile Ad Hoc network (MANET. Based on the (t, n threshold cryptography, this paper introduced mobile agents to exchange private key and network topological information with nodes in the network. This method avoids a centralized certification authority to distribute the public keys and the certificates, thus enhances security. Carrying private key and some state variables, mobile agents navigate in the network according to visitsbalance policy, namely, node with the least visits would be first visited by mobile agent. Any t nodes in the network can cooperate to perform an authentication upon a new node wanting to join the network. Experimental results show that the mobile agent performs very well for improving the success ratio of authentication and enhance security while reducing the communication overhead and resource consumption.

  16. Packet Transmission Analysis in Vehicular Ad Hoc Networks using Revival Mobility Model

    K.Prasanth

    2010-01-01

    Full Text Available Vehicular Ad-hoc Networks (VANETs have been recently attracting an increasing attention from both research and industry communities. VANETs are currently deployed on a large scale, research in this area is mostly simulation based. Mobility models or the movement patterns of nodes communicating wirelessly, play a vital role in determining the protocol performance in VANET. We still have a limited understanding of the required level of mobility details for modeling and simulating VANETs. Thus, it is essential to study and analyze various mobility models and their effect on VANET protocols. In this paper, we examine d different mobility models proposed in the recent research literature. We proposed Revival Mobility Model (RMM and evaluate its effect on packet delivery in VANETs by ns-2 simulations.

  17. Adaptive and Secure Routing Protocol for Emergency Mobile Ad Hoc Networks

    Panaousis, Emmanouil A; Millar, Grant P; Politis, Christos; 10.5121/ijwmn.2010.2205

    2010-01-01

    The nature of Mobile Ad hoc NETworks (MANETs) makes them suitable to be utilized in the context of an extreme emergency for all involved rescue teams. We use the term emergency MANETs (eMANETs) in order to describe next generation IP-based networks, which are deployed in emergency cases such as forest fires and terrorist attacks. The main goal within the realm of eMANETs is to provide emergency workers with intelligent devices such as smart phones and PDAs. This technology allows communication "islets" to be established between the members of the same or different emergency teams (policemen, firemen, paramedics). In this article, we discuss an adaptive and secure routing protocol developed for the purposes of eMANETs. We evaluate the performance of the protocol by comparing it with other widely used routing protocols for MANETs. We finally show that the overhead introduced due to security considerations is affordable to support secure ad-hoc communications among lightweight devices.

  18. A Encryption Based Dynamic and Secure Routing Protocol for Mobile Ad Hoc Network

    Pankaj Kumar Sehgal

    2009-03-01

    Full Text Available Significant progress has been made for making mobile ad hoc networks secure and dynamic. The unique characteristics like infrastructure-free and absence of any centralized authority make these networks more vulnerable to security attacks. Due to the ever-increasing security threats, there is a need to develop algorithms and protocols for a secured ad hoc network infrastructure. This paper presents a secure routing protocol, called EDSR (Encrypted Dynamic Source Routing. EDSR prevents attackers or malicious nodes from tampering with communication process and also prevents a large number of types of Denial-of-Service attacks. In addition, EDSR is efficient, using only efficient symmetric cryptographic primitives. We have developed a new program in c++ for simulation setup.

  19. Secure, Redundant, and Fully Distributed Key Management Scheme for Mobile Ad Hoc Networks: An Analysis

    Joshi Deepti

    2005-01-01

    Full Text Available Security poses a major challenge in ad hoc networks today due to the lack of fixed or organizational infrastructure. This paper proposes a modification to the existing "fully distributed certificate authority" scheme for ad hoc networks. In the proposed modification, redundancy is introduced by allocating more than one share to each node in order to increase the probability of creating the certificate for a node in a highly mobile network. A probabilistic analysis is carried out to analyze the trade-offs between the ease of certificate creation and the security provided by the proposed scheme. The analysis carried out from the intruder's perspective suggests that in the worst-case scenario, the intruder is just "one node" away from a legitimate node in compromising the certificate. The analysis also outlines the parameter selection criteria for a legitimate node to maintain a margin of advantage over an intruder in creating the certificate.

  20. Security Scheme for Distributed DoS in Mobile Ad Hoc Networks

    Sanyal, Sugata; Gogri, Rajat; Rathod, Punit; Dedhia, Zalak; Mody, Nirali

    2010-01-01

    In Mobile Ad Hoc Networks (MANET), various types of Denial of Service Attacks (DoS) are possible because of the inherent limitations of its routing protocols. Considering the Ad Hoc On Demand Vector (AODV) routing protocol as the base protocol it is possible to find a suitable solution to over-come the attack of initiating / forwarding fake Route Requests (RREQs) that lead to hogging of network resources and hence denial of service to genuine nodes. In this paper, a proactive scheme is proposed that could prevent a specific kind of DoS attack and identify the misbehaving node. Since the proposed scheme is distributed in nature it has the capability to prevent Distributed DoS (DDoS) as well. The performance of the proposed algorithm in a series of simulations reveal that the proposed scheme provides a better solution than existing approaches with no extra overhead.

  1. Enhanced Secure Trusted AODV (ESTA Protocol to Mitigate Blackhole Attack in Mobile Ad Hoc Networks

    Dilraj Singh

    2015-09-01

    Full Text Available The self-organizing nature of the Mobile Ad hoc Networks (MANETs provide a communication channel anywhere, anytime without any pre-existing network infrastructure. However, it is exposed to various vulnerabilities that may be exploited by the malicious nodes. One such malicious behavior is introduced by blackhole nodes, which can be easily introduced in the network and, in turn, such nodes try to crumble the working of the network by dropping the maximum data under transmission. In this paper, a new protocol is proposed which is based on the widely used Ad hoc On-Demand Distance Vector (AODV protocol, Enhanced Secure Trusted AODV (ESTA, which makes use of multiple paths along with use of trust and asymmetric cryptography to ensure data security. The results, based on NS-3 simulation, reveal that the proposed protocol is effectively able to counter the blackhole nodes in three different scenarios.

  2. Adaptive and Secure Routing Protocol for Emergency Mobile Ad Hoc Networks

    Emmanouil A. Panaousis

    2010-05-01

    Full Text Available The nature of Mobile Ad hoc NETworks (MANETs makes them suitable to be utilized in the context of anextreme emergency for all involved rescue teams. We use the term emergency MANETs (eMANETs inorder to describe next generation IP-based networks, which are deployed in emergency cases such asforest fires and terrorist attacks. The main goal within the realm of eMANETs is to provide emergencyworkers with intelligent devices such as smart phones and PDAs. This technology allows communication”islets” to be established between the members of the same or different emergency teams (policemen,firemen, paramedics. In this article, we discuss an adaptive and secure routing protocol developed forthe purposes of eMANETs. We evaluate the performance of the protocol by comparing it with otherwidely used routing protocols for MANETs. We finally show that the overhead introduced due to securityconsiderations is affordable to support secure ad-hoc communications among lightweight devices.

  3. Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance

    Jean-Daniel Medjo Me Biomo; Thomas Kunz; Marc St-Hilaire; Yifeng Zhou

    2015-01-01

    An unmanned aerial ad hoc network (UAANET) is a special type of mobile ad hoc network (MANET). For these networks, researchers rely mostly on simulations to evaluate their proposed networking protocols. Hence, it is of great importance that the simulation environment of a UAANET replicates as much as possible the reality of UAVs. One major component of that environment is the movement pattern of the UAVs. This means that the mobility model used in simulations has to be thoroughly understood ...

  4. QoS Routing and Performance Evaluation for Mobile Ad Hoc Networks using OLSR Protocol

    Amnai, Mohamed; Abouchabaka, Jaafar

    2011-01-01

    Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure. As the real-time applications used in today's wireless network grow, we need some schemes to provide more suitable service for them. We know that most of actual schemes do not perform well on traffic which is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio) of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4) and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases. Experimentally, we considered the three mobility models as follows Random Waypoint, Random Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change according to the model and the used traffics.

  5. Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach

    Gavalas, Damianos; Konstantopoulos, Charalampos; Mamalis, Basilis

    2011-01-01

    Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency issues. Also, unlike existing active clustering methods, our algorithm relieves the network from the unnecessary burden of control messages broadcasting, especially for relatively static network topologies. This is achieved through adapting broadcast period according to mobile nodes mobility pattern. The efficiency, scalability and competence of our algorithm against alternative approaches have been demonstrated through simulation results.

  6. Optimal Power Control for Concurrent Transmissions of Location-aware Mobile Cognitive Radio Ad Hoc Networks

    Song, Yi

    2011-01-01

    In a cognitive radio (CR) network, CR users intend to operate over the same spectrum band licensed to legacy networks. A tradeoff exists between protecting the communications in legacy networks and maximizing the throughput of CR transmissions, especially when CR links are unstable due to the mobility of CR users. Because of the non-zero probability of false detection and implementation complexity of spectrum sensing, in this paper, we investigate a sensing-free spectrum sharing scenario for mobile CR ad hoc networks to improve the frequency reuse by incorporating the location awareness capability in CR networks. We propose an optimal power control algorithm for the CR transmitter to maximize the concurrent transmission region of CR users especially in mobile scenarios. Under the proposed power control algorithm, the mobile CR network achieves maximized throughput without causing harmful interference to primary users in the legacy network. Simulation results show that the proposed optimal power control algori...

  7. A NOVEL CHARGING AND ACCOUNTING SCHEME IN MOBILE AD-HOC NETWORKS

    Inna Kofman

    2016-03-01

    Full Text Available 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.

  8. Power Control in Reactive Routing Protocol for Mobile Ad Hoc Network

    Maher HENI

    2012-05-01

    Full Text Available The aim of this work is to change the routing strategy of AODV protocol (Ad hoc On Demand Vector inorder to improve the energy consumption in mobile ad hoc networks (MANET. The purpose is tominimize the regular period of HELLO messages generated by the AODV protocol used for the research,development and maintenance of routes. This information is useful to have an idea about battery powerlevels of different network hosts. After storing this information, the node elect the shortest path followingthe classical model used this information to elect safest path (make a compromise in terms of energy.Transmitter node does not select another node as its battery will be exhausted soon.Any node of the network can have the same information’s about the neighborhoods as well as otherinformation about the energy level of the different terminal to avoid routing using a link that will be lostdue to an exhausted battery of a node in this link.Analytical study and simulations by Jist/SWANS have been conducted to note that no divergencerelatively to the classical AODV, a node can have this type of information that improves the energyefficiency in ad hoc networks.

  9. Multi-Level Secret Sharing Scheme for Mobile Ad-Hoc Networks

    P.V. Siva Kumar

    2015-09-01

    Full Text Available In this paper, we are concerned with security for Mobile Ad-hoc Networks (MANETs using threshold cryptography. When we are applying cryptography to MANETs, key management schemes must provide the cryptographic keys in a secure manner and storing the secret information within the nodes, thwarting the activities of malicious nodes inside a network and is how to distribute the role of the trusted authority among the nodes. Mobile ad hoc networks (MANETs represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, ad-hoc network topologies. Secret Sharing Scheme is a method which distributes shares of a secret to a set of participants in such a way that only authorized subset of participants can uniquely reconstruct the secret and an unauthorized subset can get no information about the secret. In this paper we present a new multilevel secret sharing scheme by extending the Shamir’s to the case that the global threshold is strictly greater than the sum of the compartment thresholds and we indicate how to use the threshold secret sharing schemes based on polynomial interpolation. These schemes are based on one-way functions (Discrete Logarithm which are computationally perfect. In the first scheme the number of public shares grows exponentially with the number of participants. To overcome this disadvantage we proposed two efficient schemes in which the number of public shares ate linearly proportional to the number of participants. Both these schemes are similar except that in the third scheme the identities of the participants are also hidden. In this we also addressed the problem of malicious shareholders that aim to corrupt a secret sharing scheme. To prevent such a threat, legitimate shareholders must detect any modification of shares that has not been issued by a node responsible for the sharing of secret S.

  10. A HYBRID APPROACH FOR NODE CO-OPERATION BASED CLUSTERING IN MOBILE AD HOC NETWORKS

    C. Sathiyakumar

    2013-01-01

    Full Text Available A Mobile Ad-Hoc Network (MANET is termed as a set of wireless nodes which could be built with infrastructure less environment where network services are afforded by the nodes themselves. In such a situation, if a node refuses to co-operate with other nodes, then it will lead to a considerable diminution in throughput and the network operation decreases to low optimum value. Mobile Ad hoc Networks (MANETs rely on the collaboration of nodes for packet routing ahead. Nevertheless, much of the existing work in MANETs imagines that mobile nodes (probably possessed by selfish users will pursue prearranged protocols without variation. Therefore, implementing the co-operation between the nodes turn out to be an significant issue. The previous work described a secured key model for ad hoc network with efficient node clustering based on reputation and ranking model. But the downside is that the co-operation with the nodes is less results in a communication error. To enhance the security in MANET, in this work, we present a hybrid approach, build a node co-operation among the nodes in MANET by evaluating the weightage of cooperativeness of each node in MANET. With the estimation of normal co-operative nodes, nodes are restructured on its own (self. Then clustering is made with the reorganized nodes to form a secured communication among the nodes in the MANET environment. The Simulation of the proposed Hybrid Approach for Node Cooperation based Clustering (HANCC work is done for varying topology, node size, attack type and intensity with different pause time settings and the performance evaluations are carried over in terms of node cooperativeness, clustering efficiency, communication overhead and compared with an existing secured key model. Compared to an existing secured key model, the proposed HANCC performance is 80-90% high.

  11. Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks

    Hüttel, Hans; Kühnrich, Morten; Godskesen, Jens Christian

    We introduce a novel process calculus called DBSPI (distributed broadcast SPI-calculus) which models mobile ad hoc networks (MANET). The calculus is a cryptographic broadcast calculus with locations and migration. Communication and migration are limited to neighborhoods. Neighborhood definitions...... are explicitly part of the syntax allowing dynamic extension using bound identifiers. In this semantic setting we study authentication of agents in MANET protocols. A safety property dealing with authentication correspondence assertions is defined. Later a dependent type and effect system is given and...

  12. Security Challenges Related to Routing in Mobile Ad hoc Networks (MANET) and Proposed Solutions

    J. Rajeshwar; Dr G NARSIMHA

    2012-01-01

    A freely roaming nodes forming as a group of network for effective communication is called Mobile Ad hoc Networks (MANET). In MANET nodes have the liberty of moving around the network with no defensive boundaries and often nodes join and leave the network as per their need due to this nature MANET’s are insecure. In this insecure environment Routing is a critical aspect which must be done properly for secure and reliable delivery of a data and communication. In order to have a secure system w...

  13. Hardware in Loop Simulation for Emergency Communication Mobile Ad Hoc Network

    YANG Jie; AN Jian-ping; LIU Heng

    2007-01-01

    For the research of mobile Ad hoc network (MANET), hardware in the loop simulation (HILS) is introduced to improve simulation fidelity. The architectures and frameworks of HILS system are discussed. Based on HILS and QualNet network simulator, two kinds of simulation frameworks for MANET multicast emergency communicati on network are proposed. By running simulation under this configuration and doing experiments with on-demand multicast routing protocol (ODMRP), unicast and multicast functions of this protocol are tested. Research results indicate that HILS method can effectively reduce the difficulty of system modeling and improve precision of simulation, and can further accelerate transition from design to system deployment.

  14. An Assessment of Worm Hole attack over Mobile Ad-Hoc Network as serious threats

    Vikas Kumar Upadhyay

    2013-07-01

    Full Text Available Now these day Mobile Ad hoc networks vulnerable from number of security threats like black hole attack, DOS attack, Byzantine attack and wormhole attack. Wormhole attack is one of most important attack and having great attention in recent year. Wormhole attack, demonstrate a illusion over the network that show two far away node to be an neighbor node and attracted all traffic by presenting an greediness of shortest path over the network. This paper presents a bird eye over different existing wormhole deduction mechanism and their problem.

  15. AN ENHANCEMENT SCHEME OF TCP PROTOCOL IN MOBILE AD HOC NETWORKS: MME-TCP

    Kai Caihong; Yu Nenghai; Chen Yuzhong

    2007-01-01

    Transmission Control Protocol (TCP) optimization in Mobile Ad hoc NETworks (MANETs) is a challenging issue because of some unique characteristics of MANETs. In this paper,a new end-to-end mechanism based on multiple metrics measurement is proposed to improve TCP performance in MANETs. Multi-metric Measurement based Enhancement of TCP (MME-TCP)designs the metrics and the identification algorithm according to the characteristics of MANETs and the experiment results. Furthermore, these metrics are measured at the sender node to reduce the overhead of control information over networks. Simulation results show that MME-TCP mechanism achieves a significant performance improvement over standard TCP in MANETs.

  16. A QoS Aware Service Composition Protocol in Mobile Ad Hoc Networks

    HAN Song-qiao; ZHANG Shen-sheng; ZHANG Yong; CAO Jian

    2008-01-01

    A novel decentralized service composition protocol was presented based on quality of service (QoS) for mobile ad hoc networks (MANETs). A service composition in MANETs is considered as a service path discovery in a service network. Based on the concept of source routing, the protocol integrates route discovery, service discovery and service composition and utilizes a constrained flooding approach to discover the optimal service path. A service path maintenance mechanism was exploited to recover broken service paths. Simulation experiments demonstrate that the proposed protocol outperforms existing service composition protocols.

  17. QDSR: QoS-aware Dynamic Source Routing Protocol for Mobile Ad Hoc Network

    SHIMinghong; YAOYinxiong; BAIYingcai

    2004-01-01

    QoS routing in wireless ad hoc networks faces many technical challenges due to time varying link and random mobility of nodes in these dynamic networks.In this paper, we design a QoS-aware dynamic source routing protocol (QDSR), based on DSR . QDSR uses minimum cost as the constraint, modifies route discovery, route reply and route maintenance mechanisms in DSR, adds the capability of path testing and initial resource reservation.The results of robustness and stability and performances imulations demonstrate that it suits the fluctuation of dynamic environment very well.

  18. Reduction of Greedy Forwarding using Overlay Multicasting in Mobile Ad Hoc Networks

    G. Kiran Kumar#1, B.Vijaya Babu

    2013-05-01

    Full Text Available Mobile Ad-hoc Network (MANET is a self configuring network composed of mobile nodes without any fixed infrastructure. Group communications are important in Mobile Ad hoc Networks (MANET. Multicast is an efficient method for implementing group communications. But, it is big challenge to implement the well-organized and scalable multicast in MANET due to the difficulty in group membership scheme and multicast packet forwarding over a dynamic topology. EGMP uses a virtual-zone-based structure to implement scalable and efficient group membership scheme. A zone based bi-directional tree is constructed to achieve more efficient membership management and multicast delivery. The position information is used to guide the zone structure construction, multicast tree formation, and multicast packet forwarding, which efficiently reduce the overhead for route searching and tree structure maintenance. The main aim of this paper is to improve the performance of different multicasting approaching using Two-tier Overlay Multicast Architecture. Scalable overlay multicasting architecture approach to investigate the performance of Overlay multicast approach in Internet like environments based on realistic topologies. Overlay multicast architecture achieves close to optimal average resource utilization in such environments.

  19. A Novel Architecture for Intrusion Detection in Mobile Ad hoc Network

    Atul Patel

    2011-08-01

    Full Text Available Today’s wireless networks are vulnerable in many ways including illegal use, unauthorized access, denial of service attacks, eavesdropping so called war chalking. These problems are one of the main issues for wider uses of wireless network. On wired network intruder can access by wire but in wireless it has possibilities to access the computer anywhere in neighborhood. However, securing MANETs is highly challenging issue due to their inherent characteristics. Intrusion detection is an important security mechanism, but little effort has been directed towards efficient and effective architectures for Intrusion Detection System in the context of MANETs. We investigate existing Intrusion Detection Architecture design Issues, challenges and proposed a novel architecture based on a conceptual model for an IDS agent that lead to a secure collaboration environment integrating mobile ad hoc network and the wired backbone. In wireless/mobile ad hoc network, the limited power, weak computation capabilities of mobile nodes, and restricted bandwidth of the open media impede the establishment of a secure collaborative environment.

  20. A Novel Approach for Securing Mobile Ad Hoc Network with an Enhanced Trust Calculation Method

    Amit Chauhan

    2012-03-01

    Full Text Available A Mobile Adhoc Network is a group of wireless mobile computers in which nodes cooperate by forwarding packets for each other to allow them to communicate beyond direct wireless transmission range. Due to wide-ranging characteristics of the Ad Hoc Networks like decentralization, dynamic topology and neighbor based routing, it is always at a risk to internal as well as external attacks. In a mobile ad hoc network (MANET where security is a crucial issue, trust plays an important factor that could improve the number of successful data transmission process. Many solutions have been proposed by the reaearchers and currently being improved in this area. Most of them are designed to operate in specific particular situations, which may fail to work successfully in other scenarios. The aim of this present work is to emphasize on the use of trust concept to enhance the security by calculating proportion based trust in a global manner. The present work offers an alternate to improve the trustworthiness of the neighbourhood and secure the routing procedure. It helps in computing the trust in neighbours and selecting the most secure route from the available ones for the data transfer. In the proposed model, trust is not calculated for any particular situation instead, it is computed based on a summary of behaviour of the node for a specific amount of period.

  1. Performance Analysis of TORA & DSR Routing Protocols in Mobile Ad-hoc Networks

    D GEETHA

    2013-01-01

    Full Text Available Mobile ad hoc network (MANET is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. In this paper an attempt has been made to compare the performance of two prominent on demand reactive routing protocols for MANETs: Temporally Ordered Routing Algorithm (TORA, Dynamic Source Routing (DSR protocols. This subjected the protocols to identical loads and environmental conditions and evaluates their relative performance with respect to quantitative metrics; throughput, average delay, packet delivery ratio and routing load. From the detailed simulation results and analysis of presented, we use NS-2 simulator for simulation of DSR and TORA protocol and variation occurs in mobility of packets, time interval between the packets sent and packet size of packets sent in throughout the protocols.

  2. Performance optimisation through EPT-WBC in mobile ad hoc networks

    Agarwal, Ratish; Gupta, Roopam; Motwani, Mahesh

    2016-03-01

    Mobile ad hoc networks are self-organised, infrastructure-less networks in which each mobile host works as a router to provide connectivity within the network. Nodes out of reach to each other can communicate with the help of intermediate routers (nodes). Routing protocols are the rules which determine the way in which these routing activities are to be performed. In cluster-based architecture, some selected nodes (clusterheads) are identified to bear the extra burden of network activities like routing. Selection of clusterheads is a critical issue which significantly affects the performance of the network. This paper proposes an enhanced performance and trusted weight-based clustering approach in which a number of performance factors such as trust, load balancing, energy consumption, mobility and battery power are considered for the selection of clusterheads. Moreover, the performance of the proposed scheme is compared with other existing approaches to demonstrate the effectiveness of the work.

  3. Intrusion Detection In Mobile Ad Hoc Networks Using GA Based Feature Selection

    Nallusamy, R; Duraiswamy, K

    2009-01-01

    Mobile ad hoc networking (MANET) has become an exciting and important technology in recent years because of the rapid proliferation of wireless devices. MANETs are highly vulnerable to attacks due to the open medium, dynamically changing network topology and lack of centralized monitoring point. It is important to search new architecture and mechanisms to protect the wireless networks and mobile computing application. IDS analyze the network activities by means of audit data and use patterns of well-known attacks or normal profile to detect potential attacks. There are two methods to analyze: misuse detection and anomaly detection. Misuse detection is not effective against unknown attacks and therefore, anomaly detection method is used. In this approach, the audit data is collected from each mobile node after simulating the attack and compared with the normal behavior of the system. If there is any deviation from normal behavior then the event is considered as an attack. Some of the features of collected audi...

  4. Mobile Database Application in Ad Hoc Network%Ad Hoc网中的移动数据库应用

    范俊; 李晓宇

    2012-01-01

    As a result that the traditional mobile database model can not adapt to the actual situation of Ad Hoc network, this paper improves the traditional mobile database model with adding a local server as the agent to adapt to the situation of Ad Hoc network, forming the mobile database model which comprises mobile computer, local server and master server. Furthermore, two algorithms which are used to solve problems of transactions redoing and data synchronization between local server and master server are proposed, so that mobile computer can access database efficiently and correctly. Experimental results show that mobile database model can gain good stability.%传统的移动数据库模型应用到Ad Hoc网中,会带来通信代价增大等问题.为此,对传统的移动数据库模型进行改进,加入本地服务器作为中介,形成由移动主机、本地服务器和主服务器3类结点构成的移动数据库模型,并提出2个算法用来解决模型中本地服务器与主服务器上的数据同步和事务重做问题,从而使移动主机能够高效正确地访问数据库.实验结果证明,该移动数据库模型具有较好的稳定性.

  5. Performance Comparison of Secure Routing Protocols in Mobile Ad-Hoc Networks

    Ashwani Garg

    2012-08-01

    Full Text Available A mobile Ad-Hoc network (MANET is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Each node operates not only as an end system but, also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. A node can get compromised during the route discovery process. Attackers from inside or outside can easily exploit the network. Several secure routing protocols are proposed for MANETs by researchers. In this paper, an attempt has been made to compare the performance of two prominent secure routing protocols for MANETs: Secure Efficient Ad-Hoc Distance Vector Protocol i.e. SEAD (a proactive or table driven protocol and Ariadne (a reactive or on demand protocol.Compared to the proactive routing protocols, less control overhead is a distinct advantage of the reactive protocols. Thus, reactive routing protocols have better scalability than proactive routing protocols. However, when using reactive routing protocols, source nodes may suffer from long delays for route searching before they can forward data packets. Hence these protocols are not suitable for real-time applications. As per our findings the difference in the protocols mechanics leads to significant performance differentials for both of these protocols. The performance differentials are analyzed using varying simulation time. These simulations are carried out using the NS-2 network simulator. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.

  6. Link Stability and Node Energy Conscious Local Route-Repair Scheme for Mobile Ad Hoc Networks

    Anuradha Banerjee

    2010-01-01

    Full Text Available Problem statement: A mobile ad hoc network is a self-configuring network of mobile nodes connected by wireless links. As the nodes are free to move randomly, topology of the network may change rapidly and unpredictably. As a result, intermediate nodes in the communication routes tend to lose connection with each other during the communication process. In order to repair a broken link, an end-to-end (from source to destination route discovery is typically performed to establish a new route for communication. The mechanism results in huge communication overhead and long delay in completion of the communication. So, it is rational to locally repair a link, as much as possible, than to discover a whole new route. Approach: In the present article, we proposed a Link Stability and Node Energy Conscious (LSNEC local route repair scheme for mobile ad hoc networks. In case of breakage of a link from node na to another node nb in between a communication session, LSNEC instructs na to broadcast a ROUTE-REPAIR message within its radio-range specifying nb or any successor of nb in the broken route, as a desirable destination. If any node residing within the radio-range of na has an already established single/multi-hop path to any one of those destinations mentioned in the ROUTE-REPAIR message, it sends a REPAIR-ACK message back to na. Attributes of REPAIR-ACK include the identification number (s of the destination (s as well as identification numbers, geographical positions (in terms of latitude and longitude, radio-ranges and residual energies of nodes present in the associated path to that destination along with the intuitively computed stability of links between the consecutive nodes. The stability is computed depending upon relative velocities of the involved nodes, distance between them and the history of survival of the link. The optimal path is chosen depending upon the residual energy of nodes, stability of links and number of hops in that path

  7. Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy

    Osamah S. Badarneh

    2009-01-01

    Full Text Available Multicasting plays a crucial role in many applications of mobile ad hoc networks (MANETs. It can significantly improve the performance of these networks, the channel capacity (in mobile ad hoc networks, especially single-channel ones, capacity is a more appropriate term than bandwidth, capacity is measured in bits/s and bandwidth in Hz and battery power of which are limited. In the past couple of years, a number of multicast routing protocols have been proposed. In spite of being designed for the same networks, these protocols are based on different design principles and have different functional features when they are applied to the multicast problem. This paper presents a coherent survey of existing multicasting solutions for MANETs. It presents various classifications of the current multicast routing protocols, discusses their operational features, along with their advantages and limitations, and provides a comparison of their characteristics according to several distinct features and performance parameters. Moreover, this paper proposes classifying the existing multicast protocols into three categories according to their layer of operation, namely, the network layer, the application layer, and the MAC layer. It also extends the existing classification system and presents a comparison between them.

  8. Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy

    Badarneh OsamahS

    2009-01-01

    Full Text Available Abstract Multicasting plays a crucial role in many applications of mobile ad hoc networks (MANETs. It can significantly improve the performance of these networks, the channel capacity (in mobile ad hoc networks, especially single-channel ones, capacity is a more appropriate term than bandwidth, capacity is measured in bits/s and bandwidth in Hz and battery power of which are limited. In the past couple of years, a number of multicast routing protocols have been proposed. In spite of being designed for the same networks, these protocols are based on different design principles and have different functional features when they are applied to the multicast problem. This paper presents a coherent survey of existing multicasting solutions for MANETs. It presents various classifications of the current multicast routing protocols, discusses their operational features, along with their advantages and limitations, and provides a comparison of their characteristics according to several distinct features and performance parameters. Moreover, this paper proposes classifying the existing multicast protocols into three categories according to their layer of operation, namely, the network layer, the application layer, and the MAC layer. It also extends the existing classification system and presents a comparison between them.

  9. Improve Performance of TCP New Reno Over Mobile Ad-Hoc Network Using ABRA

    Dhananjay Bisen

    2011-05-01

    Full Text Available In a mobile ad hoc network, temporary link failures and route changes occur frequently. With theassumption that all packet losses are due to congestion, TCP performs poorly in such an environment.There are many versions of TCP which modified time to time as per need. In this paper modificationsintroduced on TCP New Reno over mobile ad-hoc networks using calculation of New RetransmissionTime out (RTO, to improve performance in term of congestion control. To calculate New RTO, adaptivebackoff response approach (ABRA in TCP New Reno was applied which suggest ABRA New Reno. Itutilizes an ABRA by which congestion window and slow start threshold values were decreased wheneveran acknowledgement is received and new backoff value calculate from smoothed round trip time.Evaluation based on comparative study of ABRA New Reno with other TCP Variants like New Reno andReno was done using realistic parameters like TCP Packet Received, Packet Drop, Packets Retransmitted,Throughput, and Packet Delivery Ratio calculated by varying attributes of Node Speed, Number of Nodesand Pause Time. Implementation and simulations were performed in QualNet 4.0 simulator.

  10. An Optimal Path Management Strategy in Mobile Ad Hoc Network Using Fuzzy and Rough Set Theory

    P. Seethalakshmi

    2011-01-01

    Full Text Available Problem statement: Mobile Ad Hoc Network (MANET is a collection of wireless mobile nodes that dynamically forms a network. Most of the existing ad-hoc routing algorithms select the shortest path using various resources. However the selected path may not consider all the network parameters and this would result in link instability in the network. The problems with existing methods are frequent route change with respect to change in topology, congestion as result of traffic and battery limitations since its an infrastructure less network. Approach: To overcome these problems an optimal path management approach called path vector calculation based on fuzzy and rough set theory were addressed. The ultimate intend of this study is to select the qualified path based on power consumption in the node, number of internodes and traffic load in the network. Simple rules were generated using fuzzy and rough set techniques for calculating path vector and to remove irrelevant attributes (resources for evaluating the best routing. The set of rules were evaluated with proactive and reactive protocols namely DSDV, AODV and DSR in the NS-2 simulation environment based on metrics such as total energy consumed, throughput, packet delivery ratio and average end-to-end delay. Results: The results have shown that in MANET, decision rules with fuzzy and rough set technique has provided qualified path based best routing. Conclusion: The network life time and performance of reactive and proactive protocols in MANET has improved with fuzzy and rough set based decision rules.

  11. An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

    Al-Omari, Saleh Ali K; 10.5121/jgraphhoc.2010.2107

    2010-01-01

    Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any...

  12. Implementing voice over Internet protocol in mobile ad hoc network – analysing its features regarding efficiency, reliability and security

    Naveed Ahmed Sheikh; Ashfaq Ahmad Malik; Athar Mahboob; Khairun Nisa

    2014-01-01

    Providing secure and efficient real-time voice communication in mobile ad hoc network (MANET) environment is a challenging problem. Voice over Internet protocol (VoIP) has originally been developed over the past two decades for infrastructure-based networks. There are strict timing constraints for acceptable quality VoIP services, in addition to registration and discovery issues in VoIP end-points. In MANETs, ad hoc nature of networks and multi-hop wireless environment with significant packet...

  13. Secure neighborhood discovery: A fundamental element for mobile ad hoc networking

    Papadimitratos, P.; Poturalski, M.; Schaller, P.; Lafourcade, P.; Basin, D.; Capkun, Srdjan; Hubaux, J.P.

    2008-01-01

    Pervasive computing systems will likely be deployed in the near future, with the proliferation of wireless devices and the emergence of ad hoc networking as key enablers. Coping with mobility and the volatility of wireless communications in such systems is critical. Neighborhood discovery (ND......) - the discovery of devices directly reachable for communication or in physical proximity - becomes a fundamental requirement and building block for various applications. However, the very nature of wireless mobile networks makes it easy to abuse ND and thereby compromise the overlying protocols and...... applications. Thus, providing methods to mitigate this vulnerability and secure ND is crucial. In this article we focus on this problem and provide definitions of neighborhood types and ND protocol properties, as well as a broad classification of attacks. Our ND literature survey reveals that securing ND is...

  14. A Leasing Model to Deal with Partial Failures in Mobile Ad Hoc Networks

    Gonzalez Boix, Elisa; van Cutsem, Tom; Vallejos, Jorge; de Meuter, Wolfgang; D'Hondt, Theo

    In mobile ad hoc networks (MANETs) many partial failures are the result of temporary network partitions due to the intermittent connectivity of mobile devices. Some of these failures will be permanent and require application-level failure handling. However, it is impossible to distinguish a permanent from a transient failure. Leasing provides a solution to this problem based on the temporal restriction of resources. But to date no leasing model has been designed specifically for MANETs. In this paper, we identify three characteristics required for a leasing model to be usable in a MANET, discuss the issues with existing leasing models and then propose the leased object references model, which integrates leasing with remote object references. In addition, we describe an implementation of the model in the programming language AmbientTalk. Leased object references provide an extensible framework that allows programmers to express their own leasing patterns and enables both lease holders (clients) and lease grantors (services) to deal with permanent failures.

  15. A Robust and Efficient Node Authentication Protocol for Mobile Ad Hoc Networks

    Sen, Jaydip

    2011-01-01

    A mobile ad hoc network (MANET) is a collection of mobile nodes that communicate with each other by forming a multi-hop radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of clear lines of defense. Design of an efficient and reliable node authentication protocol for such networks is a particularly challenging task since the nodes are battery-driven and resource constrained. This paper presents a robust and efficient key exchange protocol for nodes authentication in a MANET based on multi-path communication. Simulation results demonstrate that the protocol is effective even in presence of large fraction of malicious nodes in the network. Moreover, it has a minimal computation and communication overhead that makes it ideally suitable for MANETs.

  16. Routage Unicast et Multicast dans les réseaux mobiles Ad hoc

    Moustafa, Hasnaa

    2004-01-01

    Les Réseaux mobiles ad hoc (MANETs) appartiennent à une catégorie de réseaux sans fils qui n'a pas besoin d'infrastructure, chaque nœud jouant le rôle de l'hôte ainsi que du routeur. Les équipements mobiles dans ces réseaux sont généralement de petites tailles (PC portable, PDA...) d'où les contraintes de ressources en terme de mémoire et de batteries. Ces réseaux sont caractérisés par la faible bande passante qui diminue également en raison des interférences des signaux ainsi que la déplétio...

  17. Secure neighborhood discovery: A fundamental element for mobile ad hoc networking

    Papadimitratos, P.; Poturalski, M.; Schaller, P.;

    2008-01-01

    Pervasive computing systems will likely be deployed in the near future, with the proliferation of wireless devices and the emergence of ad hoc networking as key enablers. Coping with mobility and the volatility of wireless communications in such systems is critical. Neighborhood discovery (ND......) - the discovery of devices directly reachable for communication or in physical proximity - becomes a fundamental requirement and building block for various applications. However, the very nature of wireless mobile networks makes it easy to abuse ND and thereby compromise the overlying protocols and applications....... Thus, providing methods to mitigate this vulnerability and secure ND is crucial. In this article we focus on this problem and provide definitions of neighborhood types and ND protocol properties, as well as a broad classification of attacks. Our ND literature survey reveals that securing ND is indeed...

  18. Implementation and performance evaluation of mobile ad hoc network for Emergency Telemedicine System in disaster areas.

    Kim, J C; Kim, D Y; Jung, S M; Lee, M H; Kim, K S; Lee, C K; Nah, J Y; Lee, S H; Kim, J H; Choi, W J; Yoo, S K

    2009-01-01

    So far we have developed Emergency Telemedicine System (ETS) which is a robust system using heterogeneous networks. In disaster areas, however, ETS cannot be used if the primary network channel is disabled due to damages on the network infrastructures. Thus we designed network management software for disaster communication network by combination of Mobile Ad hoc Network (MANET) and Wireless LAN (WLAN). This software maintains routes to a Backbone Gateway Node in dynamic network topologies. In this paper, we introduce the proposed disaster communication network with management software, and evaluate its performance using ETS between Medical Center and simulated disaster areas. We also present the results of network performance analysis which identifies the possibility of actual Telemedicine Service in disaster areas via MANET and mobile network (e.g. HSDPA, WiBro). PMID:19964544

  19. Improved Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks

    Mr.C.Nallusamy*1

    2014-06-01

    Full Text Available In geographic routing, the nodes ought to maintain up-to-date positions of their immediate neighbors. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes may be a new technique utilized by most geographic routing protocols to keep up neighbor positions. The traditional routing schemes demonstrate that periodic beaconing regardless of the node mobility and traffic patterns in the network are not attractive from both update cost and routing performance point of view. Since the Adaptive Position Update (APU strategy for geographic routing, which energetically regulates the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Generally in Mobile Ad Hoc Networks, if forwarding nodes have high mobility then it may have many chances to make local topology inaccurate in nature. Hence this new Improved Adaptive Position Update (IAPU technique for Geographic routing mainly enhances the APU with low mobility based forwarding node selection. This overcomes the link failure of the entire network in high mobility routing. Thus the experimental results exemplifies that the proposed approach drastically improves the performance of the existing APU.

  20. A Survey on Attacks and Defense Metrics of Routing Mechanism in Mobile Ad hoc Networks

    K.P.Manikandan

    2011-03-01

    Full Text Available A Mobile Ad hoc Network (MANET is a dynamic wireless network that can be formed infrastructure less connections in which each node can act as a router. The nodes in MANET themselves are responsible for dynamically discovering other nodes to communicate. Although the ongoing trend is to adopt ad hoc networks for commercial uses due to their certain unique properties, the main challenge is the vulnerability to security attacks. In the presence of malicious nodes, one of the main challenges in MANET is to design the robust security solution that can protect MANET from various routing attacks. Different mechanisms have been proposed using various cryptographic techniques to countermeasure the routing attacks against MANET. As a result, attacks with malicious intent have been and will be devised to exploit these vulnerabilities and to cripple the MANET operations. Attack prevention measures, such as authentication and encryption, can be used as the first line of defense for reducing the possibilities of attacks. However, these mechanisms are not suitable for MANET resource constraints, i.e., limited bandwidth and battery power, because they introduce heavy traffic load to exchange and verifying keys. In this paper, we identify the existent security threats an ad hoc network faces, the security services required to be achieved and the countermeasures for attacks in routing protocols. To accomplish our goal, we have done literature survey in gathering information related to various types of attacks and solutions. Finally, we have identified the challenges and proposed solutions to overcome them. In our survey, we focus on the findings and related works from which to provide secure protocols for MANETs. However, in short, we can say that the complete security solution requires the prevention, detection and reaction mechanisms applied in MANET.

  1. MESSAGE AUTHENTICATION CODE BASED SECURE GROUP KEY MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKS

    T. Peer Meera Labbai

    2013-01-01

    Full Text Available A mobile ad hoc network is a group of nodes which are communicating with each other with the use of radio frequencies. When there is high movement of mobile nodes, the nodes find difficult to reach other nodes. If the data are exchanged between nodes when there is high mobility, the data may be lost in transit. Therefore the security of data is needed for the transmission of data. Since the high dense of mobile nodes we cannot give better security, the mobile nodes must be formed as groups. For providing security, there are pre-requirements like key establishment, key agreement and key management and so on. Then these keys are used in the encryption/decryption algorithms such as symmetric key algorithms and asymmetric key algorithms. For this study, we have taken VBOR as the base protocol. VBOR consists of two phases namely, Route discovery and Route maintenance with the use of variable bit rate. In this study, the message authentication code is generated during route discovery phase then these data are exchanged between the nodes. In this proposed work, the performance analysis is done using some performance parameters like energy consumption, packet delivery ratio, overhead and delay.

  2. Power control in reactive routing protocol for Mobile Ad Hoc Network

    Heni, Maher

    2012-01-01

    The aim of this work is to change the routing strategy of AODV protocol (Ad hoc On Demand Vector) in order to improve the energy consumption in mobile ad hoc networks (MANET). The purpose is to minimize the regular period of HELLO messages generated by the AODV protocol used for the research, development and maintenance of routes. This information is useful to have an idea about battery power levels of different network hosts. After storing this information, the node elect the shortest path following the classical model used this information to elect safest path (make a compromise) in terms of energy. Transmitter node does not select another node as its battery will be exhausted soon. Any node of the network can have the same information's about the neighborhoods as well as other information about the energy level of the different terminal to avoid routing using a link that will be lost due to an exhausted battery of a node in this link. Analytical study and simulations by Jist/SWANS have been conducted to no...

  3. A Mechanism for Detection of Cooperative Black Hole Attack in Mobile Ad Hoc Networks

    Sen, Jaydip; Ukil, Arijit

    2011-01-01

    A mobile ad hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi-hop radio network and maintaining connections in a decentralized manner. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms,absence of centralized monitoring points, and lack of clear lines of defense. Most of the routing protocols for MANETs are thus vulnerable to various types of attacks. Ad hoc on-demand distance vector routing (AODV) is a very popular routing algorithm. However, it is vulnerable to the well-known black hole attack, where a malicious node falsely advertises good paths to a destination node during the route discovery process. This attack becomes more sever when a group of malicious nodes cooperate each other. In this paper, a defense mechanism is presented against a coordinated attack by multiple black hole nodes in a MANET. The simulation carried out on the propose...

  4. Simulation based study of common issues in Flooding over Mobile ad hoc networks

    Ramandeep kaur

    2013-04-01

    Full Text Available Wireless network is a network set up by using radio signal frequency to communicate among computers and other network devices.Sometimes it’s also referred to as Wi-Fi network or WLAN [1]. With the advances of wireless communication technology, a mobile ad hocnetwork (MANET is comprised of mobile hosts that can communicate with each other using wireless links. It is also possible to have access to some hosts in a fixed infrastructure, depending on the kind of mobile ad hoc network available. The wireless communication medium does not have a foreseeable behavior as in a wired channel [2]. On the contrary, the wireless communication medium has variable and unpredictable characteristics. This paper focuses on flooding; the source node broadcasts its packet to all its neighboring nodes. The goal of this paper for working on homogenous to heterogeneous networks and improve the network connectivity among the neighboring nodes. We analyze the performance and discuss the flooding techniques by using AODV and DSDV protocols. We demonstrate through simulations that our protocols used in this proposed work provide good performance and incur a significantly smaller congestion. This paper shows that the proposed mechanisms improve the Throughput and significantly enhance the network performances in terms of delay.

  5. Performance Analysis of AODV-UI Routing Protocol With Energy Consumption Improvement Under Mobility Models in Hybrid Ad hoc Network

    Abdusy Syarif,

    2011-07-01

    Full Text Available In mobile ad hoc networks (MANETs, routing protocol plays the most important role. In the last decade, Ad hoc On-demand Distance Vector (AODV routing protocol becomes the attention of focussed research on MANETs world wide. A lot of protocols had been proposed to improve and optimize AODV routing protocol to achieve the best in quest of reliable protocol. In this paper, we present some improvement suggestion to AODV routing protocol. Our proposed protocol, called AODV-UI, improved AODV in gateway interconnection, reverse route and in energy consumption. We also measure performance indicators for some metrics, such as energy, routing overhead, end-to-end delay, and packet delivery ratio. We performed our simulation scenarios with three mobility model with different maximum speed and sources in hybrid ad hoc network. The result shows that AODV-UI is more stablewhen it is used in random way point mobility model in any speed and number of sources.

  6. QOS Routing and Performance Evaluation for Mobile Ad Hoc Networks Using OLSR Protocol

    Mohamed Amnai

    2011-06-01

    Full Text Available Mobile Ad-Hoc network is a collection of mobile nod es in communication without using infrastructure. As the real-time applications used in today’s wirel ess network grow, we need some schemes to provide more suitable service for them. We know that most o f actual schemes do not perform well on traffic whi ch is not strictly CBR. Therefore, in this paper we ha ve studied the impact, respectively, of mobility mo dels and the density of nodes on the performances (End-t o-End Delay, Throughput and Packet Delivery ratio of routing protocol (Optimized Link State Routing OLSR by using in the first a real-time VBR (MPEG-4 and secondly the Constant Bit Rate (CBR traffic. F inally we compare the performance on both cases. Experimentally, we considered the three mobility mo dels as follows Random Waypoint, Random Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR chang e according to the model and the used traffics.

  7. A DNA-Inspired Encryption Methodology for Secure, Mobile Ad Hoc Networks

    Shaw, Harry

    2012-01-01

    Users are pushing for greater physical mobility with their network and Internet access. Mobile ad hoc networks (MANET) can provide an efficient mobile network architecture, but security is a key concern. A figure summarizes differences in the state of network security for MANET and fixed networks. MANETs require the ability to distinguish trusted peers, and tolerate the ingress/egress of nodes on an unscheduled basis. Because the networks by their very nature are mobile and self-organizing, use of a Public Key Infra structure (PKI), X.509 certificates, RSA, and nonce ex changes becomes problematic if the ideal of MANET is to be achieved. Molecular biology models such as DNA evolution can provide a basis for a proprietary security architecture that achieves high degrees of diffusion and confusion, and resistance to cryptanalysis. A proprietary encryption mechanism was developed that uses the principles of DNA replication and steganography (hidden word cryptography) for confidentiality and authentication. The foundation of the approach includes organization of coded words and messages using base pairs organized into genes, an expandable genome consisting of DNA-based chromosome keys, and a DNA-based message encoding, replication, and evolution and fitness. In evolutionary computing, a fitness algorithm determines whether candidate solutions, in this case encrypted messages, are sufficiently encrypted to be transmitted. The technology provides a mechanism for confidential electronic traffic over a MANET without a PKI for authenticating users.

  8. Rollback recovery with low overhead for fault tolerance in mobile ad hoc networks

    Parmeet Kaur Jaggi

    2015-10-01

    Full Text Available Mobile ad hoc networks (MANETs have significantly enhanced the wireless networks by eliminating the need for any fixed infrastructure. Hence, these are increasingly being used for expanding the computing capacity of existing networks or for implementation of autonomous mobile computing Grids. However, the fragile nature of MANETs makes the constituent nodes susceptible to failures and the computing potential of these networks can be utilized only if they are fault tolerant. The technique of checkpointing based rollback recovery has been used effectively for fault tolerance in static and cellular mobile systems; yet, the implementation of existing protocols for MANETs is not straightforward. The paper presents a novel rollback recovery protocol for handling the failures of mobile nodes in a MANET using checkpointing and sender based message logging. The proposed protocol utilizes the routing protocol existing in the network for implementing a low overhead recovery mechanism. The presented recovery procedure at a node is completely domino-free and asynchronous. The protocol is resilient to the dynamic characteristics of the MANET; allowing a distributed application to be executed independently without access to any wired Grid or cellular network access points. We also present an algorithm to record a consistent global snapshot of the MANET.

  9. A Testbed Implementation for Securing OLSR in Mobile Ad hoc Networks

    Panaousis, Emmanouil A; Millar, Grant P; Ramrekha, Tipu A; Politis, Christos

    2010-01-01

    Contemporary personal computing devices are increasingly required to be portable and mobile enabling user’s wireless access, to wired network infrastructures and services. This approach to mobile computing and communication is only appropriate in situations where a coherent infrastructure is available. There are many situations where these requirements are not fulfilled such as; developing nations, rural areas, natural disasters, and military conflicts to name but a few. A practical solution is to use mobile devices interconnected via a wireless medium to form a network, known as a Mobile Ad-hoc Network (MANET), and provide the services normally found in wired networks. Security in MANETs is an issue of paramount importance due to the wireless nature of the communication links. Additionally due to the lack of central administration security issues are different from conventional networks. For the purposes of this article we have used the “WMN test-bed” to enable secure routing in MANETs. The us...

  10. POWER-AWARE ROUTING BASED ON DSR FOR MOBILE AD HOC NETWORKS

    Huang Jingbo; Hong Peilin; Li Jinsheng

    2007-01-01

    Energy consumption is a crucial design concern in Mobile Ad hoc NETworks (MANETs)since nodes are powered by batteries with limited energy, whereas Dynamic Source Routing (DSR)protocol does not take the energy limitation of MANET nodes into account. This paper proposes an energy-saving routing algorithm based on DSR: Power Aware Routing protocol based on DSR (PAR-DSR). The design objective of PAR-DSR is to select energy-efficient paths. The main features of PAR-DSR are: (1) Nodes use the Signal Attenuation Rate (SAR) to conduct power control operations;(2) Minimum path cost as metric to balance the traffic and energy consumption of wireless nodes. The simulation results show that PAR-DSR can greatly reduce the energy consumption of MANET nodes.The average node lifetime of PAR-DSR is 50%-77% longer than that of DSR.

  11. Contention Based Routing in Mobile Ad Hoc Networks with Multiple Copies

    JebaJothi, E Jenefa; Kavitha, T

    2010-01-01

    Routing the packets efficiently in mobile ad hoc network does not have end to end paths. Multiple copies are forwarded from the source to the destination. To deal with such networks, researches introduced flooding based routing schemes which leads to high probability of delivery. But the flooding based routing schemes suffered with contention and large delays. Here the proposed protocol "Spray Select Focus", sprays a few message copies into the network, neighbors receives a copy and by that relay nodes we are choosing the shortest route and then route that copy towards the destination. Previous works assumption is that there is no contention and dead ends. But we argue that contention and dead ends must be considered for finding efficiency in routing. So we are including a network which has contention and dead ends and we applied the proposed protocol. We can say that this protocol works well for the contention based network.

  12. A High Certificate Authority Scheme for Authentication in Mobile Ad hoc Networks

    A. Rajaram

    2010-07-01

    Full Text Available In mobile ad hoc networks (MANETs, it is easy to launch wormhole, man-in-the-middle and denial of service (DoS attacks, or to impersonate another node. Trust based cross layer approach established a network consisting confidentiality and authentication of packets in both routing and link layers., in this paper, we propose to develop an enhanced distributed certificate authority scheme to provide data integrity, thus making the network more secure from both inside and outside attacks. The proposed scheme makes use of Shamir's secret sharing scheme along with a redundancy technique to support certificate renewal and revocation. The malicious nodes are detected by the trusting mechanism by monitoring the behavior hop by hop. By simulation results, we show that the proposed scheme achieves more packet delivery ratio while attaining less delay and overhead, compared with the trust based cross layer approach.

  13. Identification of Closest and Phantom Nodes in Mobile Ad Hoc Networks

    G. Satyachellayi

    2014-08-01

    Full Text Available There are several services that build on the availability of closest node location information like geographic routing in spontaneous networks, data gathering in sensor networks, movement coordination among autonomous robotic nodes, location specific services for hand held devices and danger warning or traffic monitoring in vehicular networks. Ad hoc networking protocols and location-aware services require that mobile nodes identify the location of their closest nodes. Such a process can be easily misuses or stop by opposed nodes. In absence of a priori trusted nodes, the spotting and identifying of closest node position presents challenges that have been scarcely investigated in the literature. Node can also send message from one to many nodes in a broadcasting manner here.

  14. Enhancing congestion control to address link failure loss over mobile ad-hoc network

    Fard, Mohammad Amin Kheirandish; Aflaki, Mohammad

    2011-01-01

    Standard congestion control cannot detect link failure losses which occur due to mobility and power scarcity in multi-hop Ad-Hoc network (MANET). Moreover, successive executions of Back-off algorithm deficiently grow Retransmission Timeout (RTO) exponentially for new route. The importance of detecting and responding link failure losses is to prevent sender from remaining idle unnecessarily and manage number of packet retransmission overhead. In contrast to Cross-layer approaches which require feedback information from lower layers, this paper operates purely in Transport layer. This paper explores an end-to-end threshold-based algorithm which enhances congestion control to address link failure loss in MANET. It consists of two phases. First, threshold-based loss classification algorithm distinguishes losses due to link failure by estimating queue usage based on Relative One-way Trip Time (ROTT). Second phase adjusts RTO for new route by comparing capabilities of new route to the broken route using available i...

  15. Distributed Cooperative Spectrum Sensing in Mobile Ad Hoc Networks with Cognitive Radios

    Yu, F Richard; Huang, Minyi; Mason, Peter; Li, Zhiqiang

    2011-01-01

    In cognitive radio mobile ad hoc networks (CR-MANETs), secondary users can cooperatively sense the spectrum to detect the presence of primary users. In this chapter, we propose a fully distributed and scalable cooperative spectrum sensing scheme based on recent advances in consensus algorithms. In the proposed scheme, the secondary users can maintain coordination based on only local information exchange without a centralized common receiver. We use the consensus of secondary users to make the final decision. The proposed scheme is essentially based on recent advances in consensus algorithms that have taken inspiration from complex natural phenomena including flocking of birds, schooling of fish, swarming of ants and honeybees. Unlike the existing cooperative spectrum sensing schemes, there is no need for a centralized receiver in the proposed schemes, which make them suitable in distributed CR-MANETs. Simulation results show that the proposed consensus schemes can have significant lower missing detection prob...

  16. Cluster Based Misbehaviour Detection and Authentication Using Threshold Cryptography in Mobile Ad Hoc Networks

    R. Murugan

    2012-06-01

    Full Text Available In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH, it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.

  17. Cluster Based Node Misbehaviour Detection, Isolation and Authentication Using Threshold Cryptography in Mobile Ad Hoc Networks

    R. Murugan

    2012-06-01

    Full Text Available In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resultingin damage of other nodes. In order to establish secure communication with the group members ofa network, use of a shared group key for confidentiality and authentication is required. Distributingthe shares of secret group key to the group members securely is another challenging task inMANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authenticationscheme using threshold cryptography in MANET. For secure data transmission, when any noderequests a certificate from a cluster head (CH, it utilizes a threshold cryptographic technique toissue the certificate to the requested node for authentication. The certificate of a node is renewedor rejected by CH, based on its trust counter value. An acknowledgement scheme is alsoincluded to detect and isolate the misbehaving nodes. By simulation results, we show that theproposed approach reduces the overhead.

  18. A Mechanism for Detection of Gray Hole Attack in Mobile Ad Hoc Networks

    Sen, Jaydip; G., Harihara S; Reddy, Harish; Balamuralidhar, P

    2011-01-01

    Protecting the network layer from malicious attacks is an important and challenging security issue in mobile ad hoc networks (MANETs). In this paper, a security mechanism is proposed to defend against a cooperative gray hole attack on the well known AODV routing protocol in MANETs. A gray hole is a node that selectively drops and forwards data packets after it advertises itself as having the shortest path to the destination node in response to a route request message from a source node. The proposed mechanism does not apply any cryptographic primitives on the routing messages. Instead, it protects the network by detecting and reacting to malicious activities of any node. Simulation results show that the scheme has a significantly high detection rate with moderate network traffic overhead.

  19. PCBA: A Priority-Based Competitive Broadcasting Algorithm in Mobile Ad Hoc Networks

    ZHOU BoSheng(周伯生); WU JieYi(吴介一); FEI Xiang(费翔); ZHAO Jian(赵键)

    2003-01-01

    Broadcasting operations are of great importance in Mobile Ad Hoc Networks(MANETs) since they are frequently executed. A straightforward broadcasting by flooding willproduce serious redundancy, contention and collision, and furthermore it will result in the perfor-mance degradation of the networks. PCBA, a Priority-based Competitive Broadcasting Algorithm,is proposed in this paper to solve the above problem. In this algorithm, hosts with larger PriorityIndex (PI) have higher probability to rebroadcast relevant messages while some other hosts will beprevented from rebroadcasting according to the competing policy. PCBA is a distributed algorithmand will not increase communication overhead. Through the analyses and extensive simulations,the authors demonstrate that PCBA has advantages in availability and scalability. It can signif-icantly reduce the rebroadcast redundancy. In addition, PCBA can also be further used in otherapplications such as routing discovery schemes, enhancing the performance.

  20. A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks

    Julien Haillot

    2010-01-01

    Full Text Available In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the needs of applications dedicated to information sharing, news distribution, service advertisement and discovery, etc. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs. The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. The paper provides an overview of the protocol, as well as simulation results that show how this protocol can perform in realistic conditions.

  1. AUTHENTICATION ARCHITECTURE USING THRESHOLD CRYPTOGRAPHY IN KERBEROS FOR MOBILE AD HOC NETWORKS

    Hadj Gharib

    2014-06-01

    Full Text Available The use of wireless technologies is gradually increasing and risks related to the use of these technologies are considerable. Due to their dynamically changing topology and open environment without a centralized policy control of a traditional network, a mobile ad hoc network (MANET is vulnerable to the presence of malicious nodes and attacks. The ideal solution to overcome a myriad of security concerns in MANET’s is the use of reliable authentication architecture. In this paper we propose a new key management scheme based on threshold cryptography in kerberos for MANET’s, the proposed scheme uses the elliptic curve cryptography method that consumes fewer resources well adapted to the wireless environment. Our approach shows a strength and effectiveness against attacks.

  2. Topology Control and Routing in Mobile Ad Hoc Networks with Cognitive Radios

    Guan, Quansheng; Jiang, Shengming

    2011-01-01

    Cognitive radio (CR) technology will have significant impacts on upper layer performance in mobile ad hoc networks (MANETs). In this paper, we study topology control and routing in CR-MANETs. We propose a distributed Prediction-based Cognitive Topology Control (PCTC) scheme to provision cognition capability to routing in CR-MANETs. PCTC is a midware-like cross-layer module residing between CR module and routing. The proposed PCTC scheme uses cognitive link availability prediction, which is aware of the interference to primary users, to predict the available duration of links in CR-MANETs. Based on the link prediction, PCTC constructs an efficient and reliable topology, which is aimed at mitigating re-routing frequency and improving end-to-end network performance such as throughput and delay. Simulation results are presented to show the effectiveness of the proposed scheme.

  3. Cooperative Medium Access Control Protocol for Mobile Ad-hoc Networks using Spatial Diversity

    Tazeem Ahmad Khan

    2013-10-01

    Full Text Available Enhancement the Performance of MANET (Mobile Ad-hoc Network using spatial diversity. Spatial diversity implemented using cooperative transmission technique in Medium access control (MAC layer level protocol. In noisy environment limit the network performance like coverage area, limit number of node, degrade packet transmission rate, increase packet loss rate etc. In this paper enhance the source to destination transmission range, minimize the packet loss, improve packet transmission rate and appropriate end to end delay. When direct link is fail to transmit packet then Cooperative scheme help to transmit packet. Cooperative scheme is to help the packet transmission with five handshakes instead of four. This scheme implemented in MANET network on MAC layer protocol. Cooperative scheme improve the performance with help of intermediate node between sources to destination. We are performance analysis using discrete simulator NS-2 in MANET. Our performance based on MAC layer level with cooperative scheme in IEEE WLAN standard CSMA/CA protocol.

  4. AN IMMUNITY-BASED SECURITY ARCHITECTURE FOR MOBILE AD HOC NETWORKS

    2006-01-01

    This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in mobile ad hoc networks. In this approach, the immunity-based agents monitor the situation in the network. These agents can take appropriate actions according to the underlying security policies. Specifically, their activities are coordinated in a hierarchical fashion while sensing,communicating, decision and generating responses. Such an agent can learn and adapt to its environment dynamically and can detect both known and unknown intrusions. The proposed intrusion detection architecture is designed to be flexible, extendible, and adaptable that can perform real-time monitoring. This paper provides the conceptual view and a general framework of the proposed system. In the end, the architecture is illustrated by an example to show it can prevent the attack efficiently.

  5. MCCM: Multilevel Congestion Avoidance and Control Mechanism for Mobile Ad Hoc Networks

    Md. Manowarul Islam

    2014-05-01

    Full Text Available Congestion in Mobile Ad Hoc Network causes packet loss, longer end-to-end data delivery delay which affects the overall performance of the network significantly. To ensure high throughput, the routing protocol should be congestion adaptive and should be capable of handling the congestion. In this research work, we propose a Multilevel Congestion avoidance and Control Mechanism (MCCM that exploits both congestion avoidance and control mechanism to handle the congestion problem in an effective and efficient way. MCCM is capable of finding an energy efficient path during route discovery process, provide longer lifetime of any developed route. The efficient admission control and selective data packet delivery mechanism of MCCM jointly overcome the congestion problem at any node and thus, MCCM improves the network performance in term of packet delivery ratio, lower data delivery delay and high throughput. The result of performance evaluation section shows that, MCCM outperforms the existing routing protocols carried out in Network Simulator-2(NS-2.

  6. A Review of Current Routing Attacks in Mobile Ad Hoc Networks

    Rashid Hafeez Khokhar

    2008-11-01

    Full Text Available A mobile ad hoc network (MANET is a dynamic wireless network that can be formed without any pre-existing infrastructure in which each node can act as a router. MANET has no clear line of defense, so, it is accessible to both legitimate network users and malicious attackers. In the presence of malicious nodes, one of the main challenges in MANET is to design the robust security solution that can protect MANET from various routing attacks. Different mechanisms have been proposed using various cryptographic techniques to countermeasure the routing attacks against MANET. However, these mechanisms are not suitable for MANET resource constraints, i.e., limited bandwidth and battery power, because they introduce heavy traffic load to exchange and verifying keys. In this paper, the current security issues in MANET are investigated. Particularly, we have examined different routing attacks, such as flooding, blackhole, link spoofing, wormhole, and colluding misrelay attacks, as well as existing solutions to protect MANET protocols.

  7. Efficient Link Based Route Selection for Multicasting in Mobile Ad Hoc Networks

    S. Senthil Kumar

    2015-01-01

    Full Text Available Mobile Ad hoc networks have invaded some of the most traditional technologies due to the portability that comes handy with efficient communication using the ‘temporary links’ created between the nodes. One of the major issues face, however, is the link failure issue during the movement of nodes. In this study, we provide a solution to perform efficient multicasting in MANETs called Link Based Route Selection for Multicasting (LBRSM with the link conditions considered as well. φ ̅ is a novel link factor proposed that aids in choosing the best next node to reach the destinations while multicasting. The efficiency of the proposed method is evaluated by the simulations in network simulator. To prove the efficiency, we compare the simulations results of LBRSM and LSMRP to show that the LBRSM is efficient.

  8. Performance Analysis of Contention Window Cheating Misbehaviors in Mobile Ad Hoc Networks

    Kalaiarasi, R; Pari, S Neelavathy; Sridharan, D

    2010-01-01

    Mobile Ad Hoc Network (MANET) is a collection of nodes that can be rapidly deployed as a multi-hop network without the aid of any centralized administration. Misbehavior is challenged by bandwidth and energy efficient medium access control and fair share of throughput. Node misbehavior plays an important role in MANET. In this survey, few of the contention window misbehavior is reviewed and compared. The contention window cheating either minimizes the active communication of the network or reduces bandwidth utilization of a particular node. The classification presented is in no case unique but summarizes the chief characteristics of many published proposals for contention window cheating. After getting insight into the different contention window misbehavior, few of the enhancements that can be done to improve the existing contention window are suggested. The purpose of this paper is to facilitate the research efforts in combining the existing solutions to offer more efficient methods to reduce contention win...

  9. On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks

    Caleffi, Marcello; Paura, Luigi

    2008-01-01

    In this paper, a reliability analysis is carried out to state a performance comparison between two recently proposed proactive routing algorithms. These protocols are able to scale in ad hoc and sensor networks by resorting to dynamic addressing, to face with the topology variability, which is typical of ad hoc, and sensor networks. Numerical simulations are also carried out to corroborate the results of the analysis.

  10. Energy-Aware Performance Metric for AODV and DSDV Routing Protocols in Mobile Ad-Hoc Networks

    P Vijayalakshmi

    2011-07-01

    Full Text Available In Mobile Ad-Hoc Networks (MANETs, mobile devices are equipped with power (energy. In order to utilize this energy equipped devices efficiently for transmission of data packets, many energy aware routing strategies are followed. As a key note to these routing strategies, the energy aware performance metrics are analyzed on two routing protocols like Ad-Hoc On Demand Distance Vector Protocol (AODV and Destination Sequenced Distance Vector Routing Protocol (DSDV. The comparison results prove that AODV protocol can be adopted for any routing strategy, in order to increase the performance of the network lifetime in comparison with DSDV.

  11. A Survey of QOS Routing Protocols For Mobile Ad Hoc Networks

    G. Santhi

    2010-09-01

    Full Text Available A Mobile Ad-hoc Network (MANET is composed of mobile nodes without any infrastructure.MANET applications such as audio/video conferencing, webcasting requires very stringent and inflexibleQuality of Service (QoS. The provision of QoS guarantees is much more challenging in MANETs thanwired networks due to node mobility, limited power supply and a lack of centralized control. Manyresearches have been done so as to provide QoS assurances by designing various MANET protocols. Inrecent years a number of QoS routing protocols with distinguishing features have been newly proposed.However, systematic performance evaluations and comparative analysis of these protocols in a commonrealistic environment have been performed only in a limited manner. This paper presents a thoroughoverview of QoS routing metrics, resources and factors affecting performance of QoS routing protocols. Therelative strength, weakness, and applicability of existing QoS routing protocols are also studied andcompared. QoS routing protocols are classified according to the QoS metrics used, type of QoS guaranteeassured and their interaction with the medium access control (MAC protocol.

  12. Implementation of EnhancedSecurity AlgorithmsinMobile Ad hoc Networks

    Takialddin A. Al Smadi

    2014-01-01

    Full Text Available Mobile Ad hoc Networks are wireless infrastructure less networks can beeasily formed or deployed due to its simple infrastructure. Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. The main objective of this work is to enhance the performance of the network by securing the data and to minimize the malicious nodes which disturb the stream of the network. Securing data is a critical task which can be achieved by cryptographic algorithms and disturbance detection plays as a crucial ingredient in any comprehensive security solution to address the threats.Hence a Novel Cryptographic Algorithm with a new Disturbance Detection System (DDS has been proposed for Mobile Adhoc Networks. This method prevents the outside attacks to obtain any information from any data exchange in network and also use promiscuous mode of working along with rating and collaborative decision making based on multiple threshold values.The proposed algorithm was implemented and simulated in the Glomosim and the result analysis proved that the performance of the network is increased.

  13. Evaluation of mobile ad hoc network reliability using propagation-based link reliability model

    A wireless mobile ad hoc network (MANET) is a collection of solely independent nodes (that can move randomly around the area of deployment) making the topology highly dynamic; nodes communicate with each other by forming a single hop/multi-hop network and maintain connectivity in decentralized manner. MANET is modelled using geometric random graphs rather than random graphs because the link existence in MANET is a function of the geometric distance between the nodes and the transmission range of the nodes. Among many factors that contribute to the MANET reliability, the reliability of these networks also depends on the robustness of the link between the mobile nodes of the network. Recently, the reliability of such networks has been evaluated for imperfect nodes (transceivers) with binary model of communication links based on the transmission range of the mobile nodes and the distance between them. However, in reality, the probability of successful communication decreases as the signal strength deteriorates due to noise, fading or interference effects even up to the nodes' transmission range. Hence, in this paper, using a propagation-based link reliability model rather than a binary-model with nodes following a known failure distribution to evaluate the network reliability (2TRm, ATRmand AoTRm) of MANET through Monte Carlo Simulation is proposed. The method is illustrated with an application and some imperative results are also presented

  14. Replica Dissemination and Update Strategies in Cluster-Based Mobile Ad Hoc Networks

    Mieso K. Denko

    2006-01-01

    Full Text Available A mobile ad hoc network (MANET is a collection of wireless mobile nodes that forms a temporary network without the aid of a fixed communication infrastructure. Since every node can be mobile and network topology changes can occur frequently, node disconnection is a common mode of operation in MANETs. Providing reliable data access and message delivery is a challenge in this dynamic network environment. Caching and replica allocation within the network can improve data accessibility by storing the data and accessing them locally. However, maintaining data consistency among replicas becomes a challenging problem. Hence, balancing data accessibility and consistency is an important step toward data management in MANETs. In this paper, we propose a replica-based data-storage mechanism and undelivered-message queue schemes to provide reliable data storage and dissemination. We also propose replica update strategies to maintain data consistency while improving data accessibility. These solutions are based on a clustered MANET where nodes in the network are divided into small groups that are suitable for localized data management. The goal is to reduce communication overhead, support localized computation, and enhance scalability. A simulation environment was built using an NS-2 network simulator to evaluate the performance of the proposed schemes. The results show that our schemes distribute replicas effectively, provide high data accessibility rates and maintain consistency.

  15. A Survey Of Tcp Reno, New Reno And Sack Over Mobile Ad-Hoc Network

    Md Nazmul Islam Khan

    2012-02-01

    Full Text Available Transmission Control Protocol (TCP is often preferred to be implemented at the transport layer of a Mobile Ad-hoc Network (MANET because of its wide range of applications, which enjoys the advantage of reliable data transmission in the Internet. However, because of some unique characteristics of MANET, TCP cannot offer reliable services while using e-mail, internet search and file transmission insuch a network. The research investigates how well the different versions of TCP respond to various performance differentials when subjected to different network stresses and topology changes, aside from identifying the most efficient and robust TCP version(s for different MANET scenarios. Among several TCP variants, three types are considered important for the analysis, namely TCP Reno, TCP New Reno and TCP Selective Acknowledgment (SACK. In most cases, the TCP performance is found in our study to decrease when the node size and mobility rate is increased in the network. There is, however, exception to this. As our simulation results demonstrate, the increases in the node velocity sometimes help the TCP to attain a better performance. The study also reveals that out of the three variants, TCP SACK can adaptrelatively well to the changing network sizes while TCP Reno performs most robustly in the presence ofdifferent mobility rates within MANET.

  16. Securing mobile ad hoc networks using danger theory-based artificial immune algorithm.

    Maha Abdelhaq

    Full Text Available A mobile ad hoc network (MANET is a set of mobile, decentralized, and self-organizing nodes that are used in special cases, such as in the military. MANET properties render the environment of this network vulnerable to different types of attacks, including black hole, wormhole and flooding-based attacks. Flooding-based attacks are one of the most dangerous attacks that aim to consume all network resources and thus paralyze the functionality of the whole network. Therefore, the objective of this paper is to investigate the capability of a danger theory-based artificial immune algorithm called the mobile dendritic cell algorithm (MDCA to detect flooding-based attacks in MANETs. The MDCA applies the dendritic cell algorithm (DCA to secure the MANET with additional improvements. The MDCA is tested and validated using Qualnet v7.1 simulation tool. This work also introduces a new simulation module for a flooding attack called the resource consumption attack (RCA using Qualnet v7.1. The results highlight the high efficiency of the MDCA in detecting RCAs in MANETs.

  17. An Update based Energy-Efficient Reactive Routing Protocol for Mobile Ad Hoc Networks

    Dhirendra Kumar Sharma

    2013-09-01

    Full Text Available Low cost energy-efficient (power based routing protocols of mobile ad hoc networks (MANETs increase the lifetime of static networks by using received signal strength (RSS and battery power status (PS. They require GPS service to find the exact location of mobile nodes. The GPS devices themselves consume power because they need excessive updates to find the stationary nodes for efficient routing. To overcome this, RSS is being used as a metric, followed by, residual battery power. The recent protocols, based on these concepts, provide energy efficient routes during the route discovery phase only. Topological changes make these routes weak in due course of time. To update routes, HELLO process can be used, which however creates unnecessary overhead, delay and consumes power. Hence, these protocols do not update the routes. We propose an energy-efficient reactive routing protocol that uses the RSS and PS of mobile nodes. Proposed Link Failure Prediction (LFP algorithm uses the link-layer feedback system to update active routes. We use ns2 for simulation of the proposed algorithm. Comparing the results of proposed scheme and existing scheme, in terms of energy consumption, link failure probability, and retransmission of packets, we observe that the proposed scheme outperforms the existing one.

  18. A Distributed Trust and Reputation Framework for Mobile Ad Hoc Networks

    Sen, Jaydip

    2010-01-01

    In a multi-hop mobile ad hoc network (MANET), mobile nodes cooperate to form a network without using any infrastructure such as access points or base stations. The mobility of the nodes and the fundamentally limited capacity of the wireless medium, together with wireless transmission effects such as attenuation, multi-path propagation, and interference combine to create sig-nificant challenges for security in MANETs. Traditional cryptographic mecha-nisms such as authentication and encryption are not capable of handling some kinds of attacks such as packet dropping by malicious nodes in MANETs. This paper presents a mechanism for detecting malicious packet dropping attacks in MANETs. The mechanism is depends on a trust module on each node, which is based on the reputation value computed for that node by its neighbors. The reputation value of a node is computed based on its packet forwarding behavior in the network. The reputation information is gathered, stored and exchanged between the nodes, and computed und...

  19. 移动Ad Hoc网络路由协议综述%A Survey of Routing Protocols for Mobile Ad Hoc Networks

    张顺亮; 叶澄清; 李方敏

    2003-01-01

    A review of current research about routing protocols for mobile Ad Hoc networks is made. Based on classifying of them, the characteristic, the strength and the weakness of these protocols are evaluated respectively. Then some crucial strategies to improve the existing routing protocols are proposed. Besides, a frame of new routing protocol for Ad Hoc networks is put forward. Finally, open issues that still need investigation are listed.

  20. Misbehaving Node Detection in Mobile Ad Hoc Networks using Multi Hop Acknowledgement Scheme

    U. Sakthivel

    2011-01-01

    Full Text Available Problem statement: For any node in a Mobile Ad hoc Network conservation of battery power and bandwidth are the priority. Hence, they try to reduce the overload they would otherwise incur when they forward packets. This selfish behavior of a node affects the throughput of the network. The nodes may also choose a back off value of shorter duration. These problems are handled effectively by the methodology proposed in this study. A conscious effort has been made keeping the constraints of the MANETs in mind. Approach: Misbehavior is best identified at the lower levels as the upper levels of the OSI standard primarily deals with the data the packets carry and less about how, so the network and the MAC layers is where the primary focus lies. Thus, keeping these points in mind, we propose algorithms that work along with the 802.11 MAC protocol to monitor the behavior of neighboring nodes by listening to the channel, specifically monitoring parameters like back off values sent by the nodes. A counter is maintained which is incremented every time node misconduct is detected, subsequently after a particular value is cross the node is labeled as misbehaving and the information is broadcast over the network. Results: Performance parameters like throughput, packet delivery ratio were monitored with traffic of the magnitude 10 to 60 nodes. Also the performance of the network based on the percentage of selfish nodes present in the network was monitored and a graph was generated based on the statistics. Conclusion: An algorithmic approach for misbehaving node detection and isolation in ad hoc networks by modifying the protocol being used in the lower layers which consequently improves performance of the network had been proposed. Simulation results show considerable performance increase upon implementing the proposed algorithm. Further research can confirm the practicality of the proposed idea.

  1. Dynamic Agent Classification and Tracking Using an Ad Hoc Mobile Acoustic Sensor Network

    Friedlander, David; Griffin, Christopher; Jacobson, Noah; Phoha, Shashi; Brooks, Richard R.

    2003-12-01

    Autonomous networks of sensor platforms can be designed to interact in dynamic and noisy environments to determine the occurrence of specified transient events that define the dynamic process of interest. For example, a sensor network may be used for battlefield surveillance with the purpose of detecting, identifying, and tracking enemy activity. When the number of nodes is large, human oversight and control of low-level operations is not feasible. Coordination and self-organization of multiple autonomous nodes is necessary to maintain connectivity and sensor coverage and to combine information for better understanding the dynamics of the environment. Resource conservation requires adaptive clustering in the vicinity of the event. This paper presents methods for dynamic distributed signal processing using an ad hoc mobile network of microsensors to detect, identify, and track targets in noisy environments. They seamlessly integrate data from fixed and mobile platforms and dynamically organize platforms into clusters to process local data along the trajectory of the targets. Local analysis of sensor data is used to determine a set of target attribute values and classify the target. Sensor data from a field test in the Marine base at Twentynine Palms, Calif, was analyzed using the techniques described in this paper. The results were compared to "ground truth" data obtained from GPS receivers on the vehicles.

  2. Dynamic Agent Classification and Tracking Using an Ad Hoc Mobile Acoustic Sensor Network

    Friedlander David

    2003-01-01

    Full Text Available Autonomous networks of sensor platforms can be designed to interact in dynamic and noisy environments to determine the occurrence of specified transient events that define the dynamic process of interest. For example, a sensor network may be used for battlefield surveillance with the purpose of detecting, identifying, and tracking enemy activity. When the number of nodes is large, human oversight and control of low-level operations is not feasible. Coordination and self-organization of multiple autonomous nodes is necessary to maintain connectivity and sensor coverage and to combine information for better understanding the dynamics of the environment. Resource conservation requires adaptive clustering in the vicinity of the event. This paper presents methods for dynamic distributed signal processing using an ad hoc mobile network of microsensors to detect, identify, and track targets in noisy environments. They seamlessly integrate data from fixed and mobile platforms and dynamically organize platforms into clusters to process local data along the trajectory of the targets. Local analysis of sensor data is used to determine a set of target attribute values and classify the target. Sensor data from a field test in the Marine base at Twentynine Palms, Calif, was analyzed using the techniques described in this paper. The results were compared to "ground truth" data obtained from GPS receivers on the vehicles.

  3. Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

    WANG Han-xing; HU Xi; FANG Jian-chao; JIA Wei-jia

    2007-01-01

    Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatial reuse birth-death model (n-SRBDM). We analyze the performance of the network under the dynamic source routing protocol (DSR) which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.

  4. INTRUSION DETECTION IN MOBILE AD HOC NETWORK USING SECURE ROUTING FOR ATTACKER IDENTIFICATION PROTOCOL

    S. Gopalakrishnan

    2014-01-01

    Full Text Available In past few decades, the migration of communication takes place from wired networks to wireless networks because of its mobility and scalability and Mobile Ad hoc Network (MANET is a unique and significant application in recent years which does not necessitates any pre-existing network infrastructure. Each node can act as both transmitters as well as receivers that are communicating with each other when they are in same communication/transmission range. Otherwise, these nodes depend on neighbor nodes to transmit their packets and they possess self-configuring ability which makes MANETs popular in various critical mission applications such as military and other emergency applications. In general, MANETs are open medium network and their nodes are widely distributed which makes the network more vulnerable to various attackers. Some times, the transmitted packets are viewed or modified or corrupted by the attackers through the way to reach destination and the destination could not find such type of packets. So, the receiver can deliver modified packets with wrong information. Thus, it is essential to present an efficient secure routing protocol to preserve MANET from several attacks. In this study, we are going to propose and implement a novel routing protocol named Secure Routing for Attacker Identification (SRAI protocol that executes at receiver/destination side to discover the modified packets in delivered nodes and generate misbehaviour report to the source. Compared to modern approaches, SRAI protocol establishes higher attacker identification rates in certain considerations.

  5. Quick Local Repair Scheme using Adaptive Promiscuous Mode in Mobile Ad Hoc Networks

    Joo-Sang Youn

    2006-05-01

    Full Text Available In mobile ad hoc networks (MANETs, there is frequently disconnected a route consisting of multi- hop from a source to a destination because of the dynamic nature such as the topology change caused by nodes’ mobility. To overcome this situation, existing routing protocols for MANETs have performed route repair scheme to repair the disconnected route. However, existing reactive routing protocols have the problem which is that a source node unnecessarily performs re-discovers the whole path when just one node moves, even if the rest of path needs not to be re-arranged. Therefore, the time for re-discovery of the whole path may often take too long. To solve the problem, we propose a new local repair scheme using promiscuous mode. Our scheme is mainly composed of two parts: adaptive promiscuous mode and quick local repair scheme. Adaptive promiscuous mode is to repeat the switching processes between promiscuous mode and nonpromiscuous mode to overcome energy limit caused by using promiscuous mode in overall time and quick local repair scheme is to fast perform the local re-route discovery process with the information of the active connection in the local area acquired by promiscuous mode. With simulation in the various number of connection, We demonstrate the better network performances achieved with the proposed schemes as compared with AODV as reference model that do not provide local repair scheme.

  6. A new Hierarchical Group Key Management based on Clustering Scheme for Mobile Ad Hoc Networks

    Ayman EL-SAYED

    2014-05-01

    Full Text Available The migration from wired network to wireless network has been a global trend in the past few decades because they provide anytime-anywhere networking services. The wireless networks are rapidly deployed in the future, secure wireless environment will be mandatory. As well, The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks,Mobile Ad hoc Networks (MANET is one of the most important and unique applications. MANET is a collection of autonomous nodes or terminals which communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. Due to the nature of unreliable wireless medium data transfer is a major problem in MANET and it lacks security and reliability of data. The most suitable solution to provide the expected level of security to these services is the provision of a key management protocol. A Key management is vital part of security. This issue is even bigger in wireless network compared to wired network. The distribution of keys in an authenticated manner is a difficult task in MANET. When a member leaves or joins the group, it needs to generate a new key to maintain forward and backward secrecy. In this paper, we propose a new group key management schemes namely a Hierarchical, Simple, Efficient and Scalable Group Key (HSESGK based on clustering management scheme for MANETs and different other schemes are classified. Group members deduce the group key in a distributed manner.

  7. Energy Aware Routing Scheme for Mobile Ad Hoc Network Using Variable Range Transmission

    Pinki Nayak

    2012-08-01

    Full Text Available A Mobile Ad hoc Network is a collection of mobile n odes that dynamically forms networks temporarily without the need for any pre-existing infrastructur e. Today, one of the main issues in MANETs is the development of energy efficient protocols due to li mited bandwidth and battery life. The nodes in MANETs operate by a battery source which has limite d energy reservoir. Power failure of a node affects the node’s ability to forward packets on behalf of others, thus reducing the network lifetime. The conventional MANET routing protocols s. a. DSR and AODV use common transmission range for transfer of data and does not consider energy statu s of nodes. This paper discusses a new energy aware routing (EAR scheme which uses variable transmissi on range. The protocol has been incorporated along with the route discovery procedure of AODV as a cas e study. Both the protocols are simulated using Network Simulator-2 and comparisons are made to ana lyze their performance based on energy consumption, network lifetime and number of alive n odes metrics for different network scenarios. The results show that EAR makes effective node energy u tilization.

  8. An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

    Iyengar, N Ch Sriman Narayana; Nagar, Piyush; Sharma, Siddharth; Atrey, Akshay; 10.5121/ijcnc.2010.2303

    2010-01-01

    Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by vari...

  9. Impact of Vehicle Mobility on Performance of Vehicular Ad Hoc Network IEEE 1609.4

    M. Ahyar

    2014-01-01

    Full Text Available Vehicular Ad hoc Network (VANET is a new communications system for moving vehicles at high speed, which are equipped with wireless communication devices, together with additional wireless roadside units, enabling communications among nearby vehicles (vehicle-to-vehicle communication as well as between vehicles and nearby fixed equipment (vehicle-to-infrastructure communication. Inter-vehicular communications aim to improve road traffic safety and provide multimedia services. VANET has become an important communication infrastructure for the Intelligent Transportation System (ITS. In this work we have studied the impact of vehicle mobility on the quality of service in VANET based on IEEE 1609.4. The performance of this network is evaluated through exhaustive simulations using the VanetMobiSim and Network Simulator-NS2 under different parameters like delay, packet delivery ratio, packet loss and throughput. The simulation results are obtained when vehicles are moving according to a freeway mobility model is significantly different from results based on Manhattan model. When the Manhattan model is used, there is an increase in the average end-to-end delay and packet loss.

  10. Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

    Michael D. Colagrosso

    2006-11-01

    Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

  11. Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

    Colagrosso Michael D

    2007-01-01

    Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

  12. QoS Support in TDMA-Based Mobile Ad Hoc Networks

    Imad Jawhar; Jie Wu

    2005-01-01

    Mobile ad hoc networks (MANETs) are gaining a lot of attention in research lately due to their importance in enabling mobile wireless nodes to communicate without any existing wired or predetermined infrastructures. Furthermore,in order to support the growing need for multimedia and realtime applications, quality of service (QoS) support by the networking protocol is required. Several important QoS parameters that are needed by such applications can be identified.They include bandwidth, end-to-end delay, delay jitter, and bit error rate. A good amount of research has been developed in this area covering different issues and challenges such as developing routing protocols that support bandwidth reservation and delay management. In this paper, the current state of research for QoS support in TDMA-based MANETs at different layers of the networking model is presented and categorized. In addition, the current issues and future challenges involved in this exciting area of research are also included.

  13. FRCA: A Fuzzy Relevance-Based Cluster Head Selection Algorithm for Wireless Mobile Ad-Hoc Sensor Networks

    Taegwon Jeong

    2011-05-01

    Full Text Available Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP, the Weighted-based Adaptive Clustering Algorithm (WACA, and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM. The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms.

  14. FRCA: a fuzzy relevance-based cluster head selection algorithm for wireless mobile ad-hoc sensor networks.

    Lee, Chongdeuk; Jeong, Taegwon

    2011-01-01

    Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA) to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP), the Weighted-based Adaptive Clustering Algorithm (WACA), and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM). The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms. PMID:22163905

  15. Mitigate DoS and DDoS attacks in Mobile Ad Hoc Networks

    Michalas, Antonis; Komninos, Nikos; Prasad, Neeli R.

    2011-01-01

    This paper proposes a technique to defeat Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks in Ad Hoc Networks. The technique is divided into two main parts and with game theory and cryptographic puzzles. Introduced first is a new client puzzle to prevent DoS attacks in such...... networks. The second part presents a multiplayer game that takes place between the nodes of an ad hoc network and based on fundamental principles of game theory. By combining computational problems with puzzles, improvement occurs in the efficiency and latency of the communicating nodes and resistance in...

  16. A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in a Mobile Ad Hoc Network

    Jaydip Sen

    2010-01-01

    In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of any clear lines of defense. Most of the currently existing security algorithms designed for these networks are insecure, in efficient, and have low detection a...

  17. Analysis of DDoS Attack Effect and Protection Scheme in Wireless Mobile Ad-hoc Network

    Ramratan Ahirwal

    2012-06-01

    Full Text Available In Wireless mobile Ad Hoc Networks (MANET every node functions as transmitter, router and data sink is network without infrastructure. Detecting malicious nodes in an open ad-hoc network in whichparticipating nodes have no previous security associations presents a number of challenges not faced by traditional wired networks. Traffic monitoring in wired networks is usually performed at switches,routers and gateways, but an ad-hoc network does not have these types of network elements where the Intrusion Detection System (IDS can collect and analyse audit data for the entire network. A number ofneighbour-monitoring, trust-building, and cluster-based voting schemes have been proposed in the research to enable the detection and reporting of malicious activity in ad-hoc networks. The resourcesconsumed by ad-hoc network member nodes to monitor, detect, report, and diagnose malicious activity, however, may be greater than simply rerouting packets through a different available path. In this paperwe are trying to protect our network from distributed denial of service attack (DDOS, In this paper we present method for determining intrusion or misbehave in MANET using intrusion detection system and protect the network from distributed denial of service (DDOS and analysis the result on the bases of actual TCP flow monitoring, routing load ,packet delivery ratio and average end-to-end delay in normal , DDOS attack and IDS time .

  18. Security Challenges Related to Routing in Mobile Ad hoc Networks (MANET and Proposed Solutions

    J. Rajeshwar

    2012-11-01

    Full Text Available A freely roaming nodes forming as a group of network for effective communication is called Mobile Ad hoc Networks (MANET. In MANET nodes have the liberty of moving around the network with no defensive boundaries and often nodes join and leave the network as per their need due to this nature MANET’s are insecure. In this insecure environment Routing is a critical aspect which must be done properly for secure and reliable delivery of a data and communication. In order to have a secure system we need design a system which provides security to the mechanism of routing i.e. Route Discovery in a efficient way, Route maintenance with less cost and there should be secure Packet forwarding/delivery. In this paper we are trying to study the mechanism of routing as well as various attacks on functionality of routing. We are also studying different solutions to the various attacks on the routing mechanism of MANET and try to propose a best solution

  19. Securing Mobile Ad-Hoc Networks Against Jamming Attacks Through Unified Security Mechanism

    Arif Sari

    2012-06-01

    Full Text Available The varieties of studies in the literature have been addressed by the researchers to solve security dilemmas of Mobile Ad-Hoc Networks (MANET. Due to the wireless nature of the channel and specific characteristics of MANETs, the radio interference attacks cannot be defeated through conventional security mechanisms. An adversary can easily override its medium access control protocol (MAC and continually transfer packages on the network channel. The authorized nodes keep sending Request-toSend (RTS frames to the access point node in order to access to shared medium and start data transfer. However, due to jamming attacks on the network, the access point node cannot assign authorization access to shared medium. These attacks cause a significant decrease on overall network throughput, packet transmission rates and delay on the MAC layer since other nodes back-off from the communication. The proposed method applied for preventing and mitigating jamming attacks is implemented at the MAC layer that consist of a combination of different coordination mechanisms. These are a combination of Point Controller Functions (PCF that are used to coordinate entire network activities at the MAC layer and RTS/CTS (Clear-To-Send mechanisms which is a handshaking process that minimizes the occurrence of collisions on the wireless network. The entire network performance and mechanism is simulated through OPNET simulation application.

  20. Intelligent Routing Techniques for Mobile Ad hoc Networks using Swarm Intelligence

    P. Suresh Varma

    2012-12-01

    Full Text Available A Mobile Ad hoc Network (MANET is a collection of autonomous self-organized nodes. They use wireless medium for communication, thus two nodes can communicate directly if and only if they are within each other’s transmission radius in a multi-hop fashion. Many conventional routing algorithms have been proposed for MANETs. An emerging area that has recently captured much attention in network routing researches is Swarm Intelligence (SI. Besides conventional approaches, many new researches have proposed the adoption of Swarm Intelligence for MANET routing. Swarm Intelligence (SI refers to complex behaviors that arise from very simple individual behaviors and interactions, which is often observed in nature, especially among social insects such as ants, bees, fishes etc. Although each individual has little intelligence and simply follows basic rules using local information obtained from the environment. Ants routing resembles basic mechanisms from distributed Swarm Intelligence (SI in biological systems and turns out to become an interesting solution where routing is a problem. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence (SI based algorithms were proposed by researchers. In this paper, we study bio-inspired routing protocols for MANETs.

  1. A Novel Multiple Access Protocol for Mobile Ad Hoc Network with Smart Antennas

    YANGJun; LIJiandong; ZHOUXiaodong

    2004-01-01

    The approach to employ smart antennas in Mobile ad hoc network (MANET) nodes is presented. An adaptive beamforming-Carrier-Sense multiple access/collison avoidance) (ABF-CSMA/CA) protocol is proposed. In the ABF-CSMA/CA, Request-to-Send/Clear-to-Send (RTS/CTS) dialogue is used to distribute channel reservation information. Training sequences are transmitted just before RTS and CTS packets, so the Temporal reference beamforming (TRB) can be performed by the source node and the destination node.An improved virtual carrier-sense mechanism is also proposed to enhance Collision avoidance (CA) and obtain efficient Space division multiple access (SDMA). In this scheme, every node has two kinds of Network allocation vector (NAV): an oNAV maintains the interval of ongoing transmission of neighbors whose smart antennas operate in omnidirectional mode, and multiple bNAVs maintain those intervals of neighbors whose smart antennas operate in beamforming mode. Theoretical analysis of channel utilization of the proposed protocol is presented. Results show that ABF-CSMA/CA protocol combining with smart antennas can provide higher channel utilization.

  2. A System of Umpires for Security of Wireless Mobile Ad Hoc Network

    Ayyaswamy Kathirvel

    2010-06-01

    Full Text Available A mobile ad hoc network (MANET is a self-created self-organized and self-administering set of nodes connectedvia wireless links without the aid of any fixed infrastructure or centralized administrator. Protecting the network layer frommalicious attacks is an important and challenging issue in both wired and wireless networks and the issue becomes even morechallenging in the case of MANET. In this paper we propose a solution of umpiring system (US that provides security forrouting and data forwarding operations. Umpiring system consist of three models, are single umpiring system (SUS, doubleumpiring system (DUS, and triple umpiring system (TUS. In our system each node in the path from source to destination hasdual roles to perform: packet forwarding and umpiring.US does not apply any cryptographic techniques on the routing andpacket forwarding message. In the umpiring role, each node in the path closely monitors the behavior of its succeeding nodeand if any misbehavior is noticed immediately flags off the guilty node. For demonstration, we have implemented the umpiringsystem by modifying the popular AODV protocol.

  3. On-Line and Off-Line Security Measurement Framework for Mobile Ad Hoc Networks

    Reijo M. Savola

    2009-09-01

    Full Text Available We propose an integrated security measurement architecture and framework for a dynamic self-organizing monitoring system based on mobile ad hoc networks (MANETs, structured according to currently known security challenges. The aim is to predict, as well as to monitor, the security performance, concentrating on the principal effects contributing to it. We introduce an on-thefly security level estimation mechanism for MANETs. The mechanism can be used to support node-level, network segment-level and network-level decision making. At the node level, it is possible to constantly estimate the security level when choosing applications and communication mechanisms. At the network level, democratic voting among independent estimates originating from different nodes is used to increase the level of security. Furthermore, we introduce a generic security evaluation framework based on definition and decomposition of security requirements, behaviour modelling, evidence collection, and decision making. The goal of the decision making process is to make an assessment of and form conclusions about the information security level or performance of the system under investigation.

  4. A Selection Region Based Routing Protocol for Random Mobile ad hoc Networks

    Li, Di; Chen, Changhai; Cui, Shuguang

    2010-01-01

    We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the nearest node to the transmitter that is located within the selection region. By assuming that the relay nodes are randomly placed, we derive an upper bound for the optimum reference distance to maximize the expected density of progress and investigate the relationship between the optimum selection angle and the optimum reference distance. We also note that the optimized expected density of progress scales as $\\Theta(\\sqrt{\\lambda})$, which matches the prior results in the literature. Compared with the spatial-reuse multi-hop protocol in \\cite{Baccelli:Aloha} recently proposed by Baccelli \\emph{et al.}, in our new protocol the amount of nodes involved and the calculation complexity for each relay selection are reduced significantly, which is attractive for energy-limited wirele...

  5. An Optimal Spectrum Handoff Scheme for Cognitive Radio Mobile Ad Hoc Networks

    DUAN, J.

    2011-08-01

    Full Text Available Spectrum handoff procedures occur when the primary users appear in the licensed band temporary occupied by the cognitive radio (CR users and aim to help the CR users to vacate the spectrum rapidly and find available channel to resume the transmission. However, a spectrum handoff scheme that comprehensively considers channel selection, handoff decision as well as space domain handoff is yet undeveloped. In this paper we present a complete optimal spectrum handoff scheme for cognitive radio mobile ad hoc networks. First, we design a spectrum selection mechanism to allow CR users optimally choose the appropriate channel. The spectrum idleness prediction algorithm is utilized based on developing a cooperative spectrum searching approach. Through combining the estimated transmission time, the PU appearance probability and the mean spectrum availability time are integrated to develop the optimal spectrum handoff scheme. Moreover, as one part of the proposed scheme, a geo-location approach is utilized to deal with the space domain handoff. The complete scheme is evaluated through a comprehensive simulation study, and results reveal significant improvements in handoff times and transmission efficiency over conventional approaches.

  6. Adaptive Control Parameters for Dispersal of Multi-Agent Mobile Ad Hoc Network (MANET) Swarms

    Kurt Derr; Milos Manic

    2013-11-01

    A mobile ad hoc network is a collection of independent nodes that communicate wirelessly with one another. This paper investigates nodes that are swarm robots with communications and sensing capabilities. Each robot in the swarm may operate in a distributed and decentralized manner to achieve some goal. This paper presents a novel approach to dynamically adapting control parameters to achieve mesh configuration stability. The presented approach to robot interaction is based on spring force laws (attraction and repulsion laws) to create near-optimal mesh like configurations. In prior work, we presented the extended virtual spring mesh (EVSM) algorithm for the dispersion of robot swarms. This paper extends the EVSM framework by providing the first known study on the effects of adaptive versus static control parameters on robot swarm stability. The EVSM algorithm provides the following novelties: 1) improved performance with adaptive control parameters and 2) accelerated convergence with high formation effectiveness. Simulation results show that 120 robots reach convergence using adaptive control parameters more than twice as fast as with static control parameters in a multiple obstacle environment.

  7. A Policy Based Scheme for Combined Data Security in Mobile Ad hoc Networks

    S. K. Srivatsa

    2012-01-01

    Full Text Available Problem statement: In Mobile Ad hoc Networks (MANET routing protocols, we require a network-level or link layer security. Since without appropriate security provisions, the MANETs is subjected to attacks like network traffic, replay transmissions, manipulate packet headers and redirect routing messages. In order to address these needs, a policy based network management system that provides the capability to express network requirements is required. Approach: In this study, we propose a policy based scheme for combined data security which focuses mainly on three policies: Integrity, authentication and Confidentiality. For providing security not only to data, but also for routing information, we calculate the trust indexes of the nodes and the route is selected according to the trust value which improves integrity. Then in order to provide authentication, we propose a Distributed Certificate Authority (DCA technique in which multiple DCA is required to construct a certificate. Next we propose an RSA based novel encryption mechanism in order to provide Confidentiality among the nodes. Thus, the desired level of security is provided by the system based on the policy of the user by executing the corresponding security modules. Results: By simulation results, we show that this scheme provides a combined data security in MANETs and can be used efficiently. Conclusion: Our proposed combined data security policy provides complete protection for the data in MANET communications.

  8. A Combined Solution for Routing and Medium Access Control Layer Attacks in Mobile Ad Hoc Networks

    R. Murugan

    2010-01-01

    Full Text Available Problem statement: In Mobile Ad hoc Network (MANET, both the routing layer and the Medium Access Control (MAC layer are vulnerable to several attacks. There are very few techniques to detect and isolate the attacks of both these layers simultaneously. In this study, we developed a combined solution for routing and MAC layer attacks. Approach: Our approach, makes use of three techniques simultaneously which consists of a cumulative frequency based detection technique for detecting MAC layers attacks, data forwarding behavior based detection technique for detecting packet drops and message authentication code based technique for packet modification. Results: Our combined solution presents a reputation value for detecting the malicious nodes and isolates them from further network participation till its revocation. Our approach periodically checks all nodes, including the isolated nodes, at regular time period λ. A node which recovers from its misbehaving condition is revoked to its normal condition after the time period λ. Conclusion/Recommendations: By simulation results, we show that our combined solution provides more security by increased packet delivery ratio and reduced packet drops. We also shown that our approach has less overhead compared to the existing technique.

  9. A MODEL FOR CONGESTION CONTROL OF TRANSMISSION CONTROL PROTOCOL IN MOBILE WIRELESS AD HOC NETWORKS

    Adib M. Monzer Habbal

    2013-01-01

    Full Text Available Transmission Control Protocol (TCP is a fundamental protocol in the TCP/IP Protocol Suite.TCP was well designed and optimized to work over wired networks where most packet loss occurs due to network congestion. In theory, TCP should not care whether it is running over wired networks, WLANs, or Mobile Ad hoc Networks (MANETs. In practice, it does matter because most TCP deployments have been carefully designed based on the assumption that congestion is the main factor of network instability. However, MANETs have other dominating factors that cause network instability. Forgetting the impact of these factors violates some design principles of TCP congestion control and open questions for future research to address. This study aims to introduce a model that shows the impact of MANET factors on TCP congestion control. To achieve this aim, Design Research Methodology (DRM proposed by BLESSING was used as a guide to present this model. The proposed model describes the existing situation of TCP congestion control. Furthermore, it points to the factors that are most suitable to be addressed by researchers in order to improve TCP performance. This research proposes a novel model to present the impact of MANET factors on TCP congestion control. The model is expected to serve as a benchmark for any intended improvement and enhancement of TCP congestion control over MANET.

  10. A New Dynamic Route Discovery Mechanism for Mobile Ad Hoc Networks

    Humaira Nishat

    2012-11-01

    Full Text Available Nodes in a mobile ad hoc network have limited battery power for their operation. Energy efficient routing protocol such as Min-Max Battery Cost Routing (MMBCR selects a path with nodes having maximum battery capacity for transmission of data packets from source to destination. Though MMBCR considers individual node battery power during route discovery process, the route selected does not change unless any node in that route is exhausted completely resulting in link failure. This paper proposes a new dynamic route discovery mechanism which adapts a new route periodically resulting in decreasing the probability of link failure and increasing the lifetime of the network. The proposed routing protocol is named Dynamic Route Discovery (DRD protocol. In this DRD protocol, the energy and cost function of each node is computed periodically by initializing route discovery process at regular intervals. Simulation results show that the proposed algorithm not only increases the lifetime of the network but also gives better throughput, packet delivery ratio and delay performance at the cost of increased routing overhead and normalized routing load compared to the existing MMBCR protocol.

  11. Delay-dependent asymptotic stability of mobile ad-hoc networks: A descriptor system approach

    In order to analyze the capacity stability of the time-varying-propagation and delay-dependent of mobile ad-hoc networks (MANETs), in this paper, a novel approach is proposed to explore the capacity asymptotic stability for the delay-dependent of MANETs based on non-cooperative game theory, where the delay-dependent conditions are explicitly taken into consideration. This approach is based on the Lyapunov—Krasovskii stability theory for functional differential equations and the linear matrix inequality (LMI) technique. A corresponding Lyapunov—Krasovskii functional is introduced for the stability analysis of this system with use of the descriptor and “neutral-type” model transformation without producing any additional dynamics. The delay-dependent stability criteria are derived for this system. Conditions are given in terms of linear matrix inequalities, and for the first time referred to neutral systems with the time-varying propagation and delay-dependent stability for capacity analysis of MANETs. The proposed criteria are less conservative since they are based on an equivalent model transformation. Furthermore, we also provide an effective and efficient iterative algorithm to solve the constrained stability control model. Simulation experiments have verified the effectiveness and efficiency of our algorithm. (general)

  12. A Study on Contributory Group Key Agreements for Mobile Ad Hoc Networks

    CH. V. Raghavendran

    2013-04-01

    Full Text Available Wireless networks, in particular Mobile Ad hoc Networks (MANETs have revolutionized the field of networking with increasing number of their commercial and military applications. Security on the other hand, is now an essential requirement for these applications. However, the limitations of the dynamic, infrastructure-less nature of MANETs impose major difficulties in establishing a secure framework suitable for such services. Security for MANETs is a dynamic area of research. Most of the traditional routing protocols proposed for MANETs are focused on routing only not on the security aspects. As in traditional wired networks, wireless networks also require security. Unlike the wired networks, where dedicated routers, servers control the network, in MANETs nodes act both as terminals and also as routers for other nodes. A popular mechanism to satisfy the security requirements is the Group Key Management in which the group key is to be shared by each group communication participant. But to establish and manage the group key efficiently imposes new challenges – especially in infrastructure less MANETs. The basic needs of such networks require that the group key schemes must demonstrate not only high performance but also fault-tolerance.

  13. A Threshold-Adaptive Reputation System on Mobile Ad Hoc Networks

    Tsai, Hsiao-Chien; Lo, Nai-Wei; Wu, Tzong-Chen

    In recent years huge potential benefits from novel applications in mobile ad hoc networks (MANET) have been discussed extensively. However, without robust security mechanisms and systems to provide safety shell through the MANET infrastructure, MANET applications can be vulnerable and hammered by malicious attackers easily. In order to detect misbehaved message routing and identify malicious attackers in MANET, schemes based on reputation concept have shown their advantages in this area in terms of good scalability and simple threshold-based detection strategy. We observed that previous reputation schemes generally use predefined thresholds which do not take into account the effect of behavior dynamics between nodes in a period of time. In this paper, we propose a Threshold-Adaptive Reputation System (TARS) to overcome the shortcomings of static threshold strategy and improve the overall MANET performance under misbehaved routing attack. A fuzzy-based inference engine is introduced to evaluate the trustiness of a node's one-hop neighbors. Malicious nodes whose trust values are lower than the adaptive threshold, will be detected and filtered out by their honest neighbors during trustiness evaluation process. The results of network simulation show that the TARS outperforms other compared schemes under security attacks in most cases and at the same time reduces the decrease of total packet delivery ratio by 67% in comparison with MANET without reputation system.

  14. Probabilistic Modelling of Information Propagation in Wireless Mobile Ad-Hoc Network

    Schiøler, Henrik; Hansen, Martin Bøgsted; Schwefel, Hans-Peter

    2005-01-01

    In this paper the dynamics of broadcasting wireless ad-hoc networks is studied through probabilistic modelling. A randomized transmission discipline is assumed in accordance with existing MAC definitions such as WLAN with Decentralized Coordination or IEEE-802.15.4. Message reception is assumed to...

  15. Investigating on Mobile Ad-Hoc Network to Transfer FTP Application

    Ako Muhammad Abdullah

    2015-07-01

    Full Text Available Mobile Ad-hoc Network (MANET is the collection of mobile nodes without requiring of any infrastructure. Mobile nodes in MANET are operating as a router and MANET network topology can change quickly. Due to nodes in the network are mobile and thus can move randomly and organize arbitrarily regardless of the directions that generate great complexity in routing traffic from source to destination. To communicate with other nodes MANET nodes contain multiple applications and it needs the different level of data traffic. While data communicate different routing protocols require whereas every node must act as a router. Nowadays, different routing protocols have available for MANET. MANET protocols designed and implemented at the network layer have vital roles that affect the application running at the application layer. In this paper, the performance of On Demand Distance Vector (AODV, Dynamic Source Routing (DSR and Geographic Routing Protocol (GRP will be evaluated. The main purpose of this research is to analyze the performance of MANET routing protocols to identify “Which routing protocol has ability to provide the best performance to transfer FTP Application in high mobility case under low, medium and high density scenario?”. The performance analyze with respect to Average End-to-End Delay, Media Access Delay, Network Load, Retransmission Attempt and Throughput. All simulations have been done using OPNET. On the basis of results show that the GRP gives better performance in End-to-End Delay, Media Access Delay, and Retransmission Attempt when varying network size and provide the best Throughput in small and medium network size. Simulation results verify that AODV gives better Throughput in a large network and lower Network Load in small and medium network size compared to GRP. DSR produces low Average Network load as compared to other protocols. The overall study of the FTP application shows that the performance of theses routing protocols

  16. A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense Mobile Ad Hoc Networks

    Baisakh

    2013-06-01

    Full Text Available A research work without considering the power const raint cannot be conceded a fine contribution toward s Mobile Ad Hoc Networks (MANET. As MANET comes into action for some special purpose, but its fugacity sometimes result degrades in network perfo rmance. Although the many prominent features of MANET like mobility, dynamic change in topology, mu lti radio relaying, quickly lay down the network without depending upon fixed infrastructures and ma ny more provides tremendous flexibilities for the end user but challenges like limited power constraint, reliable data communication, band width utilization , network performance and throughput are still neede d to be handle very sensibly. As limited battery po wer and inefficient routing protocol mechanism are high prone to network partition, in such case the netwo rk needs to be established more than once. Because com munication establishment involves many costly operations like route discovery and route maintenan ce. The more the network partition the more the pac ket drops and packet loss which indeed requires a numbe r of retransmission of packets, consuming network bandwidth as well as depleting battery power of ind ividual nodes with a higher rate, which are the maj or destructive elements in network performance degrada tion as well as the major cause of reducing individ ual node’s life time and network life time. So with al l caveat in mind, we have proposed a novel Grid Based Dynamic Energy Efficient Routing (GBDEER approach which is aimed to construct an energy eff icient path from source to destination based on grid area, where each grid will have three deferent levels of transmission power. Every grid will have its own grid supervisor node who will take the responsibility during data communication, especially when the data is been passed through that specific grid. And keeping the dynamic nature of MANET in mind, we ha ve also provide the feature of grid subordinate node , who will take

  17. Trust Based Scheme for QoS Assurance in Mobile Ad-Hoc Networks

    Sridhar Subramanian

    2012-02-01

    Full Text Available A mobile ad-hoc network (MANET is a peer-to-peer wireless network where nodes can communicate with each other without the use of infrastructure such as access points or base stations. These networks are self-configuring, capable of self-directed operation and hastily deployable. Nodes cooperate to provide connectivity, operates without centralized administration. Nodes are itinerant, topology can be very dynamic and nodes must be able to relay traffic since communicating nodes might be out of range. The dynamic nature of MANET makes network open to attacks and unreliability. Routing is always the most significant part for any networks. Each node should not only work for itself, but should be cooperative with other nodes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET. The Qos parameters like PDR, throughput and delay are affected directly due to such misbehaving nodes. We focus on trust management framework, which is intended to cope with misbehaviour problem of node and increase the performance of MANETs. A trust-based system can be used to track this misbehaving of nodes, spot them and isolate them from routing and provide reliability. In this paper a Trust Based Reliable AODV [TBRAODV] protocol is presented which implements a trust value for each node. For every node trust value is calculated and based trust valuenodes are allowed to participate in routing or else identified to become a misbehaving node. This enhances reliability in AODV routing and results in increase of PDR, decrease in delay and throughput is maintained. This work is implemented and simulated on NS-2. Based on simulation results, the proposed protocol provides more consistent and reliable data transfer compared with general AODV, if there are misbehaving nodes in the MANET.

  18. Two-terminal reliability of a mobile ad hoc network under the asymptotic spatial distribution of the random waypoint model

    The random waypoint (RWP) mobility model is frequently used in describing the movement pattern of mobile users in a mobile ad hoc network (MANET). As the asymptotic spatial distribution of nodes under a RWP model exhibits central tendency, the two-terminal reliability of the MANET is investigated as a function of the source node location. In particular, analytical expressions for one and two hop connectivities are developed as well as an efficient simulation methodology for two-terminal reliability. A study is then performed to assess the effect of nodal density and network topology on network reliability.

  19. A NEW CLUSTER-BASED WORMHOLE INTRUSION DETECTION ALGORITHM FOR MOBILE AD-HOC NETWORKS

    Debdutta Barman Roy; Rituparna Chaki; Nabendu Chaki

    2009-01-01

    In multi-hop wireless systems, the need for cooperation among nodes to relay each other's packets exposes them to a wide range of security attacks. A particularly devastating attack is the wormhole attack, where a malicious node records control traffic at one location and tunnels it to another compromised node, possibly far away, which replays it locally. Routing security in ad hoc networks is often equated with strong and feasible node authentication and lightweight cryptography. Unfortunate...

  20. VoIP Implementation and Experiments on a Mobile Wireless AdHoc Network

    Zhang, Hongqi; Yang, Oliver; Zhao, Jiying

    We have implemented a testbed to study the performance of VoIP in wireless ad hoc networks. The ASNC (Adaptive Source Network-rate Control) scheme is used to battle packet loss by feeding MOS (Mean Opinion Score) and loss information back to the sender. Our different VoIP experiments with measurements on delay, packet loss rate and MOS have validated the feasibility and efficiency of our scheme. It further verifies the simulator we used in the initial investigation.

  1. Hierarchical Location Service with Prediction in Mobile Ad-Hoc Networks

    Ebtisam Amar; Selma Boumerdassi; Éric Renault

    2010-01-01

    Position-based routing protocols take advantage of location information to perform a stateless and efficient routing. To enable position-based routing, a node must be able to discover the location of the messages' destination node. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks. In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the en...

  2. Wireless Ad Hoc Networks

    Hong-Chuan Yang

    2007-01-01

    Full Text Available We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

  3. A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in a Mobile Ad Hoc Network

    Sen, Jaydip

    2010-01-01

    In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of any clear lines of defense. Most of the currently existing security algorithms designed for these networks are insecure, in efficient, and have low detection accuracy for nodes' misbehaviour. In this paper, a new approach has been proposed to bring out the complementary relationship between key distribution and misbehaviour detection for developing an integrated security solution for MANETs. The redundancy of routing information in ad hoc networks is utilized to develop a highly reliable protocol that works even in presence of transient network partitioning and Byzantine failure of nodes. The proposed mechanism is fully co-operative, and thus it is more robust as the vulnerabil...

  4. A Reliability-based Framework for Multi-path Routing Analysis in Mobile Ad-Hoc Networks

    Caleffi, Marcello; Paura, Luigi

    2008-01-01

    Unlike traditional routing procedures that, at the best, single out a unique route, multi-path routing protocols discover proactively several alternative routes. It has been recognized that multi-path routing can be more efficient than traditional one mainly for mobile ad hoc networks, where route failure events are frequent. Most studies in the area of multi-path routing focus on heuristic methods, and the performances of these strategies are commonly evaluated by numerical simulations. The need of a theoretical analysis motivates such a paper, which proposes to resort to the terminal-pair routing reliability as performance metric. This metric allows one to assess the performance gain due to the availability of route diversity. By resorting to graph theory, we propose an analytical framework to evaluate the tolerance of multi-path route discovery processes against route failures for mobile ad hoc networks. Moreover, we derive a useful bound to easily estimate the performance improvements achieved by multi-pa...

  5. Energy Aware Reliable Routing Protocol (EARRP) for Mobile AdHoc Networks Using Bee Foraging Behavior and Ant Colony Optimization

    K. G. Santhiya; Arumugam, N.

    2012-01-01

    Energy aware reliable routing in mobile ad hoc networks is an astonishing task and in this paper we propose to design, develop such protocol which will be a good solution. For developing such protocol EARRP, two swarm intelligence techniques are involved namely ant colony optimization and bee colony foraging behavior. For optimization, we proposed adaptive solutions in order to estimate MAC overhead, link eminence and residual energy. After estimating the above said metrics, the fitness funct...

  6. Mobility Based Key Management Technique for Multicast Security in Mobile Ad Hoc Networks

    B. Madhusudhanan

    2015-01-01

    Full Text Available In MANET multicasting, forward and backward secrecy result in increased packet drop rate owing to mobility. Frequent rekeying causes large message overhead which increases energy consumption and end-to-end delay. Particularly, the prevailing group key management techniques cause frequent mobility and disconnections. So there is a need to design a multicast key management technique to overcome these problems. In this paper, we propose the mobility based key management technique for multicast security in MANET. Initially, the nodes are categorized according to their stability index which is estimated based on the link availability and mobility. A multicast tree is constructed such that for every weak node, there is a strong parent node. A session key-based encryption technique is utilized to transmit a multicast data. The rekeying process is performed periodically by the initiator node. The rekeying interval is fixed depending on the node category so that this technique greatly minimizes the rekeying overhead. By simulation results, we show that our proposed approach reduces the packet drop rate and improves the data confidentiality.

  7. Mobility Based Key Management Technique for Multicast Security in Mobile Ad Hoc Networks

    Madhusudhanan, B.; Chitra, S.; Rajan, C.

    2015-01-01

    In MANET multicasting, forward and backward secrecy result in increased packet drop rate owing to mobility. Frequent rekeying causes large message overhead which increases energy consumption and end-to-end delay. Particularly, the prevailing group key management techniques cause frequent mobility and disconnections. So there is a need to design a multicast key management technique to overcome these problems. In this paper, we propose the mobility based key management technique for multicast security in MANET. Initially, the nodes are categorized according to their stability index which is estimated based on the link availability and mobility. A multicast tree is constructed such that for every weak node, there is a strong parent node. A session key-based encryption technique is utilized to transmit a multicast data. The rekeying process is performed periodically by the initiator node. The rekeying interval is fixed depending on the node category so that this technique greatly minimizes the rekeying overhead. By simulation results, we show that our proposed approach reduces the packet drop rate and improves the data confidentiality. PMID:25834838

  8. Performance Evaluation of Mobile Ad Hoc Network Based Communications for Future Mobile Tele-Emergency System

    Viswacheda, D. V.; Barukang, L.; Hamid, M. Y.; Arifianto, M. S.

    Sparked by awareness of the limitations to provide medical services in remote areas, researchers have perceived that developing telemedicine systems is inevitable. In most cases very remote areas and disaster struck areas lack telecommunication infrastructure. Telemedicine system operating in such areas must have advanced wireless technology supporting it in devastating situation, hence it is called as tele-emergency system. Our approach is on MANET combined with Mobile IP and MIPV6, is the basis of infrastructure for the mobile tele-emergency system. The tele-emergency system requires data, voice and video transmission in its network. In this investigation, evaluation is based on simulation of the various ITU-T standard CODECs of VoIP and video transmission over MANET using discrete event simulator NS-2. The results of simulation showed that ITU-T G723.1 worked well in the MANET environment than the other CODECs for VoIP in fixed and mobility tele-emergency environments. From the simulation of video CODEC performance evaluation, it was observed that H.263 performed to a great extent in random small scale environment and also in multiple video flow of 57.6kbps speed video transmission.

  9. The Blue Game Project: Ad-hoc Multiplayer Mobile Game with Social Dimension

    Špánek, Roman; Pirkl, P.; Kovář, P.

    New York: ACM DL, 2007, s. 1-2. ISBN 978-1-59593-770-4. [CoNEXT'07. Annual Conference /3./ Student Workshop. New York (US), 10.12.2007-13.12.2007] R&D Projects: GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : ad-hoc network * wireless communication * social network Subject RIV: IN - Informatics, Computer Science http://www.sigcomm.org/co-next2007/papers/ http://portal.acm.org/browse_dl.cfm?linked=1&part=series&idx=SERIES11284&coll=ACM&dl=ACM&CFID=10924760&CFTOKEN=51539177

  10. Performance Analysis on Mobile Agent Based Congestion Control Using AODV Routing Protocol Technique with Hop by Hop Algorithm for Mobile Ad-hoc Network

    Vishnu Kumar Sharma

    2012-04-01

    Full Text Available In Mobile Ad hoc Networks (MANETs congestion occurs due to the packet loss and it can be successfully reduced by involving congestion control scheme which includes routing algorithm and a flow control at the network layer. In this paper, we propose to agent based congestion control technique for MANETs. In our technique, the information about network congestion is collected and distributed by mobile agents (MA A mobile agent based congestion control AODV routing protocol is proposed to avoid congestion in ad hoc network. Some mobile agents are added in ad hoc network, which carry routing information and nodes congestion status.When mobile agent travels through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node’s congestion status. With the aid of mobile agents, the nodes can get the dynamic network topology in time. By simulation results, we show that our proposed technique attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

  11. RTOS BASED SECURE SHORTEST PATH ROUTING ALGORITHM IN MOBILE AD- HOC NETWORKS

    R. Ramesh

    2011-07-01

    Full Text Available Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.

  12. RTOS Based Secure Shortest Path Routing Algorithm In Mobile Ad- Hoc Networks

    R. Ramesh

    2011-08-01

    Full Text Available Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.

  13. A New Cluster-based Wormhole Intrusion detection algorithm for Mobile Ad-Hoc Networks

    Roy, Debdutta Barman; Chaki, Nabendu

    2010-01-01

    In multi-hop wireless systems, the need for cooperation among nodes to relay each other's packets exposes them to a wide range of security attacks. A particularly devastating attack is the wormhole attack, where a malicious node records control traffic at one location and tunnels it to another compromised node, possibly far away, which replays it locally. Routing security in ad hoc networks is often equated with strong and feasible node authentication and lightweight cryptography. Unfortunately, the wormhole attack can hardly be defeated by crypto graphical measures, as wormhole attackers do not create separate packets. They simply replay packets already existing on the network, which pass the cryptographic checks. Existing works on wormhole detection have often focused on detection using specialized hardware, such as directional antennas, etc. In this paper, we present a cluster based counter-measure for the wormhole attack, that alleviates these drawbacks and efficiently mitigates the wormhole attack in MAN...

  14. Topology Control in Large-Scale High Dynamic Mobile Ad-Hoc Networks

    El-Habbal, Mohamed; Rückert, Ulrich; Witkowski, Ulf

    We present our contribution in projects related to ad-hoc networking using different routing protocols and hardware platforms, showing our results and new solutions regarding topology control and routing protocols. We mainly focus on our work in the GUARDIANS EU-project, where as a main disaster scenario a large industrial warehouse on fire is assumed. The paper presents the simulation results for the routing protocols ACR, DSR and EDSR, as well as the implementation of down-scaled demos for supporting the autonomous team of robots as well as the human squad team with robust communication coverage. Various hardware platforms were used in the demos for distance measurement, based on laser range finder and radio communication with time of flight analysis.

  15. Cooperative Reputation Index Based Selfish Node Detection and Prevention System for Mobile Ad hoc Networks

    Muhammad Arsalan Paracha

    2012-04-01

    Full Text Available In Ad hoc networks every node plays an important part in the transmission of packets from sender to receiver. Most of the time packet delivery ratio of these networks depends on the behavior of intermediate nodes. Sometimes these intermediate nodes cooperate and forward the packets of their neighbor and some time they simply drop their packets and cheat their neighbors. We present a solution that not only detect these selfish nodes but also punish these nodes so that they avoid such misbehavior in future. To this account, we use an agent “Neighbor Monitor”, running on every node, to monitor the traffic of neighbors and assign a value called “Reputation Index”, associated with each node, based on its behavior.

  16. Comparative Performance Analysis of AODV and AODV-MIMC Routing Protocols for Mobile Ad hoc Networks

    P.Periyasamy

    2014-05-01

    Full Text Available Bandwidth Scarcity is a major drawback in multi-hop ad hoc networks. When a single-interface single-channel (SISC approach is used for both incoming and outgoing traffic the bandwidth contention between nodes along the path has occurred as well as throughput is degraded. This drawback is overwhelmed by using MIMC approach as well as some of the Quality of Service (QoS requirements has been enhanced. In this paper we applied multi-interface muti-channel approach to AODV routing protocol, called AODV-MIMC routing protocol and its performance is compared with AODV routing protocol. The simulation results show the Network Life Time, Throughput, and Packet Delivery Ratio of AODV-MIMC routing protocol has been tremendously improved than the AODV routing protocol.

  17. A Simulation Study of a Location Service for Position-Based Routing in Mobile Ad Hoc Networks

    Käsemann, Michael; Hartenstein, Hannes; Füßler, Holger; Mauve, Martin

    2002-01-01

    Position-based routing in a mobile ad hoc network requires geographic addresses. Thus, a node that wants to send a packet to some target node has to know the target's (approximate) current position. In order to provide each node's position to the other network nodes, a distributed location service has to be used. J. Li et al. recently put forward a promising approach called the Grid Location Service' (GLS). In this paper we provide some analyses and evaluations of GLS by means of simulation w...

  18. Decentralized Self-Management of Trust for Mobile Ad Hoc Social Networks

    Juan Li

    2011-12-01

    Full Text Available The construction of social networks over mobile devices in the events or at locations has emerged as anew network paradigm. These new mobile social networks enable people to communicate and share theirexperiences without the need to have Internet access and with minimum required infrastructure.However, the functionality and security of such networks would be potentially undermined without aneffective trust management scheme. Although many trust management systems have been proposed, few ofthem can be applied to these new mobile social networks because of the unique network andcommunication characteristics. This paper presents a novel trust management system, termedMobileTrust, to establish decentralized, secure and reliable trust relationships between mobile ad hocsocial network participants. Specifically, the construction of trust models encompasses both scenariosthat users are experienced with the network and users are unacquainted with the environment. The trustmodels cover various important factors of trust relationships in social networks, including the similarityof user profile, reputation, and history of friendship. A set of simulations is conducted to evaluate oursystem deployed in a mobile social network in the presence of dishonest users.

  19. A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in a Mobile Ad Hoc Network

    Jaydip Sen

    2010-10-01

    Full Text Available In a multi-hop mobile ad hoc network (MANET mobile nodes communicate with each other forming acooperative radio network. Security remains a major challenge for these networks due to their features ofopen medium, dynamically changing topologies, reliance on cooperative algorithms, absence ofcentralized monitoring points, and lack of any clear lines of defense. Most of the currently existingsecurity algorithms designed for these networks are insecure, in efficient, and have low detectionaccuracy for nodes’ misbehaviour. In this paper, a new approach has been proposed to bring out thecomplementary relationship between key distribution and misbehaviour detection for developing anintegrated security solution for MANETs. The redundancy of routing information in ad hoc networks isutilized to develop a highly reliable protocol that works even in presence of transient networkpartitioning and Byzantine failure of nodes. The proposed mechanism is fully co-operative, and thus it ismore robust as the vulnerabilities of the election algorithms used for choosing the subset of nodes forcooperation are absent. Simulation results show the effectiveness of the proposed protocol.

  20. A NEW CLUSTER-BASED WORMHOLE INTRUSION DETECTION ALGORITHM FOR MOBILE AD-HOC NETWORKS

    Debdutta Barman Roy

    2009-04-01

    Full Text Available In multi-hop wireless systems, the need for cooperation among nodes to relay each other's packets exposes them to a wide range of security attacks. A particularly devastating attack is the wormhole attack, where a malicious node records control traffic at one location and tunnels it to another compromised node, possibly far away, which replays it locally. Routing security in ad hoc networks is often equated with strong and feasible node authentication and lightweight cryptography. Unfortunately, the wormhole attack can hardly be defeated by crypto graphical measures, as wormhole attackers do not create separate packets. They simply replay packets already existing on the network, which pass the cryptographic checks. Existing works on wormhole detection have often focused on detection using specialized hardware, such as directional antennas, etc. In this paper, we present a cluster based counter-measure for the wormhole attack, that alleviates these drawbacks and efficiently mitigates the wormhole attack in MANET. Simulation results on MATLab exhibit the effectiveness of the proposed algorithm in detecting wormhole attacks.

  1. A Survey of Vehicular Ad hoc Networks Routing Protocols

    Marwa Altayeb; Imad Mahgoub

    2013-01-01

    In recent years, the aspect of vehicular ad hoc network (VANET) is becoming an interesting research area; VANET is a mobile ad hoc network considered as a special case of mobile ad hoc network (MANET). Similar to MANET, VANET is characterized as autonomous and self-configured wireless network. However, VANET has very dynamic topology, large and variable network size, and constrained mobility; these characteristics led to the need for efficient routing and resource saving VANET protocols, to f...

  2. Implementing voice over Internet protocol in mobile ad hoc network – analysing its features regarding efficiency, reliability and security

    Naveed Ahmed Sheikh

    2014-05-01

    Full Text Available Providing secure and efficient real-time voice communication in mobile ad hoc network (MANET environment is a challenging problem. Voice over Internet protocol (VoIP has originally been developed over the past two decades for infrastructure-based networks. There are strict timing constraints for acceptable quality VoIP services, in addition to registration and discovery issues in VoIP end-points. In MANETs, ad hoc nature of networks and multi-hop wireless environment with significant packet loss and delays present formidable challenges to the implementation. Providing a secure real-time VoIP service on MANET is the main design objective of this paper. The authors have successfully developed a prototype system that establishes reliable and efficient VoIP communication and provides an extremely flexible method for voice communication in MANETs. The authors’ cooperative mesh-based MANET implementation can be used for rapidly deployable VoIP communication with survivable and efficient dynamic networking using open source software.

  3. Energy Aware Reliable Routing Protocol (EARRP for Mobile AdHoc Networks Using Bee Foraging Behavior and Ant Colony Optimization

    K.G.Santhiya

    2012-03-01

    Full Text Available Energy aware reliable routing in mobile ad hoc networks is an astonishing task and in this paper we propose to design, develop such protocol which will be a good solution. For developing such protocol EARRP, two swarm intelligence techniques are involved namely ant colony optimization and bee colony foraging behavior. For optimization, we proposed adaptive solutions in order to estimate MAC overhead, link eminence and residual energy. After estimating the above said metrics, the fitness function is derived out. The performance metrics taken are overhead, delay, packet delivery ratio and total energy consumed by nodes. By simulation results the proposed EARRP outperforms AODV by reducing energy consumption, overhead and delay. Also EARRP gains better packet delivery ratio than that of AODV.

  4. Monitoring and classifying animal behavior using ZigBee-based mobile ad hoc wireless sensor networks and artificial neural networks

    S. Nadimi, Esmaeil; Jørgensen, Rasmus Nyholm; Blanes-Vidal, Victoria;

    2012-01-01

    Animal welfare is an issue of great importance in modern food production systems. Because animal behavior provides reliable information about animal health and welfare, recent research has aimed at designing monitoring systems capable of measuring behavioral parameters and transforming them into...... their corresponding behavioral modes. However, network unreliability and high-energy consumption have limited the applicability of those systems. In this study, a 2.4-GHz ZigBee-based mobile ad hoc wireless sensor network (MANET) that is able to overcome those problems is presented. The designed MANET...... showed high communication reliability, low energy consumption and low packet loss rate (14.8%) due to the deployment of modern communication protocols (e.g. multi-hop communication and handshaking protocol). The measured behavioral parameters were transformed into the corresponding behavioral modes using...

  5. BEHAVIOUR OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS INVESTIGATED FOR EMERGENCY AND RESCUE SITUATION IN INDIA

    S.Sivagurunathan

    2016-02-01

    Full Text Available Mobile Ad hoc Networks are open, shared, dynamic and self-organized networks. These distinct nature lead to efficient use in emergency and recue scenarios where the sharing of information is necessary. In order to share information within the network, a proper routing protocol is required to establish routes between nodes. This article discusses which of the routing protocols such as reactive or proactive has better performance in such scenario. In order to implement the test bed, we choose a real area in Uttarakhand state, India where the disaster occurred recently hence so many civilizations had vanished due to lack of communication and failure in recovery. Our aim is to choose an optimum routing protocol that is correct and used for efficient route establishment between nodes so that message could be delivered on time without loss and it will be implemented and used in future based on the model that we propose.

  6. Self-Organized Public-Key Management for Mobile Ad Hoc Networks Based on a Bidirectional Trust Model

    2006-01-01

    In traditional networks ,the authentication is performed by certificate authoritys(CA),which can't be built in distributed mobile Ad Hoc Networks however. In this paper, we propose a fully self-organized public key management based on bidirectional trust model without any centralized authority that allows users to generate their public-private key pairs, to issue certificates, and the trust relation spreads rationally according to the truly human relations. In contrast with the traditional self-organized public-key management, the average certificates paths get more short,the authentication passing rate gets more high and the most important is that the bidirectional trust based model satisfys the trust requirement of hosts better.

  7. Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols

    Lundgren, Henrik

    2005-01-01

    A wireless ad hoc network consists of a number of mobile nodes that temporarily form a dynamic infrastructure-less network. New routing protocols that can adapt to the frequent topology changes induced by node mobility and varying link qualities are needed. During the last decade dozens of different ad hoc routing protocols have been proposed, optimized and partially compared, mainly through simulation studies. This thesis takes an experimental approach to the evaluation of ad hoc routing pro...

  8. Routing Security in Ad Hoc Wireless Networks

    Pervaiz, Mohammad O.; Cardei, Mihaela; Wu, Jie

    Wireless networks provide rapid, untethered access to information and computing, eliminating the barriers of distance, time, and location for many applications ranging from collaborative, distributed mobile computing to disaster recovery (such as fire, flood, earthquake), law enforcement (crowd control, search, and rescue), and military communications (command, control, surveillance, and reconnaissance). An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration [11

  9. Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaining Connectivity of Mobile Terminals Which Move from One to the Others

    Kohei Arai, Lipur Sugiyanta

    2011-08-01

    Full Text Available Wireless ad-hoc network is a special kind of network, where all of the nodesmove in time. The topology of the network changes as the nodes are in theproximity of each other. Ad-hoc networks are generally self-configuring no stableinfrastructure takes a place. In this network, each node should help relayingpackets of neighboring nodes using multi-hop routing mechanism. Thismechanism is needed to reach far destination nodes to solve problem of deadcommunication. This multiple traffic hops within a wireless ad-hoc networkcaused dilemma. Wireless ad-hoc network that contain multiple hops becomeincreasingly vulnerable to problems such as energy degradation and rapidincreasing of overhead packets. This paper provides a generic routing frameworkthat balances energy efficient broadcast schemes in Wireless Ad-Hoc Networkand maintaining connectivity of nodes (mobile terminals. Typically, each node’sactivities will consume energy, either for sending packets, receiving orpreparing/processing packets. Number of hops, distance of nodes, and size ofpacket will determine the consumption of energy. The framework is based on theprinciple that additional relay nodes with appropriate energy and routing metricbetween source and final destination significantly reduces the energyconsumption necessary to deliver packets in Wireless Ad-Hoc Network whilekeep the connectivity of dynamic nodes. Using the framework, the averagenetwork connectivity is kept 18% higher and the lifetime of network lasting morethan 2.38% compared with network with Link State Routing mechanism. Thesimulation notes that the end-to-end delay may increase rapidly if relay nodesare more than five.

  10. 移动Ad Hoc网络的入侵响应研究%Intrusion detection and response in mobile Ad Hoc network.

    赵跃华; 张崇

    2012-01-01

    传统网络中的入侵阻止和检测等防护方法在网络结构脆弱、节点移动的移动自组网络中无法达到预期效果.将移动代理引入无线自组网络中,设计分布式入侵检测响应系统,通过多种功能的移动代理实现入侵检测功能,并在入侵检测的基础上利用移动代理跟踪、隔离入侵节点,对入侵节点做出及时响应.实验结果表明此方法节省网络节点资源、避免网络的崩溃且达到主动响应隔离入侵节点的效果,有效地检测并阻止了入侵行为.%Many traditional security technologies such as intrusion prevention and intrusion detection are subject to restrictions in the network environment of mobile ad hoc networks can not achieve the desired results. This paper introduces mobile agents in wireless ad hoc network security model, designs a distributed intrusion detection and respond system. Through a variety of functions of mobile agent the system implements the functions of intrusion detection intrusion, and uses mobile agents to track, isolate invasion node to make a timely response. Experimental results show that this method can save the resources of node and avoid the collapse of the network, effective in detecting and preventing intrusions.

  11. Enabling Co-located Learning over Mobile Ad Hoc P2P with LightPeers

    Bent Guldbjerg Christensen; Mads Darø Kristensen; Frank Allan Hansen; Niels Olof Bouvin

    2008-01-01

    This paper presents LightPeers – a new mobile P2P framework specifically tailored for use in a nomadic learning environment. A set of key requirements for the framework is identified based on nomadic learning, and these requirements are used as outset for designing and implementing the architecture and protocols. The main contributions of the LightPeers framework are: a mobile P2P framework including a specialized robust messaging protocol resilient to changes in the network topology, an deve...

  12. Building Real-World Ad-Hoc Networks to Support Mobile Collaborative Applications: Lessons Learned

    Meseguer Pallarès, Roc; Ochoa, Sergio; Pino, José; Medina Medina, Esunly; Navarro Moldes, Leandro; Royo Vallés, María Dolores; Neyem, Andres

    2009-01-01

    Mobile collaboration is required in several work scenarios, i.e. education, healthcare, business and disaster relief. The features and capabilities of the communication infrastructure used by mobile collaborative applications will influence the type of coordination and collaboration that can be supported in real work scenarios. Developers of these applications are typically unaware of the constraints the communication infrastructure imposes on the collaborative system. There...

  13. Fundamental storage mechanisms for location based services in mobile ad hoc networks

    Dudkowski, Dominique

    2009-01-01

    The proliferation of mobile wireless communication technology has reached a considerable magnitude. As of 2009, a large fraction of the people in most industrial and emerging nations is equipped with mobile phones and other types of portable devices. Supported by trends in miniaturization and price decline of electronic components, devices become enhanced with localization technology, which delivers, via the Global Positioning System, the geographic position to the user. The combination of bo...

  14. Extended Virtual Spring Mesh (EVSM): The Distributed Self-Organizing Mobile Ad Hoc Network for Area Exploration

    Kurt Derr

    2011-12-01

    Mobile Ad hoc NETworks (MANETs) are distributed self-organizing networks that can change locations and configure themselves on the fly. This paper focuses on an algorithmic approach for the deployment of a MANET within an enclosed area, such as a building in a disaster scenario, which can provide a robust communication infrastructure for search and rescue operations. While a virtual spring mesh (VSM) algorithm provides scalable, self-organizing, and fault-tolerant capabilities required by aMANET, the VSM lacks the MANET's capabilities of deployment mechanisms for blanket coverage of an area and does not provide an obstacle avoidance mechanism. This paper presents a new technique, an extended VSM (EVSM) algorithm that provides the following novelties: (1) new control laws for exploration and expansion to provide blanket coverage, (2) virtual adaptive springs enabling the mesh to expand as necessary, (3) adapts to communications disturbances by varying the density and movement of mobile nodes, and (4) new metrics to assess the performance of the EVSM algorithm. Simulation results show that EVSM provides up to 16% more coverage and is 3.5 times faster than VSM in environments with eight obstacles.

  15. Enhanced Intrusion Detection System for Malicious Node Detection in Mobile Ad hoc Networks using Data Transmission Quality of Nodes

    S. Mamatha

    2014-09-01

    Full Text Available Mobile Ad hoc NETworks (MANETs are the new generation of networks that offer unrestricted mobility without any underlying infrastructure. It relies on the cooperation of all the participating nodes. Due to their open nature and lack of infrastructure, security for MANETS has become an intricate problem than the security in other networks. The conventional security mechanisms of protecting a wired network are not sufficient for these networks. Hence a second level of defense to detect and respond to the security problem called an Intrusion detection system is required. Generally the malicious nodes demonstrate a different behavioral pattern of all the other normal nodes. So an Intrusion Detection System based on anomaly based intrusion detection that works by checking the behavior of the nodes was proposed. Here, in this paper to determine the behavior of the nodes as malicious or legitimate a Data Transmission Quality (DTQ function is used. The DTQ function is defined in such a way that it will be close to a constant or keep changing smoothly for genuine nodes and will keep on diminishing for malicious nodes.. The final decision of confirming nodes as malicious is determined by a group consensus method. The evaluation results show that the proposed method increases the detection rate as well as decreases the false positive rate.

  16. An Efficient Scheme to Prevent DDoS Flooding Attacks in Mobile Ad-Hoc Network (MANET

    Meghna Chhabra

    2014-03-01

    Full Text Available The purpose of this study is to understand the flaws of existing solutions to combat the DDoS attack and a novel scheme is being provided with its validation to reduce the effect of DDoS attack in MANET Environment. As Internet users are increasing day by day, it is becoming more prone to attacks and new hacking techniques. People are accessing information and communicating with each other on the move. Mobile Ad-hoc Network (MANET is responsible for this rapid change in the lives of people. With the emergence of technology, where people communicate or share important documentations on the go with the help of laptops, PDAs, notebooks, smart phones etc., the loopholes in the Internet security have also increased and they are becoming more difficult to handle due to the characteristics of MANET such as dynamic topologies, low battery life, multicast routing, frequency of updates or network overhead, scalability, mobile agent based routing and power aware routing, etc. The network is becoming more prone to attacks like DDoS, byzantine, resource consumption, blackhole, grayhole, etc. Therefore, there is an urgent need to look into the security issues to allow authorized users to access the information available on Internet without any risk. In this study, a novel scheme is proposed which deals with suppressing the influence of the attack. The effectiveness of the approach is validated with simulation in GloMoSim, integrated with parsec compiler, on a windows platform.

  17. Enabling Co-located Learning over Mobile Ad Hoc P2P with LightPeers

    Christensen, Bent Guldbjerg; Kristensen, Mads Darø; Hansen, Frank Allan;

    2008-01-01

    This paper presents LightPeers – a new mobile P2P framework specifically tailored for use in a nomadic learning environment. A set of key requirements for the framework is identified based on nomadic learning, and these requirements are used as outset for designing and implementing the architecture...... and protocols. The main contributions of the LightPeers framework are: a mobile P2P framework including a specialized robust messaging protocol resilient to changes in the network topology, an developers API, and a suite of LightPeers applications supporting nomadic learning prototyping key features...

  18. A Fast Handover Scheme for Multicasting in IPv6 based Mobile Ad hoc Networks

    H. Parveen Sultana

    2011-01-01

    Full Text Available Abstract: Problem statement: In the previous researches, steps were taken to resolve the problems of multicasting, after several discussions. Actually these issues were raised, while multicasting packets from Internet Protocol (IP to Mobile Nodes (MN. On the other hand, there is very little concern about the problem of packet loss reduction. Sometimes the occurrence of multicast service chaos is ignored during handovers. Therefore in this study it has been tried to explain the optimal multicast technique for Mobile IPv6 (MIPv6 to diminish the required amendment to the existing fast handover. Approach: An alternate method is suggested in Fast handover for MIPv6 (FMIPv6 to lessen the packet losses during handovers, before tunneling. Based on the qualities of the multicast subscription techniques for the Mobile IPv6 (MIPv6, multicast upholds method for FMIPv6. MIPv6 in general comprise two types of multicasting techniques, which are related to Home Agent (HA and Foreign Agent (FA. These techniques help the MN to obtain the packets in roaming location referred as Foreign Network (FN, which is being forwarded by the Core Network (CN. But due to the handover latency problem MN have to experience packet loss while switching between any two Access Routers (AR. A protocol has been designed to conquer the issue of packet loss in MIPv6. Results and Conclusion: This protocol can be used during joining process in MIPv6 before tunneling to eliminate the IP connectivity time. This implementation allows a mobile node to be connected more quickly at a fresh point of connection, when that mobile node moves with less packet losses.

  19. A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks

    Ingelrest, François; Mitton, Nathalie; Simplot-Ryl, David

    2007-01-01

    International audience We present a turnover based adaptive HELLO protocol (TAP), which enables nodes in mobile networks to dynamically adjust their HELLO messages frequency depending on the current speed of nodes. To the best of our knowledge, all existing solutions are based on specific assumptions (\\eg{} slotted networks) and/or require specific hardware (\\eg{} GPS) for speed evaluation. One of the key aspects of our solution is that no additional hardware is required since it does not ...

  20. Beaconless Position-Based Routing for Mobile Ad-Hoc Networks

    Füßler, Holger; Widmer, Jörg; Käsemann, Michael; Mauve, Martin; Hartenstein, Hannes

    2003-01-01

    Existing position-based unicast routing algorithms, where packets are forwarded in the geographic direction of the destination, require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. The transmission of beacons and the storage of neighbor information consumes resources. Due to mobility, collected neighbor information can quickly get outdated w...

  1. Improved Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks

    Mr.C.Nallusamy*1; Dr.A.Sabari2; Suresh, N.

    2014-01-01

    In geographic routing, the nodes ought to maintain up-to-date positions of their immediate neighbors. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes may be a new technique utilized by most geographic routing protocols to keep up neighbor positions. The traditional routing schemes demonstrate that periodic beaconing regardless of the node mobility and traffic patterns in the network are not attractive from both update cost ...

  2. Flexible Authentication in Vehicular Ad hoc Networks

    Caballero-Gil, P; Molina-Gil, J; Hernández-Goya, C

    2010-01-01

    A Vehicular Ad-Hoc Network (VANET) is a form of Mobile ad-hoc network, to provide communications among nearby vehicles and between vehicles and nearby fixed roadside equipment. The key operation in VANETs is the broadcast of messages. Consequently, the vehicles need to make sure that the information has been sent by an authentic node in the network. VANETs present unique challenges such as high node mobility, real-time constraints, scalability, gradual deployment and privacy. No existent technique addresses all these requirements. In particular, both inter-vehicle and vehicle-to-roadside wireless communications present different characteristics that should be taken into account when defining node authentication services. That is exactly what is done in this paper, where the features of inter-vehicle and vehicle-to-roadside communications are analyzed to propose differentiated services for node authentication, according to privacy and efficiency needs.

  3. Range Detection Multicast Routing Protocol for Mobile Ad-Hoc Networks

    K. Duraiswamy

    2012-01-01

    Full Text Available Problem statement: Many efforts have been implemented towards the Group membership management on multicast routing in MANETs, but the difficulties associated with Group membership management are still existed. Approach: Maintaining endurance of Group Leader (GL in multicasting routing has been a great challenge to all the protocol having been invented so far. Results: This study provides the RDMP algorithm for persistency of Group Leader within the group. Nodes perform very active in exchanging the Data and Control packet when they mobile within the transmission range. Range Detection Multicast Protocol (RDMP focuses on dynamic topology of nodes and uses detection mechanism based on transmission range within the group. Instead of having a separate external node to monitor on Group leadership, a node within the transmission range acts as a Leadership Track Node (LTN, Group Leader manages the group member with the aid provided by LTN and thus control over head shared among them. LTN keeps track of mobility of Group Leader and send alert message when Group Leader moves out of Transmission range and also holds the list of address of all other Group Leader which are adjacent to it. Routing control packet and data packet are regulated with minimum control over head. Conclusion/Recommendations: Our simulation results under increasing group size demonstrate endurance of Group leader for longer period of time, joining delay for multicast group is very low, normalized control over head and minimizing number of hops in maintain average path length.

  4. An Adaptive Fuzzy System in Large Scale Mobile Ad Hoc Networks

    B.G.Obulla Reddy

    2012-04-01

    Full Text Available Multicast protocols in MANETs must consider control overhead for maintenance, energy efficiency of nodes and routing trees managements to frequent changes of network topology. Now-adaysMulticast protocols extended with Cluster based approach. Cluster based multicast tree formation is still research issues. The tree reconstruction of cluster-based multicast routing protocol will take place if any link of the trees has malfunction or the nodes move out of the link, therefore, its robust performance is unsatisfactory. The mobility of nodes will always increase the communication delay because of re-clustering and cluster head selections. For this issue we proposed the new scheme Adaptive Fuzzy System (AFS, its fuzzy based clustering and predicting the next cluster head (CH based their location updates with clustered group. A new location management scheme is proposed to handle the mobility of cluster members, based on a hybrid strategy that includes location updating and location prediction. In a clustered zone predicts movement of members and CH based on Kalman filtering of previously received updates and based on location updates CH will selected. Here location managements will leads to reduce cluster head selections. We used ns2 for our AFS.We present simulation results that demonstrate a significant reduce the communication delay over the traditional cluster based MANETs deployments.

  5. A Cross-Layer Delay-Aware Node Disjoint Multipath Routing Algorithm for Mobile Ad Hoc Networks

    Mahadev A. Gawas

    2014-09-01

    Full Text Available Mobile Ad Hoc Networks (MANETS require reliable routing and Quality of Service(QoS mechanism to support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop count as the main metric for path selection, hence are not suitable for delay sensitive real time applications. To support such applications delay constrained routing protocols are employed. These Protocols makes path selection between source and destination based on the delay over the discovered links during routing discovery and routing table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV based on delay constraint. It employs cross-layer communications between MAC and routing layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay incurred at each intermediate node. Performance of the proposed protocol is compared with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and reduced overhead between intermediate nodes.

  6. An Adaptive Gateway Discovery Algorithm to support QoS When Providing Internet Access to Mobile Ad Hoc Networks

    Mari Carmen Domingo

    2007-04-01

    Full Text Available When a node in an ad hoc network wants Internet access, it needs to obtain information about the available gateways and it should select the most appropriate of them. In this work we propose a new gateway discovery scheme suitable for real-time applications that adjusts the frequency of gateway advertisements dynamically. This adjustment is related to the percentage of real-time sources that have quality of service problems because of excessive end-to-end delays. The optimal values for the configuration parameters (time interval and threshold of the proposed adaptive gateway discovery mechanism for the selected network conditions have been studied with the aid of simulations. The scalability of the proposed scheme with respect to mobility as well as the impact of best-effort traffic load have been analyzed. Simulation results indicate that the proposed scheme significantly improves the average end-to-end delay, jitter and packet delivery ratio of real-time flows; the routing overhead is also reduced and there is no starvation of best-effort traffic.

  7. MUSIC algorithm DoA estimation for cooperative node location in mobile ad hoc networks

    Warty, Chirag; Yu, Richard Wai; ElMahgoub, Khaled; Spinsante, Susanna

    In recent years the technological development has encouraged several applications based on distributed communications network without any fixed infrastructure. The problem of providing a collaborative early warning system for multiple mobile nodes against a fast moving object. The solution is provided subject to system level constraints: motion of nodes, antenna sensitivity and Doppler effect at 2.4 GHz and 5.8 GHz. This approach consists of three stages. The first phase consists of detecting the incoming object using a highly directive two element antenna at 5.0 GHz band. The second phase consists of broadcasting the warning message using a low directivity broad antenna beam using 2× 2 antenna array which then in third phase will be detected by receiving nodes by using direction of arrival (DOA) estimation technique. The DOA estimation technique is used to estimate the range and bearing of the incoming nodes. The position of fast arriving object can be estimated using the MUSIC algorithm for warning beam DOA estimation. This paper is mainly intended to demonstrate the feasibility of early detection and warning system using a collaborative node to node communication links. The simulation is performed to show the behavior of detecting and broadcasting antennas as well as performance of the detection algorithm. The idea can be further expanded to implement commercial grade detection and warning system

  8. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  9. IP ADDRESS AUTOCONFIGURATION FOR WIRELESS AD HOC NETWORKS

    阿姆贾德

    2002-01-01

    A novel mechanism was specified by which a node in ad hoc network may autoconfigure an IP address which is unique throughout the mobile ad hoc network. This new algorithm imposes less and constant overhead and delay in obtaining an IP address, and fully utilizes the available addresses space of an ad hoc network, and independent of the existing routing protocol, and less prone to security threats. Moreover, a new Join/Leave mechanism was proposed as an enhancement to the new IP address autoconfiguration algorithm, to support the overall operation of the existing routing protocol of wireless ad hoc networks.

  10. Intrusion detection in wireless ad-hoc networks

    Chaki, Nabendu

    2014-01-01

    Presenting cutting-edge research, Intrusion Detection in Wireless Ad-Hoc Networks explores the security aspects of the basic categories of wireless ad-hoc networks and related application areas. Focusing on intrusion detection systems (IDSs), it explains how to establish security solutions for the range of wireless networks, including mobile ad-hoc networks, hybrid wireless networks, and sensor networks.This edited volume reviews and analyzes state-of-the-art IDSs for various wireless ad-hoc networks. It includes case studies on honesty-based intrusion detection systems, cluster oriented-based

  11. An Improved Location aided Cluster Based Routing Protocol with Intrusion Detection System in Mobile Ad Hoc Networks

    S. Mangai; Tamilarasi, A.

    2011-01-01

    Problem statement: Routing and security are the main challenges for ad hoc networks due to dynamic topology as well as resource constraints. A designed protocol must provide scalable routing with better security. Lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. And also resource constraints such as limited energy and size also play an important role in the protocols designed for security. Approach: In th...

  12. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks.

    Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J; Pallarès Segarra, Esteve; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Sanvicente Gargallo, Emilio

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs. PMID:25897496

  13. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

    Ahmad Mohamad Mezher

    2015-04-01

    Full Text Available The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc. could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

  14. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

    Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J.; Segarra, Esteve Pallarès; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Gargallo, Emilio Sanvicente

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic.Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs. PMID:25897496

  15. Non DTN Geographic Routing Protocols for Vehicular Ad Hoc Networks

    Ramin Karimi; Norafida Ithnin; Shukor Abd Razak; Sara Najafzadeh

    2011-01-01

    Vehicular Ad Hoc Networks are highly mobile wireless ad hoc networks. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Geographic routing protocols are becoming popular due to advancement and availability of GPS devices. In this paper, we review the existing non DTN Geographic Routing Protocols for VANETs and also provide a qualitative comparison of them.

  16. An Efficient Proactive RSA Scheme for Ad Hoc Networks

    ZHANG Rui-shan; CHEN Ke-fei

    2007-01-01

    A proactive threshold signature scheme is very important to tolerate mobile attack in mobile ad hoc networks. In this paper, we propose an efficient proactive threshold RSA signature scheme for ad hoc networks. The scheme consists of three protocols: the initial secret share distribution protocol, the signature generation protocol and the secret share refreshing protocol. Our scheme has three advantages. First, the signature generation protocol is efficient. Second, the signature generation protocol is resilient. Third, the share refreshing protocol is efficient.

  17. Multihost ad-hoc network with the clustered Security networks

    J.Manikandan,; S.Vijayaragavan.

    2010-01-01

    Security has becomes a primary concern in order to provide protected communication between mobile nodes in a host environment .Unlike the wire line network, the unique characteristics mobile ad-hoc networkpose a collection on autonomous nodes of terminals. Which ommunication with each other by forming multihost radio network and maintaining connectivity in a decentralized manner. Node in Ad-hoc network path is dynamic network topology. These challenges clearly make a case for building multif...

  18. MQARR-AODV: A NOVEL MULTIPATH QOS AWARE RELIABLE REVERSE ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORKS

    K.G. Santhiya

    2012-12-01

    Full Text Available MANET (Mobile Ad-hoc Network is an infra structure less wireless ad-hoc network that does not require any basic central control. The topology of the network changes drastically due to very fast mobility of nodes. So an adaptive routing protocol is needed for routing in MANET. AODV (Ad-hoc On-demand Distance Vector routing is the effective and prominent on-demand Ad-hoc routing protocols. During route establishment phase in traditional AODV, only one route reply message will be sent in the reverse path to establish routing path. The high mobility of nodes may affect the reply messages which lead to the retransmission of route request message by the sender which in turn leads to higher communication delay, power consumption and the reduction in the ratio of packets delivered. Sending multiple route reply messages and establishing multiple paths in a single path discovery will reduce the routing overhead involved in maintaining the connection between source and destination nodes. Multipath routing can render high scalability, end-to-end throughput and provide load balancing in MANET. The new proposed novel Multipath QoS aware reliable routing protocol establishes two routes of maximum node disjoint paths and the data transfer is carried out in the two paths simultaneously. To select best paths, the new proposed protocol uses three parameters Link Eminence, MAC overhead and node residual energy. The experimental values prove that the MQARR-AODV protocol achieves high reliability, stability, low latency and outperforms AODV by the less energy consumption, overhead and delay.

  19. Proximity Aware Routing in Ad Hoc Networks

    Valerie Alandzi

    2007-01-01

    Full Text Available Most of the existing routing protocols for ad hoc networks are designed to scale in networks of a few hundred nodes. They rely on state concerning all links of the network or links on the route between a source and a destination. This may result in poor scaling properties in larger mobile networks or when node mobility is high. Using location information to guide the routing process is one of the most often proposed means to achieve scalability in large mobile networks. However, location-based routing is difficult when there are holes in the network topology. We propose a novel position-based routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA to address these issues. PARA selects the next hop of a packet based on 2-hops neighborhood information. We introduce the concept of “proximity discovery”. The knowledge of a node’s 2-hops neighborhood enables the protocol to anticipate concave nodes and helps reduce the risks that the routing protocol will reach a concave node in the network. Our simulation results show that PARA’s performance is better in sparse networks with little congestion. Moreover, PARA significantly outperforms GPSR for delivery ratio, transmission delay and path length. Our results also indicate that PARA delivers more packets than AODV under the same conditions.

  20. A State-of-the-art Survey on IDS for Mobile Ad-Hoc Networks and Wireless Mesh Networks

    Deb, Novarun; Chaki, Nabendu

    2011-01-01

    An Intrusion Detection System (IDS) detects malicious and selfish nodes in a network. Ad hoc networks are often secured by using either intrusion detection or by secure routing. Designing efficient IDS for wireless ad-hoc networks that would not affect the performance of the network significantly is indeed a challenging task. Arguably, the most common thing in a review paper in the domain of wireless networks is to compare the performances of different solutions using simulation results. However, variance in multiple configuration aspects including that due to different underlying routing protocols, makes the task of simulation based comparative evaluation of IDS solutions somewhat unrealistic. In stead, the authors have followed an analytic approach to identify the gaps in the existing IDS solutions for MANETs and wireless mesh networks. The paper aims to ease the job of a new researcher by exposing him to the state of the art research issues on IDS. Nearly 80% of the works cited in this paper are published ...

  1. Using Wikipedia categories for ad hoc search

    R. Kaptein; M. Koolen; J. Kamps

    2009-01-01

    In this paper we explore the use of category information for ad hoc retrieval in Wikipedia. We show that techniques for entity ranking exploiting this category information can also be applied to ad hoc topics and lead to significant improvements. Automatically assigned target categories are good sur

  2. A Simulation Study: The Impact of Random and Realistic Mobility Models on the Performance of Bypass-AODV in Ad Hoc Wireless Networks

    Baroudi Uthman

    2010-01-01

    Full Text Available To bring VANET into reality, it is crucial to devise routing protocols that can exploit the inherited characteristics of VANET environment to enhance the performance of the running applications. Previous studies have shown that a certain routing protocol behaves differently under different presumed mobility patterns. Bypass-AODV is a new optimization of the AODV routing protocol for mobile ad-hoc networks. It is proposed as a local recovery mechanism to enhance the performance of the AODV routing protocol. It shows outstanding performance under the Random Waypoint mobility model compared with AODV. However, Random Waypoint is a simple model that may be applicable to some scenarios but it is not sufficient to capture some important mobility characteristics of scenarios where VANETs are deployed. In this paper, we will investigate the performance of Bypass-AODV under a wide range of mobility models including other random mobility models, group mobility models, and vehicular mobility models. Simulation results show an interesting feature that is the insensitivity of Bypass-AODV to the selected random mobility model, and it has a clear performance improvement compared to AODV. For group mobility model, both protocols show a comparable performance, but for vehicular mobility models, Bypass-AODV suffers from performance degradation in high-speed conditions.

  3. Scalable Revocation in Hybrid Ad Hoc Networks: The SHARL Scheme

    Mona Holsve Ofigsbø

    2008-06-01

    Full Text Available The article proposes a simple, scalable and robust scheme for the distribution of revocation information in mobile ad hoc networks (MANETs. The scheme is intended for ad hoc networks with a planned origin, and where a common point of trust exists. Mobile ad hoc networks have limited available bandwidth. The revocation lists must therefore be specific to the network. They are established with the aid of trusted gateways reporting the identity of the nodes to a central trusted entity. To minimize overhead, the revocation lists are distributed along with the routing messages. In the articles we discuss how the scheme can be implemented in conjunction with the predominant routing protocols in ad hoc networks. The article also provides a detailed security analysis of the proposed protocols, partly based on the use of formal methods.

  4. Reliable adaptive multicast protocol in wireless Ad hoc networks

    Sun Baolin; Li Layuan

    2006-01-01

    In wireless ad hoc network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoc network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoc network environment.In this paper, we propose and evaluate Reliable Adaptive Multicast Protocol (RAMP) based on a relay node concept. Relay nodes are placed along the multicast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoc network by reducing the number of packet retransmissions. We compare RAMP with SRM (Scalable Reliable Multicast). Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmission.

  5. An Intrusion Detection System Framework for Ad Hoc Networks

    Arjun Singh; Surbhi Chauhan; Kamal Kant; Reshma Doknaia

    2012-01-01

    Secure and efficient communication among a set of mobile nodes is one of the most important aspects in ad-hoc wireless networks. Wireless networks are particularly vulnerable to intrusion, as they operate in open medium, and use cooperative strategies for network communications. By efficiently merging audit data from multiple network sensors, we analyze the entire ad hoc wireless network for intrusions and try to inhibit intrusion attempts. This paper presents an intrusion detection system fo...

  6. An Optimized Signature Verification System for Vehicle Ad hoc NETwork

    Mamun, Mohammad Saiful Islam; Miyaji, Atsuko

    2012-01-01

    This paper1 presents an efficient approach to an existing batch verification system on Identity based group signature (IBGS) which can be applied to any Mobile ad hoc network device including Vehicle Ad hoc Networks (VANET). We propose an optimized way to batch signatures in order to get maximum throughput from a device in runtime environment. In addition, we minimize the number of pairing computations in batch verification proposed by B. Qin et al. for large scale VANET. We introduce a batch...

  7. Secure and reliable wireless and ad hoc communications

    Nguyen, Son Thanh

    2009-01-01

    Wireless and ad hoc communication systems create additional challenges for the implementation of security and reliability services when compared to fxed networks. On the one hand, the inherent characteristics of wireless environment contribute serious system vulnerabilities if the security requirements are not met. On the other hand, the mobility pattern as well as resource constraints of ad hoc devices make security design more di cult. The principal objective of SWACOM pro...

  8. IDHOCNET: A Novel ID Centric Architecture for Ad Hoc Networks

    Shahrukh Khalid; Athar Mahboob; Choudhry Fahad Azim; Aqeel Ur Rehman

    2016-01-01

    Ad hoc networks lack support of infrastructure and operate in a shared bandwidth wireless environment. Presently, such networks have been realized by various adaptations in Internet Protocol (IP) architecture which was developed for infrastructure oriented hierarchical networks. The IP architecture has its known problem and issues even in infrastructure settings, like IP address overloading, mobility, multihoming, and so forth. Therefore, when such architecture is implemented in ad hoc scenar...

  9. Analisis Unjuk Kerja Aplikasi VoIP Call Android di Jaringan MANET [Performance Analysis of VoIP Call Application Android in MANET (Mobile Ad Hoc Network)

    Ryan Ari Setyawan

    2015-01-01

    Penelitian ini bertujuan menganalisis kinerja aplikasi  VoIP call android di jaringan MANET (mobile ad hoc network).  Hasil pengujian menunjukan bahwa aplikasi VoIP call android dapat digunakan di jaringan MANET. Delay yang dihasilkan paling besar di pengujian indoor dengan jarak 11-15 meter yakni sebesar 0,014624811 seconds. Packet loss yang dihasilkan pada range 1%-2% sedangkan standar packet loss yang ditetapkan oleh CISCO untuk layanan aplikasi VoIP adalah < 5%. Jitter yang dihasilkan ...

  10. A Novel Approach Towards Cost Effective Region-Based Group Key Agreement Protocol for Peer - to - Peer Information Sharing in Mobile Ad Hoc Networks

    Kumar, K; Sumathy, V

    2010-01-01

    Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of users. However, current peer-to-peer information sharing systems work mostly on wired networks. With the growing number of communication-equipped mobile devices that can self-organize into infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer information sharing over MANETs becomes a promising research area. In this paper, we propose a Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs. The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node mobility and provides Reliable information sharing.

  11. On the Connectivity, Lifetime and Hop Count of Routes Determined Using the City Section and Manhattan Mobility Models for Vehicular Ad Hoc Networks

    Meghanathan, Natarajan

    The high-level contribution of this paper is a simulation based analysis of the network connectivity, hop count and lifetime of the routes determined for vehicular ad hoc networks (VANETs) using the City Section and Manhattan mobility models. The Random Waypoint mobility model is used as a benchmark in the simulation studies. Two kinds of paths are determined on the sequence of static graphs representing the topology over the duration of the network session: paths with the minimum hop count (using the Dijkstra algorithm) and stable paths with the longest lifetime (using our recently proposed OptPathTrans algorithm). Simulation results indicate that the City Section model provided higher network connectivity compared to the Manhattan model for all the network scenarios. Minimum hop paths and stable paths determined under the Manhattan model have a smaller lifetime and larger hop count compared to those determined using the City Section and Random Waypoint mobility models.

  12. The Extended Clustering AD HOC Routing Protocol (ECRP

    Buthayna Al-Sharaa

    2013-06-01

    Full Text Available Ad hoc networks are acollection of mobile nodes communicating via wireless channels without any fixedinfrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractiveapplications in different fields. The topology of ad hoc networks changes dynamically, and each node in thenetwork can act as a host or router.With the increase in the number of wirelessdevices andlarge amountof traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents ascalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc RoutingProtocol (ECRP. This is a hybrid protocol, which combines reactive and proactive approaches in routing.The protocol uses theGlobal PositioningSystem todetermine the position of certain nodesin the network.The evaluation methodology and simulation results obtained showthat the protocol is efficient and scaleswell in large networks

  13. Selbstorganisierende Systemarchitekturen - Ad-hoc-Netze

    Rabel, Matthias Reinhard

    2007-01-01

    A new in-vehicle network is developed and elaborated. The new protocol hierarchy aims at an ad hoc integration of typical in-vehicle networks, like CAN, IEEE 1394 and others. Therefore several communication protocols are developed. First an overall communication scheme needs to be available to allow end-to-end communication. This is done similar to OSI Layer 5, as session based communication. Sessions allow transitive communication paths without interruption. With this, an ad hoc behavior of ...

  14. AD HOC P2P on Android

    Narayanan, Sathya; Byun, YoungJoon; Cebrowski Institute; CSUMB, C.S.I.T. Program

    2011-01-01

    In conjunction with the NPS C.S. Department MWC Group, this research looks at establishing an Ad Hoc Peer-to-Peer network on cell phones, specifically using the Android OS. Work comprised of Android Device, Library, and Application Design. The Library used was AODV (Ad Hoc on demand Distance Vector) and hardware devices must be controlled directly in addition to application enhancements. A prototype has been created and communication was achieved. Future work to include enhancements to contro...

  15. Analisis Unjuk Kerja Aplikasi VoIP Call Android di Jaringan MANET [Performance Analysis of VoIP Call Application Android in MANET (Mobile Ad Hoc Network

    Ryan Ari Setyawan

    2015-06-01

    Full Text Available Penelitian ini bertujuan menganalisis kinerja aplikasi  VoIP call android di jaringan MANET (mobile ad hoc network.  Hasil pengujian menunjukan bahwa aplikasi VoIP call android dapat digunakan di jaringan MANET. Delay yang dihasilkan paling besar di pengujian indoor dengan jarak 11-15 meter yakni sebesar 0,014624811 seconds. Packet loss yang dihasilkan pada range 1%-2% sedangkan standar packet loss yang ditetapkan oleh CISCO untuk layanan aplikasi VoIP adalah < 5%. Jitter yang dihasilkan yakni antara 0,01-0,06 seconds sedangkan standar yang ditetapkan oleh CISCO adalah ≤ 30 ms atau 0,03 seconds. Throughput yang dihasilkan pada proses pengujian yakni antar 161 kbps-481 kbps. *****This study aims to analyze the performance of VOIP call android application in the MANET (mobile ad hoc network. The results showed that VoIP applications could be implemented in MANET network. The highest  delay is produced in indoor testing  with distance of 11-15 meters,  which is equal to 0.014624811 seconds. Packet loss is generated in the range of 1% -2%, while packet loss standards set by Cisco for VoIP application services are <5%. The jitter is between 0.01 to 0.06 seconds, while the standard set by CISCO is ≤ 30 ms or 0.03 seconds. Throughput generated in the testing process is between 161 kbps-481 kbps.

  16. An Improved Location aided Cluster Based Routing Protocol with Intrusion Detection System in Mobile Ad Hoc Networks

    S. Mangai

    2011-01-01

    Full Text Available Problem statement: Routing and security are the main challenges for ad hoc networks due to dynamic topology as well as resource constraints. A designed protocol must provide scalable routing with better security. Lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. And also resource constraints such as limited energy and size also play an important role in the protocols designed for security. Approach: In this study, Improved Location aided Cluster based Routing Protocol (ILCRP for GPS enabled MANETs was analysed in MANETs with malicious nodes and an Intrusion Detection System was used to increase the packet delivery ratio. ILCRP makes use of location aided routing in the presence of cluster based routing Protocol. Results: Use of location information with security against attacks results in high packet delivery ratio for the cluster based routing protocol. Simulations are performed using NS2 by varying the number of nodes. Conclusion: The results illustrate ILCRP provides higher delivery ratio with IDS.

  17. A Survey of Multicast Routing Protocols for Vehicular Ad Hoc Networks

    Waqar Farooq; Khan, Muazzam A.; Saad Rehman; Nazar Abbas Saqib

    2015-01-01

    Vehicular Ad Hoc Networks (VANETs) are autonomous and self-configurable wireless ad hoc networks and considered as a subset of Mobile Ad Hoc Networks (MANETs). MANET is composed of self-organizing mobile nodes which communicate through a wireless link without any network infrastructure. A VANET uses vehicles as mobile nodes for creating a network within a range of 100 to 1000 meters. VANET is developed for improving road safety and for providing the latest services of intelligent transport sy...

  18. Secure Clustering in Vehicular Ad Hoc Networks

    Zainab Nayyar

    2015-09-01

    Full Text Available A vehicular Ad-hoc network is composed of moving cars as nodes without any infrastructure. Nodes self-organize to form a network over radio links. Security issues are commonly observed in vehicular ad hoc networks; like authentication and authorization issues. Secure Clustering plays a significant role in VANETs. In recent years, various secure clustering techniques with distinguishing feature have been newly proposed. In order to provide a comprehensive understanding of these techniques are designed for VANETs and pave the way for the further research, a survey of the secure clustering techniques is discussed in detail in this paper. Qualitatively, as a result of highlighting various techniques of secure clustering certain conclusions are drawn which will enhance the availability and security of vehicular ad hoc networks. Nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads.

  19. The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game

    Chatzigiannakis, Ioannis; Akribopoulos, Orestis; Logaras, Marios; Kokkinos, Panagiotis; Spirakis, Paul

    2010-01-01

    In this work, we discuss multiplayer pervasive games that rely on the use of ad hoc mobile sensor networks. The unique feature in such games is that players interact with each other and their surrounding environment by using movement and presence as a means of performing game-related actions, utilizing sensor devices. We discuss the fundamental issues and challenges related to these type of games and the scenarios associated with them. We also present and evaluate an example of such a game, called the "Hot Potato", developed using the Sun SPOT hardware platform. We provide a set of experimental results, so as to both evaluate our implementation and also to identify issues that arise in pervasive games which utilize sensor network nodes, which show that there is great potential in this type of games.

  20. Secured Position Location and Tracking (SPL&T) for Detection of Multiple Malicious Nodes Maintaining Two Friendly References in Mobile Ad hoc Networks

    Shakhakarmi, Niraj

    2012-01-01

    Secured Position Location and Tracking (PL&T) scheme is developed for multiple malicious radios or nodes detection using integrated key based strict friendly scheme and position location and tracking by multi-sectored based multiple target's PL&T. The friendly and malicious nodes detection is based on the integrated key consisting of symmetric keys, geographic location and round trip response time. Two strictly friend references dynamically form the tracking zone over the detected multiple malicious nodes using the multi-sectored adaptive beam forming. This PL&T technique is robust, precise, scalable, and faster than using the single reference, two reference and three reference nodes based PL&T method in the battlefield oriented Mobile Ad hoc Networks. The simulation results show that the lower relative speed bound of any participating node increased the switching overhead, the decreasing received energy with increasing number of the multi-sectored beams reduced tracking accuracy and the stric...

  1. Vehicular ad hoc network security and privacy

    Lin, X

    2015-01-01

    Unlike any other book in this area, this book provides innovative solutions to security issues, making this book a must read for anyone working with or studying security measures. Vehicular Ad Hoc Network Security and Privacy mainly focuses on security and privacy issues related to vehicular communication systems. It begins with a comprehensive introduction to vehicular ad hoc network and its unique security threats and privacy concerns and then illustrates how to address those challenges in highly dynamic and large size wireless network environments from multiple perspectives. This book is richly illustrated with detailed designs and results for approaching security and privacy threats.

  2. Ad hoc networks telecommunications and game theory

    Benslama, Malek; Batatia, Hadj

    2015-01-01

    Random SALOHA and CSMA protocols that are used to access MAC in ad hoc networks are very small compared to the multiple and spontaneous use of the transmission channel. So they have low immunity to the problems of packet collisions. Indeed, the transmission time is the critical factor in the operation of such networks. The simulations demonstrate the positive impact of erasure codes on the throughput of the transmission in ad hoc networks. However, the network still suffers from the intermittency and volatility of its efficiency throughout its operation, and it switches quickly to the satura

  3. TCP Freeze-Probing Enhancement for Mobile Ad Hoc Networks%基于无线自组织网络的TCP Freeze-Probing改进协议

    王波; 范平志

    2005-01-01

    传统的TCP协议在有线网络中能够良好地工作,但用于无线自组织网络时则性能有所下降.其原因在于,传统的TCP协议无法分辨网络丢包原因,如网络拥塞、链路断开、信道错误或者链路改变.为了提高TCP协议在无线自组织网络中的性能,提出了一种TCP协议的改进方案TCP Freeze-Probing.该方案是一种端到端方法,不需要网络中间节点的反馈合作同时,提出了一种基于TCP Freeze-Probing的吞吐量模型并利用仿真对模型进行了验证.分析和仿真结果表明,该方案能够有效地改进TCP在无线自组织网络的性能.%Traditional Transmission Control Protocol (TCP) works well in wired network but suffers from performance degradation in mobile ad-hoc networks (MANET) due to the fact that it cannot distinguish packet losses due to congestion from packet losses due to link breakage, channel error and route changes. In this paper, an enhanced TCP, named TCP Freeze-Probing, is proposed to improve the TCP performance in mobile ad-hoc networks. TCP Freeze-Probing is an end-to-end approach that does not need the cooperation of the intermediate nodes in the network. Besides, a throughput model for TCP Freeze-Probing is given, which is validated through simulation. It is shown by analysis and simulation that the proposed approach can greatly improve the TCP performance in MANET.

  4. Routing Protocol of Sparse Urban Vehicular Ad Hoc Networks

    Li, Huxiong

    Vehicular ad hoc network (VANET) is an application of mobile ad hoc technology in transportation systems, it has become an important part of ITS. Since multi-hop link is hard to set up in sparse VANET, a traffic-aware routing (TAR) protocol is proposed which estimates vehicle average neighbors (VAN) of roads by exchanging beacon messages between encounter vehicles. Road with high VAN is preferred to be selected as part of forwarding path at intersection. Packets are forwarded to the next intersection in road in a greedy manner. Simulations show that TAR outperforms the compared protocols in terms of both packet delivery ratio and average end-to-end delay.

  5. A Survey: variants of TCP in Ad-hoc networks

    Komal Zaman; Muddesar Iqbal; Muhammad Shafiq; Azeem Irshad; Saqib Rasool

    2013-01-01

    MANET (Mobile Ad-hoc network) forms a temporary network of wireless mobile nodes without any infrastructure where all nodes are allowed to move freely, configure themselves and interconnect with its neighbors to perform peer to peer communication and transmission. TCP (Transmission Control Protocol) offers reliable, oriented connection and mechanism of end to end delivery. This article provides the review and comparison of existing variants of TCP for instance: The TCP Tahoe, The TCP Reno, Th...

  6. Reliable routing algorithm in marine ad hoc networks

    LIN Wei; YANG Yong-Tian

    2004-01-01

    A routing algorithm called DNH for increasing efficiency of mobile ad hoc network is presented, which is based on a new criterion called TSS ( Temporarily Steady State) , combining with wireless transmission theory that makes networks topology correspondingly stabilization. Also the DNH algorithm has the characteristics of giving up queuing in a node, but selecting another idle node instead of the node for forwarding data packets if the node has a full throughput. Simulation evaluation shows that selecting another node is better than queuing in a full throughout node if some conditions are satisfied, especially during a sea battle, every warship in ad hoc network wants to contest time and increase propagation reliability. The DNH algorithm can help decrease routing time, and raise efficiency of marine ad hoc networks.

  7. Enhanced Wireless Network Ad Hoc Pattern

    M. Kamalakannan

    2012-06-01

    Full Text Available Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns and detailed local radio interactions. This study examines these factors alone and in combination, using simulation and analysis from first principles. Our results include both specific constants and general relationship Scaling helpful in understanding the limitations of wireless ad hoc networks. We examine interactions of the 802.11 MAC and ad hoc forwarding and the effect on capacity for several simple configurations and traffic patterns. While 802.11 discovers reasonably good schedules, we nonetheless observe capacities markedly less than optimal for very simple chain and lattice networks with very regular traffic patterns. We validate some simulation results with experiments. We also show that the traffic pattern determines whether an ad hoc network’s per node capacity will scale to large networks. In particular, we show that for total capacity to scale up with network size the average distance between source and destination nodes must remain small as the network grows. Nonlocal traffic patterns in which this average distance grows with the network size result in a rapid decrease of per node capacity.

  8. FRCA: A Fuzzy Relevance-Based Cluster Head Selection Algorithm for Wireless Mobile Ad-Hoc Sensor Networks

    Taegwon Jeong; Chongdeuk Lee

    2011-01-01

    Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the member...

  9. The Adaptive Optimized Routing Protocol for Vehicular Ad-hoc Networks

    Kunal Vikas Patil; M.R. Dhage

    2013-01-01

    The vehicular ad hoc network (VANET) is a superior newtechnology. Vehicular ad hoc network (VANET) is a subclassof MANET that is mobile ad hoc networks. Vehicular ad hocnetwork provides wireless communication among vehicles andvehicles to roadside equipments. The communication betweenvehicles is more important for safety and more probably forentertainment as well. The performance of communicationdepends on how better the routing takes place in the network.Routing of data depends on routing pr...

  10. Routing in Ad Hoc Network Using Ant Colony Optimization

    Khanpara, Pimal; Valiveti, Sharada; Kotecha, K.

    The ad hoc networks have dynamic topology and are infrastructure less. So it is required to implement a new network protocol for providing efficient end to end communication based on TCP/IP structure. There is a need to re-define or modify the functions of each layer of TCP/IP model to provide end to end communication between nodes. The mobility of the nodes and the limited resources are the main reason for this change. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive behavior. There are number of routing algorithms based on the concept of ant colony optimizations. It is quite difficult to determine the best ant based algorithm for routing as these algorithms perform differently under various circumstances such as the traffic distribution and network topology. In this paper, the overview of such routing algorithms is given.

  11. Supporting Dynamic Ad hoc Collaboration Capabilities

    Modern HENP experiments such as CMS and Atlas involve as many as 2000 collaborators around the world. Collaborations this large will be unable to meet often enough to support working closely together. Many of the tools currently available for collaboration focus on heavy-weight applications such as videoconferencing tools. While these are important, there is a more basic need for tools that support connecting physicists to work together on an ad hoc or continuous basis. Tools that support the day-to-day connectivity and underlying needs of a group of collaborators are important for providing light-weight, non-intrusive, and flexible ways to work collaboratively. Some example tools include messaging, file-sharing, and shared plot viewers. An important component of the environment is a scalable underlying communication framework. In this paper we will describe our current progress on building a dynamic and ad hoc collaboration environment and our vision for its evolution into a HENP collaboration environment

  12. Supporting Dynamic Ad hoc Collaboration Capabilities

    Agarwal, Deborah A. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Berket, Karlo [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

    2003-07-14

    Modern HENP experiments such as CMS and Atlas involve as many as 2000 collaborators around the world. Collaborations this large will be unable to meet often enough to support working closely together. Many of the tools currently available for collaboration focus on heavy-weight applications such as videoconferencing tools. While these are important, there is a more basic need for tools that support connecting physicists to work together on an ad hoc or continuous basis. Tools that support the day-to-day connectivity and underlying needs of a group of collaborators are important for providing light-weight, non-intrusive, and flexible ways to work collaboratively. Some example tools include messaging, file-sharing, and shared plot viewers. An important component of the environment is a scalable underlying communication framework. In this paper we will describe our current progress on building a dynamic and ad hoc collaboration environment and our vision for its evolution into a HENP collaboration environment.

  13. Enhanced Wireless Network Ad Hoc Pattern

    M. Kamalakannan; V. Khanaa

    2012-01-01

    Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns and detailed local radio interactions. This study examines these factors alone and in combination, using simulation and analysis from first principles. Our results include both specific constants and general relationship Scaling helpful in understanding t...

  14. Aeronautical Ad Hoc Network for Civil Aviation

    Vey, Quentin; Pirovano, Alain; Radzik, José; Garcia, Fabien

    2014-01-01

    Aeronautical communication systems are constantly evolving in order to handle the always increasing flow of data generated by civil aviation. In this article we first present communication systems currently used for en-route aircraft. We then propose Aeronautical Ad hoc NETwork (AANET) as a complementary communication system and demonstrate its connectivity and assess the throughput by simulations based on real aircraft trajectories over the French sky and over the Atlantic ocean.

  15. A multi-user game-theoretical multipath routing protocol to send video-warning messages over mobile ad hoc networks

    Mezher Mezher, Ahmad; Aguilar Igartua, Mónica; Cruz Llopis, Luis Javier de la; Pallarès Segarra, Esteve; Tripp Barba, Carolina; Urquiza Aguiar, Luis; Fornés Guardia, Jordi; Sanvicente Gargallo, Emilio

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simp...

  16. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

    Ahmad Mohamad Mezher; Mónica Aguilar Igartua; de la Cruz Llopis, Luis J.; Esteve Pallarès Segarra; Carolina Tripp-Barba; Luis Urquiza-Aguiar; Jordi Forné; Emilio Sanvicente Gargallo

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simp...

  17. Using Road IDs to Enhance Clustering in Vehicular Ad hoc Networks

    Hadded, Mohamed; Muhlethaler, Paul; Zagrouba, Rachid; Laouiti, Anis; Saidane, Leila Azouz

    2015-01-01

    —Vehicular ad hoc networks (VANETs) where vehicles act as mobile nodes is an instance of Mobile Ad hoc NETworks (MANETs), which are essentially developed for intelligent transportation systems. A challenging problem when designing communication protocols in VANETs is coping with high vehicle mobility, which causes frequent changes in the network topology and leads to frequent breaks in communication. The clustering technique is being developed to reduce the impact of mobility between neighbor...

  18. Analysis of DelAck based TCP-NewReno with varying window size over Mobile Ad Hoc Networks

    Parul Puri; Gaurav Kumar; Bhavna Tripathi; Gurjit Kaur

    2012-01-01

    In this paper, we study TCP performance over multi-hop wireless networks that use IEEE 802.11 protocol for access. For such networks NewReno is the most deployed TCP variant that handles multiple packet losses efficiently. It is shown that the delayed ACK scheme substantially increases the TCP throughput. We propose an approach to improve the performance of half-duplex and asymmetric multi hop networks widely employed for mobile communication. Our approach is based on optimizing the timer dur...

  19. The distributed parallel genetic algorithm on the ad hoc network

    Nima Afifi

    2015-02-01

    Full Text Available Today, mobile computing is one of the important issues in computer and network sciences. Using the processing power of mobile devices purposefully for solving complex issues is one of the research fields for researchers. One of the important issues in the optimization which needs a high processing power for finding the best possible answer is travelling salesman problem. In this paper, by providing a method based on the distributed parallel genetic algorithm on a number of mobile nodes in the Ad Hoc network, it was attempted to increase the speed of finding the best answer for the travelling salesman algorithm.

  20. A Performance Study of Reactive Multicast Routing Protocols in Virtual Class Room Using Mobile Ad Hoc Network

    S. Vijayaragavan

    2009-01-01

    Full Text Available Problem statement: A great deal of excitement has recently propelled Mobile Learning to the forefront of educational technology. The exponential growth of mobile technology in the recent years, increase in the availability of high-bandwidth network, advances in wireless technologies and popularity of handheld devices, have opened up new accessibility opportunities for education. Approach: Virtual class room using MANET had been proposed to enhance the m-Learning opportunities in a residential institution. Results: This environment transferred both large and small volume of data to the particular group members. Generally multicasting supports group oriented computing. Such a group oriented service required a suitable multicast routing protocol. Two standard multicast routing protocols were implemented and analyzed for tree (MAODV and mesh (ODMRP based approach. The performances of group learning module of VCR had been analyzed using MAODV and ODMRP routing protocols for parameters such as network traffic, the node speed and the network area. Conclusion/Recommendations: Our results showed that many scenarios in VCR environment, MAODV achieved a higher packet delivery ratio than ODMRP.

  1. Distributed Reinforcement Learning Approach for Vehicular Ad Hoc Networks

    Wu, Celimuge; Kumekawa, Kazuya; Kato, Toshihiko

    In Vehicular Ad hoc Networks (VANETs), general purpose ad hoc routing protocols such as AODV cannot work efficiently due to the frequent changes in network topology caused by vehicle movement. This paper proposes a VANET routing protocol QLAODV (Q-Learning AODV) which suits unicast applications in high mobility scenarios. QLAODV is a distributed reinforcement learning routing protocol, which uses a Q-Learning algorithm to infer network state information and uses unicast control packets to check the path availability in a real time manner in order to allow Q-Learning to work efficiently in a highly dynamic network environment. QLAODV is favored by its dynamic route change mechanism, which makes it capable of reacting quickly to network topology changes. We present an analysis of the performance of QLAODV by simulation using different mobility models. The simulation results show that QLAODV can efficiently handle unicast applications in VANETs.

  2. Ant Based Dynamic Source Routing Protocol to Support Multiple Quality of Service (QoS Metrics in Mobile Ad Hoc Networks

    R.Asokan

    2008-09-01

    Full Text Available Quality of Service (QoS support for Mobile Ad hoc Networks (MANETs is an exigent task due to dynamic topology and limited resource. To support QoS, the link state information such as delay, bandwidth, jitter, cost, error rate and node energy in the network should be available and manageable. The focus of this paper is extending the scope to QoS routing procedure, to inform the source about QoS available to any destination in the wireless network. However, existing QoS routing solutions were dealt with only one or two of the QoS parameters. It is important that MANETs should provide QoS support routing, such as acceptable delay, jitter and energy in the case of multimedia and real time applications. This paper proposes a QoS Dynamic Source Routing (DSR protocol using Ant Colony Optimization (ACO called Ant DSR (ADSR.The performance of DSR and ADSR are analyzed using network simulator-2. ADSR produces better results than the existing DSR in terms of delay, energy, jitter and throughput.

  3. Security Issues Pertaining to Ad-Hoc Networks - A Survey

    Rishu Bhatia

    2012-01-01

    Full Text Available A mobile ad-hoc network (MANET is a self-configuring network of mobile routers (and associated hosts connected by wireless links—the union of which form an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. MANETs are usually set up in situations of emergency for temporaryoperations or simply if there are no resources to set up elaborate networks. These types of networks operate in the absence of any fixed infrastructure, which makes them easy to deploy, at the same time however, due to the absence of any fixed infrastructure, it becomes difficult to make use of the existing routing techniques for network services, and this poses a number of challenges in ensuring the security of the communication, something that is not easily done as many of the demands of network security conflict with thedemands of mobile networks, mainly due to the nature of the mobile devices (e.g. low power consumption, low processing load. Many of the ad hoc routing protocols that address security issues rely on implicit trust relationships to route packets among participating nodes. Besides the general security objectives like authentication,confidentiality, integrity, availability and non-repudiation, the ad hoc routing protocols should also address location confidentiality, cooperation fairness and absence of traffic diversion. In this paper we attempt to analyze threats faced by the ad hoc network environment and provide a classification of the various security mechanisms. We analyzed the respective strengths and vulnerabilities of the existing routing protocols and suggest a broad and comprehensive framework that can provide a tangible solution.

  4. A new traffic allocation algorithm in Ad hoc networks

    LI Xin; MIAO Jian-song; SUN Dan-dan; ZHOU Li-gang; DING Wei

    2006-01-01

    A dynamic traffic distribution algorithm based on the minimization product of packet delay and packet energy consumption is proposed. The algorithm is based on packet delay and energy consumption in allocating traffic, which can optimize the network performance. Simulation demonstrated that the algorithm could dynamically adjust to the traffic distribution between paths, which can minimize the product of packet delay and energy consumption in mobile Ad hoc networks.

  5. Quality of service on ad-hoc wireless networks

    Paoliello Guimaraes, Rafael

    2008-01-01

    Over the last years, Mobile Ad-hoc Networks (MANETs) have captured the attention of the research community. The flexibility and cost savings they provide, due to the fact that no infrastructure is needed to deploy a MANET, is one of the most attractive possibilities of this technology. However, along with the flexibility, lots of problems arise due to the bad quality of transmission media, the scarcity of resources, etc. Since real-time communications will be common in MANETs, there has been ...

  6. TRUST ORIENTED SECURITY FRAMEWORK FOR AD HOC NETWORK

    Amandeep Verma

    2012-05-01

    Full Text Available An ad hoc network is a group of wireless mobile hosts that are connected momentarily through wireless connections in the dearth of any centralized control or some supporting services. The mobile ad hoc network is at risk by its environment because of the vulnerabilities at channel and node level. The conventional security mechanisms deals with only protecting resources from unauthorized access, but are not capable to safeguard the network from who offer resources. Adding trust to the on hand security infrastructures would improvise the security of these environments. A trust oriented security framework for adhoc network using ontological engineering approach is proposed by modeling ad hoc network, the OLSR (Optimized Link State Routing protocol and trust model as OWL (Ontology Web language ontologies, which are integrated using Jena. In this model, a trustor can calculate its trust about trustee and use the calculated trust values to make decisions depending on the context of the application or interaction about granting or rejecting it. A number of experiments with a potential implementation of suggested framework are performed to validate the characteristics of a trust oriented model suggested by the literature by this framework

  7. Cluster-based Intrusion Detection in Wireless Ad-Hoc Networks

    Di Wu; Zhisheng Liu; Yongxin Feng; Guangxing Wang

    2004-01-01

    There are inherent vulnerabilities that are not easily preventable in the mobile Ad-Hoc networks.To build a highly secure wireless Ad-Hoc network,intrusion detection and response techniques need to be deployed;The intrusion detection and cluster-based Ad-Hoc networks has been introduced,then,an architecture for better intrusion detection based on cluster using Data Mining in wireless Ad-Hoc networks has been shown. A statistical anomaly detection approach has been used.The anomaly detection and trace analysis have been done locally in each node and possibly through cooperation with clusterhead detection in the network.

  8. Protection of an intrusion detection engine with watermarking in ad hoc networks

    Mitrokotsa, A.; Komninos, N.; Douligeris, C.

    2010-01-01

    Mobile ad hoc networks have received great attention in recent years, mainly due to the evolution of wireless networking and mobile computing hardware. Nevertheless, many inherent vulnerabilities exist in mobile ad hoc networks and their applications that affect the security of wireless transactions. As intrusion prevention mechanisms, such as encryption and authentication, are not sufficient we need a second line of defense, Intrusion Detection. In this pa-per we present an intrusion detecti...

  9. A REVIEW PAPER ON AD HOC NETWORK SECURITY

    Karan Singh

    2007-06-01

    Full Text Available In this article we present a survey of secure ad hoc routing protocols for wireless networks. Ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. Attacks on ad hoc network routing protocols disrupt network performance and reliability with there solution. We briefly present the most popular protocols that follow the table-driven and the source-initiated on-demand approaches. The comparison between the proposed solutions and parameters of ad hoc network shows the performance according to secure protocols. We discuss in this paper routing protocol and challenges and also discuss authentication in ad hoc network.

  10. GPS Based Secure Communication Strategy For Vehicular Ad Hoc Networks

    Riyaz Shaik, P. Prasanna MuraliKrishna, DR. M.V. Subhramanyam

    2012-10-01

    Full Text Available Now a day, one of the most attractive research topics in the area of Intelligent Traffic Control is Inter vehicle communication. In V2V communication or we can also call VANET i.e. Vehicular ad-hoc network; a vehicle can communicate with its neighboring vehicles even in the absence of a central Base Station. The concept of this shortest communication is to send vehicle safety messages one-to-one or one too-many vehicles via wireless connection. Such messages are generally short in length and have very short lifetime in which they have to reach at the target. The Inter-vehicle communication system is an adhoc network with high mobility and changing number of nodes, where mobile nodes animatedly create temporary networks and transferring messages from one node to others by using multiple hops due to restriction of tiny range. The routing in vehicular Ad hoc Networks (VANET has attracted many attentions during the last few years. So in this thesis we are focusing on the routing concept for the VANET i.e. Principles for routing, disintegration of the routing function and obligation. The data delivery through Vehicular Ad-hoc Networks is challenging since it must efficiently handle rapid topology changes and a fragmented network.

  11. Safety Message Power Transmission Control for Vehicular Ad hoc Networks

    Samara, Ghassan; Al-Salihy, Wafaa A H

    2010-01-01

    Vehicular Ad hoc Networks (VANET) is one of the most challenging research area in the field of Mobile Ad Hoc Networks. In this research we proposed a dynamic power adjustment protocol that will be used for sending the periodical safety message. (Beacon)based on the analysis of the channel status depending on the channel congestion and the power used for transmission. The Beacon Power Control (BPC) protocol first sensed and examined the percentage of the channel congestion, the result obtained was used to adjust the transmission power for the safety message to reach the optimal power. This will lead to decrease the congestion in the channel and achieve good channel performance and beacon dissemination.

  12. Reformative multicast routing protocol based on Ad Hoc

    杨喜旺; 王华; 焦国太

    2008-01-01

    Mobile Ad Hoc networks has been widely applied to military field, emergency management, public service and so on. Because it is uncertain on network and communication, a great deal of energy will be consumed with nodes increasing and creating routing each other. The reformative on-demand multicast routing protocol was putted forward by researching the energy consuming of multicast routing protocol in Ad Hoc. It will decrease consumption in a big multicast flooding through studying the relaying group net structure based on map or wormhole. The energy consumption is reduced 30% by creating the two kinds of routing principles: minimization of energy consumption and minimization of maximum nodes energy consumption. The simulation result indicates that the reformative RODMRP is effective to reduce the energy consuming while routing protocol built.

  13. Performance Comparison Of Link, Node and Zone Disjoint Multi-Path Routing Strategies and Minimum Hop Single Path Routing For Mobile Ad Hoc Networks

    Natarajan Meghanathan

    2010-11-01

    Full Text Available The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs betweenlifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepathminimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjointalgorithms proposed in this paper can be used to arrive at benchmarks for the time between successivemulti-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipathset. We assume a multi-path set exists as long as at least one path in the set exists. Simulation resultsindicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lowerthan the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjointmulti-path discoveries would be far lower than the time between node and link-disjoint multi-pathroute discoveries and can be at most 45% more than the time between single minimum-hop path routediscoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint,node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the averageminimum hop count determined using single-path routing. We also observe that even though the numberof link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjointpaths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be atmost 15-25% more than the time between two successive node-disjoint multi-path discoveries, withoutany significant difference in the hop count per multi-path set.

  14. Supervision de la sécurité pour des réseaux ad hoc mobiles : un système léger, robuste, et fiable de détection d'intrusion

    Alattar, Mouhannad

    2013-01-01

    Mobile Ad hoc NETworks (referred to as MANETs) continue increasing their presence in our every day life. They become a corner stone in the commercial, the society, the military, the science, and even the next-generation applications. However, these networks mostly operate over open environments and are therefore vulnerable to a large body of threats. Traditional ways of securing networks relying on preventive techniques, e.g., firewall and encryption, are not sufficient and should henceforth ...

  15. Worm epidemics in wireless ad hoc networks

    Nekovee, Maziar

    2007-06-01

    A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet.

  16. Dynamic Connectivity in ALOHA Ad Hoc Networks

    Ganti, RadhaKrishna

    2008-01-01

    We consider an ad hoc network which uses multihop routing and slotted ALOHA for its MAC contention. We show that the minimum time required for a packet to reach the destination from the origin scales linearly with the distance. We define this delay as the minimum time required for a causal path to form between the source and destination. We derive the distributional properties of the connection time using ideas from first passage percolation and epidemic processes. We show that the delay scales linearly with the distance and also provide asymptotic results (with respect to time) for the positions of the nodes which are able to receive information from a transmitter located at the origin. We also provide simulation results to support the theoretical results.

  17. Worm epidemics in wireless ad hoc networks

    A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet

  18. A Study on the Tracking Problem in Vehicular Ad Hoc Networks

    Xing Zhang; Bang Liu; Jinchuan Tang

    2013-01-01

    Vehicles have the characteristic of high mobility which makes vehicular ad hoc networks (VANETs) different from other mobile ad hoc networks (MANETs), it is more difficult to establish an end-to-end route in VANETs, and the source and destination nodes keep moving fast from their original locations. To guarantee a data packet will finally be received by the destination node in VANETs, and the location of the destination node must be tracked constantly. Advanced Greedy Forwarding (AGF (Naumov ...

  19. A Comparision Study of Common Routing Protocols Used In Wireless Ad-Hoc Networks

    Basim Alhadidi

    2013-04-01

    Full Text Available The aim of this study is to analyze and compare performance of both reactive and proactive Mobile Ad hoc Networks (MANETs routing protocols using different environments. Wireless networks are divided into two types: infrastructure and ad hoc network. In wireless ad hoc networks each node can be a sender, router and receiver, so these types of network are less structure compared to infrastructure network. Therefore wireless ad hoc networks need special routing protocols to overcome the limitations of wireless ad hoc networks. Wireless ad hoc networks routing protocols can be categorized into two types: reactive (on demand routing protocols and proactive routing protocols. In proactive routing protocols the nodes periodically send control messages across the network to build routing table. Different routing protocols have been simulated using GloMoSim (Global Mobile Information system simulation library and PARSEC compiler. Five multi-hop wireless ad hoc network routing protocols have been simulated to cover a range of design choices: Wireless Routing Protocol (WRP, Fisheye State Routing (FSR, Dynamic Source Routing (DSR, Ad hoc On-demand Distance Vector (AODV and Location Aided Routing (LAR. The protocols are evaluated in different environments to investigate performance metrics. Performance metric includes the following aspects: packets deliver ratio, end-to-end delay and end-to-end throughput.

  20. A Smart Booster Approach In Wireless Ad Hoc Network

    Anzar Ahmad

    2016-02-01

    Full Text Available Wireless Mobile Ad-hoc network is upcoming next generation technology. The foremost reason to be the popularity of MANET is its infrastructure less nature. MANET is a group of wireless mobile nodes which are connected wirelessly. Nodes may be highly mobile because the beauty of wireless network (like MANET or cellular system lies in mobility. But due to this mobility of nodes, the topology of the node and network changed frequently. This frequent change topology affect to the communication between nodes. If nodes are within the range of each other they can communicate properly but if nodes are not in the range of each other, communication will not be possible smoothly or even ongoing communication may be disrupt or lost. So there is a need to develop and design a mechanism or system that can handle such types of situation and prevent communication failure or frequent link failure. In the present work a novel booster mechanism approach is proposed to overcome such situation or Link failure. In the proposed Approach, the level of the Power at both the Transmitter as well as Receiver is measured in order to maintain communication smooth between the nodes. If one node is moving away from the communicating node then both moving node will measure its receiving power with respect to the distance and if its current power level reaches the threshold level it switched “ON” its Booster and at the same time it send a message to source node which contains received power level of moving node due to this ,that source node also “ON” its Booster and thus both nodes connect together to protect the link failure during that mobility. The Booster Approach is a novel concept in the direction of smooth communication in dynamic or wireless environment in Mobile Ad hoc Network.

  1. A Comparison of Routing Strategies for Vehicular Ad Hoc Networks

    Füßler, Holger; Mauve, Martin; Hartenstein, Hannes; Käsemann, Michael; Vollmer, Dieter

    2002-01-01

    On this paper we investigate the use of ad-hoc routing algorithms for the exchange of data between vehicles. There are two main aspects that are of interest in this context: the specific characteristics of ad-hoc networks formed by vehicles and the applicability of existing ad-hoc routing schemes to networks that display these characteristics. In order to address both aspects we generate realistic vehicular movement patterns of highway traffic scenarios using a well validated traffic simulati...

  2. Ad Hoc Protocols Via Multi Agent Based Tools

    Ali Bazghandi; Mehdi Bazghandi

    2011-01-01

    The purpose of this paper is investigating behaviors of Ad Hoc protocols in Agent-based simulation environments. First we bring brief introduction about agents and Ad Hoc networks. We introduce some agent-based simulation tools like NS-2. Then we focus on two protocols, which are Ad Hoc On-demand Multipath Distance Vector (AODV) and Destination Sequenced Distance Vector (DSDV). At the end, we bring simulation results and discuss about their reasons.

  3. Policy Enforcing and Revoking Mechanism on Trusted Ad Hoc Networks

    Sujatha J; Mr. Manoj Challa

    2013-01-01

    In ad hoc networking the polices are vulnerable to a wide range of security in network attacks.The design of enforcing and revoking policy mechanisms is a challenging task, especially in comparison tosecuring the ad hoc network. In this paper, the designed and implemented mechanism to provide a trustedcommunication for file sharing in ad-hoc network is explained, where the mechanism has been developedwith the help of polices where each policy is a combination of set of parameters. Simulation ...

  4. 抗毁的混合移动自组织网路由策略%Integrated routing strategy with high survivability for mobile Ad Hoc network

    马驰; 孟锦; 张宏

    2011-01-01

    Concerning that the performance of Mobile Ad Hoc NETwork (MANET) with normal route method degrades obviously when being under attack in battlefield, a new STHR route strategy which integrating AODV( MANET route method) and Spay & Waiter protocols( DTN route method) to achieve high survivability was proposed in this paper. And to reduce the total network load, the method for choosing DTN nodes was designed. At the situation of hard network attacking, the target node may not be searched by AODV search extending ring. Then the zone covering nodes called ZCSEN in this paper would be used to start DTN route progress. In this way, the performance of MANET becomes stable even when it is under attack. The experimental results by ONE'show that the delivery rate of STHR is better than AODV and the delay time is shorter than Spay & Waiter route protocol.%针对战场毁伤条件下移动自组网(MANET)普通路由算法性能下降的问题,在舍有抗毁增强节点的混合MANET网络中,融合了普通MANET路由和容迟网络(DTN)路由设计了抗毁性增强路由协议STHR,并且为了降低网络负载和冲突对STHR中抗毁增强节点的选取算法进行了设计.在网络遭受毁伤甚至出现分割情况下,MANET路由扩展环无法到达目标节点,但借助具有区域覆盖特性的抗毁增强节点转入DTN路由,可以保证在一定时延容忍前提下,仍能保持较高的分组投递率.通过ONE仿真平台实验,结果表明在毁伤情况下,STHR的分组投递率要优于AODV路由,而路由时延低于DTN喷雾等待路由.

  5. Analysis of Multipath Routing in Random Ad Hoc Networks Scenario

    Indrani Das

    2014-10-01

    Full Text Available In this study, we have proposed a multipath routing protocol for Mobile Ad Hoc Networks. Multipath routing overcomes various problems that occur in data delivery through a single path. The proposed protocol selects multiple neighbor nodes of source node to establish multiple paths towards destination. These nodes are selected based on their minimum remaining distance from destination. We have computed the length of various paths and average hops count for different node density in the network. We have considered only three paths for our evaluation. The results show that path-2 gives better results in term of hop count and path length among three paths.

  6. Studies on urban vehicular ad-hoc networks

    Zhu, Hongzi

    2013-01-01

    With the advancement of wireless technology, vehicular ad hoc networks (VANETs) are emerging as a promising approach to realizing 'smart cities' and addressing many important transportation problems such as road safety, efficiency, and convenience.This brief provides an introduction to the large trace data set collected from thousands of taxis and buses in Shanghai, the largest metropolis in China. It also presents the challenges, design issues, performance modeling and evaluation of a wide spectrum of VANET research topics, ranging from realistic vehicular mobility models and opportunistic ro

  7. EXTENDED DYNAMIC SOURCE ROUTING PROTOCOL FOR AD HOC NETWORK

    Puja Kumari Sharma

    2012-07-01

    Full Text Available MANET is a collection of self-configurable mobile nodes. Several routing protocols are proposed for ad hoc network among which DSR and AODV On demand routing protocols are mostly used. Existing Dynamic source routing protocol is not suitable for large network because packet size gets increased according to the number of nodes travelled by route discovery packet. In this paper, extended DSR routing protocol is proposed to eliminate the above limitation of existing DSR. Proposed protocol will be suitable for small and large both types of networks.

  8. Node Disjoint-Virtual Circuit Approach in Ad Hoc On-Demand Multipath Distance Vector Routing to offer Quality of Service in Ad Hoc Networks

    B.SREEDEVI,

    2011-04-01

    Full Text Available Multi-path routing represents a promising routing method for wireless mobile ad hoc networks. Multipath routing achieves load balancing and is more resilient to route failures. Numerous multipath routing protocols have been proposed for wireless ad hoc networks and the most important among them is Ad hoc On-demand Multipath Distance Vector (AOMDV. By virtual circuit approach, using the property of node disjointness, its performance is evaluated. The simulation in Network Simulator (ns2 shows that it is good in its throughput with packet delivery ratio with less delay. The results conclude that AOMDV performs well than Ad hoc On-demand Distance Vector (AODV in all above said aspects.

  9. Philosophical perspectives on ad hoc hypotheses and the Higgs mechanism

    Friederich, Simon; Harlander, Robert; Karaca, Koray

    2014-01-01

    We examine physicists' charge of ad hocness against the Higgs mechanism in the standard model of elementary particle physics. We argue that even though this charge never rested on a clear-cut and well-entrenched definition of "ad hoc", it is based on conceptual and methodological assumptions and pri

  10. AD HOC TEAMWORK BEHAVIORS FOR INFLUENCING A FLOCK

    Katie Genter

    2016-02-01

    Full Text Available Ad hoc teamwork refers to the challenge of designing agents that can influence the behavior of a team, without prior coordination with its teammates. This paper considers influencing a flock of simple robotic agents to adopt a desired behavior within the context of ad hoc teamwork. Specifically, we examine how the ad hoc agents should behave in order to orient a flock towards a target heading as quickly as possible when given knowledge of, but no direct control over, the behavior of the flock. We introduce three algorithms which the ad hoc agents can use to influence the flock, and we examine the relative importance of coordinating the ad hoc agents versus planning farther ahead when given fixed computational resources. We present detailed experimental results for each of these algorithms, concluding that in this setting, inter-agent coordination and deeper lookahead planning are no more beneficial than short-term lookahead planning.

  11. M-BOARD IN AN AD-HOC NETWORK ENVIRONMENT

    Sharon Panth

    2013-04-01

    Full Text Available Notice Board is very essential part of any organization. This paper presents the design and implementation of M-Board (Mobile Notice Board for Ad-hoc Network Environment that can be established and made available for an educational or industry environment. The cost-free communication among the mobile phone clients and server takes place with the help of Bluetooth wireless technology. M-Board is particularly developed as an informative application environment to provide the basic information like daily events or timetable to the users. The design is based on the amalgamation of Java ME with other technologies like Java SE, Java EE, PHP and MySQL. The system is designed to provide simple, easy-to-use, cost-free solution in a ubiquitous environment. The system design is easily implemented and extensible allowing the number of clients in Personal Area Network (PAN for information exchange with the hotspot-server.

  12. A Survey: variants of TCP in Ad-hoc networks

    Komal Zaman

    2013-11-01

    Full Text Available MANET (Mobile Ad-hoc network forms a temporary network of wireless mobile nodes without any infrastructure where all nodes are allowed to move freely, configure themselves and interconnect with its neighbors to perform peer to peer communication and transmission. TCP (Transmission Control Protocol offers reliable, oriented connection and mechanism of end to end delivery. This article provides the review and comparison of existing variants of TCP for instance: The TCP Tahoe, The TCP Reno, The TCP New Reno, The Lite, The Sack, The TCP Vegas, Westwood and The TCP Fack. TCP’s performance depends on the type of its variants due to missing of congestion control or improper activation procedures such as Slow Start, Fast Retransmission, and Congestion Avoidance, Retransmission, Fast Recovery, Selective Acknowledgement mechanism and Congestion Control. This analysis is essential to be aware about a better TCP implementation for a specific scenario and then nominated a suitable one.

  13. Opinion Impact Models and Opinion Consensus Methods in Ad Hoc Tactical Social Networks

    Demin Li; Jie Zhou; Jingjuan Zhu; Jiacun Wang

    2013-01-01

    Ad hoc social networks are special social networks, such as ad hoc tactical social networks, ad hoc firefighter social networks, and ad hoc vehicular social networks. The social networks possess both the properties of ad hoc network and social network. One of the challenge problems in ad hoc social networks is opinion impact and consensus, and the opinion impact plays a key role for information fusion and decision support in ad hoc social networks. In this paper, consider the impact of physic...

  14. Low Power 24 GHz ad hoc Networking System Based on TDOA for Indoor Localization

    Melanie Jung; Georg Fischer; Robert Weigel; Thomas Ussmueller

    2013-01-01

    This paper introduces the key elements of a novel low-power, high precision localization system based on Time-Difference-of-Arrival (TDOA) distance measurements. The combination of multiple localizable sensor nodes, leads to an ad hoc network. Besides the localization functionality this ad hoc network has the additional advantage of a communication interface. Due to this a flexible positioning of the master station for information collection and the detection of static and mobile nodes is pos...

  15. Inter-vehicle-communications based on ad hoc networking principles. The FleetNet Project

    Franz, Walter; Hartenstein, Hannes; Mauve, Martin

    2005-01-01

    Vehicular Ad Hoc Networks (VANETs) represent an emerging topic in wireless communication and networking. VANETs are currently receiving a lot of attention due to their promise of considerably increasing safety and comfort while being on the road. High mobility, adverse channel conditions, and market introduction are some of the key challenges one has to deal with when designing these spontaneous networks. Inter-Vehicle-Communications Based on Ad Hoc Networking Principles covers results and ac...

  16. Studying Vehicle Movements on Highways and their Impact on Ad-Hoc Connectivity

    Füßler, Holger; Torrent-Moreno, Marc; Krüger, Roland; Transier, Matthias; Hartenstein, Hannes; Effelsberg, Wolfgang

    2005-01-01

    While Mobile Ad-Hoc Networks are generally studied using a randomized node movement model such as the Random Way-Point model [8], Vehicular Ad-Hoc Networks deal with street-bound vehicles following a completely different movement pattern. This results - among other things - in a completely different connectivity situation and new challenges for data dissemination or routing/forwarding algorithms. Thus, researchers need a) suitable movement patterns for simulation, and b) a solid statistical u...

  17. DelPHI: wormhole detection mechanism for ad hoc wireless networks

    Chiu, HS; Wong Lui, KS

    2006-01-01

    In mobile ad hoc networks, data transmission is performed within an untrusted wireless environment. Various kinds of attack have been identified and corresponding solutions have been proposed. Wormhole attack is one of the serious attacks which forms a serious threat in the networks, especially against many ad hoc wireless routing protocols and location-based wireless security system. We identify two types of wormhole attacks. In the first type, malicious nodes do not take part in finding rou...

  18. The Study of Routing Strategies in Vehicular Ad- Hoc Network to Enhance Security

    Parveen Kumar

    2012-01-01

    In VANET, or Intelligent Vehicular Ad-HocNetworking, defines an intelligent way of usingVehicular Networking. In VANET integrates onmultiple ad-hoc networking technologies such as WIFIIEEE 802.11p, WAVE IEEE 1609, WIMAX IEEE802.16, Bluetooth, IRA, and ZIGBEE for easy,accurate, effective and simple communication betweenvehicles on dynamic mobility. Effective measuressuch as media communication between vehicles canbe enabled as well as methods to track the automotivevehicles. In VANET helps in ...

  19. Efficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm

    Prasanth, K; Jayasudha, K; Chandrasekar, C

    2010-01-01

    VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a reliable greedy position based routing approach to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that packet delivery ratio is improved considerably compared to other routing techniques of V...

  20. Efficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm

    K. Jayasudha

    2010-01-01

    Full Text Available VANETs (Vehicular Ad hoc Networks are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing, a reliable greedy position based routing approach to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that packet delivery ratio is improved considerably compared to other routing techniques of VANET.

  1. LAMAN: Load Adaptable MAC for Ad Hoc Networks

    Realp Marc

    2005-01-01

    Full Text Available In mobile ad hoc radio networks, mechanisms on how to access the radio channel are extremely important in order to improve network efficiency. In this paper, the load adaptable medium access control for ad hoc networks (LAMAN protocol is described. LAMAN is a novel decentralized multipacket MAC protocol designed following a cross-layer approach. Basically, this protocol is a hybrid CDMA-TDMA-based protocol that aims at throughput maximization in multipacket communication environments by efficiently combining contention and conflict-free protocol components. Such combination of components is used to adapt the nodes' access priority to changes on the traffic load while, at the same time, accounting for the multipacket reception (MPR capability of the receivers. A theoretical analysis of the system is developed presenting closed expressions of network throughput and packet delay. By simulations the validity of our analysis is shown and the performances of a LAMAN-based system and an Aloha-CDMA-based one are compared.

  2. 增强Ad Hoc网络稳定性的移动问题解决策略%Strategy to Enhance the Communication Stability in Mobile Ad Hoc Network

    何晖; 王换招; 李昊; 梅涛; 郗旻

    2011-01-01

    A mobility problem-Solving strategy (MSEN) to enhance network stability is proposed to address the low stability of communication in Mobile Ad Hoc network, The strategy obtains the stability of communication routes by detecting the relative rates, and computing the stability of links among nodes. Routes with high stability will be preferred to improve network reliability.The strategy focuses on the problem of stability declining caused by mobility of nodes, and uses the creative method of moving direction prediction to raise the stability of the network. Simulation results show that the method selects the communication link with higher stability. Comparisons with traditional methods show that the performance of communication delay time is reduced by about l%, and the throughput is increased by about 5%.%针对移动自组织网络中网络通信稳定性较低的问题,提出了增强网络稳定性的移动问题解决策略.该策略通过检测节点的相对移动速率,计算节点间链路的稳定性,得到网络中通信路径的稳定度,从而选择稳定度高的路径进行通信.该策略针对节点移动可能导致的通信可靠性约降低问题,利用检测移动速率预测节点运动趋势这一创新方法提高了系统数据传输的可靠性.实验结果表明,该策略利用节点移动预测的方法可以有效选择可靠性更高的数据链路,与传统方法相比,通信延迟时间约降低1%,吞吐量约提高5%.

  3. Broadcast design in cognitive radio ad hoc networks

    Song, Yi

    2014-01-01

    This SpringerBrief investigates the special challenges of broadcast design in cognitive radio (CR) ad hoc networks. It introduces two broadcast protocols in CR ad hoc networks: a quality-of-service based broadcast protocol under blind information and a fully-distributed broadcast protocol with collision avoidance. A novel unified analytical model is also presented to analyze the performance of the broadcast protocols. This is the first book dedicated to the unique broadcast design challenges in CR ad hoc networks. The authors also discuss the recent research on the performance analysis of broa

  4. AD HOC TEAMWORK BEHAVIORS FOR INFLUENCING A FLOCK

    Katie Genter; Peter Stone

    2016-01-01

    Ad hoc teamwork refers to the challenge of designing agents that can influence the behavior of a team, without prior coordination with its teammates. This paper considers influencing a flock of simple robotic agents to adopt a desired behavior within the context of ad hoc teamwork. Specifically, we examine how the ad hoc agents should behave in order to orient a flock towards a target heading as quickly as possible when given knowledge of, but no direct control over, the behavior of the flock...

  5. Simulation Based: Study and Analysis of Routing Protocol in Vehicular Ad-hoc Network Environment

    Vaishali D. Khairnar

    2012-03-01

    Full Text Available A Vehicular Ad hoc Network (VANET consists of vehicles which communicate with each other and exchange data via wireless communication links available between the vehicles which are in communication ranges of vehicles to improve the road safety in city. The communication between vehicles is used to provide road safety, comfort and entertainment. The performance of communication depends on how better routing takes place in the network. Routing data between the source and destination vehicle depends on the routing protocols being used in vehicular ad-hoc network. In this simulation based study we investigated about different ad hoc routing protocols for vehicular ad-hoc network (VANET. The main goal of our study was to identify which ad hoc routing protocol has better performance in highly mobile environment of vehicular ad-hoc network. We have measured the performance of routing protocols using 802.11p in vehicular ad-hoc network in which we considered the scenario of city (i.e. Route between Nerul and Vashi where we have take 1200 different types of vehicles and checked their performance. Routing protocols are selected after the literature review. The selected protocols are then evaluated through simulation under 802.11p in terms of performance metrics (i.e PDR & E2E delay

  6. Intrusion Detection in Mobile Ad hoc Networks Based on Allocated Tasks%移动自组网中基于任务分配的入侵检测

    杨瑞君; 程燕; 汪为农

    2009-01-01

    Mobile Ad hoc network is a crossbred of computer network and wireless communication. A new Intrusion Detection System(IDS) scheme based on allocated tasks of IDS functions is proposed, and the main functional modules implementation is provided. Experimental result shows that new IDS scheme not only satisfies the basic requirements same as the traditional IDS, but also saves the network resources effectively with enhancing the availability of mobile nodes in Ad hoc networks.%移动自组网具有传统计算机网络及无线通信网络两方面的复杂性.提出移动自组网中基于任务分配的网络入侵检测方案,并描述各主要功能模块的实现,通过模拟实验对方案进行验证.实验结果显示,该方案除了能基本实现传统移动自组网络IDS的功能之外,还能有效节约网络系统的资源,提高网络移动节点的可用性.

  7. Vehicular ad hoc networks standards, solutions, and research

    Molinaro, Antonella; Scopigno, Riccardo

    2015-01-01

    This book presents vehicular ad-hoc networks (VANETs) from the their onset, gradually going into technical details, providing a clear understanding of both theoretical foundations and more practical investigation. The editors gathered top-ranking authors to provide comprehensiveness and timely content; the invited authors were carefully selected from a list of who’s who in the respective field of interest: there are as many from Academia as from Standardization and Industry sectors from around the world. The covered topics are organized around five Parts starting from an historical overview of vehicular communications and standardization/harmonization activities (Part I), then progressing to the theoretical foundations of VANETs and a description of the day-one standard-compliant solutions (Part II), hence going into details of vehicular networking and security (Part III) and to the tools to study VANETs, from mobility and channel models, to network simulators and field trial methodologies (Part IV), and fi...

  8. A Mobile ad hoc Network Routing Algorithm Based on Walking Length Prediction after Particle Filtering%基于粒子滤波步行长度预测的移动ad hoc网络路由算法

    张玲; 聂少华

    2016-01-01

    For the problems of mobile ad hoc network( MANET) such as big change of topology structure, high routing complexity,and low data transmission performance,this paper proposes a new mobile commu-nication system using an adaptive routing algorithm. In order to make the network topology closer to the characteristics of the mobile network intermittent connection,an improved Levy Walk Mobility Model is a-dopted in the network structure. And then,a particle filtering walking length method prediction is used to get a recursive Bayesian filter throush Monte Carlo sampling,and the walking length is predicted after parti-cle filtering to determine the number of copies of message, thereby reducing the energy consumption for node forwarding a copy to bring too many messages and improve the message delivery efficiency. Simulation results show that compared with two routing algorithms of ant colony-based optimization and profit optimi-zation-based model,the proposed algorithm improves the message passing success rate of 0. 08 and 0. 04, node average energy efficiency of 17. 9% and 13. 4%,respectively. So it achieves better results in impro-ving the success rate of data transfer and saving energy.%针对移动ad hoc网络拓扑结构变化大、路由复杂度高、数据传输性能低等问题,提出了一种新的移动通信系统自适应路由算法。为了使得网络拓扑结构更接近移动网络间歇性连接的特点,该算法在网络结构上采用了一种改进的Levy Walk移动模型。采用一种粒子滤波步行长度预测的方法,通过蒙特卡罗抽样得到递归贝叶斯滤波器,并在粒子滤波后进行步行长度预测,确定消息的副本数量,从而减少由于节点转发过多消息副本带来的能量消耗量,提高消息的传递效率。实验仿真结果表明:与基于改进蚁群优化和利润优化模型的路由算法相比,该算法的消息传递成功率分别提高了0.08和0.04,节点平均能量效率提高了17.9%和13

  9. DESAIN ALGORITMA DAN SIMULASI ROUTING UNTUK GATEWAY AD HOC WIRELESS NETWORKS

    Nixson Meok

    2009-12-01

    Full Text Available   Routing protocol to the wireless ad hoc networks is very needed in the communication process between some terminals, to send the data packet through one or several node(s to the destination address where the network typology is always changing. Many previous works that discussed about routing ad hoc both for manet (mobile ad hoc networks and wireless networks, but the emphasis have more focus on comparing the performance of several routing ad hoc. While in this work, there is a bulding of routing algorithm model to gateway in land to the nodes that analogized as a boat that move on the sea. With the assumption that the communication inter terminals to radio band of Very High Frequency, thus algorithm that built in the simulation based on the range gap of the HF frequency. The result of this simulation will be developed as the platform to implement the service development of multiuser communication

  10. Routing in Terrestrial Free Space Optical Ad-Hoc Networks

    Dong, Yao; Sadegh Aminian, Mohammad

    2014-01-01

    Terrestrial free-space optical (FSO) communication uses visible or infrared wavelengths to broadcast high speed data wirelessly through the atmospheric channel. The performance of terrestrial FSO channel mainly depends on the local atmospheric conditions. Ad hoc networks offer cost-effective solutions for communications in areas where infrastructure is unavailable, e.g., intelligent transport system, disaster recovery and battlefield scenarios. Traditional ad hoc networks operate in the radio...

  11. Easy Wireless: broadband ad-hoc networking for emergency services

    de Graaf,, Dirk C; Berg, van den, C.A.; Boucherie, Richard J.; Brouwer, Frank; Bruin, de, K.; Elfrink, Herman; Fernandez-Diaz, Irene; Heemstra de Groot, Sonia; Haan, de, R.J.; Jongh, de, J.; Nunez, Sindo; Ommeren, van, F.J.; Roijers, Frank; Stemerdink, Jan; Tromp, Erik

    2007-01-01

    Wireless ad-hoc networks will enable emergency services to continuously overview and act upon the actual status of the situation by retrieving and exchanging detailed up-to-date information between the rescue workers. Deployment of high-bandwidth, robust, self-organising ad-hoc networks will enable quicker response to typical what/where/when questions, than the more vulnerable low-bandwidth communication networks currently in use. This paper addresses a number of results of the Easy Wireless ...

  12. Définition et validation d'un modèle de communication supportant la communication basée contenus dans les réseaux mobiles ad hoc discontinus

    Haillot, Julien

    2010-01-01

    L'activité de recherche des dernières décennies dans le domaine des réseaux mobiles ad hoc (MANETs) a essentiellement visé à définir des méthodes de routage dynamique au sein de ces réseaux. La plupart des propositions faites dans cette optique reposent sur l'hypothèse que la communication entre deux terminaux mobiles n'est possible que si une route pour l'acheminement des messages peut être établie entre ces terminaux lorsque cela est nécessaire. Cette approche équivaut à considérer que la o...

  13. A secure and lightweight ad-hoc routing algorithm for personal networks

    A. Jehangir; Heemstra de Groot, S.M.

    2005-01-01

    Over the past few years, there has been increasing interest in utilizing Personal Area Networks (PANs) to offer users innovative and personalized services. This interest is a consequence of the widespread use of mobile devices such as laptops, mobile phones, PDAs, digital cameras, wireless headsets, etc. to carry out a variety of user-centric tasks. The PAN itself is built upon an ad-hoc network where devices trust their neighbors to route their packets. The cooperative nature of ad-hoc netwo...

  14. Vehicular Ad Hoc and Sensor Networks: Principles and Challenges

    Mohammad Jalil Piran

    2011-06-01

    Full Text Available The rapid increase of vehicular traffic and congest ion on the highways began hampering the safe and efficient movement of traffic. Consequently, year b y year, we see the ascending rate of car accidents and casualties in most of the countries. Therefore, exp loiting the new technologies, e.g. wireless sensor networks, is required as a solution of reduction of these sad dening and reprehensible statistics. This has motiv ated us to propose a novel and comprehensive system to utilize Wireless Sensor Networks for vehicular networks. W e coin the vehicular network employing wireless Senso r networks as Vehicular Ad Hoc and Sensor Network, or VASNET in short. The proposed VASNET is particularl y for highway traffic .VASNET is a self-organizing Ad Hoc and sensor network comprised of a large number of sensor nodes. In VASNET there are two kinds of sensor nodes, some are embedded on the vehicles-veh icular nodes- and others are deployed in predetermi ned distances besides the highway road, known as Road S ide Sensor nodes (RSS. The vehicular nodes are use d to sense the velocity of the vehicle for instance. We can have some Base Stations (BS such as Police Tra ffic Station, Firefighting Group and Rescue Team. The ba se stations may be stationary or mobile. VASNET provides capability of wireless communication betwe en vehicular nodes and stationary nodes, to increas e safety and comfort for vehicles on the highway road s. In this paper we explain main fundamentals and challenges of VASNET

  15. Inter-Cluster Routing Authentication for Ad Hoc Networks by a Hierarchical Key Scheme

    Yueh-Min Huang; Hua-Yi Lin; Tzone-I Wang

    2006-01-01

    Dissimilar to traditional networks, the features of mobile wireless devices that can actively form a network without any infrastructure mean that mobile ad hoc networks frequently display partition due to node mobility or link failures. These indicate that an ad hoc network is difficult to provide on-line access to a trusted authority server. Therefore,applying traditional Public Key Infrastructure (PKI) security framework to mobile ad hoc networks will cause insecurities.This study proposes a scalable and elastic key management scheme integrated into Cluster Based Secure Routing Protocol (CBSRP) to enhance security and non-repudiation of routing authentication, and introduces an ID-Based internal routing authentication scheme to enhance the routing performance in an internal cluster. Additionally, a method of performing routing authentication between internal and external clusters, as well as inter-cluster routing authentication, is developed.The proposed cluster-based key management scheme distributes trust to an aggregation of cluster heads using a threshold scheme faculty, provides Certificate Authority (CA) with a fault tolerance mechanism to prevent a single point of compromise or failure, and saves CA large repositories from maintaining member certificates, making ad hoc networks robust to malicious behaviors and suitable for numerous mobile devices.

  16. E2AODV Protocol for Load Balancing in Ad-Hoc Networks

    R. S.D. Wahida Banu

    2012-01-01

    Full Text Available Problem statement: In mobile ad hoc networks there are a number of challenges in providing quality of service routing with energy efficiency and load balancing. Most routing protocols do not consider the problem of load balance. A routing protocol called energy Efficient Ad-hoc on Demand Vector (E2AODV is proposed. It addresses the quality of service issues such as throughput, end to end delay, load distribution and energy. Approach: This study presents a scheme to balance the load with energy efficiency considering both congestion and the nodes energy usage. A threshold value was used to judge if intermediate node was overloaded, variable and changing along with nodes interface queue length around the backward path. Results: The routing protocol called energy Efficient Ad hoc on Demand Vector (E2AODV that is intended to provide a reliable transmission with low energy consumption was compared with Ad-hoc on Demand Vector (AODV in terms of the packet delivery ratio, average end to end delay, load distribution and node energy consumption. Conclusion/Recommendation: E2AODV protocol chooses an optimum path with low energy usage. It provides a better scheme to balance the load with energy efficiency and packet delivery ratio. It can be further enhanced as a secure routing protocol for mobile ad-hoc networks.

  17. Survey of Routing Protocols in Vehicular Ad-Hoc Network

    Karthikumar. P.

    2012-04-01

    Full Text Available Vehicular ad-hoc networks (VANETs are a promising communication scenario. Several new applications are envisioned, which will improve traffic management and safety. In comparison to other communication networks, Vehicular Ad-hoc Networks (VANETs have unique requirements with respect to applications, types of communication, self-organization and other issues. VANETspecific protocol layers, a staircase approach for interaction among layers and the use of an information connector for cross-layer information exchange using the publisher/subscriber pattern. The main goal of VANET is providing safety and comfort for passengers. Each vehicle equipped with VANET device will be a node in the Ad-hoc network and can receive

  18. A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks

    Al Hanbali, A.M.; Haan, de R.; Boucherie, R.J.; Ommeren, van J.C.W.

    2008-01-01

    Ad hoc network routing protocols may fail to operate in the absence of an end-to-end connection from source to destination. This deficiency can be resolved by so-called delay-tolerant networking which exploits the mobility of the nodes by letting them operate as relays according to the store-carry-a

  19. A tandem queueing model for delay analysis in disconnected ad hoc networks

    Al Hanbali, A.M.; Haan, de R.; Boucherie, R.J.; Ommeren, van J.C.W.

    2007-01-01

    Ad hoc network routing protocols may fail to operate in the absence of an end-to-end connection from source to destination. This deficiency can be resolved by so-called opportunistic networking which exploits the mobility of the nodes by letting them operate as relays according to the store-carry-an

  20. Gossip Based Routing Protocol Design for Ad Hoc Networks

    Toqeer Mahmood

    2012-01-01

    Full Text Available A spontaneously mannered decentralized network with no formal infrastructure and limited in temporal and spatial extent where each node communicate with each other over a wireless channel and is willing to forward data for other nodes is called as Wireless Ad Hoc network. In this research study, we proposed a routing strategy based on gossip based routing approach that follows the proactive routing with some treatment for wireless Ad Hoc network. The analytical verification of our proposed idea shows that it is a better approach based on gossip routing.

  1. Dynamic Encryption Technology in Ad-hoc Networks

    JIN Zhao-hui; WANG Shun-man; XU Kai; LIANG Qing

    2007-01-01

    A new dynamic encryption application in ad-hoc networks is proposed. The advantages of this method are its being able to use the previous ciphertext as a seed of a new encryption process, rendering the encryption process effective in all communication process by continuous dynamic key generation together with synchronization, and its capability to cut back on system bandages to a greater extent, which is valuable for the ad-hoc circumstance. In addition, the rationality and effectiveness of this novel encryption method have been verified by the test results.

  2. An Effective Capacity Estimation Scheme in IEEE802.11-based Ad Hoc Networks

    H. Zafar

    2012-11-01

    Full Text Available Capacity estimation is a key component of any admission control scheme required to support quality of serviceprovision in mobile ad hoc networks. A range of schemes have been previously proposed to estimate residualcapacity that is derived from window-based measurements of channel estimation. In this paper a simple and improvedmechanism to estimate residual capacity in IEEE802.11-based ad hoc networks is presented. The scheme proposesthe use of a ‘forgiveness’ factor to weight these previous measurements and is shown through simulation-basedevaluation to provide accurate utilizations estimation and improved residual capacity based admission control.

  3. The Study of Routing Strategies in Vehicular Ad- Hoc Network to Enhance Security

    Parveen Kumar

    2012-04-01

    Full Text Available In VANET, or Intelligent Vehicular Ad-HocNetworking, defines an intelligent way of usingVehicular Networking. In VANET integrates onmultiple ad-hoc networking technologies such as WIFIIEEE 802.11p, WAVE IEEE 1609, WIMAX IEEE802.16, Bluetooth, IRA, and ZIGBEE for easy,accurate, effective and simple communication betweenvehicles on dynamic mobility. Effective measuressuch as media communication between vehicles canbe enabled as well as methods to track the automotivevehicles. In VANET helps in defining safety measuresin vehicles, streaming communication betweenvehicles, infotainment and TELEMATICS.

  4. Topology-Transparent Transmission Scheduling Algorithms in Wireless Ad Hoc Networks

    MA Xiao-lei; WANG Chun-jiang; LIU Yuan-an; MA Lei-lei

    2005-01-01

    In order to maximize the average throughput and minimize the transmission slot delay in wireless Ad Hoc networks,an optimal topology-transparent transmission scheduling algorithm-multichannel Time-Spread Multiple Access(TSMA)is proposed.Further analysis is shown that the maximum degree is very sensitive to the network performance for a wireless Ad Hoc networks with N mobile nodes.Moreover,the proposed multichannel TSMA can improve the average throughput M times and decrease the average transmission slot delay M times,as compared with singlechannel TSMA when M channels are available.

  5. Novel multi-path routing scheme for UWB Ad hoc network

    XU Ping-ping; YANG Cai-yu; SONG Shu-qing; BI Guang-guo

    2005-01-01

    The routing protocols play an important role for ad hoc networks performance. As some problems with DSR,SMR, and AMR protocols were analyzed, a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper. The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time. Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR. While the node's mobility increases, these advantages become more obvious.

  6. ADHOCFTSIM: A Simulator of Fault Tolerence In the AD-HOC Networks

    Esma Insaf Djebbar

    2010-11-01

    Full Text Available The flexibility and diversity of Wireless Mobile Networks offer many opportunities that are not alwaystaken into account by existing distributed systems. In particular, the proliferation of mobile users and theuse of mobile Ad-Hoc promote the formation of collaborative groups to share resources. We propose asolution for the management of fault tolerance in the Ad-Hoc networks, combining the functions neededto better availability of data. Our contribution takes into account the characteristics of mobile terminalsin order to reduce the consumption of resources critical that energy, and to minimize the loss ofinformation. Our solution is based on the formation of clusters, where each is managed by a node leader.This solution is mainly composed of four sub-services, namely: prediction, replication, management ofnodes in the cluster and supervision. We have shown, using several sets of simulation, that our solution istwofold: minimizing the energy consumption which increases the life of the network and better supportdeal with requests lost.

  7. An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks.

    Penumalli, Chakradhar; Palanichamy, Yogesh

    2015-01-01

    A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results. PMID:26221627

  8. Une architecture de contrôle de mobilité pour le routage de messages dans un réseau ad hoc de grande taille

    Bracka, Pirro

    2005-01-01

    Ad hoc networks present the next great challenge for distributed systems research. Protocols that support communication in ad hoc networks have to take into account the mobility of the participants and the variation in the connectivity between associated parties. In fact, most research on routing algorithms in an ad hoc network is mainly based on algorithms dedicated to completely connected networks in which the node mobility is not used. In this thesis, we are interested on solutions which u...

  9. An ad hoc wireless sensor network for tele medicine applications

    Recent advances in embedded computing systems have led to the emergence of wireless sensor networks (SNETs), consisting of small, battery-powered motes with limited computation and radio communication capabilities. SNETs permit data gathering and computation to be deeply embedded in the physical environment. Large scale ad hoc sensor networks (ASNET), when deployed among mobile patients, can provide dynamic data query architecture to allow medical specialists to monitor patients at any place via the web or cellular network. In case of an emergency, doctors and/or nurses will be contacted automatically through their handheld personal digital assistants (PDAs) or cellular phones. In specific, the proposed network consists of sensor nodes at the first layer whose responsibility is to measure, collect and communicate, via wired or wireless interface, readings to a microcontroller presenting the second layer of architecture. Deployed microcontrollers process incoming readings and report to a central system via a wireless interface. The implemented network distinguishes between periodic sensor readings and critical or event driven readings where higher priorities is given for the latter. In this paper we implement 3 special cases for tracking and monitoring patients and doctors using SNETs. In addition, the performance of a large scale of our implementation has been tested by means of mathematical analysis. (author)

  10. Two Dimensional Connectivity for Vehicular Ad-Hoc Networks

    Farivar, Masoud; Ashtiani, Farid

    2008-01-01

    In this paper, we focus on two-dimensional connectivity in sparse vehicular ad hoc networks (VANETs). In this respect, we find thresholds for the arrival rates of vehicles at entrances of a block of streets such that the connectivity is guaranteed for any desired probability. To this end, we exploit a mobility model recently proposed for sparse VANETs, based on BCMP open queuing networks and solve the related traffic equations to find the traffic characteristics of each street and use the results to compute the exact probability of connectivity along these streets. Then, we use the results from percolation theory and the proposed fast algorithms for evaluation of bond percolation problem in a random graph corresponding to the block of the streets. We then find sufficiently accurate two dimensional connectivity-related parameters, such as the average number of intersections connected to each other and the size of the largest set of inter-connected intersections. We have also proposed lower bounds for the case ...

  11. ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests

    Kataria, Jayesh; Sanyal, Sugata

    2010-01-01

    Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with control packets. There is generally a limit on the number of these packets that can be generated or forwarded. But a malicious node can disregard this limit and flood the network with fake control packets. These packets hog the limited bandwidth and processing power of genuine nodes in the network while being forwarded. Due to this, genuine route requests suffer and many routes either do not get a chance to materialize or they end up being longer than otherwise. In this paper we propose a non cryptographic solution to the above problem and prove its efficiency by means of simulation.

  12. Design and Implementation of Anycast Services in Ad Hoc Networks Connected to IPv6 Networks

    Xiaonan Wang

    2010-04-01

    Full Text Available The paper proposes a communication model of implementing an Anycast service in an Ad Hoc network which is connected to IPv6 networks where IPv6 nodes can obtain the Anycast service provided by the Ad hoc network. In this model when an Anycast mobile member in an Ad hoc network moves it can keep the existing communications with its corresponding nodes to continue providing the Anycast services with good quality of service to IPv6 nodes. This model creates a new kind of IPv6 address auto-configuration scheme which does not need the address duplication detection. This paper deeply discusses and analyzes the model and the experimental data prove its validity and efficiency.

  13. Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

    Mann Raminder P

    2005-01-01

    Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

  14. Performance evaluation of fingerprint image processing for high Security Ad-hoc network

    P.Velayutham

    2010-06-01

    Full Text Available With the rapid development of wireless technology, various mobile devices have been developed for military and civilian applications. Defense research and development has shown increasing interest in ad-hoc networks because a military has to be mobile peer-to-peer is a good architecture for mobile communication in coalition operations. In this paper, the methodology proposed is an novel robust approach on secure fingerprint authentication and matching techniques to implement in ad-hoc wireless networks. This is a difficult problem in ad-hoc network, as it involves bootstrapping trust between the devices. This journal would present a solution, which provides fingerprint authentication techniques to share their communication in ad-hoc network. In this approach, devices exchange a corresponding fingerprint with master device for mutual communication, which will then allow them to complete an authenticated key exchange protocol over the wireless link. The solution based on authenticating user fingerprint through the master device, and this master device handshakes with the corresponding slave device for authenticating the fingerprint all attacks on the wireless link, and directly captures the user's device that was proposed to talk to a particular unknown device mentioned previously in their physical proximity. The system is implemented in C# and the user node for a variety of different devices with Matlab.

  15. A survey of TCP over ad hoc networks

    Al Hanbali, Ahmad; Altman, Eitan; Nain, Philippe

    2005-01-01

    The Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of data over unreliable networks. In practice, most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless ad hoc networks can lead to TCP implemen

  16. Ad Hoc Physical Hilbert Spaces in Quantum Mechanics

    Fernandez, F. M.; Garcia, J.; Semorádová, Iveta; Znojil, Miloslav

    2015-01-01

    Roč. 54, č. 12 (2015), s. 4187-4203. ISSN 0020-7748 Institutional support: RVO:61389005 Keywords : quantum mechanics * physical Hilbert spaces * ad hoc inner product * singular potentials regularized * low lying energies Subject RIV: BE - Theoretical Physics Impact factor: 1.184, year: 2014

  17. Providing Location Security in Vehicular Ad Hoc Networks

    Yan, Gongjun

    2010-01-01

    Location is fundamental information in Vehicular Ad-hoc Networks (VANETs). Almost all VANET applications rely on location information. Therefore it is of importance to ensure location information integrity, meaning that location information is original (from the generator), correct (not bogus or fabricated) and unmodified (value not changed). We…

  18. Authentication Based on Multilayer Clustering in Ad Hoc Networks

    Suh Heyi-Sook

    2005-01-01

    Full Text Available In this paper, we describe a secure cluster-routing protocol based on a multilayer scheme in ad hoc networks. This work provides scalable, threshold authentication scheme in ad hoc networks. We present detailed security threats against ad hoc routing protocols, specifically examining cluster-based routing. Our proposed protocol, called "authentication based on multilayer clustering for ad hoc networks" (AMCAN, designs an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. The AMCAN strategy takes advantage of a multilayer architecture that is designed for an authentication protocol in a cluster head (CH using a new concept of control cluster head (CCH scheme. We propose an authentication protocol that uses certificates containing an asymmetric key and a multilayer architecture so that the CCH is achieved using the threshold scheme, thereby reducing the computational overhead and successfully defeating all identified attacks. We also use a more extensive area, such as a CCH, using an identification protocol to build a highly secure, highly available authentication service, which forms the core of our security framework.

  19. An Investigation about Performance Comparison of Multi-Hop Wireless Ad-Hoc Network Routing Protocols in MANET

    S. Karthik

    2010-05-01

    Full Text Available Mobile Ad-Hoc Network (MANET is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Mobile Ad-hoc networks are self-organizing and self-configuring multihop wireless networks where, the structure of the network changes dynamically. This is mainly due to the mobility of nodes. The Nodes in the network not only acts as hosts but also as routers that route data to or from other nodes in network. In mobile ad-hoc networks a routing procedure is always needed to find a path so as to forward the packets appropriately between the source and the destination. The main aim of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an efficient communication path between any two nodes with minimum routing overhead and bandwidth consumption. The design problem of such a routing protocol is not simple since an ad hoc environment introduces new challenges that are not present in fixed networks. A number of routing protocols have been proposed for this purpose like Ad Hoc On Demand Distance Vector (AODV, Dynamic Source Routing (DSR, Destination- Sequenced Distance Vector (DSDV. In this paper, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV.

  20. An implementation of traffic light system using multi-hop Ad hoc networks

    Ansari, Imran Shafique

    2009-08-01

    In ad hoc networks nodes cooperate with each other to form a temporary network without the aid of any centralized administration. No wired base station or infrastructure is supported, and each host communicates via radio packets. Each host must act as a router, since routes are mostly multi-hop, due to the limited power transmission set by government agencies, (e.g. the Federal Communication Commission (FCC), which is 1 Watt in Industrial Scientific and Medical (ISM) band. The natures of wireless mobile ad hoc networks depend on batteries or other fatiguing means for their energy. A limited energy capacity may be the most significant performance constraint. Therefore, radio resource and power management is an important issue of any wireless network. In this paper, a design for traffic light system employing ad hoc networks is proposed. The traffic light system runs automatically based on signals sent through a multi-hop ad hoc network of \\'n\\' number of nodes utilizing the Token Ring protocol, which is efficient for this application from the energy prospective. The experiment consists of a graphical user interface that simulates the traffic lights and laptops (which have wireless network adapters) are used to run the graphical user interface and are responsible for setting up the ad hoc network between them. The traffic light system has been implemented utilizing A Mesh Driver (which allows for more than one wireless device to be connected simultaneously) and Java-based client-server programs. © 2009 IEEE.

  1. Improved Packet Forwarding Approach in Vehicular Ad Hoc Networks Using RDGR Algorithm

    Prasanth, K; Jayasudha, K; Chandrasekar, Dr C; 10.5121/ijngn.2010.2106

    2010-01-01

    VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Position based routing protocols are becoming popular due to advancement and availability of GPS devices. One of the critical issues of VANETs are frequent path disruptions caused by high speed mobility of vehicle that leads to broken links which results in low throughput and high overhead . This paper argues the use of information on vehicles' movement information (e.g., position, direction, speed of vehicles) to predict a possible link-breakage event prior to its occurrence. So in this paper we propose a Reliable Directional Greedy routing (RDGR), a reliable position based routing approach which obtains position, speed and direction of its neighboring nodes from GPS. This approach incorporates potential score based strategy...

  2. Power-Controlled MAC Protocols with Dynamic Neighbor Prediction for Ad hoc Networks

    LI Meng; ZHANG Lin; XIAO Yong-kang; SHAN Xiu-ming

    2004-01-01

    Energy and bandwidth are the scarce resources in ad hoc networks because most of the mobile nodes are battery-supplied and share the exclusive wireless medium. Integrating the power control into MAC protocol is a promising technique to fully exploit these precious resources of ad hoc wireless networks. In this paper, a new intelligent power-controlled Medium Access Control (MAC) (iMAC) protocol with dynamic neighbor prediction is proposed. Through the elaborate design of the distributed transmit-receive strategy of mobile nodes, iMAC greatly outperforms the prevailing IEEE 802.11 MAC protocols in not only energy conservation but also network throughput. Using the Dynamic Neighbor Prediction (DNP), iMAC performs well in mobile scenes. To the best of our knowledge, iMAC is the first protocol that considers the performance deterioration of power-controlled MAC protocols in mobile scenes and then proposes a solution. Simulation results indicate that DNP is important and necessary for power-controlled MAC protocols in mobile ad hoc networks.

  3. Hiérarchisation dans les réseaux ad hoc de véhicules

    Vèque, Véronique; Johnen, Colette

    2012-01-01

    National audience The vehicular Ad Hoc network (VANET) is often considered as an \\textit{ad hoc} extension of a cellular mobile network. Thus communications are then possible between vehicles as well as from vehicle to infrastructure based-network. However, the VANET suffers from a lack of connectivity and a limited capacity. One solution is to use clustering-based protocol to communicate between vehicles. The Clustering approach is well suited for vehicular networks because the dynamics o...

  4. Energy management in wireless cellular and ad-hoc networks

    Imran, Muhammad; Qaraqe, Khalid; Alouini, Mohamed-Slim; Vasilakos, Athanasios

    2016-01-01

    This book investigates energy management approaches for energy efficient or energy-centric system design and architecture and presents end-to-end energy management in the recent heterogeneous-type wireless network medium. It also considers energy management in wireless sensor and mesh networks by exploiting energy efficient transmission techniques and protocols. and explores energy management in emerging applications, services and engineering to be facilitated with 5G networks such as WBANs, VANETS and Cognitive networks. A special focus of the book is on the examination of the energy management practices in emerging wireless cellular and ad hoc networks. Considering the broad scope of energy management in wireless cellular and ad hoc networks, this book is organized into six sections covering range of Energy efficient systems and architectures; Energy efficient transmission and techniques; Energy efficient applications and services. .

  5. WIRELESS AD-HOC NETWORK UNDER BLACK-HOLE ATTACK

    Shree Om

    2011-01-01

    Full Text Available Wireless Ad-hoc Network is a temporary and decentralized type of wireless network. Due to security vulnerabilities in the routing protocol currently, this type of network is unprotected to network layer attacks. Black-hole attack is such a type of attack and is a Denial-of-Service (DoS attack. Due to its nature, the attack makes the source node send all the data packets to a Black-hole node that ends up dropping all the packets. The aim of this paper is to reflect light on the severe effects of a Black-hole attack in a Wireless Ad-hoc network and the drawbacks of the security mechanisms being used for the mitigation of this attack.

  6. Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

    Simeone O

    2007-01-01

    Full Text Available Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized optimization problem. Distributed opportunistic space-time collaboration (OST is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation.

  7. Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

    O. Simeone

    2007-03-01

    Full Text Available Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized optimization problem. Distributed opportunistic space-time collaboration (OST is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation.

  8. Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks

    Zahariadis Theodore

    2010-01-01

    Full Text Available Security in sensor networks is one of the most relevant research topics in resource constrained wireless devices and networks. Several attacks can be suffered in ad hoc and wireless sensor networks (WSN, which are highly susceptible to attacks, due to the limited resources of the nodes. In this paper, we propose innovative and lightweight localization techniques that allow for intrusion identification and isolation schemes and provide accurate location information. This information is used by our routing protocol which additionally incorporates a distributed trust model to prevent several routing attacks to the network. We finally evaluate our algorithms for accurate localization and for secure routing which have been implemented and tested in real ad hoc and wireless sensor networks.

  9. Performance modeling of data dissemination in vehicular ad hoc networks

    Chaqfeh, Moumena; Lakas, Abderrahmane; Lazarova-Molnar, Sanja

    2013-01-01

    Vehicular Ad hoc Networks (VANETs) have become a cornerstone component of Intelligent Transportation Systems (ITS). VANET applications present a huge potential for improving road safety and travel comfort, hence the growing interest of both academia and industry. The main advantage of VANETs is its...... ad hoc nature which does not require fixed infrastructure or centralized administration. However, designing scalable information dissemination techniques for VANET applications remains a challenging task due to the inherent nature of such highly dynamic environments. Existing dissemination techniques...... often resort to simulation for performance evaluation and there are only few studies that offer mathematical modeling. In this paper we provide a comparative study of existing performance modeling approaches for data dissemination techniques designed for different VANET applications. © 2013 IEEE....

  10. An Intrusion Detection Architecture for Clustered Wireless Ad Hoc Networks

    Sen, Jaydip

    2010-01-01

    Intrusion detection in wireless ad hoc networks is a challenging task because these networks change their topologies dynamically, lack concentration points where aggregated traffic can be analyzed, utilize infrastructure protocols that are susceptible to manipulation, and rely on noisy, intermittent wireless communications. Security remains a major challenge for these networks due their features of open medium, dynamically changing topologies, reliance on co-operative algorithms, absence of c...

  11. An Approach In Optimization Of Ad-Hoc Routing Algorithms

    Sarvesh Kumar Sharma

    2012-06-01

    Full Text Available In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.

  12. Verteilte Zugangskontrolle in offenen Ad-hoc-Netzen

    Kraft, Daniel

    2007-01-01

    In Ad-hoc-Netzen sind aktive Mitarbeit aller Teilnehmer und Einbringung eigener, knapper Ressourcen zugunsten Anderer unverzichtbar. Das hier vorgestellte verteilte Zugangskontrollsystem schließt dazu unkooperative Nutznießer aus dem Netz aus. Grundlage dafür sind gegenseitige Kooperativitätseinschätzungen der autonomen, einander a priori meist unbekannten Teilnehmer, die durch automatische Verhaltensbeobachtung sowie durch Austausch und Verknüpfung von Einschätzungen ermittelt werden.

  13. Precise Positioning Systems for Vehicular Ad-Hoc Networks

    Gufran Ahmad Ansari; Samir A. Elsagheer Mohamed; A. Nasr

    2012-01-01

    Vehicular Ad Hoc Networks (VANET) is a very promising research venue that can offers many useful and critical applications including the safety applications. Most of these applications require that each vehicle knows precisely its current position in real time. GPS is the most common positioning technique for VANET. However, it is not accurate. Moreover, the GPS signals cannot be received in the tunnels, undergrounds, or near tall buildings. Thus, no positioning service can be obtained in the...

  14. Security Analysis of Vehicular Ad Hoc Networks (VANET)

    Samara, Ghassan

    2012-01-01

    Vehicular Ad Hoc Networks (VANET) has mostly gained the attention of today's research efforts, while current solutions to achieve secure VANET, to protect the network from adversary and attacks still not enough, trying to reach a satisfactory level, for the driver and manufacturer to achieve safety of life and infotainment. The need for a robust VANET networks is strongly dependent on their security and privacy features, which will be discussed in this paper. In this paper a various types of ...

  15. A Platform for Implementing Secure Wireless Ad Hoc Networks

    Farkas, Gyula; Genge, Bela; Haller, Piroska

    2010-01-01

    We propose a new platform for implementing secure wireless ad hoc networks. Our proposal is based on a modular architecture, with the software stack constructed directly on the Ethernet layer. Within our platform we use a new security protocol that we designed to ensure mutual authentication between nodes and a secure key exchange. The correctness of the proposed security protocol is ensured by Guttman's authentication tests.

  16. Selective Cooperative Transmission in Ad Hoc Networks with Directional Antennas

    Eui-Jik Kim; Sungkwan Youm

    2013-01-01

    This paper presents a selective cooperative transmission scheme (abbreviated SCT) for ad hoc network with directional antennas that leverages the benefits of directional-only antenna approach and cooperative communication. The main feature of SCT is its adaptability to the channel condition in the network. In other words, when the node sends data, SCT determines its transmission strategy on either direct or cooperative transmission via a relay node called a forwarder, depending on the transmi...

  17. Interference in wireless ad hoc networks with smart antennas

    Alabdulmohsin, Ibrahim

    2014-08-01

    In this paper, we show that the use of directional antennas in wireless ad hoc networks can actually increase interference due to limitations of virtual carrier sensing. We derive a simple mathematical expression for interference in both physical and virtual carrier sense networks, which reveals counter-intuitively that receivers in large dense networks with directional antennas can experience larger interference than in omnidirectional networks unless the beamwidth is sufficiently small. Validity of mathematical analysis is confirmed using simulations.

  18. Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge Node Based Greedy Routing

    K.Prasanth

    2010-03-01

    Full Text Available VANETs (Vehicular Ad hoc Networks are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing, a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.

  19. Recent development in wireless sensor and ad-hoc networks

    Li, Xiaolong; Yang, Yeon-Mo

    2015-01-01

    Wireless Sensor Network (WSN) consists of numerous physically distributed autonomous devices used for sensing and monitoring the physical and/or environmental conditions. A WSN uses a gateway that provides wireless connectivity to the wired world as well as distributed networks. There are many open problems related to Ad-Hoc networks and its applications. Looking at the expansion of the cellular infrastructure, Ad-Hoc network may be acting as the basis of the 4th generation wireless technology with the new paradigm of ‘anytime, anywhere communications’. To realize this, the real challenge would be the security, authorization and management issues of the large scale WSNs. This book is an edited volume in the broad area of WSNs. The book covers various chapters like Multi-Channel Wireless Sensor Networks, its Coverage, Connectivity as well as Deployment. It covers comparison of various communication protocols and algorithms such as MANNET, ODMRP and ADMR Protocols for Ad hoc Multicasting, Location Based C...

  20. An Algorithm for Localization in Vehicular Ad-Hoc Networks

    Hajar Barani

    2010-01-01

    Full Text Available Positioning a node in Vehicular Ad-Hoc networks is one of the most interested research areas in recent years. In many Ad-Hoc networks such as Vehicular Ad-Hoc networks in which the nodes are considered as vehicles, move very fast in streets and highways. So, to have a safe and fast transport system, any vehicle should know where a traffic problem such as a broken vehicle occurs. GPS is one of the equipments which have been widely used for positioning service. Problem statement: Vehicle can use a GPS receiver to determine its position. But, all vehicles have not been equipped with GPS or they cannot receive GPS signals in some places such as inside of a tunnel. In these situations, the vehicle should use a GPS free method to find its location. Approach: In this study, a new method based on transmission range had been suggested. Results: This algorithm had been compared with a similar algorithm ODAM in same situations. The best performance for Optimized Disseminating Alarm Message (ODAM is when 40% of nodes are equipped with GPS. Conclusion: We executed our algorithm on this situation and compared it with ODAM results. At the end of this study, we can see our algorithm in compare to ODAM has better results.