Please use this identifier to cite or link to this item:
Title: Data dissemination and sharing in mobile computing environments
Authors: Fan, Xiaopeng
Keywords: Mobile communication systems -- Data processing
Mobile computing -- Data processing
Hong Kong Polytechnic University -- Dissertations
Issue Date: 2010
Publisher: The Hong Kong Polytechnic University
Abstract: With the prevalence of mobile devices and recent advances in wireless communication technologies, mobile computing provides users with much easier access to the information and services available on the Internet, regardless of users' physical locations and movement behaviors. However, it is still challenging to improve the efficiency of data access in wireless mobile networks. First, wireless networks are notorious for the scarcity of communication bandwidth, energy, memory, and other resources. Thus mobile nodes cannot transmit too many packets for communication and store a mass of data locally. Second, dynamic topologies exacerbate the performance of the algorithms and protocols designed for static topologies. Third, many mobile applications, especially multimedia applications with video or audio, require transmitting much larger amount of data than before, which dramatically increase the traffic load of mobile networks. To improve the efficiency of data access in wireless mobile networks, mobile data management is one of the most important topics in mobile computing. It mainly concerns the reliability and the efficiency of data access in mobile computing environments under the difficulties like intermittent connectivity, mobility and scarcity of resources. There are two key problems in mobile data management, namely data dissemination and data sharing. In this thesis, we investigate the challenging issues in designing algorithms and protocols to improve the performance of data dissemination and sharing in wireless mobile networks. The whole thesis is divided into three parts as follows. In the first part of this thesis, we study data dissemination, i.e., how to disseminate a message to other mobile nodes reliably and timely. There are mainly three ways to disseminate a message to one or more nodes in a mobile network, namely unicast, multicast, and broadcast. In this thesis, we focus on how to use gossiping to provide reliable multicast, via building up mathematical models for gossiping to evaluate its reliability. We first investigate the fault tolerance problem of gossip-based reliable multicast protocols in mobile environments. We propose a generalized gossiping algorithm and develop a mathematical model based on generalized random graphs to evaluate the reliability of the gossiping protocol, answering questions like to what extent our proposed gossiping algorithm can tolerate node failures, while guaranteeing the specified message delivery ratio. We analytically derive the maximum ratio of failed nodes that can be tolerated without reducing the required degree of reliability. Next, we consider the typical hierarchical structure in an infrastructure-based wireless network and propose a generalized hierarchical gossiping algorithm, in which a multicast group is divided into smaller subgroups. We develop a mathematical model based on generalized random graphs to evaluate the reliability of hierarchical gossiping. We investigate the impact of the fanout distributions at the two levels of hierarchy on the reliability of hierarchical gossiping, and derive the critical condition for guaranteeing a gossiping message to be propagated from subgroups to the whole multicast group. Simulations in both above works have been carried out to validate the effectiveness of our analytical models in terms of the reliability of gossiping and the success of gossiping. In the second part of this thesis, we study data sharing in mobile computing environments, i.e., how to share single or multiple data items with other mobile nodes efficiently and consistently. We consider data caching as the most important technique to share data items in mobile computing environments. We focus on the cache placement problem, i.e., how to select cache nodes to minimize total access cost in a mobile network. We deal with the cache placement problem in two cases: sharing single data item and multiple data items.
First, we consider the cache placement problem for sharing single data item in a mobile ad hoc network. We propose to achieve an optimal tradeoff between caching overhead and total access delay by properly selecting a subset of wireless nodes as cache nodes. Most of the existing cache placement algorithms use hop counts to measure the total cost of a caching system, but hop delay in wireless mobile networks varies due to the contentions among nodes and the traffic load on each link. Therefore, we propose to evaluate the per-hop delay using a metric defined on the contentions detected by a wireless node. We propose two heuristic cache placement algorithms, one centralized and another distributed. The two algorithms are named Centralized Contention-Aware Caching Algorithm (CCCA) and Distributed Contention-aware Caching Algorithm (DCCA) respectively. Both algorithms detect the variation of contentions and the change of the traffic flows to evaluate the benefit of selecting a node as a cache node. We apply a TTL-based cache consistency strategy to maintain the delta consistency among all the cache nodes. Simulation results show that the proposed algorithms achieve better performance than other alternative ones in terms of the average query delay, caching overhead, and query success ratio. Second, we consider the cache placement problem for sharing multiple data items cooperatively in an Internet-based Mobile Ad Hoc Network (IMANET). In an IMANET, mobile nodes access a set of data items on the Internet through gateway nodes. To reduce the access delay from the Internet, mobile nodes can cooperatively cache some data items. Our objective is to let each mobile node select a subset of data items to cache cooperatively in its limited cache, such that the total access cost of all the nodes is minimized. This problem has been proved to be NP-hard. We propose a solution named Divide-and-Rule Cooperative Caching (DRCC), which divides the cache space of each node into two components: selfish and altruistic. In the selfish component, mobile nodes cache the most frequently accessed data items according to its own preference, showing the side of selfishness of a node. In the altruistic component, mobile nodes select data items in a randomized way, showing the side of altruism of a node. Given a specific access frequency distribution, we can find a near-optimal allocation solution to allocate cache sizes for the two components, aiming at minimizing the total access cost. Simulation results show that DRCC achieves much better performance than the existing best cooperative caching strategy in MANETs in terms of average query delay, caching overheads, and query success ratio. In particular, DRCC reduces caching overheads by 40% in average. In the third part of this thesis, we apply our studies on mathematical modeling of gossiping in cooperative caching to design a novel solution named Gossip-based Cooperative Caching (GosCC) for data access in an IMANET. GosCC solves the cache placement problem, considering the sequential relation among data items. It makes use of the progress reports of mobile nodes assessing data items and the content in mobile nodes' caches to determine whether a data item should be cached at a mobile node. GosCC applies the gossiping scheme to guarantee that mobile nodes receive the accurate and timely information for making caching decisions. Simulation results show that GosCC achieves much better performance than other cooperative caching schemes, in terms of average interruption intervals and average interruption times, while sacrificing acceptable message cost to a certain degree.
Description: xvii, 172 p. : ill. ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577P COMP 2010 Fan
Rights: All rights reserved.
Appears in Collections:Thesis

Files in This Item:
File Description SizeFormat 
b23926521_link.htmFor PolyU Users 162 BHTMLView/Open
b23926521_ir.pdfFor All Users (Non-printable) 2.15 MBAdobe PDFView/Open
Show full item record

Page view(s)

Last Week
Last month
Checked on Mar 26, 2017


Checked on Mar 26, 2017

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.