Haut PDF DoS-Resistant Self-Keying Mobile Ad-Hoc Networks

DoS-Resistant Self-Keying Mobile Ad-Hoc Networks

DoS-Resistant Self-Keying Mobile Ad-Hoc Networks

Unité de recherche INRIA Rhône-Alpes 655, avenue de l’Europe - 38330 Montbonnot-St-Martin France Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois - Campus scientifi[r]

32 En savoir plus

Optimized broadcast scheme for mobile ad hoc networks

Optimized broadcast scheme for mobile ad hoc networks

based schemes, each node adds its location information in the header of each packet sent. Thus, packet retransmission is done only if the additional coverage area added by the receiver is greater than a given threshold. Finally, the fourth family contains neighborhood based methods which exploit information on the neighborhood of the nodes. The main schemes belonging to this family are: self pruning [3], dominant pruning [3], scalable broadcasting [4], multipoint relay [5], Ad Hoc broadcast protocol [6] and Sim- plified Multicast Forwarding for MANETs [8]. In self pruning, each node piggybacks, into each retransmitted packet, its adjacent nodes. Thus, nodes that received this packet can check if their own adjacent nodes are the same as those piggybacked in the received packet. If so, the packet is dropped. Otherwise, it is re-transmitted. While self pruning exploits only one-hop node information, the remaining schemes dominant pruning, scalable broad- casting, multipoint relay, Ad Hoc broadcast protocol and Simplified Multicast Forwarding for MANETs require that all nodes have knowledge of their two-hop neighbors. Unfortunately, all neighborhood based methods require extra transmission overhead, especially in dense MANETs.
En savoir plus

13 En savoir plus

Reputation Propagation and Updating in Mobile Ad Hoc Networks with Byzantine Failures

Reputation Propagation and Updating in Mobile Ad Hoc Networks with Byzantine Failures

Keywords-reputation; mobile ad-hoc network; byzantine; I. I NTRODUCTION In a mobile ad hoc network, nodes cooperate in a dis- tributed and self-organized way to achieve some predefined goals. Thanks to a reputation mechanism, each node can benefit from the monitoring of the quality of service per- formed by others and can decide to interact or not with a service provider. A service provider is called a trustee, while a service user is called a truster. In this study we consider that a service is provided either by a fixed device located in a particular place or by a specific mobile node. In both cases, the user and the service provider must share the same location to be able to interact. We assume that a service user is necessarily a mobile node. Moreover, even if a service is not used by all the mobile nodes, the nodes which do not act as a truster/user (for this particular trustee/service) participate to the computation of its reputation score.
En savoir plus

9 En savoir plus

Simulation and Performance Analysis of MP-OLSR for Mobile Ad hoc Networks

Simulation and Performance Analysis of MP-OLSR for Mobile Ad hoc Networks

Index Terms — ad hoc networks, link state protocol, multipath routing I. I NTRODUCTION Nowadays, great demands for self-organizing, fast deployable wireless Mobile Ad hoc Networks (MANETs) come along with the advances in wireless portable technologies. Compared with the conventional cellular wireless mobile networks that rely on extensive infrastructure to support mobility, the MANETs do not need base stations and wired infrastructure. This future makes it useful in battlefields, emergency searches and rescue operations where fixed base stations are undesirable or unavailable. For commercial applications such as convention centers, electronic classrooms and conferences, a rapid deployment of all-on-air networks provides users with more flexible and cheaper ways to share information.
En savoir plus

7 En savoir plus

SLSF: Stable Linked Structure Flooding For Mobile Ad Hoc Networks

SLSF: Stable Linked Structure Flooding For Mobile Ad Hoc Networks

I. I NTRODUCTION In this paper we consider large Mobile Ad hoc NETworks (MANET) where the wirelessly connected devices communi- cate spontaneously without any predefined infrastructure with each other [1]. To reach a destination, nodes communicate using intermediate nodes as routers. Moreover, topology changes are common since joining and leaving of nodes occur dynamically. Our main research topic is service discovery in such networks where it is more important to provide stable services to contributing nodes than transient services to unstable nodes. Therefore optimal service discovery is more about a qualitative discovery (stable nodes/structures and their reachability) than a quantitative one (discovering all possible services). Firstly we build clusters (local groups) of one-hop stable-connected devices in a self-organizing manner using the NLWCA clustering protocol [3]. Secondly to create bigger stable-linked network structures, stable connections between nearby clusters are discovered. To do so we propose Inter- Cluster Relays (ICR) that are inspired by the Multi-Point Relays (MPR) of OLSR [5]. Moreover, extending WCPD [4], specific beacon formats are specified. We exploit the stable- linked structures within the network topology to streamline information exchange and to minimize the overhead.
En savoir plus

7 En savoir plus

Mobile Ad Hoc Networks: Modelling, Simulation and Broadcast-based Applications

Mobile Ad Hoc Networks: Modelling, Simulation and Broadcast-based Applications

Introduction Recent studies performed by popular technology magazines like Point Topic 1 and DSL Forum 2 stated the number of citizens equipped with a broadband access to the Internet has followed an amazing increase: a growth of 40% per year since 2000. Moreover, most current commercial offers include a DSL-Wifi router, making people more and more comfortable with this technology. At the same time, small communicating objects – PDA, mobile phones, multimedia players, gaming console, etc – are becoming more and more common in our daily life. For instance, the spreading ratio of mobile phones is close to 100% in most western European and Northern American regions. In addition, it is noticeable that next generations of most of them come with Wi-Fi interfaces: more and more mobile phones are now able to communicate using the traditional GSM/UMTS media but also using wireless interfaces, and cumulate the features of classical mobile phones, PDAs, multimedia players and even gaming consoles. This general tendency leads us to envision a future in which most people will be equipped with devices able to communicate using wireless interfaces. Oppositely to classical wired network, in a Wi-Fi network the nodes communicate by sending and receiving electro-magnetic (radio) waves. Wi-Fi networks can operate in two modes: “infrastructure” and “ad hoc”. In infrastructure mode, the nodes communicate with each other via an access point. This access point rules the communications in the local wireless network (WirelessLAN). Most often, the access point also enables the nodes within the WirelessLAN to communicate with nodes outside of the network (access to the internet in particular). This mode, which is the default one for most Wi-Fi devices, is com- monly used in public places were access to the internet is provided (train stations, airports, etc), at home, and in the company. In ad hoc mode, nodes communicate directly without resorting to any infrastructure. Although this mode is not commonly used, it presents some advantages. In particular ad hoc communications require neither the construction of expensive infrastructure nor network administration. Unfortunately ad hoc networks face a number of difficulties which have to be solved in order to permit their deployment. In ad hoc mode, a set of devices can build in an autonomous and spontaneous way a commu- nication network and have the capacity to self-organize in order to maintain it. This kind
En savoir plus

165 En savoir plus

Mobility Prediction Based Neighborhood Discovery for Mobile Ad Hoc Networks

Mobility Prediction Based Neighborhood Discovery for Mobile Ad Hoc Networks

Abstract: 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 ARH (Autoregressive Hello protocol). In this protocol, each node predicts its own position by an ever-updated autoregression-based mobility model, and neighboring nodes predict its position by the same mobil- ity model. The node transmits ‘hello’ message (for location update) only when the predicted location is too different from the true location (causing topology distortion), triggering mobility model correction on both itself and each of its neighbors. ARH evolves along with network dynamics, and seamlessly tunes it- self to the optimal configuration on the fly using local knowledge only. Through extensive simulation, we demonstrate the effectiveness and efficiency of ARH, in comparison with the best known competitive protocol TAP (Turnover based Adaptive hello Protocol). It comes out that ARH achieves the same high neigh- borhood discovery performance as TAP with dramatically less message overhead (about 50% lower ‘hello’ rate).
En savoir plus

21 En savoir plus

Advanced receivers for distributed cooperation in mobile ad hoc networks

Advanced receivers for distributed cooperation in mobile ad hoc networks

IC , where soft symbol estimates based on decoder’s extrinsic messages are used for regener- ating the interference. However, repeatedly using SISO decoding can have significant com- putational or latency costs, hence the idea of iterating the detection process on its own can be attractive, if it has affordable computational complexity. This idea of self-iterating the detection process is already present in many fundamental techniques such as the well-known Decision Feedback Equalizer ( DFE ) structures used for ISI mitigation [ Bel+79 ; Cio08 ; BT05 ], or the SIC structures in Multiple-User Detectors ( MUD s) [ TV05 ; CVB04 ; VBL08 ]. However there exist various approaches to the exact manner of designing the linear symbol detector ( MMSE , zero-forcing, matched-filtering) and the interference re-generator (hard decisions, soft estimates). Different possibilities will be compared and discussed in detail in following chapters, and in this subsection, the derivation of a double-loop BICM receiver is discussed, for the linear model with the generic channel, through the use of Expectation Propagation ( EP ) message passing.
En savoir plus

332 En savoir plus

Scalability and Quality of Service in Mobile Ad Hoc Networks

Scalability and Quality of Service in Mobile Ad Hoc Networks

Definition 1 (Cambridge Dictionary of American English) Ad Hoc for a particular purpose or need, especially for an immediate need In the mid 16th century, the term ad hoc has been used in the Latin language, however nowadays is used by scientists to qualify a specific category of networks. The most of wireless classical networks are characterized by a pre-existing in- frastructure that coordinate and manage the communication between network de- vices. They are generally organized using hierarchical topology structures which are fixed through time (without any mobility of fixed stations). With the help of this centralized infrastructure, very distant devices can communicate without even knowing the exact path used for the transmissions. On the other hand, mobile ad hoc networks (MANETs) are autonomous systems capable of self- organizing and self-conguring in multi-hop wireless networks without requiring any infrastructure support or centralized management for their operation. Each node in MANETs is free to move independently in any direction and will there- fore change its links (wireless link) to other nodes frequently. So, nodes may join and leave the network at any time.
En savoir plus

182 En savoir plus

Routing in Large Scale tactical mobile ad hoc Networks

Routing in Large Scale tactical mobile ad hoc Networks

7.1 Conclusion The Transformation of the military networks that is currently occurring with the ad- vent of the Network Centric Warfare adopts the concept of “Mobile Ad Hoc Network” (MANET) as a central component of the tactical network environment. Military networks are typically transportable networks made of multiple components among which the tactical network which refers to the nodes responsible for the operations on-the-field. In the future, the tactical network is expected to be made of nodes that are mobile, self-managing, self-configuring without relaying on any infrastructure. Thereby, the concept of Mobile Ad hoc Networks appears as the ideal candidate so- lution for supporting the fully mobile and dynamic tactical communication networks. Since the 1980’s, the Mobile Ad Hoc Networks have known a substantial at- tention. MANETs are often considered as “wireless access network” solutions to connect mobile users to a fixed infrastructure. Their use in the military environment is different from the commercial employment. Whereas in the commercial use of mobile ad hoc network the wireless network is seen as an extension of a wired IP network i.e. operating as a stub, its use within the tactical network structure places it as a transit network carrying traffic entering and then leaving the network (and not sinked or generated by MANET nodes). The first chapter of this manuscript presents the tactical network architecture and the role of the tactical MANET as a transit network within the architecture. The Tactical Internet is made of a variety of heterogeneous networks such as LANs, satellite networks, commercial networks that are interconnected through the Tactical Communications Nodes. These Tac- tical Communications Nodes integrate radio equipments to form together a highly dynamic radio network, the tactical MANET. Thereby, the tactical MANET is a transit network that must inter-operate different networks (LANs, commercial Inter- net...). The context of employment of the tactical MANET engenders challenges to solve as well as the ones inherent to this type of network. We can mention among others the scalability (tactical networks can be made of several hundreds of nodes), the importance of multicast communications and the interoperability with wired net- works. Through this thesis, we endeavours to define how multicast communications can be settled between actors that are spread among different types of networks interconnected thanks to the MANET network.
En savoir plus

204 En savoir plus

Self-Organization in Ad Hoc Networks

Self-Organization in Ad Hoc Networks

4 Main objectives The main goal is to design a heuristic that selects some nodes as cluster-heads and computes clusters in a large WN network. As we mentioned in the previous section, the definition of a cluster should not be defined a priori by some fixed criteria but must reflect the density of the network. Indeed, if we need to change clusters structure every time we add or remove nodes, we will not be able to be scalable since changes will be too much frequent with a great amount of mobile nodes and will generate to much traffic. Wireless links will be quickly saturated. In order to be scalable, the heuristic should be completely distributed and asynchronous (avoiding any clock synchronization). The number of messages exchanges should be minimized. In fact, we use only local broadcast messages like HE L L O PA C K E T ([5]) in order to discover the 2-neighborhood of a node. Finally, in
En savoir plus

46 En savoir plus

AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks

AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks

in 2005. They use the same cryptographic mechanism – Diffie Hellmann key agreement protocol [6] to create a shared session key for a security communication between the source node and destination node. But these security routing protocols including Ariadne [16] and SRP [17] cannot protect the routing information from traffic analysis attacks such as message coding attack, communication pattern attack, and others [7]. Thus adversaries can trace network routes and find the source and destination nodes of any communication, making serious threats to instigate covert missions against user privacy. To prevent adversaries from tracing a packet flow to its source or destination and other traffic analysis attacks, Kong and Hong [8] presented an anonymous routing protocol for mobile ad-hoc networks (ANODR) in 2003. We describe in detail two limitations in Kong-Hong’s ANODR protocol through a cryptographic analysis in the next section. One limitation is that the source and destination cannot make a cryptographic onion for their communication data after the anonymous route discovery protocol since each node encrypts the routing information with their own secret key during the route discovery so that the source and destination don’t know the whole route. Obviously, they cannot create the shared session keys with each intermediate node on the routes to make an anonymous cryptographic onion for communication data. Another limitation is that the trapdoor used in the protocol is not practical since a destination node really does not know which shared session key should be used for the trapdoor if the destination node has many shared session keys with different nodes in an ad-hoc network. El- Khatib et al. [9, 13, 14] presented another secure distributed anonymous routing protocol (SDAR) for mobile ad-hoc networks in 2003. The protocol uses a public key algorithm as the trapdoor, making the system very unscalable since each intermediate forwarding node needs to attempt to decrypt the trapdoor during a route discovery. Asymmetric decryption usually has a very high computational complexity for a public key algorithm according to the demonstration in [11].
En savoir plus

12 En savoir plus

Route Lifetime based Interactive Routing in Intervehicle Mobile Ad Hoc Networks

Route Lifetime based Interactive Routing in Intervehicle Mobile Ad Hoc Networks

Nous supposons que pour établir un itinéraire les emplacements et les vitesses d’autres vehicules sont connus. Dans une hypothèse markovienne sur les processus des vitesse, nous prouvons que le choix optimal de la prochaine voiture essaye d’égaliser la durée de vie des liens adjacents dans un itinéraire. Une propriété de variation monotone de la vitesse des nœuds intermédiaires dans le cadre de la politique optimale est prouvée. Ces structures de solution ont été confirmées par des simulations exhaustives. L’heuristique et les structures développées dans cet article peuvent servir à concevoir un nouvel ensemble de protocoles interactifs efficaces d’établissement d’itinéraires spécifiquement adaptés aux réseaux ad hoc à mobilité élevée et aux iv-MANETs en particulier.
En savoir plus

24 En savoir plus

Relaying in Mobile Ad Hoc Networks: The Brownian Motion Mobility Model

Relaying in Mobile Ad Hoc Networks: The Brownian Motion Mobility Model

Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex France Unité de recherche INRIA Futurs : Parc Club Orsay Université - ZAC des Vi[r]

23 En savoir plus

Stability Oriented Routing in Mobile Ad Hoc Networks Based on Simple Automatons

Stability Oriented Routing in Mobile Ad Hoc Networks Based on Simple Automatons

Since wireless ad-hoc networks with mobile nodes have not stable topology, the classical network functions such as the routing are difficult to realize. The router nodes and the links between them are not stable and can appear and disappear randomly. So, classic routing algorithms cannot be used successfully. Many special reactive, proactive and hybrid routing algorithms have been proposed to solve the data transmission in multihop ad hoc networks. The principal propositions are cost, delay or energy oriented. However, new approaches should be used which deals with these dynamic changes. In the case of reactive routing, the proposed route to satisfy a new request can be volatile and so, the communication concerned by it may be frequently interrupted and new routes may be computed. As an example, we can cited AODV, which is a well known reactive on-demand routing protocol proposed in (Perkins & Royer, 1999). The dynamic source routing (DSR) also proposes the dynamic allocation of routes (Johnson & Maltz, 1996). Trivially, the establishment of the new routes involves additional latency and intensive communication for control purposes. When a proactive routing algorithm is applied, the topology changes must be broadcasted in the
En savoir plus

29 En savoir plus

WATCHMAN : an overlay distributed AAA architecture for mobile ad hoc networks

WATCHMAN : an overlay distributed AAA architecture for mobile ad hoc networks

B. AAA Server Election and Assignment 1) The overview and definitions: As part of AAA paradigm, the network needs an AAA server which has repositories for authentication, authorization, and accounting logs. But since the network is mobile and each node is prone to fail or lose its connectivity to the network, due to redundancy purposes, we need at least two AAA servers in the network. To define the responsibility of each server, we need to have one Master AAA Server (MAS) and N (≥ 1 ) Slave AAA Servers (SASs). Besides its AAA functionality, the master server must elect slave servers among the nodes. This election starts when the number of available SASs is less than N. N is a parameter assigned by the operator based on the expected ad hoc network size to support load balancing and to lessen the network traffic generated for authentication handling. This election is performed based on the willingness (w) of each node to be AAA server. This value which is calculated by nodes individually is a function of the following parameters:
En savoir plus

9 En savoir plus

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

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

to simulate a service- based firefighter decision support system where firefighters of three different hierarchical levels (Group, Engine, and Team) carry devices which offer software services and cooperatively form an infrastructure-less MANET. In detail, we simulate a network of 63 mobile nodes (3 Group Leaders, 12 En- gine Leaders, and 48 Team Leaders/Members) with trans- mission range of 45m distributed in a area of 500m × 500m. Each group follows a different mobility model because each group has a different purpose and mission to fulfil. To ensure that the network is completely configured before simulating a composition configuration we included a set-up/warm-up time of 20 seconds. For more details about the simulation scenario such as the chosen mobility, network and routing parameters, please refer to our previous work in [10].
En savoir plus

9 En savoir plus

P2P SIP over mobile ad hoc networks

P2P SIP over mobile ad hoc networks

Figure 2.3: An example of a DAG difference is that the discovered path is stored in the packet header instead of every node along the path. Nodes in the DSR are arranged in a promiscuous mode operation, causing adjacent nodes to overhear the RREQ packet. Therefore, the nodes may cache this overheard route information for possible future use. Moreover, the DSR allows nodes to keep multiple routes to a destination in their caches. When the link to the destination is broken, they can use other routes in the caches without creating a new route discovery. However, a stale cache because of host mobility has a severe impact on the performance of the DSR. The sender may try several stale routes in its cache before finding a good one. Route maintenance is as follows. When an intermediate node detects a broken link to its next hop node toward the destination, it marks this route in its cache as invalid and returns a route error packet (RERR) back to the source node. As the RERR packet arrives, the source node initiates a new route discovery process to the destination. Apart from the mentioned reactive routing protocols, we briefly give a list of other reactive routing protocols to complete the literature. There are reactive routing protocols based on link reversal routing (LRR) (Gafni et al., 1981). The concept of LRR is that all nodes are represented as a graph, which is converted into a directed acyclic graph (DAG). This DAG contains only one destination or a sink that does not have any outgoing links to its neighbors as shown in Fig. 2.3. When the link from node 2 to the sink fails, node 2 must perform a link reversal algorithm because it becomes the other sink (no outgoing links). Then, node 2 reverses its links. The link reversal process is repeated until there is only one sink left as shown in Fig. 2.4. Reactive routing protocols that use the concept of LRR are Lightweight Mobile Routing (LMR) (Corson & Ephremides, 1995) and Temporally Ordered Routing Algorithm (TORA) (Park & Corson, 1997). Single Stability Adaptive (SSA) (Dube et al., 1997) is similar to ABR, but it uses link stability as a metric for path selection instead. Cluster Based Routing Protocol (CBRP) (Jiang et al., 1999) is a hierarchical routing protocol that divides a network into many clusters. Each cluster contains a cluster head. In CBRP, routing information is exchanged only among clus- terheads, leading to the introduction of a lower routing overhead compared with other reactive routing protocols. However, the clusterhead selection is performed every time when the clusterheads become inactive due to mobility. This frequent selection may re- sult in high overhead and route discovery delay.
En savoir plus

161 En savoir plus

Opportunistic Content-Based Dissemination in Disconnected Mobile Ad Hoc Networks

Opportunistic Content-Based Dissemination in Disconnected Mobile Ad Hoc Networks

Content-based dissemination in disconnected MANETs is addressed specifically in [12], which describes an ap- proach whereby a content-driven multi-hop routing struc- ture (limited to a given horizon) is built around each host. A utility-based function is used in order to select the best for- warders for each kind of message, and mobile carriers can help disseminate messages between non-connected parts of the network. Our protocol is somehow much simpler than that described in [12]. Like the Autonomous Gossiping al- gorithm described in [2], it does not construct and maintain any routing structure. Instead it only exploits direct contacts between mobile hosts. The selection of carriers for a mes- sage is also straightforward: only those hosts that are inter- ested by a message are enlisted as carriers for this message. Interestingly, experimental and simulation results confirm that in spite of its apparent simplicity this approach can give very good results in terms of message delivery, while con- suming very few network resources.
En savoir plus

7 En savoir plus

Quality-delay tradeoff for video streaming over mobile ad hoc networks

Quality-delay tradeoff for video streaming over mobile ad hoc networks

II. SYSTEM MODEL A. Mobility Model There are 𝒩 = {1, ..., 𝑛, ..., 𝑁} (𝑁 ∈ ℕ) nodes which are positioned in a unit torus square, i.e., the left and right edges are assumed to touch each other and the top and bottom edges are also connected to each other. Without loss of generality, each node is both a source and a destination, and all the nodes can identically and uniformly visit the entire network area. Each node’s transmission range is 𝑅 (𝑅 ∈ ℝ + ), which is a constant parameter in this work. The video transmission delay is divided into some time-slots with unit length. In order to depict a practical mobile network scenario, we consider a general Random Walk Mobility Model (RWMM). Specifically, at the beginning of each time-slot, each node uniformly select a random mobility direction 𝜃 ∈ [0, 2𝜋). Then, the node moves along this direction with a constant velocity 𝑉 (𝑉 ∈ ℝ + ) during the rest of time-slot. The mobility directions of the nodes can be selected again after each time-slot, totally independently from time-slot and node. Fig. 2 illustrates the behavior of RWMM.
En savoir plus

6 En savoir plus

Show all 7800 documents...