Shanshan Lu

Graduation Semester and Year




Document Type


Degree Name

Doctor of Philosophy in Computer Science


Computer Science and Engineering

First Advisor

Yonghe Liu


With the high penetration of mobile devices and their equipments of wireless interfaces in people's lives, the development of the scenario of Opportunistic Networks(OppNets) has become available. OppNets enable transmissions by exploiting temporary wireless links and connections opportunistically arising from mobility nature of nodes. The applications of OppNets have emerged in a wide range of areas.OppNets have attracted a lot of attention from the wireless and mobile network research community, while little has been paid to the OppNets in large-scale scenario. The existing OppNets are not scaled well to large-scale area due to the high uncertainty embedded in transient contacts among people on the move. This dissertation introduces the large-scale opportunistic network that is centered and linked by populous locations in a physically large network field instead of transient contacts among mobile nodes. The relative stationary of mobile devices within these locations creates stabler and longer contact opportunities compared to those during movement and therefore provides much higher chances for successful message exchanges, potentially larger network capacity, and more flexibility for application design. A two-layer architecture for the location centered large-scale opportunistic network is proposed in this dissertation. The base layer handles connection and enables device discovery and connection establishment within a location. The upper layer deals with routing which delivers messages to targeted locations and nodes.For location targeted routing, two routing schemes, LOcation based routing for OPportunistic networks termed LOOP and GEOcasting for OPPortunistic networks termed Geoopp are proposed. Both adapt geographic greedy routing and fit it in the context of large-scale OppNets. The challenge lies in determining the future locations of nodes. LOOP and Geoopp differ in the determination. LOOP constructs a Bayes' predictive model to explore a node's mobility history and learn its mobility pattern, the regularity embedded in its movement. Instead of complicated data mining in LOOP, Geeopp offers a simple yet efficient way to learn the regularity in a novel approach. Geoopp introduces the concepts of inter-visiting time and contact availability per visiting to characterize a node's mobility. Chebyshev's inequality is employed to capture the regularity embedded in node mobility from visit and contact perspectives.For node targeted routing, a CAlendar based RouTing scheme termed CART is proposed. While most existing routing schemes infer node mobility from context and social information, including LOOP and Geoopp which infer future locations from previous trajectory, CART studies a novel direction to obtain mobility without inference. CART explores the online public calendars for acquiring reliable node mobility and more importantly a global view of the evolving network topology. At the source node, CART can discover a path connecting source node and destination node, a node sequence from source to destination where pair of adjacent nodes share overlapped time and location. The message will be forwarded over the predetermined path.For the connection layer, a device discovery approach and connection establishment scheme using ad-hoc Wi-Fi is proposed in this dissertation. It discovers devices within a larger range compared to commonly used Bluetooth and therefore enables the longer and stabler connections among mobile nodes inside a location. This approach is further enhanced with energy efficiency.


Computer Sciences | Physical Sciences and Mathematics


Degree granted by The University of Texas at Arlington