164 research outputs found

    On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries

    Get PDF
    In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed

    3D Geographical routing in wireless sensor networks

    Get PDF
    In this paper, we present a novel 3D geographical routing algorithm (3DGR) that makes use of the position information to route packets from sources to destinations with high path quality and reliability. The locality and high scalability of this algorithm make it suitable for wireless sensor networks. It provides high adaptability to changes in topology and recovery of link failures which increases its reliability. We also incorporate the battery-aware energy efficient schemes to increase the overall lifetime of the network. To reduce latency, a method of keeping a small record of recent paths is used. We also show that location errors still result in good performance of our algorithm while the same assumptions might yield to bad performance or even complete failures in others. Simulation results show that the power consumption and delay using 3DGR are close to optimal obtainable based on full knowledge of the network

    Reliable geocasting for random-access underwater acoustic sensor networks

    Get PDF
    a b s t r a c t Reliable data delivery for underwater acoustic sensor networks is a major concern in applications such as surveillance, data collection, navigation, and ocean monitoring. Geocasting is a crucial communication primitive needed to support these applications, which consists in transmitting one or multiple consecutive data packets -all carrying an atomic message -to nodes located in a certain geographic region. In this article, two versions of a distributed, reliable, and efficient underwater geocasting solution (based on different degrees of neighbor information) are proposed for underwater networks whose acoustic modems use random-access Medium Access Control (MAC) protocols. By jointly considering the position uncertainty of nodes as well as the MAC and routing functionalities, packet transmissions are prioritized and scheduled so to maximize link reliability while limiting the end-to-end geocasting delay. Moreover, a simple yet effective timer-based mechanism is designed to limit the number of transmissions by selecting only a subset of neighbors for packet forwarding. Performance is evaluated and compared via thorough simulations against existing geocasting solutions tuned for the underwater environment that were originally designed for terrestrial wireless networks

    Self-organizing Network Optimization via Placement of Additional Nodes

    Get PDF
    Das Hauptforschungsgebiet des Graduiertenkollegs "International Graduate School on Mobile Communication" (GS Mobicom) der Technischen Universität Ilmenau ist die Kommunikation in Katastrophenszenarien. Wegen eines Desasters oder einer Katastrophe können die terrestrischen Elementen der Infrastruktur eines Kommunikationsnetzwerks beschädigt oder komplett zerstört werden. Dennoch spielen verfügbare Kommunikationsnetze eine sehr wichtige Rolle während der Rettungsmaßnahmen, besonders für die Koordinierung der Rettungstruppen und für die Kommunikation zwischen ihren Mitgliedern. Ein solcher Service kann durch ein mobiles Ad-Hoc-Netzwerk (MANET) zur Verfügung gestellt werden. Ein typisches Problem der MANETs ist Netzwerkpartitionierung, welche zur Isolation von verschiedenen Knotengruppen führt. Eine mögliche Lösung dieses Problems ist die Positionierung von zusätzlichen Knoten, welche die Verbindung zwischen den isolierten Partitionen wiederherstellen können. Hauptziele dieser Arbeit sind die Recherche und die Entwicklung von Algorithmen und Methoden zur Positionierung der zusätzlichen Knoten. Der Fokus der Recherche liegt auf Untersuchung der verteilten Algorithmen zur Bestimmung der Positionen für die zusätzlichen Knoten. Die verteilten Algorithmen benutzen nur die Information, welche in einer lokalen Umgebung eines Knotens verfügbar ist, und dadurch entsteht ein selbstorganisierendes System. Jedoch wird das gesamte Netzwerk hier vor allem innerhalb eines ganz speziellen Szenarios - Katastrophenszenario - betrachtet. In einer solchen Situation kann die Information über die Topologie des zu reparierenden Netzwerks im Voraus erfasst werden und soll, natürlich, für die Wiederherstellung mitbenutzt werden. Dank der eventuell verfügbaren zusätzlichen Information können die Positionen für die zusätzlichen Knoten genauer ermittelt werden. Die Arbeit umfasst eine Beschreibung, Implementierungsdetails und eine Evaluierung eines selbstorganisierendes Systems, welche die Netzwerkwiederherstellung in beiden Szenarien ermöglicht.The main research area of the International Graduate School on Mobile Communication (GS Mobicom) at Ilmenau University of Technology is communication in disaster scenarios. Due to a disaster or an accident, the network infrastructure can be damaged or even completely destroyed. However, available communication networks play a vital role during the rescue activities especially for the coordination of the rescue teams and for the communication between their members. Such a communication service can be provided by a Mobile Ad-Hoc Network (MANET). One of the typical problems of a MANET is network partitioning, when separate groups of nodes become isolated from each other. One possible solution for this problem is the placement of additional nodes in order to reconstruct the communication links between isolated network partitions. The primary goal of this work is the research and development of algorithms and methods for the placement of additional nodes. The focus of this research lies on the investigation of distributed algorithms for the placement of additional nodes, which use only the information from the nodes’ local environment and thus form a self-organizing system. However, during the usage specifics of the system in a disaster scenario, global information about the topology of the network to be recovered can be known or collected in advance. In this case, it is of course reasonable to use this information in order to calculate the placement positions more precisely. The work provides the description, the implementation details and the evaluation of a self-organizing system which is able to recover from network partitioning in both situations

    On-Demand Information Retrieval in Sensor Networks with Localised Query and Energy-Balanced Data Collection

    Get PDF
    On-demand information retrieval enables users to query and collect up-to-date sensing information from sensor nodes. Since high energy efficiency is required in a sensor network, it is desirable to disseminate query messages with small traffic overhead and to collect sensing data with low energy consumption. However, on-demand query messages are generally forwarded to sensor nodes in network-wide broadcasts, which create large traffic overhead. In addition, since on-demand information retrieval may introduce intermittent and spatial data collections, the construction and maintenance of conventional aggregation structures such as clusters and chains will be at high cost. In this paper, we propose an on-demand information retrieval approach that exploits the name resolution of data queries according to the attribute and location of each sensor node. The proposed approach localises each query dissemination and enable localised data collection with maximised aggregation. To illustrate the effectiveness of the proposed approach, an analytical model that describes the criteria of sink proxy selection is provided. The evaluation results reveal that the proposed scheme significantly reduces energy consumption and improves the balance of energy consumption among sensor nodes by alleviating heavy traffic near the sink

    FAR: Face-Aware Routing for Mobicast in Large-Scale Sensor Networks

    Get PDF
    This paper presents FAR, a Face-Aware Routing protocol for mobicast, a spatiotemporal variant of multicast tailored for sensor networks with environmental mobility. FAR features face-routing and timed-forwarding for delivering a message to a mobile delivery zone. Both analytical and statistical results show that, FAR achieves reliable and just-in-time mes-sage delivery with only moderate communication and memory overhead. This paper also presents a novel distributed algorithm for spatial neighborhood discovery for FAR boot-strapping. The spatiotemporal performance and reliability of FAR are demonstrated via ns-2 simulations

    Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing

    Get PDF
    Location based routing protocols are the kinds of routing protocols, which use of nodes’ location information, instead of links’ information for routing. They are also known as position based routing. In position based routing protocols, it is supposed that the packet source node has position information of itself and its neighbors and packet destination node. In recent years, many location based routing protocols have been developed for ad hoc and sensor networks. In this paper we shall present the concept of location-based routing protocol, its advantages and disadvantages. We shall also look into two popular location-based protocols: Geographic Adaptive Fidelity (GAF) and Geographic and Energy Aware Routing (GEAR)
    • …
    corecore