Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network

Hoßfeld, Tobias; Oechsner, Simon; Tutschku, Kurt; Andersen, F.-U.; Caviglione, Luca

doi:10.1109/percomw.2006.130

Cited by 9 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to build the location-aware-key, an identifier called Cname is added to the coordinate pair, because the coordinates alone cannot qualify collocated objects. This concept leads to a hash function signature similarly to [28]: H(x, y, Cname), where x is the concatenation of 8 longitude digits o1, o2, . .…”

Section: Location Aware Hash Functionmentioning

confidence: 99%

“…RSUs nodes are interconnected in a mesh wired broadband network and communicate also with vehicles situated in their communication range using wireless short range communication protocols [29]. The exchange of information between vehicles and RSUs is bidirectional: in one type of ITS applications vehicles provide sensor data such as humidity, road temperature, speed, brake status, etc.…”

Section: Distributed Platform For Intelligent Transportation Applicatmentioning

confidence: 99%

See 1 more Smart Citation

Using tuple-spaces to manage the storage and dissemination of spatial–temporal content

Bessler

Fischer

Kühn

et al. 2011

Journal of Computer and System Sciences

View full text Add to dashboard Cite

Structured, spatial-temporal content arises in application areas such as mobile computing, intelligent transportation, urban mobility, and ubiquitous sensing. For the distributed storage and dissemination of such content, peer-to-peer solutions appear to be the natural choice. However, a closer analysis shows that distributed hash tables (DHT) alone are not enough: firstly, they do not maintain the original data structure needed to efficiently access the comprising attributes, and secondly, they lead to high signaling traffic when the data is short lived, such as in high mobility scenarios. In order to address these two problems we propose a novel content dissemination architecture based on an overlay of space-based containers. Furthermore, we apply the proposed concept to realize a concrete application in the field of intelligent transportation, and present the results of the performance evaluation conducted with the system prototype.

show abstract

Section: Location Aware Hash Functionmentioning

confidence: 99%

Section: Distributed Platform For Intelligent Transportation Applicatmentioning

confidence: 99%

Using tuple-spaces to manage the storage and dissemination of spatial–temporal content

Bessler

Fischer

Kühn

et al. 2011

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…To this end, we proposed in [2] a distributed database based on a DHT that uses the attachment points themselves as peers, on which the measurement data is stored. These attachment points, such as nodeBs and WLAN access points, form an overlay that is used to route queries from the attachment point where they enter the system to the storage location of the queried data.…”

Section: Location-aware Routing Mechanismmentioning

confidence: 99%

“…In order to speed up the retrieval process, we modified the Pastry algorithm by taking into account the locality of the mobiles requesting a vertical handover [2]. In an earlier work, we showed the feasibility of this location-aware approach with a simplified model of the message processing at a peer [3].…”

Section: Introductionmentioning

confidence: 99%

On the Trade-Off between Efficiency and Congestion in Location-Aware Overlay Networks - Example of a Vertical Handover Support System

Zinner

Oechsner

Hoßfeld

et al. 2008

2008 Eighth International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

Introducing location-awareness in overlay networks allows for a higher efficiency of the offered services, e.g., shorter search times or higher throughput. This is especially important for business applications supported by overlays. In this paper, we will illustrate how such an increase in efficiency causes congestion in an otherwise well-dimensioned locality-aware overlay using a Distributed Hash Table (DHT). In particular, we will use a Vertical Handover (VHO) support system using a Pastry substrate as an example. We will describe the occuring congestion problem and identify the underlying reasons. Thus, we describe the basic trade-off between efficiency and load-inequality. Furthermore, we introduce a solution for the specific issue observed, and conduct a performance evaluation identifying the major influence factors and optimization potential for future work.

show abstract

“…The effect of the performance anomaly depends on the distance between AP and users; therefore, if both AP and users move cooperatively, throughput can be improved effectively. A method for distributing required load information for autonomic load balancing has been investigated [24], [25]. We intend to include investigation of the distribution of required load information to achieve autonomic load balancing in future work.…”

mentioning

confidence: 99%

A Proposal of Access Point Selection Method Based on Cooperative Movement of Both Access Points and Users

Hamamoto

Murase

Takano

et al. 2015

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Ryo HAMAMOTO†a) , Student Member, Tutomu MURASE † † * b) , Fellow, Chisa TAKANO †c) , Hiroyasu OBATA †d) , and Kenji ISHIDA †e) , Members SUMMARYIn recent times, wireless Local Area Networks (wireless LANs) based on the IEEE 802.11 standard have been spreading rapidly, and connecting to the Internet using wireless LANs has become more common. In addition, public wireless LAN service areas, such as train stations, hotels, and airports, are increasing and tethering technology has enabled smartphones to act as access points (APs). Consequently, there can be multiple APs in the same area. In this situation, users must select one of many APs. Various studies have proposed and evaluated many AP selection methods; however, existing methods do not consider AP mobility. In this paper, we propose an AP selection method based on cooperation among APs and user movement. Moreover, we demonstrate that the proposed method dramatically improves throughput compared to an existing method.

show abstract

Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network

Cited by 9 publications

References 3 publications

Using tuple-spaces to manage the storage and dissemination of spatial–temporal content

Using tuple-spaces to manage the storage and dissemination of spatial–temporal content

On the Trade-Off between Efficiency and Congestion in Location-Aware Overlay Networks - Example of a Vertical Handover Support System

A Proposal of Access Point Selection Method Based on Cooperative Movement of Both Access Points and Users

Contact Info

Product

Resources

About