An Overlay Network for Forwarding Symbolically Addressed Geocast Messages
01 Oct 2006-pp 427-434
TL;DR: This paper presents a novel geocast routing protocol for symbolically addressed messages that can operate on simple symbolic location models, and shows how to improve the performance of message forwarding by integrating a light-weight layer 3 multicast protocol.
Abstract: Geocast, which allows for forwarding messages to hosts residing at specified geographic areas, is a promising communication paradigm with a wide range of applications. Geocast target areas can be specified either by geometric figures or symbolic addresses, such as /usa/f 1/miami/market-street. In this paper, we present a novel geocast routing protocol for symbolically addressed messages. Compared to geocast protocols based on geometric information, our protocol can operate on simple symbolic location models, and message forwarding does not require costly geometric operations. The proposed protocol is based on an overlay network that is mapped to an IP-based network infrastructure. The overlay network is structured in a hierarchical fashion, to ensure a scalable global geocast service supporting also large target areas. Although our protocol does not rely on a layer 3 multicast protocol, we also show how to improve the performance of message forwarding by integrating a light-weight layer 3 multicast protocol. Our evaluations of the protocol underline the scalability of our approach and show good routing quality leading to short message paths. I.
Citations
More filters
01 Jan 2011
TL;DR: A novel user interface approach is offered to simplify the solicitation of user-generated labels that rely on labeling long-term measurements, not just second-long snapshots, and provide algorithms that are able to accurately position a device based on such user- generated labels.
Abstract: Location-aware computing has become one of the most publicly visible results of ubiquitous computing research, with small, low-power GPS modules being incorporated in an ever increasing number of consumer devices. While GPS systems work well in outdoor environments, the limited propagation characteristics of GPS satellite signals require alternative solutions for positioning and navigating inside buildings. Radio location fingerprinting is one of the most promising indoor positioning mechanisms as it allows positioning using signal characteristics of existing wireless communication networks (e.g., a WiFi installation) and thus requires no dedicated localization infrastructure to be installed. However, location fingerprinting typically requires a costly setup phase, in which signal fingerprints are manually mapped to individual locations. Moreover, since radio signals change and fluctuate over time, map maintenance requires continuous recalibration. In this thesis, we introduce the concept of user-contributed, collaborative fingerprint labeling to address the problems of radio map setup and map maintenance in location fingerprinting systems. Instead of manually creating an initial map prior to deployment, we propose a method to harness the inputs of all users to collaboratively create and subsequently maintain an accurate map of indoor radio fingerprints. We offer a novel user interface approach to simplify the solicitation of user-generated labels that rely on labeling long-term measurements, not just second-long snapshots, and provide algorithms that are able to accurately position a device based on such user-generated labels.
16 citations
Cites background from "An Overlay Network for Forwarding S..."
...Such applications mostly imply distributed services, like messaging based on the current location of the user [48], or adapting the settings of a device [28]....
[...]
14 Jun 2009
TL;DR: Concepts from publish/subscribe networks are extended to efficiently deal with highly dynamic user location to lower update rates by approximating the user's location.
Abstract: The dissemination of messages according to clients' contexts (i.e., location and other attributes) opens up new possibilities in context-aware systems. While geocast or content-based publish/subscribe forward messages according to client location or attributes, respectively, neither uses a combination of the two. In this paper, we present this new communication paradigm and the challenges it poses. We also extend concepts from publish/subscribe networks to efficiently deal with highly dynamic user location to lower update rates by approximating the user's location. This reduces update rates by between 25% and 90%, depending on the granularity of the approximation.
10 citations
Cites methods from "An Overlay Network for Forwarding S..."
...The location attribute αloc is given as a geometric location based on WGS84, with a type of “WGS84”....
[...]
...Examples for such systems are GEO [9], which uses a geometric location model based on WGS84, [10], which uses a hierarchical symbolic location model, or “semantic geocast” [11], which uses a hybrid model....
[...]
25 Mar 2008
TL;DR: This paper presents an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand and shows that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.
Abstract: In this paper, we propose an overlay network supporting world-wide geographic messaging. Our approach is based on hierarchical symbolic coordinates like /usa/fl/miami/. Although hierarchical network topologies lend themselves to the implementation of such overlay networks, they may lead to bottlenecks at the root of the hierarchy, long message paths, and inefficient bandwidth utilization. To avoid these problems, we propose an overlay network that adapts its structure to the users' communication patterns by dynamically adding "shortcut" links to the hierarchy leading to a routing mesh. We present an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand. Through simulations we show that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.
6 citations
Cites background or methods from "An Overlay Network for Forwarding S..."
...Messages are forwarded in two phases (for a detailed description see [3])....
[...]
...In [3] we describe this process in detail....
[...]
...Similar to [3, 4], a node adds more links to nearby zones than to distant zones....
[...]
..., shortcuts to top-level locations like countries are preferred to shortcuts to smaller locations like cities [2], or shortcuts to nearby locations are preferred to distant shortcuts [3,4]....
[...]
...We compare our adaptive shortcut selection algorithm (Adaptive Shortcut Routing (ASR)) to the static shortcut selection algorithm (Static Shortcut Routing (SSR)) proposed in [3] and to hierarchical routing using a routing tree according to the spatial inclusion relation between service areas without any shortcuts (Basic Routing (BR))....
[...]
TL;DR: This work proposes a basic scheme and its variations which utilize the geometric concept of “Fermat point” to determine the optimal junction point among multiple geocast regions from the source node and shows that the proposed schemes can effectively reduce the overhead of message delivery while maintaining a high delivery ratio in mobile multi-hop wireless networks.
Abstract: Geocasting, a variation on the notion of multicasting, is a mechanism to deliver messages of interest to all nodes within a certain geographical target region. Although several geocasting protocols have already been proposed for multi-hop wireless networks, most of these algorithms consider a "single" target region only. Here, when more than one target regions need to receive the same geocast messages, multiple transmissions need to be initiated separately by the message source. This causes significant performance degradation due to redundant packet transmissions, and it becomes more severe as the number of target regions increase. To solve this problem, we propose a basic scheme and its variations which utilize the geometric concept of "Fermat point" to determine the optimal junction point among multiple geocast regions from the source node. Our simulation study using ns-2 shows that the proposed schemes can effectively reduce the overhead of message delivery while maintaining a high delivery ratio in mobile multi-hop wireless networks.
5 citations
Cites background from "An Overlay Network for Forwarding S..."
...A number of geocast protocols have been developed [3, 13, 14, 15], but most of them consider only a ‘‘single’’ target region....
[...]
19 Mar 2007
TL;DR: This paper describes the middleware's architecture for context-aware applications, based on messenger protocols, and proposes a user interface that is widespread, well known to users and allows to manage one's privacy settings for every single service transparently.
Abstract: Nowadays most context-aware applications are independent proprietary pieces of software. A general framework or middleware deployed in the field does not exist; therefore the implementation of context-aware applications and services assumes the development of the whole application stack for each application. Along these development issues, deployment and privacy problems are to be solved. This imposes the following challenges concerning a middleware for context-aware applications: (1) we need an architecture that allows to implement and deploy services easily on the network. (2) We need a user interface that is widespread, well known to users and allows to manage one's privacy settings for every single service transparently. In this paper we describe our middleware's architecture for context-aware applications, based on messenger protocols
4 citations
References
More filters
01 Jun 1997
TL;DR: This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM), a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing Information base.
Abstract: This document specifies Protocol Independent Multicast - Sparse Mode
(PIM-SM). PIM-SM is a multicast routing protocol that can use the
underlying unicast routing information base or a separate multicast-
capable routing information base. It builds unidirectional shared
trees rooted at a Rendezvous Point (RP) per group, and optionally
creates shortest-path trees per source. This document obsoletes RFC
2362, an Experimental version of PIM-SM. [STANDARDS-TRACK]
1,174 citations
01 Nov 1988
TL;DR: This RFC describes a distance-vector-style routing protocol for routing multicast datagrams through an internet, derived from the Routing Information Protocol, and implements multicasting as described in RFC-1054.
Abstract: This RFC describes a distance-vector-style routing protocol for
routing multicast datagrams through an internet. It is derived from
the Routing Information Protocol (RIP), and implements multicasting as
described in RFC-1054. This is an experimental protocol, and its
implementation is not recommended at this time.
1,048 citations
"An Overlay Network for Forwarding S..." refers methods in this paper
...In particular, each location is assigned an individual multicast address, and an IP multicast protocol, such as Multicast Open Shortest Path First (MOSPF [6]) or the Distance Vector Multicast Routing Protocol (DVMRP [7]), is used to forward messages to the corresponding location....
[...]
01 Mar 1994
TL;DR: This memo documents enhancements to the OSPF protocol enabling the routing of IP multicast datagrams based both on the packet's source and its multicast destination (commonly referred to as source/destination routing).
Abstract: This memo documents enhancements to the OSPF protocol enabling the routing of IP multicast datagrams In this proposal, an IP multicast packet is routed based both on the packet's source and its multicast destination (commonly referred to as source/destination routing) As it is routed, the multicast packet follows a shortest path to each multicast destination During packet forwarding, any commonality of paths is exploited; when multiple hosts belong to a single multicast group, a multicast packet will be replicated only when the paths to the separate hosts diverge
532 citations
"An Overlay Network for Forwarding S..." refers methods in this paper
...In particular, each location is assigned an individual multicast address, and an IP multicast protocol, such as Multicast Open Shortest Path First (MOSPF [6]) or the Distance Vector Multicast Routing Protocol (DVMRP [7]), is used to forward messages to the corresponding location....
[...]
26 Sep 1997
TL;DR: This paper proposes and evaluates a Touting and addressing method to integrate geographic coordinates into the Internet Protocol to enable the creation of location dependent services.
371 citations
Additional excerpts
...in [2], [3], and our approach proposed in [4]....
[...]
TL;DR: A protocol comparison includes message and memory complexity, robustness, and the ability to deliver geocast packets in partially partitioned networks and presents simulations to compare the approaches based on flooding, directed flooding, and routing without flooding.
Abstract: Geocasting is the delivery of a message to nodes within a geographical region. With geocast, new services and applications are feasible, such as finding friends who are nearby, geographic advertising, and accident or wrong-way driver warning on a motorway. In this article we present a survey on geocast routing protocols. The protocols mainly differ in whether they are based on flooding, directed flooding, or on routing without flooding, and whether they are suitable for ad hoc networks or for infrastructure networks. Based on these criteria we propose a classification of geocast protocols. Our protocol comparison includes message and memory complexity, robustness, and the ability to deliver geocast packets in partially partitioned networks. Finally, we present simulations to compare the approaches based on flooding, directed flooding, and routing without flooding.
368 citations