Efficient and Robust Geocasting Protocols for Sensor Networks

In this paper we consider a set of heterogeneous terminals in a urban area that are interested in collecting the information originated from several sources. This set includes mobile nodes (pedestrian and vehicles) and fixed terminals. In particular, each terminal aims at retrieving the data items in a limited region of interest (ROI) centered around the node position. Since data items may change over time all nodes must strive for having access to the latest version. The goa...

Geographic routing offers guaranteed packet deliv- ery in a dense network. In this routing, packets are forwarded to a node which is nearer to the destination with an extensive use of location information. However, research studies in Mobile Adhoc Networks (MANETs) and Wireless Sensor Networks (WSNs) have shown that packet delivery percentage can degrade substantially when malicious nodes are found in the network. Conventional cryptography techniques can be adopted in order t...

This paper presents a comparison of cluster-based position and non position-based routing protocols for mobile wireless sensor networks to outline design considerations of protocols for mobile environments. The selected protocols are compared on the basis of multiple parameters, which include packet delivery ratio, packet loss, network lifetime, and control overhead using variable number of nodes and speeds. The extensive simulation and analysis of results show that position-...

This paper is concerned with the problem of broadcasting information from a source node to every node in an ad-hoc network. Flooding, as a broadcast mechanism, involves each node forwarding any packet it receives to all its neighbours. This results in excessive transmissions and thus a high energy expenditure overall. Probabilistic forwarding or gossiping involves each node forwarding a received packet to all its neighbours only with a certain probability $p$. In this paper, ...

We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wireless ad hoc sensor networks. It is a simple routing protocol that can easily be combined with any other greedy routing algorithm to obtain delivery guarantee. The efficiency of HBR increases if the network is sparse and contains obstacles. The space necessary to store the additional routing informati...

A number of geolocation-based Delay Tolerant Networking (DTN) routing protocols have been shown to perform well in selected simulation and mobility scenarios. However, the suitability of these mechanisms for vehicular networks utilizing widely-available inexpensive Global Positioning System (GPS) hardware has not been evaluated. We propose a novel geolocation-based routing primitive (Centroid Routing) that is resilient to the measurement errors commonly present in low-cost GP...

Geographic routing consists in using the position information of nodes to assist in the routing process, and has been a widely studied subject in sensor networks. One of the outstanding challenges facing geographic routing has been its applicability. Authors either make some broad assumptions on an idealized version of wireless networks which are often unverifiable, or they use costly methods to planarize the communication graph. The overarching questions that drive us are ...

This paper addresses the problem of reliable transmission of data through a sensor network. We focus on networks rapidly deployed in harsh environments. For these networks, important design requirements are fast data transmission and rapid network setup, as well as minimized energy consumption for increased network lifetime. We propose a novel broadcasting solution that accounts for the interference impact and the congestion level of the channel, in order to improve robustnes...

The ability of a sensor node to determine its physical location within a network (Localization) is of fundamental importance in sensor networks. Interpretating data from sensors will not be possible unless the context of the data is known; this is most often accomplished by tracking its physical location. Existing research has focused on localization in static sensor networks where localization is a one-time (or low frequency) activity. In contrast, this paper considers local...

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regularity in node placement affects energy consumption. We first establish an information-theore...