| dc.identifier.uri | http://hdl.handle.net/11401/78160 | |
| dc.description.sponsorship | This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree | en_US |
| dc.format | Monograph | |
| dc.format.medium | Electronic Resource | en_US |
| dc.language.iso | en_US | |
| dc.type | Dissertation | |
| dcterms.abstract | Routing is the process of selecting best paths for data transfer in a network. The design of the routing is largely determined by the network itself and the objective to be achieved. In this dissertation, I design and implement the routing techniques under three network scenarios. The first part focuses on the data sharing within the nodes under wireless mobile sensor network. We are interested in developing a practical, lightweight solution with high delivery rate and low latency. We find an embedding of the network such that greedy routing using the virtual coordinates guarantees delivery. We encode the map of network domain to virtual coordinate space by using a small number of parameters which can be preloaded to all sensor nodes. As a result, the map is only dependent on the network domain and is independent of the network connectivity. Each node can directly compute or update its virtual coordinates by applying the locally stored map on its geographical coordinates. This represents the first practical solution for using virtual coordinates for greedy routing in a (mobile) sensor network. The second part studies the path design of the data mule to efficiently and equally gather data from the sensors under dense 3D sensor network that are distributed densely on some two-dimensional geometric surface. We present a novel method for generating space filling curves as the path for the data mule. Our algorithm is completely distributed and constructs a path which gets uniformly, progressively denser as the path becomes longer. This is also a new linearization scheme for general sensor networks on 2D surfaces. The third part studies the bulk data transfer under wide-area network (WAN). We target to have a scheduling solution to achieve short transfer completion time and meet mission- critical deadlines. We present a novel traffic management system that optimizes wide-area bulk transfers with centralized joint control of the optical and network layers. We develop efficient algorithms to jointly optimize optical circuit setup, routing and rate allocation, and dynamically adapt them to traffic demand changes. The joint management significantly improves data transfers over the wide area network. | |
| dcterms.available | 2018-03-22T22:39:10Z | |
| dcterms.contributor | Gao, Jie | en_US |
| dcterms.contributor | Chen, Jing | en_US |
| dcterms.contributor | Zeng, Wei | en_US |
| dcterms.contributor | Gu, David Xianfeng. | en_US |
| dcterms.contributor | Goswami, Mayank. | en_US |
| dcterms.creator | Li, Siming | |
| dcterms.dateAccepted | 2018-03-22T22:39:10Z | |
| dcterms.dateSubmitted | 2018-03-22T22:39:10Z | |
| dcterms.description | Department of Computer Science. | en_US |
| dcterms.extent | 100 pg. | en_US |
| dcterms.format | Application/PDF | en_US |
| dcterms.format | Monograph | |
| dcterms.identifier | http://hdl.handle.net/11401/78160 | |
| dcterms.issued | 2017-08-01 | |
| dcterms.language | en_US | |
| dcterms.provenance | Made available in DSpace on 2018-03-22T22:39:10Z (GMT). No. of bitstreams: 1
Li_grad.sunysb_0771E_13290.pdf: 19238670 bytes, checksum: 99932bdde988c19682762ad7bf34fdd4 (MD5)
Previous issue date: 2017-08-01 | en |
| dcterms.subject | Computer science | |
| dcterms.title | Mobility and Traffic-Adaptive Routing Algorithms for Wireless and Optical Networks | |
| dcterms.type | Dissertation | |
