18,349 research outputs found

    Broadcasting in Hybrid Ad Hoc Networks.

    Get PDF
    In this paper, we consider hybrid ad hoc networks, which are composed of two kinds of nodes, regular ones and nodes with additional capabilities. For example, multi-hop cellular and wireless Internet networks consist of static or mobile nodes, and fixed access points which provide an access to an infrastructure. In such a network, each node may use direct or multihop link to connect to an access point, allowing a greater mobility. The goal of this paper is to provide protocols for broadcasting data in such an environment, by taking advantage of the presence of access points to optimize the broadcast, either from an energy consumption or from a latency point of view. We thus consider known protocols for pure ad hoc networks and adapt them to hybrid ad hoc networks. These protocols are the Blind Flooding, the Neighbor Elimination Scheme, the Multipoint Relay protocol and the generalized Self-Pruning Rule (algorithm that elects some dominant nodes to relay messages). We give some experimental data for these modified protocols to compare them to their original version, so that we are able to emphasize the gain obtained thanks to our proposed modifications

    Performance evaluation of an efficient counter-based scheme for mobile ad hoc networks based on realistic mobility model

    Get PDF
    Flooding is the simplest and commonly used mechanism for broadcasting in mobile ad hoc networks (MANETs). Despite its simplicity, it can result in high redundant retransmission, contention and collision in the network, a phenomenon referred to as broadcast storm problem. Several probabilistic broadcast schemes have been proposed to mitigate this problem inherent with flooding. Recently, we have proposed a hybrid-based scheme as one of the probabilistic scheme, which combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Despite these considerable numbers of proposed broadcast schemes, majority of these schemes’ performance evaluation was based on random waypoint model. In this paper, we evaluate the performance of our broadcast scheme using a community based mobility model which is based on social network theory and compare it against widely used random waypoint mobility model. Simulation results have shown that using unrealistic movement pattern does not truly reflect on the actual performance of the scheme in terms of saved-rebroadcast, reachability and end to end delay

    Improvement to efficient counter-based broadcast scheme through random assessment delay adaptation for MANETs

    Get PDF
    Flooding, the process in which each node retransmits every uniquely received packet exactly once is the simplest and most commonly used mechanism for broadcasting in mobile ad hoc networks (MANETs). Despite its simplicity, it can result in high redundant retransmission, contention and collision, a phenomenon collectively referred to as broadcast storm problem. To mitigate this problem, several broadcast schemes have been proposed which are commonly divided into two categories; deterministic schemes and probabilistic schemes. Probabilistic methods are quite promising because they can reduce the number of redundant rebroadcast without any control overhead. In this paper, we investigate the performance of our earlier proposed efficient counter-based broadcast scheme by adapting its random assessment delay (RAD) mechanism to network congestion. Simulation results revealed that this simple adaptation achieves superior performance in terms of saved rebroadcast, end-to-end delay and reachability

    Hybrid-Vehfog: A Robust Approach for Reliable Dissemination of Critical Messages in Connected Vehicles

    Full text link
    Vehicular Ad-hoc Networks (VANET) enable efficient communication between vehicles with the aim of improving road safety. However, the growing number of vehicles in dense regions and obstacle shadowing regions like Manhattan and other downtown areas leads to frequent disconnection problems resulting in disrupted radio wave propagation between vehicles. To address this issue and to transmit critical messages between vehicles and drones deployed from service vehicles to overcome road incidents and obstacles, we proposed a hybrid technique based on fog computing called Hybrid-Vehfog to disseminate messages in obstacle shadowing regions, and multi-hop technique to disseminate messages in non-obstacle shadowing regions. Our proposed algorithm dynamically adapts to changes in an environment and benefits in efficiency with robust drone deployment capability as needed. Performance of Hybrid-Vehfog is carried out in Network Simulator (NS-2) and Simulation of Urban Mobility (SUMO) simulators. The results showed that Hybrid-Vehfog outperformed Cloud-assisted Message Downlink Dissemination Scheme (CMDS), Cross-Layer Broadcast Protocol (CLBP), PEer-to-Peer protocol for Allocated REsource (PrEPARE), Fog-Named Data Networking (NDN) with mobility, and flooding schemes at all vehicle densities and simulation times

    Internet connectivity for mobile Ad Hoc networks

    Get PDF
    Ad hoc networking allows portable devices to establish communication independent of a central infrastructure. However, the fact that there is no central infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this thesis the problem of routing is considered. There are several ad hoc routing protocols, such as AODV, DSR, OLSR and ZRP, that propose solutions for routing within a mobile ad hoc network. However, since there is an interest in communication between not only mobile devices in an ad hoc network, but also between a mobile device in an ad hoc network and a fixed device in a fixed network (e.g. the Internet), the ad hoc routing protocols need to be modified. In this thesis the ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile adhoc network and the Internet. For this purpose Network Simulator 2, ns2, has been used. Moreover, three proposed approaches for gateway discovery are implemented and investigated. The goal of the thesis project is twofold: • To modify the source code of AODV in accordance with the Internet draft\Global connectivity for IPv6 Mobile Ad Hoc Networks " which presents a solution where AODV is used to provide Internet access to mobile nodes. • To implement and compare di®erent approaches for gateway discovery. In this thesis, three di®erent type of gateway discovery have been taken: • The proactive gateway discovery is initiated by the gateway itself. The gateway periodically broadcasts a gateway advertisement message which is transmitted after expiration of the gateways timer. The time between two consecutive advertisements must be chosen with care so that the network is not °ooded unnecessarily. All mobile devices residing in the gateways transmission range receive the advertisement and update information about gateway. After receiving advertisement, a mobile device just forward it broadcast it again. This process goes on within entire MANET. • In reactive gateway discovery a mobile device of MANET connects by gateway only when it is needed. For that the mobile device broadcasts request message to the ALL MANET GW MULTICAST address (the IP address for the group of all gateways in a mobile ad hoc network). Thus, only the gateways are addressed by this message and only they process it. Intermediate mobile nodes that receive the message just forward it by broadcasting it again up to gateway. • To minimize the disadvantages of proactive and reactive gateway discovery, the two approaches can be combined. This results is a hybrid gateway discovery. For mobile devices in a certain range around a gateway, proactive gateway discovery is used. Mobile devices residing outside this range use reactive gateway discovery to obtain information about the gateway. In comparing theses di®erent gateway discovery, three matrices are used. These are packet delivery ratio,average end-to-end delay and overhead. In case of proactive gateway discovery and hybrid gateway discovery, value of packet delivery ratio is larger than reactive gateway discovery. In case of proactive gateway discovery and hybrid gateway discovery, value of end to end delay is less than reactive gateway discovery. The overhead of proactive gateway discovery is greater than other two gateway discovery As for the average end-to-end delay, the proactive and hybrid methods perform slightly better than the reactive method. Concerning the routing overhead, when the advertisement interval is short the reactive method generates much less overhead than the proactive method, which in turn generates much less overhead than the hybrid method

    A Voice for the Voiceless: Peer-to-peer Mobile Phone Networks for a Community Radio Service

    Get PDF
    We propose a new application for mobile ad-hoc networks (MANETs) – community radio. We argue how MANETS help overcome important limitations in how community radio is currently operationalized. We identify critical design elements for a MANET based community radio service and propose a broad architecture for the same. We then investigate a most critical issue– the choice of the network wide broadcast protocol for the audio content. We identify desired characteristics of a community radio broadcasting service. We choose and evaluate eight popular broadcasting protocols on these characteristics, to find the protocols most suited for our application.

    HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks

    Full text link
    In this paper we propose HYMAD, a Hybrid DTN-MANET routing protocol which uses DTN between disjoint groups of nodes while using MANET routing within these groups. HYMAD is fully decentralized and only makes use of topological information exchanges between the nodes. We evaluate the scheme in simulation by replaying real life traces which exhibit this highly dynamic connectivity. The results show that HYMAD outperforms the multi-copy Spray-and-Wait DTN routing protocol it extends, both in terms of delivery ratio and delay, for any number of message copies. Our conclusion is that such a Hybrid DTN-MANET approach offers a promising venue for the delivery of elastic data in mobile ad-hoc networks as it retains the resilience of a pure DTN protocol while significantly improving performance.Comment: 7 pages, 6 figure
    corecore