27 research outputs found

    Coherent, automatic address resolution for vehicular ad hoc networks

    Get PDF
    Published in: Int. J. of Ad Hoc and Ubiquitous Computing, 2017 Vol.25, No.3, pp.163 - 179. DOI: 10.1504/IJAHUC.2017.10001935The interest in vehicular communications has increased notably. In this paper, the use of the address resolution (AR) procedures is studied for vehicular ad hoc networks (VANETs). We analyse the poor performance of AR transactions in such networks and we present a new proposal called coherent, automatic address resolution (CAAR). Our approach inhibits the use of AR transactions and instead increases the usefulness of routing signalling to automatically match the IP and MAC addresses. Through extensive simulations in realistic VANET scenarios using the Estinet simulator, we compare our proposal CAAR to classical AR and to another of our proposals that enhances AR for mobile wireless networks, called AR+. In addition, we present a performance evaluation of the behaviour of CAAR, AR and AR+ with unicast traffic of a reporting service for VANETs. Results show that CAAR outperforms the other two solutions in terms of packet losses and furthermore, it does not introduce additional overhead.Postprint (published version

    Autonomous Gossiping: A self-organizing epidemic algorithm for selective information dissemination in mobile ad-hoc networks

    Get PDF
    We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc networking (MANET) environment because it does not require any infrastructure or middleware like multicast tree and (un)subscription maintenance for publish/subscribe, but uses ecological and economic principles in a self-organizing manner in order to achieve its selectivity. The trade-off of using an infrastructure-less self-organizing mechanism like A/G is that it does not guarantee completeness deterministically as is one of the original objectives of alternate selective dissemination schemes like publish/subscribe. We argue that such incompleteness is not a problem in many non-critical real-life civilian application scenarios and realistic node mobility patterns, where the overhead of infrastructure maintenance may outweigh the benefits of completeness, more over, at present there exists no mechanism to realize publish/subscribe or other paradigms for selective dissemination in MANET environments. A/G's reliance and hence vulnerability on cooperation of mobile nodes is also much less as compared to other possible schemes using routing information, since it does not expect node philanthropy for forwarding/carrying information, but only cooperation to the extent that nodes already carrying the information pass it on to other suitable ones. Thus autonomous gossiping is expected to be a light-weight infrastructure-less information dissemination service for MANETs, and hence support any-to-many communication (flexible casting) without the need to establish and maintain separate routing information (e.g., multicast trees)

    A COMMUNICATION FRAMEWORK FOR MULTIHOP WIRELESS ACCESS AND SENSOR NETWORKS: ANYCAST ROUTING & SIMULATION TOOLS

    Get PDF
    The reliance on wireless networks has grown tremendously within a number of varied application domains, prompting an evolution towards the use of heterogeneous multihop network architectures. We propose and analyze two communication frameworks for such networks. A first framework is designed for communications within multihop wireless access networks. The framework supports dynamic algorithms for locating access points using anycast routing with multiple metrics and balancing network load. The evaluation shows significant performance improvement over traditional solutions. A second framework is designed for communication within sensor networks and includes lightweight versions of our algorithms to fit the limitations of sensor networks. Analysis shows that this stripped down version can work almost equally well if tailored to the needs of a sensor network. We have also developed an extensive simulation environment using NS-2 to test realistic situations for the evaluations of our work. Our tools support analysis of realistic scenarios including the spreading of a forest fire within an area, and can easily be ported to other simulation software. Lastly, we us our algorithms and simulation environment to investigate sink movements optimization within sensor networks. Based on these results, we propose strategies, to be addressed in follow-on work, for building topology maps and finding optimal data collection points. Altogether, the communication framework and realistic simulation tools provide a complete communication and evaluation solution for access and sensor networks

    Two birds, one stone : using mobility behavioral profiles both as destinations and as a routing tool

    Get PDF
    We present HabCast, a profile-cast communication paradigm that learns about the mobility habits of the location-aware nodes of the network and uses this information both to route the messages, and to deliver them only to the nodes that match the target behavioral profile. HabCast substitutes destination's identifier by a mobility profile model called habitat, meaning that allows users to send messages "to any nodes who usually roams around this area" instead of sending messages intended to a node. HabCast is designed to operate without network infrastructure, using Opportunistic Networking strategies and operates in three phases: approximation, floating and delivery phase. HabCast enables new services and applications on Opportunistic Networking by automatically inferring the nodes' behavioral profiles and using them to define the messages' destinations. The overhead introduced by HabCast is evaluated using a proof-of-concept implementation, and its performance and feasibility is studied, through simulation, under the scope of a real carsharing application

    Hey, Influencer! Message Delivery to Social Central Nodes in Social Opportunistic Networks

    Get PDF
    This paper presents a new strategy to efficiently deliver messages to influencers in social opportunistic networks. An influencer node is an important node in the network with a high social centrality and, as a consequence, it can have some characteristics such as high reputation, trustfulness and credibility, that makes it an interesting recipient. Social network analysis has already been used to improve routing in opportunistic networking, but there are no mechanisms to efficiently route and deliver messages to these network influencers. The delivery strategy proposed in this article uses optimal stopping statistical techniques to choose among the different delivery candidate nodes in order to maximise the social centrality of the node chosen for delivery. For this decision process, we propose a routing-delivery strategy that takes into account node characteristics such as how central a node is in terms of its physical encounters. We show, by means of simulations based on real traces and message exchange datasets, that our proposal is efficient in terms of influencer selection, overhead, delivery ratio and latency time. With the proposed strategy, a new venue of applications for opportunistic networks can be devised and developed using the leading figure of social influencer

    An Overlay Routing Protocol for Video over sparse MANETs in Emergencies

    Get PDF
    Video delivery over a mobile ad-hoc network that can be deployed by members of an emergency service in an incident zone is an appealing tool for emergency and rescue services, but has not be studied yet. In order to design and test a suitable solution, we have generated realistic evaluation scenarios by modeling fireman action plans and GPS traces from real situations. The Emergency Overlay Routing (EOR) protocol is a reactive protocol integrated into a store-carry-forward architecture. It selects ferry nodes to transport video data from a camera in the Incident Area to the Incident Chief’s node, looking for the minimum delay, but reliable, candidate. The evaluation of EOR shows its superiority to the well-known DTN routing protocol, PROPHET, under this conditions
    corecore