Thesis (M.S.)--Washington State University, May 2007. / Includes bibliographical references (p. 39-42).

published_or_final_version / abstract / Computer Science / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

Yeung Man Chun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 84-86). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Graph Theory --- p.5 / Chapter 1.2 --- Classical Routing Algorithms --- p.10 / Chapter 1.2.1 --- Proactive Routing Algorithms --- p.11 / Chapter 1.2.2 --- Reactive Routing Algorithms --- p.13 / Chapter 1.3 --- Wireless Ad Hoc Routing Algorithms --- p.15 / Chapter 1.5 --- Organization of the Thesis --- p.17 / Chapter Chapter 2 --- General Routing Algorithm --- p.18 / Chapter 2.1 --- Pre-routing Cost and On-routing Cost --- p.18 / Chapter 2.2 --- Rewritten Bellman-Ford Algorithm --- p.20 / Chapter 2.3 --- A Hybrid Algorithm --- p.22 / Chapter 2.4 --- Routable Condition --- p.33 / Chapter 2.5 --- A Better Algorithm? --- p.43 / Chapter Chapter 3 --- Clique Routing Algorithm --- p.45 / Chapter 3.1 --- Clique Process --- p.45 / Chapter 3.2 --- Property --- p.49 / Chapter 3.3 --- Decentralized Construction of the Clique Process --- p.55 / Chapter 3.4 --- Construction of a Clique Process Based GRA --- p.61 / Chapter 3.5 --- Other Alternatives --- p.68 / Chapter Chapter 4 --- Simulations and Results --- p.70 / Chapter 4.1 --- Models and Assumptions --- p.70 / Chapter 4.2 --- Results --- p.72 / Chapter 4.2.1 --- Pre-routing Cost --- p.73 / Chapter 4.2.2 --- On-routing Cost --- p.76 / Chapter 4.2.3 --- Reliability --- p.77 / Chapter Chpater 5 --- Conclusions --- p.80 / References --- p.84

Lam, Kim Yung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 87-92). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Rayleigh Fading Channels --- p.1 / Chapter 1.2 --- Wireless Ad Hoc Networks --- p.3 / Chapter 1.3 --- Ad Hoc Routing Protocols --- p.3 / Chapter 1.4 --- Information Capacity --- p.4 / Chapter 1.5 --- Cooperative Communications --- p.6 / Chapter 1.6 --- Outline of Thesis --- p.7 / Chapter 2 --- Background and Related Work --- p.8 / Chapter 2.1 --- Cooperative Communications --- p.8 / Chapter 2.1.1 --- Cooperative Diversity --- p.8 / Chapter 2.1.2 --- User Cooperation --- p.10 / Chapter 2.1.3 --- Coded Cooperation --- p.11 / Chapter 2.2 --- Cooperative Routing --- p.12 / Chapter 2.3 --- Information-Theoretic Study --- p.16 / Chapter 2.4 --- Optimization techniques --- p.17 / Chapter 3 --- Single-Source Single-Destination Cooperative Routing --- p.21 / Chapter 3.1 --- System Model --- p.22 / Chapter 3.1.1 --- Network Assumptions --- p.22 / Chapter 3.1.2 --- Routing Process --- p.22 / Chapter 3.1.3 --- Transmitting Signal --- p.23 / Chapter 3.1.4 --- Link Cost Formulation --- p.23 / Chapter 3.2 --- Minimum Energy Cooperative Route --- p.25 / Chapter 3.2.1 --- Cooperative Graph --- p.25 / Chapter 3.2.2 --- An Example of the Cooperative Graph --- p.27 / Chapter 3.2.3 --- Non-reducible property of the Cooperative Graph --- p.29 / Chapter 3.3 --- Optimized Scheduling --- p.32 / Chapter 3.3.1 --- KKT conditions --- p.32 / Chapter 3.3.2 --- Newton´ةs Method --- p.34 / Chapter 3.4 --- Complexity Analysis --- p.35 / Chapter 3.5 --- Simplified Scheduling Process --- p.37 / Chapter 3.5.1 --- Linear relationship in low rate regime --- p.37 / Chapter 3.5.2 --- The Simplified Scheduling Algorithm --- p.39 / Chapter 4 --- Heuristic Single-Source Cooperative Routing Schemes --- p.41 / Chapter 4.1 --- Maximum Hops Cut --- p.42 / Chapter 4.1.1 --- The Routing Protocol --- p.42 / Chapter 4.1.2 --- Simulations --- p.46 / Chapter 4.2 --- Maximum Relays Subgraph --- p.47 / Chapter 4.2.1 --- The Routing Protocol --- p.47 / Chapter 4.2.2 --- Simulations --- p.51 / Chapter 4.3 --- Adaptive Maximum Relays Subgraph --- p.55 / Chapter 4.3.1 --- The Routing Protocol --- p.55 / Chapter 4.3.2 --- Simulations --- p.57 / Chapter 4.4 --- Comparison of three protocols --- p.60 / Chapter 4.4.1 --- Implementation --- p.60 / Chapter 4.4.2 --- Cooperative Performance --- p.60 / Chapter 4.5 --- Enhancement of the algorithms --- p.61 / Chapter 4.5.1 --- Conclusion --- p.63 / Chapter 5 --- Multiplexing Cooperative Routes in Multi-source Networks --- p.64 / Chapter 5.1 --- Problem Formation --- p.65 / Chapter 5.1.1 --- The Network Model --- p.65 / Chapter 5.1.2 --- Objective Aim --- p.65 / Chapter 5.1.3 --- Link Cost Formulation --- p.66 / Chapter 5.1.4 --- Time Sharing and Interference --- p.66 / Chapter 5.1.5 --- Multiple Sources Consideration --- p.67 / Chapter 5.2 --- Multi-Source Route-Multiplexing Protocols --- p.68 / Chapter 5.2.1 --- Full Combination with Interference (FCI) --- p.68 / Chapter 5.2.2 --- Full Combination with Time Sharing (FCTS) --- p.68 / Chapter 5.2.3 --- Selection Between Interference and Time Sharing (SBITS) --- p.69 / Chapter 5.2.4 --- Interference and time sharing combinations --- p.71 / Chapter 5.2.5 --- The Simplified Version for SBITS --- p.72 / Chapter 5.3 --- Stage Cost Calculation --- p.73 / Chapter 5.3.1 --- Total stage cost formation in the sub timeslot --- p.73 / Chapter 5.3.2 --- Total stage cost formulation in different routing protocols --- p.74 / Chapter 5.3.3 --- Multiplexing for non-uniform timeslot routes --- p.75 / Chapter 5.4 --- Simulation --- p.76 / Chapter 5.4.1 --- Simulation model --- p.76 / Chapter 5.4.2 --- Simulation detail --- p.77 / Chapter 5.4.3 --- Simulation evaluation --- p.78 / Chapter 6 --- Conclusion and Future Work --- p.83 / Chapter 6.1 --- Conclusion --- p.83 / Chapter 6.2 --- Future Work --- p.84 / Chapter 6.2.1 --- Multiple-Source System Optimal Route --- p.84 / Chapter 6.2.2 --- Better Relay-Selection Policy --- p.85 / Chapter 6.2.3 --- Single Optimization for Minimum Energy Cooperative Route --- p.85 / Chapter 6.2.4 --- Dynamic Programming for Minimum Energy Cooperative Route --- p.85 / Chapter 6.2.5 --- Min-Max Problem --- p.85 / Chapter 6.2.6 --- Distributed Algorithm --- p.86 / Chapter 6.2.7 --- Game Theory --- p.86 / Bibliography --- p.87

Cheung, Man Hon. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 89-94). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Rayleigh Fading Channels --- p.1 / Chapter 1.2 --- Ultra-Wideband (UWB) Communications --- p.2 / Chapter 1.2.1 --- Definition --- p.2 / Chapter 1.2.2 --- Characteristics --- p.3 / Chapter 1.2.3 --- UWB Signals --- p.4 / Chapter 1.2.4 --- Applications --- p.5 / Chapter 1.3 --- Cooperative Communications --- p.7 / Chapter 1.4 --- Outline of Thesis --- p.7 / Chapter 2 --- Background Study --- p.9 / Chapter 2.1 --- Interference-Aware Routing --- p.9 / Chapter 2.2 --- Routing in UWB Wireless Networks --- p.11 / Chapter 2.3 --- Cooperative Communications and Routing --- p.12 / Chapter 3 --- Cooperative Routing in Rayleigh Fading Channel --- p.15 / Chapter 3.1 --- System Model --- p.16 / Chapter 3.1.1 --- Transmitted Signal --- p.16 / Chapter 3.1.2 --- Received Signal and Maximal-Ratio Combining (MRC) --- p.16 / Chapter 3.1.3 --- Probability of Outage --- p.18 / Chapter 3.2 --- Cooperation Criteria and Power Distribution --- p.21 / Chapter 3.2.1 --- Optimal Power Distribution Ratio --- p.21 / Chapter 3.2.2 --- Near-Optimal Power Distribution Ratio β´ة --- p.21 / Chapter 3.2.3 --- Cooperation or Not? --- p.23 / Chapter 3.3 --- Performance Analysis and Evaluation --- p.26 / Chapter 3.3.1 --- 1D Poisson Random Network --- p.26 / Chapter 3.3.2 --- 2D Grid Network --- p.28 / Chapter 3.4 --- Cooperative Routing Algorithm --- p.32 / Chapter 3.4.1 --- Cooperative Routing Algorithm --- p.33 / Chapter 3.4.2 --- 2D Random Network --- p.35 / Chapter 4 --- UWB System Model and BER Expression --- p.37 / Chapter 4.1 --- Transmit Signal --- p.37 / Chapter 4.2 --- Channel Model --- p.39 / Chapter 4.3 --- Received Signal --- p.39 / Chapter 4.4 --- Rake Receiver with Maximal-Ratio Combining (MRC) --- p.41 / Chapter 4.5 --- BER in the presence of AWGN & MUI --- p.46 / Chapter 4.6 --- Rake Receivers --- p.47 / Chapter 4.7 --- Comparison of Simple Routing Algorithms in ID Network --- p.49 / Chapter 5 --- Interference-Aware Routing in UWB Wireless Networks --- p.57 / Chapter 5.1 --- Problem Formulation --- p.57 / Chapter 5.2 --- Optimal Interference-Aware Routing --- p.58 / Chapter 5.2.1 --- Link Cost --- p.58 / Chapter 5.2.2 --- Per-Hop BER Requirement and Scaling Effect --- p.59 / Chapter 5.2.3 --- Optimal Interference-Aware Routing --- p.61 / Chapter 5.3 --- Performance Evaluation --- p.64 / Chapter 6 --- Cooperative Routing in UWB Wireless Networks --- p.69 / Chapter 6.1 --- Two-Node Cooperative Communication --- p.69 / Chapter 6.1.1 --- Received Signal for Non-Cooperative Communication --- p.69 / Chapter 6.1.2 --- Received Signal for Two-Node Cooperative Communication --- p.70 / Chapter 6.1.3 --- Probability of Error --- p.71 / Chapter 6.2 --- Problem Formulation --- p.75 / Chapter 6.3 --- Cooperative Routing Algorithm --- p.77 / Chapter 6.4 --- Performance Evaluation --- p.80 / Chapter 7 --- Conclusion and Future Work --- p.85 / Chapter 7.1 --- Conclusion --- p.85 / Chapter 7.2 --- Future Work --- p.86 / Chapter 7.2.1 --- Distributed Algorithm --- p.87 / Chapter 7.2.2 --- Performance Analysis in Random Networks --- p.87 / Chapter 7.2.3 --- Cross-Layer Optimization --- p.87 / Chapter 7.2.4 --- Game Theory --- p.87 / Chapter 7.2.5 --- Other Variations in Cooperative Schemes --- p.88 / Bibliography --- p.89

Traditionally, on-chip network communication was achieved with shared medium networks where devices shared the transmission medium with only one device driving the network at a time. To avoid performance losses, it required a fast bus arbitration logic. However, a single shared bus has serious limitations with the heterogeneous and multi-core communication requirements of today's chip designs. Point-to-point or direct networks solved some of the scalability issues, but the use of routers and of rather complex algorithms to connect nodes during each cycle caused new bottlenecks. As technology scales, the on-chip physical interconnect presents an increasingly limiting factor for performance and energy consumption. Network-on-chip, an emerging interconnect paradigm, provide solutions to these interconnect and communication challenges. Motivated by future bottom-up self-assembled fabrication techniques, which are believed to produce largely unstructured interconnect fabrics in a very inexpensive way, the goal of this thesis is to explore the design trade-offs of such irregular, heterogeneous, and unreliable networks. The important measures we care about for our complex on-chip network models are the information transfer, congestion avoidance, throughput, and latency. We use two control parameters and a network model inspired by Watts and Strogatz's small-world network model to generate a large class of different networks. We then evaluate their cost and performance and introduce a function which allows us to systematically explore the trade-offs between cost and performance depending on the designer's requirement. We further evaluate these networks under different traffic conditions and introduce an adaptive and topology-agnostic ant routing algorithm that does not require any global control and avoids network congestion.

Thesis (Ph. D.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.

Thesis (M.S.)--State University of New York at Binghamton, Dept. of Electrical & Computer Engineering, 2006. / Includes bibliographical references.

As the role of the Internet has been steadily gaining in importance, overlays are increasingly being used to provide new services and to deploy older ones. Some of the services for which overlays have been proposed include multicast, quality of service (QoS), search, and resilient networks. The use of overlays, in turn, has led to more interest in improving their performance. The performance of an overlay network depends significantly on how the network is structured, i.e., the placement of the nodes in the underlying network topology, the links between the overlay nodes and the access links of these nodes. This thesis focuses on algorithms for improving the performance of