The classical store-and-forward routing has and will continue to be the most important routing architecture in many modern packet-switched communication networks. In a packet-switched network, data is sent in the form of discrete packets that traverse hop-by-hop from a source to a destination. At each intermediate hop, the router stores...
Iterative algorithms are simple yet efficient in solving large-scale optimization problems in practice. With a surge in the amount of data in past decades, these methods have become increasingly important in many application areas including matrix/tensor recovery, deep learning, data mining, and reinforcement learning. To optimize or improve iterative algorithms,...
Translation surfaces can be viewed as polygons with parallel and equal sides identified. An affine homeomorphism φ from a translation surface to itself is called pseudo-Anosov when its derivative is a constant matrix in SL₂(R) whose trace is larger than 2 in absolute value. In this setting, the eigendirections of...
Topology optimization (TO) is a mathematical method to find the optimal size, shape and connectivity of a domain under specified conditions, and has had many applications in engineering design. However, challenges remain in realizing TO as an effective design tool for many design situations. Uncertainty is ubiquitous in nature and...
Recent advances in wireless technologies have helped the proliferation of wireless devices, ranging from hand-held devices such as cellular phones to more powerful mobile computing platforms as such laptops [1]. Along with that, the end users’
applications running on these devices, ranging from text message to multimedia applications such as...
The recent increase in the number of wireless devices has been driven by the growing markets of smart homes and the Internet of Things (IoT). Consequently, current research has focused on efficient utilization of the radio frequency (RF) spectrum to accommodate such an increase in wireless bandwidth. Alternatively, latest free-space...
Peer-to-Peer (P2P) based distributed storage systems have gain much popularity in recent years. These systems rely greatly on the data redundancy to be robust under network dynamics, i.e., the dynamics of peer entering and departing the network. Hence, it is important to implement mechanisms for maintaining a certain level of...
Since free riders in P2P network reduce the system's performance, how to maintain and encourage the nodes' cooperation is an important aspect of P2P related research. In this thesis, a P2P system is modeled based on two games: stag hunt game and snowdrift game. To relate the model to the...
In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
We investigate a number of techniques for increasing throughput and quality of media applications over wireless networks. A typical media communication application such as video streaming imposes strict requirements on the delay and throughout of its packets, which unfortunately, cannot be guaranteed by the underlying wireless network due inherently to...