Results 1 - 10
of
15
A tuple space for social networking on mobile phones
- In 26th International Conference on Data Engineering
, 2010
"... Abstract-Social networking is increasingly becoming a popular means of communication for online users. The trend is also true for offline scenarios where people use their mobile phones to network with nearby buddies. In this paper, we propose a distributed tuple space for social networking on ad ho ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
Abstract-Social networking is increasingly becoming a popular means of communication for online users. The trend is also true for offline scenarios where people use their mobile phones to network with nearby buddies. In this paper, we propose a distributed tuple space for social networking on ad hoc networks. We describe the tuple space model and its operations and give evidence of its advantages for ad hoc social networking through several applications implemented on top of the tuple space.
Distributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks
"... Abstract. Various peer-to-peer (P2P) architectures for ad-hoc networks have been proposed over the last few years. Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application- ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
(Show Context)
Abstract. Various peer-to-peer (P2P) architectures for ad-hoc networks have been proposed over the last few years. Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application-layer overlays impractical. In this paper, we study the problem of applying distributed hash tables (DHT) to ad-hoc networks. Our approach to efficiently lookup content in such networks exploits physical proximity of peers when establishing and maintaining the DHT based routing tables. The efficiency of our method is demonstrated by simulation of large networks. 1
Reducing Latency in Rendezvous-Based Publish-Subscribe Systems for Wireless Ad Hoc Networks
- in IEEE International Conference on Distributed Computing Systems
, 2006
"... To ensure decoupling between publishers and sub-scribers, most publish-subscribe systems route notifications through intermediate message brokers. A byproduct of this practice is that notifications often follow suboptimal paths that are much longer than a direct path. Hence, in this paper, we propos ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
To ensure decoupling between publishers and sub-scribers, most publish-subscribe systems route notifications through intermediate message brokers. A byproduct of this practice is that notifications often follow suboptimal paths that are much longer than a direct path. Hence, in this paper, we propose a publish-subscribe architecture called GeoRendezvous which aims to reduce the latency experi-enced by end clients in the delivery of notifications. We base our system on a position-based distributed hash table (DHT) that supports rendezvous points where the interests of publishers and subscribers match. Leveraging from pre-vious work, we replicate the rendezvous points to give mul-tiple choices of paths to the subscribers. We show that in this way, the subscriber is able to achieve latencies compa-rable to a direct publisher-subscriber path without breaking the decoupling assumptions of the publish-subscribe model. Additionally, we show that scalability is one of the most prominent features of GeoRendezvous, as the number of rendezvous points scales with the network size. 1
Data Centric Storage in Non-Uniform Sensor Networks
"... Summary. Dependable data storage in wireless sensor networks is becoming increasingly important, due to the lack of reliability of the individual sensors. Recently, data centric storage (DCS) has been proposed to manage in network sensed data. DCS reconsiders ideas and techniques successfully propos ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
(Show Context)
Summary. Dependable data storage in wireless sensor networks is becoming increasingly important, due to the lack of reliability of the individual sensors. Recently, data centric storage (DCS) has been proposed to manage in network sensed data. DCS reconsiders ideas and techniques successfully proposed in peer to peer systems within the framework of wireless sensor networks. In particular it assume that data are uniquely named and data storage and retrieval is achieved using names instead of sensor nodes addresses. In this paper, we discuss the limitations of previous approaches, and in particular of Geographic Hash Tables (GHT), and introduce DELiGHT, a protocol which provides fine QoS control by the user and ensures even data distribution, also in non uniform sensor networks. The merits of DELiGHT have been evaluated through simulation in uniform and Gaussian distributed sensor networks. The simulation results show that the protocol provides a better load balancing than the previous proposals and that the QoS is ensured without appreciable overhead. 1
Demo Abstract -- Ad Hoc Social Networking using MAND
"... MAND (Mobile Ad Hoc Network Directory) is a middleware infrastructure for the distribution, storage, and lookup of key/value pairs in ad hoc networks. The key insight in MAND is to piggyback tuples and requests on the messages that routing protocols exchange to build and maintain routes in the ad ho ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
MAND (Mobile Ad Hoc Network Directory) is a middleware infrastructure for the distribution, storage, and lookup of key/value pairs in ad hoc networks. The key insight in MAND is to piggyback tuples and requests on the messages that routing protocols exchange to build and maintain routes in the ad hoc network. MAND can be used with different routing protocols and does not require any modification to the routing protocols themselves. Using MAND we have built AdSocial, a social networking application that allows users to exchange messages, set up SIP-based VoIP calls, and communicate common interests with nearby buddies. This demo will show the functionality of AdSocial and how MAND performs in a network of 10-15 Nokia N810 Internet Tablets communicating using AODV or OLSR. Conference participants will be able to interact with AdSocial while moving around thus configuring a mobile and multihop ad hoc network.
Dealing with Nonuniformity in Data Centric Storage for Wireless Sensor Networks
- Parallel and Distributed Systems, IEEE Transactions on
, 2011
"... Abstract—In-network storage of data in Wireless Sensor Net-works (WSNs) is considered a promising alternative to external storage since it contributes to reduce the communication over-head inside the network. Recent approaches to data storage rely on Geographic Hash Tables (GHT) for efficient data s ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract—In-network storage of data in Wireless Sensor Net-works (WSNs) is considered a promising alternative to external storage since it contributes to reduce the communication over-head inside the network. Recent approaches to data storage rely on Geographic Hash Tables (GHT) for efficient data storage and retrieval. These approaches, however, assume that sensors are uniformly distributed in the sensor field, which is seldom true in real applications. Also they do not allow to tune the redundancy level in the storage according to the importance of the data to be stored. To deal with these issues, we propose an approach based on two mechanisms. The first is aimed at estimating the real network distribution. The second exploits a data dispersal method based on the estimated network distribution. Experi-ments through simulation show that our approach approximates quite closely the real distribution of sensors and that our dispersal protocol sensibly reduces data losses due to unbalanced data load.
Building Multicast Trees in Ad-hoc Networks
"... Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produce multicast trees requiring many nodes to act as relays even though they are not part of the multicast group. In this pap ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produce multicast trees requiring many nodes to act as relays even though they are not part of the multicast group. In this paper, we propose an algorithm for building efficient multicast trees that strives to minimize the number of non-member relay nodes and the number of transmissions required to reach all the group members, and to balance the degree of members when acting as internal nodes of the multicast tree. Our algorithm relies upon a lightweight distributed hash table (DHT) to construct and optimize the multicast trees. We evaluate the efficiency and scalability of our algorithm by simulations with various network configurations and sizes.
Survey on Position-Based Routing
, 2006
"... In this paper we review position-based routing for wireless ad hoc and for wired networks. This form of routing assumes that nodes are aware of i) their own position; ii) the position of their neighbors (obtained through the exchange of beacon messages); and iii) the position of the node that is the ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this paper we review position-based routing for wireless ad hoc and for wired networks. This form of routing assumes that nodes are aware of i) their own position; ii) the position of their neighbors (obtained through the exchange of beacon messages); and iii) the position of the node that is the intended destination of the packet.
An Efficient Implementation of File Sharing ∗ Systems on the Basis of WiMAX and Wi-Fi
"... Abstract—This paper proposes an efficient algorithm for P2P file sharing systems based on WiMAX mesh mode and Wi-Fi technologies. Wireless networks in our system are hierarchically divided into three layers: Wi-Fi based wireless local area networks under a subscriber station; the mesh network of sub ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—This paper proposes an efficient algorithm for P2P file sharing systems based on WiMAX mesh mode and Wi-Fi technologies. Wireless networks in our system are hierarchically divided into three layers: Wi-Fi based wireless local area networks under a subscriber station; the mesh network of subscriber stations under a base station; the network of base stations. File lookup procedure may go through three steps: the requesting end host firstly looks up for the requested file within it’s neighbor end hosts under the same subscribe station; if fails, then it sends lookup messages to the nearest subscriber stations in the mesh network following to a changed dynamic source routing protocol; if both the steps fail, then the requesting end host searches the requested file through the Chord-based base stations ’ overlay. By statistical analysis and simulations, we prove that our layered P2P file sharing system can reduce the number of lookup messages in physical networks and prevent over expenses of precious bandwidth in wireless metropolitan area networks. Index Terms—P2P File sharing system, WiMAX I.
A Hierarchical Approach to Resource Awareness in DHTs for Mobile Data Management
"... Data is increasingly distributed across networks of mobile nodes such as wireless sensor networks, distributed smartphone applications, or ad hoc recovery networks in disaster scenarios, but must still be reliably collected, stored, and retrieved. While such networks run in either ad hoc mode or use ..."
Abstract
- Add to MetaCart
(Show Context)
Data is increasingly distributed across networks of mobile nodes such as wireless sensor networks, distributed smartphone applications, or ad hoc recovery networks in disaster scenarios, but must still be reliably collected, stored, and retrieved. While such networks run in either ad hoc mode or use existing infrastructure, all of them must deal with node heterogeneity. Wireless nodes invariably have differing levels of power availability, and often varying connectivity and computing power. While many distributed hash tables (DHTs) have been designed for mobile ad hoc or heterogeneous networks, they do not consider differences in node strength, or resource availability, for an arbitrary number of resource availability levels. In this paper, we present a scalable, location aware, hierarchical DHT that utilizes nodes’ varying resource availability levels to increase and prolong the mobile network’s data storage and retrieval capabilities. Furthermore, we compare this DHT to other location aware flat and hierarchical approaches, examining their structures’ suitability for nodes with varying resource availability.
