Multimedia Contents Caching Scheme in Mobile Ad-Hoc Network

<p>Mobile Ad Hoc Network (MANET) consists of a group of mobile or wireless nodes that are placed randomly and dynamically that causes the continual change between nodes. A mobility model attempts to mimic the movement of real mobile nodes that change the speed and direction with time. The mobility model that accurately represents the characteristics of the mobile nodes in an ad hoc network is the key to examine whether a given protocol. The aim of this paper is to compare the performance of four different mobility models (i.e. Random Waypoint, Random Direction, Random walk, and Steady-State Random Waypoint) in MANET. These models were configured with Optimized Link State Routing (OLSR) protocol under three QoS (Quality of Service) <a title="Learn more about Metrics" href="https://www.sciencedirect.com/topics/engineering/metrics">metrics</a> such as the Packet Delivery Ratio (PDR), Throughput, End-to-End delay. The simulation results show the effectiveness of Steady-State Random Waypoint Mobility Models and encourage further investigations to extend it in order to guarantee other QoS requirements.</p>

A Review on Cooperative Bait Based Intrusion Detection in MANET

Mobile Ad hoc Network (MANET) is a one that has decentralized, self-organized and self-configurable network. All mobile nodes are moving arbitrarily. It consists of mobile wireless nodes that communicate themselves without any well defined infrastructure and also do not required any interference of third party base station. MANET’s routing protocols are classified in three categories. Proactive, Reactive and Hybrid Routing Protocols are three routing Protocols. But we basically Focus on only one of each routing protocol by varying by Data Dropped and Retransmission. In this paper we analysis performance of routing protocol by using mobility models vector mobility and random way point. We are focusing performance comparison on routing protocols on Optimized Link State Routing (OLSR) is proactive routing protocol also known as table driven protocol, (AODV)Ad Hoc on Demand Distance Vector is Reactive Routing Protocol and also establish a connection on demand and third one is Gathering-based Routing Protocol (GRP) which is hybrid routing protocol. In this paper we have compare two mobility models with above three protocols. In simulation results AODV shows best results by using OPNET 14.5 simulators. We can also compare its performance by using 50 nodes and show its outcome with the help of comparison table.

Mobile Ad hoc Networks (MANETs) represent complex distributed systems that do not rely on any infrastructure or centralized administration. These networks consist of wireless mobile devices which communicate with each other over the wireless channel. Because each mobile node (MN) has a limited transmission range, multi-hop communication is necessary to deliver data across the entire network. Such type of communication requires routing protocols which are capable of discovering multi-hop routes between the sending and receiving nodes. In addition, various mobility models are used to mimic the walking patterns of MNs in real-world environments. These models are generally categorized into two types, i.e., (i) entity and (ii) group-based mobility models depending upon their functionalities. In this paper, we assessed the impacts of different networking contexts on the performance of different mobility models. We selected Random Waypoint (RWP) and Gauss-Markov (GM) models from the first category and Reference Point group (RPGM) and Nomadic Community (NCMM) mobility models from the second. We performed extensive simulations using Network Simulator (NS-2). Simulation results reveal that there is a decline in cost as the speed of MNs is increased. In addition, node density differently impacted the performance of both types of models. The recommendation of this research will provide better understanding of the different mobility models in MANETs and their uses in real-world environments such as search and rescue operations, battlefield situations, tracking operations, people-centric networking and many more.

Security is very important for the reliable operation of mobile Ad Hoc networks (MANETs). One of the critical security issues in MANETs is the revocation of misbehaving nodes. In this paper, we propose a trust based threshold cryptography revocation scheme for MANETs. In our proposed scheme, the master private key is split into n pieces according to a random polynomial. Each node in the proposed scheme is configured with a share ski of the CA private key SK, the node's public key pki, and the CA public key PK before joining the network. Meanwhile, the master private key could be recovered by combining any threshold t pieces based on Lagrange interpolation. Consequently, the proposed scheme improves the safety levels in MANETs. The proposed hop-by-hop certificate revocation scheme is based on both threshold cryptography and transitive trust between mobile nodes. Because of the decentralized nature of our proposed scheme, it enables a group of legitimate nodes to perform fast revocation of a nearby misbehaving node. The proposed scheme is highly robust in the mobility environment of MANETs. The advantages of the proposed scheme are justified through extensive simulations.

Mobile Ad Hoc Network (MANET) comprises a group of mobile or wireless nodes that are placed randomly and dynamically which causes the constant change between nodes. When considering a routing protocol to deploy in any given situation on MANET, factors such as the mobility model, mobility of nodes, the network size and packet size should be carefully considered because the routing protocols configured with the mobility model can highly affect the performance of MANET. This paper analysed the impact of two different routing protocols (i.e. Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR)) on the performance of Random WayPoint (RWP) mobility model. Three measures of performance metrics (i.e. average throughput, average delay and average traffic received) were used. In all three-performance metrics, the simulated results indicated that Random WayPoint (RWP) configured with OLSR protocol performed better than RWP configured with DSR protocol. This indicates that the choice of a routing protocol for a specific mobility model should be considered in a network design.

The mobility model is one of the most important factors in the performance evaluations of a mobile ad hoc network (MANET). The Manhattan mobility model has been used to model the node's mobility, where the movement pattern of mobile node on streets and roads defined by maps. However, DakNet ad hoc network that uses wireless technology to provide digital connectivity among villages, kiosks and private communication devices and between kiosks and a hub (for non-real time internet access) using low-cost WiFi radio transceivers. One typical mobility behavior is geographical restriction movement. To investigate DakNet scenario an underlying realistic mobility model is desired. In this paper, we propose a novel mobility model “Digital Postal Mobility Model” (DPMM), which closely approximates the mobility patterns in DakNet scenario; it models the movement of nodes at pre-defined path and have a set of destinations and also visit all destination. We demonstrate our proposed mobility model by evaluating various MANET routing protocols, including DSR and DSDV, the performance of DPMM is efficient than existing geographical restricted models and NS simulation results shows that the choice of mobility model has significant impact on network performance.

Now a day's use of wireless communication is very common and growing faster. There are different types of wireless networks which are designed as per the requirement of data rate and coverage. In this paper scope is limited to widely study and used network called Mobile Ad hoc Network (MANET). MANET is collection of wireless devices which communicate among each other without need of any physical infrastructure as well as centralize administrations. Each mobile node in MANET acts as peer node. The communication is MANET is based on routing methods and hence since from last 2 decade there are number of routing methods designed with objective of improving the Quality of Service (QoS) performance of MANET. As the mobile nodes in MANET are moving randomly with varying mobility speed, this can leads the challenging tasks to achieve the guaranteed QoS performance. Therefore it is required to have efficient routing protocol with load balancing and dynamic behaviour of mobile nodes handling in MANET. In this paper, our goal first is to present the study on different QoS aware routing methods and non-routing methods designed by various research groups for MANET. Second objective is to design novel QoS Aware routing protocol for improving the QoS performance in MANET. Additionally, we are presenting the current research gap based on analysis of all recent methods of QoS improvement. The outcome of this paper is the current research problems and efficient QAODV routing method.

Mobile Ad hoc Networks (MANETs) is about mobile nodes roaming around the network area. Simulation is one of the methods for evaluating the characteristics of Ad Hoc networking protocols. Mobility model of the network simulator is very important. The mobility of the nodes directly impacts the performance of the protocols. The simulation results obtained with unrealistic movement models may not correctly reflect the true performance of the protocols. The majority of existing mobility models for ad hoc networks do not provide realistic movement scenarios; they are limited to random walk models without any obstacles hence the need to address mobility with obstacles. In this paper, we proposed a solution to realize a realistic movement models through the incorporation of obstacles by studying the Performance Evaluation of campus mobility model in Mobile Ad Hoc Networks. Therefore, the objective of our proposed Campus Mobility Model (CMM) has been designed to model the movement of mobile nodes in terrains that resemble the real world topographies. The objects model buildings and other structures that provide a barrier to both the movement of the mobile nodes, as well as the wireless transmission of these nodes. In modeling such a terrain, a user can define the positions, shapes and sizes of these objects. Finally we evaluated the Campus Mobility model based on physical characteristics and the impact on network topology and routing performance. Simulation results showed that the use of obstacles and pathways has a significant impact on the network topology and the performance of the routing protocol.

A mobile ad hoc network (MANET) consists of mobile nodes that communicate with each other without any infrastructure. MANET has various applications including military operations, rescue operations, and many other situations that require rapidly deployable communication networks. In order to evaluate the performance of such networks accurately through simulations, we need to use realistic conditions when simulating. User mobility pattern is an important factor that affects the performance of the network significantly. Recently, a number of mobility models have been proposed in order to produce realistic node mobility patterns. Mobility models differ considerably depending on the applications for which they are designed. In this paper, we present a unified mobility model framework. The framework can generate most of widely used mobility models with a short script. We show this by applying the framework to generate most of the existing mobility models. This framework expedites the performance evaluation process of MANETs since users do not need to write code from scratch to generate the application-specific moving patterns for the nodes.

Mobile Ad-hoc Network (MANET) comprise of independent ambulant nodes with no any stable infrastructure. All mobile nodes are co-operatively transfer their data packets to different mobile nodes in the network. Mobile nodes are depends on intermediate nodes when transmission range beyond limit i.e. multi hop network. As MANET is a highly dynamic network, mobile nodes can leave and join a network at anytime. Security is the biggest issue in MANET as MANET is infrastructure-less and autonomous. In MANET, correspondence between two mobile nodes is performed by routing protocols wherein every versatile node can make directly communication with other versatile node. In the event that both portable nodes are inside a transmission range of each other, then they can straightforwardly make communication with each other. Otherwise, transmission is done through the intermediate node. The nature of its wireless nature is also additionally turns into the purpose of its greatest vulnerability. In this manner, diminishing the confidence level of the system as it appropriate to availability, integrity, reliability and privacy concerns. There are different routing protocols for providing security that are designed based on various cryptographic techniques. To obtain a rapid knowledge of security design, we are giving a review on different cryptographic techniques to secure MANET. In this review, we presents security techniques and protocols related to cryptographic techniques.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Mobile adhoc network (MANET) is composed of wireless mobile nodes/devices which are moving randomly in infrastructure-less adhoc environments. Topology among mobile nodes is dynamic in nature and keeps on changing regularly. The adhoc environment is open to all the genuine users as well as intruders/attackers. Moreover, the wireless connection between mobile nodes can break at any time on account of mobility of nodes. Also, the mobile notes depend on their battery power, which may go down because of exhaust of battery power. Hence, it is a very complex task to implement energy efficient routing over MANET. While handling energy efficient routing, the optimum utilization of batter power is required. In this research paper, efforts have been carried out to formulate an algorithm for energy efficient routing over MANET. Its performance has been studied through network simulator. The simulations have been carried out by writing self created network scenarios with 20, 60 and 100 mobile nodes. Moreover, analysis of the proposed energy efficient routing protocol has been done with AODV routing protocol by using various performance evaluation metrics viz. packet delivery ratio, normalized routing load, average end to end delay, packet loss, throughput, average energy consumed and average energy left. It was derived from the performance analysis that proposed protocol provides energy efficient routing over MANET and also gives better or almost same performance in comparison to AODV.

Mobile Ad hoc network (MANET) is a short range network which enables various mobile nodes to communicate with each other. The range of mobile node for communication is limited in the MANET so two nodes of different network which are placed in long distance are unable to communicate between them. Utility of MANET can be enhanced by providing Internet connectivity to the mobile nodes. MANET is infrastructureless and Internet is infrastructure type network so they require an interface to connect with each other. So in this situation, Gateway, a device which acts as an interface and a router, provides the MANET nodes connectivity to fixed networks. A mobile node in MANET has to find a route to a gateway first to communicate with the Internet host. It requires an efficient gateway discovery mechanism for improve the overall performance of network. For this process various approaches have been proposed in the past. The popular approaches are reactive, proactive and hybrid gateway discovery mechanisms. This paper focuses on various issues for MANET-Internet integration and their proposed technical solutions by various proposals for different Internet gateway discovery mechanisms to improve the performance.

Understanding mobility characteristics is important for the design and analysis of routing schemes for mobile ad hoc networks (MANETs). This is especially true for mobile opportunistic networks where node mobility is utilized to achieve message delivery. In this paper, we study the properties of common mobility models. Specifically, we study inter-contact times of mobile nodes in random waypoint and random direction mobility models under opportunistic network settings. We also introduce a modified random waypoint model with hot-spots to study its mobility properties. Through extensive simulation study, we provide simulation results for mobility properties of random waypoint and random direction models. Further, our modified random waypoint with hot-spots model is also found to show an approximate power-law and exponential inter-contact time dichotomy found in real-world mobility traces as described in recent literature.