882 research outputs found

    Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks

    Get PDF
    International audienceAd hoc networks are autonomous dynamic networks composed of mobile devices like personal digital assistants (PDA) for instance. In such mobile networks, lack of infrastructure leads to non trivial information discovery and dissemination. A scheme in which a unique object centralizes information is not efficient for many reasons. In this paper, we propose a probabilistic algorithm to satisfactorily distribute an information token among nodes forming the network by using localized datas. Then, in order to limit the number of memorizing nodes, we propose to make memorize nodes belonging to a dominating se

    Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks

    Get PDF
    Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput

    End-to-End Energy Efficient Geographic Path Discovery With Guaranteed Delivery in Ad Hoc and Sensor Networks

    Get PDF
    International audienceWe propose a novel localized routing protocol for wireless sensor networks (WSN) that is energy-efficient and guarantees delivery. We prove that it is constant factor of the optimum for dense networks. To forward a packet, a node ss in graph GG computes the cost of the energy weighted shortest path (SP) between ss and each of its neighbors which are closer to the destination than itself. It then selects node xx which minimizes the ratio of the cost of the SP to the progress towards the destination. It then sends the message to the first node on the SP from ss to xx: say node xx'. Node xx' restarts the same greedy routing process until the destination is reached or the routing fails. To recover from failure, our algorithm invokes Face routing that guarantees delivery. This work is the first to optimize energy consumption of Face routing. First, we build a connected dominating set from graph GG, second we compute its Gabriel graph to obtain the planar graph GG'. Face routing is applied on GG' only to decide which edges to follow in the recovery process. On each edge, greedy routing is used. This two-phase (greedy-Face) End-to-End routing process (EtE) reiterates until the final destination is reached. Simulation results show that EtE outperforms several existing geographical routing on energy consumption metric

    Energy-aware Georouting with Guaranteed Delivery in Wireless Sensor Networks with Obstacles

    Get PDF
    International audienceWe propose, EtE, a novel end-to-end localized routing protocol for wireless sensor networks that is energy-efficient and guarantees delivery. To forward a packet, a node s in graph G computes the cost of the energy weighted shortest path between s and each of its neighbors in the forward direction towards the destination which minimizes the ratio of the cost of the shortest path to the progress (reduction in distance towards the destination). It then sends the message to the first node on the shortest path from s to x: say node x′. Node x′ restarts the same greedy rout- ing process until the destination is reached or an obstacle is encountered and the routing fails. To recover from the latter scenario, local minima trap, our algorithm invokes an energy-aware Face routing that guarantees delivery. Our work is the first to optimize energy consumption of Face routing. It works as follows. First, it builds a connected dominating set from graph G, second it computes its Gabriel graph to obtain the planar graph G′. Face routing is invoked and applied to G′ only to determine which edges to follow in the recovery process. On each edge, greedy rout- ing is applied. This two-phase (greedy-Face) End-to-End routing process (EtE) reiterates until the final destination is reached. Simulation results show that EtE outperforms several existing geographical routing on en- ergy consumption metric and delivery rate. Moreover, we prove that the computed path length and the total energy of the path are constant factors of the optimal for dense networks

    On the performance of probabilistic flooding in wireless mobile ad hoc networks

    Get PDF
    Broadcasting in MANET’s has traditionally been based on flooding, but this can induce broadcast storms that severely degrade network performance due to redundant retransmission, collision and contention. Probabilistic flooding, where a node rebroadcasts a newly arrived one-to-all packet with some probability, p, was an early suggestion to reduce the broadcast storm problem. The first part of this thesis investigates the effects on the performance of probabilistic flooding of a number of important MANET parameters, including node speed, traffic load and node density. It transpires that these parameters have a critical impact both on reachability and on the number of so-called “saved rebroadcast packets” achieved. For instance, across a range of rebroadcast probability values, as network density increases from 25 to 100 nodes, reachability achieved by probabilistic flooding increases from 85% to 100%. Moreover, as node speed increases from 2 to 20 m/sec, reachability increases from 90% to 100%. The second part of this thesis proposes two new probabilistic algorithms that dynamically adjust the rebroadcasting probability contingent on node distribution using only one-hop neighbourhood information, without requiring any assistance of distance measurements or location-determination devices. The performance of the new algorithm is assessed and compared to blind flooding as well as the fixed probabilistic approach. It is demonstrated that the new algorithms have superior performance characteristics in terms of both reachability and saved rebroadcasts. For instance, the suggested algorithms can improve saved rebroadcasts by up to 70% and 47% compared to blind and fixed probabilistic flooding, respectively, even under conditions of high node mobility and high network density without degrading reachability. The final part of the thesis assesses the impact of probabilistic flooding on the performance of routing protocols in MANETs. Our performance results indicate that using our new probabilistic flooding algorithms during route discovery enables AODV to achieve a higher delivery ratio of data packets while keeping a lower routing overhead compared to using blind and fixed probabilistic flooding. For instance, the packet delivery ratio using our algorithm is improved by up to 19% and 12% compared to using blind and fixed probabilistic flooding, respectively. This performance advantage is achieved with a routing overhead that is lower by up to 28% and 19% than in fixed probabilistic and blind flooding, respectively

    Introducing Connected Dominating Set as Selection Feature of Cluster Heads in Hierarchical Protocols of Wireless Sensor Networks

    Get PDF
    It has been found that almost all routing protocols do suffer from efficiency of its operation regarding data transfer from one point to another. To overcome this process algorithm regarding the choice of nodes as cluster heads has to be done with utmost care. Failing of this leads to unnecessary dissipation of energy such as generating excess ‘Hello’ messages and less useful data transfer. In this communication we show that the introduction of connected dominating set as one of the metric regarding the choice of cluster head leads to better data transfer and energy consumption. Moreover we implemented this concept in LEACH protocol and found acceptable improvement in the performance parameters of the protocol

    Efficient Broadcast in MANETs Using Network Coding and Directional Antennas

    Get PDF

    Broadcasting Protocol for Effective Data Dissemination in Vehicular Ad Hoc Networks

    Get PDF
    VANET topology is very dynamic due to frequent movements of the nodes. Using beacon information connected dominated set are formed and nodes further enhanced with neighbor elimination scheme. With acknowledgement the inter section issues are solve. A modified Broadcast Conquest and Delay De-synchronization mechanism address the broadcasting storm issues. Although data dissemination is possible in all direction, the performance of data dissemination in the opposite direction is investigated and compared against the existing protocols

    A Lightweight Distributed Solution to Content Replication in Mobile Networks

    Full text link
    Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a network can be cast as an uncapacitated facility location problem. The endeavour of this work is to design a distributed, lightweight solution to the above joint optimization problem, while taking into account the network dynamics. In particular, we devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. We evaluate our mechanism through simulation, by exploring a wide range of settings and studying realistic content access mechanisms that go beyond the traditional assumptionmatching demand points to their closest content replica. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns, including variation in time and space of the content demand.Comment: 12 page
    corecore