Wong, Ho Yin Starsky. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 81-85). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Problems of IP multicast --- p.2 / Chapter 1.3 --- End-system multicast --- p.3 / Chapter 1.4 --- The Challenge of ESM --- p.3 / Chapter 1.5 --- Document Roadmap --- p.4 / Chapter 2 --- System Architecture --- p.5 / Chapter 3 --- ESM Protocol --- p.8 / Chapter 3.1 --- ESM: Tree Formation Protocol --- p.8 / Chapter 3.1.1 --- Example of Tree Formation Protocol --- p.14 / Chapter 3.1.2 --- "The proof of ""Tree Formation Protocol always main- tains a tree topology""" --- p.15 / Chapter 3.1.3 --- "The proof of ""Tree Formation Protocol guarantees that there is no partition in the ESM-tree""" --- p.16 / Chapter 3.1.4 --- State Transition Diagram for Tree Formation Protocol --- p.16 / Chapter 3.2 --- ESM: Data Transfer --- p.28 / Chapter 3.3 --- ESM: Tree Optimization Protocol CONTENTS --- p.30 / Chapter 3.3.1 --- Example of Tree Optimization Protocol --- p.37 / Chapter 3.3.2 --- "The proof of ""Distributed Locking Protocol avoids loop formation and tree partition""" --- p.38 / Chapter 3.3.3 --- State Transition Diagram for Tree Optimization Protocol --- p.39 / Chapter 3.4 --- ESM: Node Leaving Protocol --- p.46 / Chapter 3.4.1 --- Example of ESM: Node Leaving Protocol --- p.51 / Chapter 3.4.2 --- State Transition Diagram for Node Leaving Protocol --- p.53 / Chapter 4 --- Performance Evaluation --- p.60 / Chapter 4.1 --- Experiment 1 - Comparisons between IP Unicast and ESM --- p.61 / Chapter 4.2 --- Experiment 2 - Comparisons between different ESM topologies --- p.64 / Chapter 4.3 --- Experiment 3 - Comparison between different thresholds for tree optimization operation --- p.67 / Chapter 4.4 --- Experiment 4 - NS2 Simulation --- p.69 / Chapter 5 --- Related Work --- p.74 / Chapter 6 --- Concluding Remarks --- p.78 / Chapter 6.1 --- Contributions --- p.78 / Chapter 6.2 --- Future Work --- p.79 / Chapter 6.2.1 --- Large-scale Experiments --- p.79 / Chapter 6.2.2 --- Evaluation for non-reliable data transfer --- p.79 / Chapter 6.2.3 --- Investigation of tree-optimization activation threshold --- p.80

近年來，標準化的媒體訪問控制（MAC）協議，在無線局域網（WLAN）和無線傳感器網絡（WSNs）中起著重要的作用。其中具有分佈式協調功能 (DCF) 的IEEE 802.11協議目前是一種最流行的WLAN標準，它包括MAC層和物理層的規範；而規範了PHY-MAC 的IEEE 802.15.4協議，也成為了促進部署各種商業用途的無線傳感器網絡的一個重要的里程碑。IEEE 802.11 DCF和802.15.4 MAC協議的核心是使用與防撞載波偵聽多路訪問協議 （CSMA/CA）。 / 雖然對這類MAC協議的研究已經持續了幾十年，但是研究者們仍然無法對這些無線網絡進行全面徹底的性能分析。 / 鑑於這種原因，我們在這篇論文中提出了一種通用馬爾可夫狀態空間模型，用於分析基於CSMA/ CA的MAC協議。每個節點的輸入緩衝器被模擬為一個Geo/G/1隊列，我們用了馬爾可夫鏈來描述每一個隊頭封包（HOL）的服務時間分佈。在本篇文章裡，這種馬爾可夫模型理論被運用於分析在非飽和條件下，基於概率指數補償的調度算法的兩種網絡：在理想信道和非理想信道條件下的IEEE 802.11 DCF網絡，以及IEEE 802.15.4網絡。 / 從這個排隊模型中，我們獲得了網絡穩態下吞吐量的特性方程，數據包平均分組接入延遲以及排隊延遲。此外，對於IEEE802.15.4網絡，通過馬爾可夫模型我們也得到每個節點的能量消耗的準確表達。 / 在這篇論文中，我們闡述了對於MAC網絡的吞吐量和排隊延遲方面的穩定條件。基於這兩個穩定條件，我們能夠得出兩種區域：穩定的吞吐量區域和有界延遲區域，並發現它們與補償調度算法和總輸入量有著密切的關係。另外我們證明了這種指數補償演算法同樣適合龐大用戶量的網絡。 / 對於802.11 DCF網絡，我們發現基於RTS / CTS訪問機制的網絡性能受到總輸入量和轉播因子的影響比基於基本訪問機制的網絡來的小。此外，經過對比理想和非理想信道下網絡性能的表現，我們發現傳輸錯誤對網絡的吞吐量和延遲也會產生重大影響。對於IEEE802.15.4網絡，我們的研究結果證實在穩定的吞吐區域內，單個節點的能耗較少。 / 最後，我們將這種方法擴展到基於競爭窗口補償模型中，對比分析證明了概率補償演算法的模型可以有效地用於分析實際中基於競爭窗口機制的無線網絡。 / In recent years, the standardized Media Access Control (MAC) protocol plays an important role in wireless local area networks (WLANs) and wireless sensor networks (WSNs). The IEEE 802.11 protocol with distributed coordination function (DCF) is the most popular standard in WLANs that includes specifications for both MAC and physical layers, whereas the IEEE 802.15.4 PHY-MAC specifications represents a significant milestone in promoting deployment of WSNs for a variety of commercial uses. The core of the 802.11 DCF and 802.15.4 MAC protocols is the Carrier-Sense Multiple-Access protocol with Collision Avoidance (CSMA/CA). / Although the studies of such kinds of MAC protocols have been lasted for several decades, a thorough network performance analysis of these wireless networks still cannot be tackled in the existing works. / In light of this concern, we propose a generic Markov state space model of the MAC protocols with CSMA/CA for contention resolution in this thesis. The input buffer of each node is modeled as a Geo/G/1 queue, and the service time distribution is derived from a Markov chain describing the state transitions of head-of-line (HOL) packets. This Markov model is well demonstrated by the IEEE 802.11 DCF networks in either ideal channels or imperfect channels, and IEEE 802.15.4 networks, with probabilistic exponential backoff scheduling algorithm under non-saturated condition. / With this queueing model, we obtain the steady state characteristic equation of network throughput as well as the mean packet access and queueing delays of packets. Moreover, for the IEEE 802.15.4 networks, the accurate expressions of energy consumptions for each node can also be obtained through this Markov model. / In this dissertation, we specify the stability conditions in terms of throughput and queueing delay for MAC networks. These two stable conditions enable us to derive two kinds of regions: the stable throughput region and the bounded delay region, which is dependent on the backoff scheduling algorithm and the aggregate input traffic. We prove that the stable regions still exist even for an infinite population with exponential backoff. / For the IEEE 802.11 DCF networks, it depicts that the network performance of RTS/CTS access scheme is less dependent on the aggregate input rate and retransmission factor than that of the Basic access mechanism. Additionally, with the comparison of the networks performance under ideal and imperfect channels, we also show that the transmission errors have a significant impact on both throughput and delay of networks. For the IEEE 802.15.4 networks, our results confirm that the energy consumption of a single node is kept small within its stable throughput region. / Last but not least, we extend our approach to the contention-window-based backoff model, and depict that the probabilistic backoff model can serve as a good analytical model for the practical contention window mechanism. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Yin, Dongjie. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 151-160). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Chapter Chapter 1 --- Introduction of IEEE Standard MAC Protocols --- p.1 / Chapter 1.1 --- Medium Access Control (MAC) Protocols --- p.2 / Chapter 1.1.1 --- Medium access control in wireless LANs --- p.3 / Chapter 1.1.2 --- Medium access control in wireless sensor networks --- p.6 / Chapter 1.2 --- Backoff Scheduling Algorithms for Contention Resolution --- p.8 / Chapter 1.3 --- Our Methodologies --- p.11 / Chapter 1.3.1 --- Multi-queue-singer-server system --- p.11 / Chapter 1.3.2 --- State space of Markov chain for MAC protocols --- p.15 / Chapter 1.4 --- Contributions --- p.19 / Chapter 1.4.1 --- The Markov state space model of MAC protocols --- p.20 / Chapter 1.4.2 --- Stability analysis of networks --- p.20 / Chapter 1.4.3 --- Probabilistic exponential backoff and window-based exponential backoff --- p.21 / Chapter 1.5 --- Dissertation Overview --- p.22 / Chapter Chapter 2 --- IEEE 802.11 Distributed Coordination Function --- p.24 / Chapter 2.1 --- Introduction and Overview of IEEE 802.11 DCF --- p.25 / Chapter 2.1.1 --- Principle of IEEE 802.11 DCF protocols --- p.25 / Chapter 2.1.2 --- Historical background of IEEE 802.11 DCF --- p.26 / Chapter 2.1.3 --- Contributions of our works --- p.29 / Chapter 2.2 --- Queuing Model of HOL Packet for the 802.11 DCF --- p.31 / Chapter 2.2.1 --- Alternating renewal process of channel --- p.31 / Chapter 2.2.2 --- Queuing model of input buffer --- p.34 / Chapter 2.3 --- Stable Throughput Region for the 802.11 DCF --- p.42 / Chapter 2.3.1 --- Stable throughput condition --- p.43 / Chapter 2.3.2 --- Stable throughput region of exponential backoff --- p.45 / Chapter 2.4 --- Bounded Delay Region for IEEE 802.11 --- p.52 / Chapter 2.4.1 --- Bounded delay condition --- p.52 / Chapter 2.4.2 --- Bounded delay region of exponential backoff --- p.53 / Chapter 2.5 --- Window-based Exponential Backoff --- p.57 / Chapter 2.6 --- Conclusion --- p.63 / Chapter Chapter 3 --- IEEE 802.11 DCF in Presence of Non-Ideal Transmission Channel --- p.65 / Chapter 3.1 --- Introduction of IEEE 802.11 DCF with Error-Prone --- p.66 / Chapter 3.1.1 --- Collision and error control in 802.11 DCF --- p.66 / Chapter 3.1.2 --- Historical background --- p.69 / Chapter 3.2 --- Queuing Model of Input Buffer for the 802.11 DCF with Error-Prone Channels --- p.71 / Chapter 3.3 --- Stability Analysis --- p.83 / Chapter 3.3.1 --- Stability analysis of network throughput --- p.83 / Chapter 3.3.2 --- Stability analysis of queueing delay --- p.91 / Chapter 3.4 --- Conclusion --- p.96 / Chapter Chapter 4 --- Performance Analysis of IEEE 802.15.4 Beacon-Enabled Mode --- p.97 / Chapter 4.1 --- Introduction --- p.98 / Chapter 4.1.1 --- Principle of IEEE 802.15.4 protocols --- p.98 / Chapter 4.1.2 --- Historical background of IEEE 802.15.4 --- p.101 / Chapter 4.1.3 --- Contributions of our works --- p.103 / Chapter 4.2 --- Queuing Model of Input Buffer for IEEE 802.15.4 --- p.105 / Chapter 4.2.1 --- Queuing model of input buffer --- p.106 / Chapter 4.2.2 --- Stable conditions of exponential backoff --- p.113 / Chapter 4.3 --- Analysis of Uplink Traffic without Acknowledgement --- p.116 / Chapter 4.4 --- Analysis of Acknowledged Uplink Traffic --- p.122 / Chapter 4.5 --- Analysis of Power Consumption of Each Node --- p.127 / Chapter 4.5.1 --- Power consumption of non-acknowledgement mode --- p.129 / Chapter 4.5.2 --- Power consumption of acknowledgement mode --- p.130 / Chapter 4.6 --- Simulation and Numerical Results --- p.132 / Chapter 4.7 --- Conclusion --- p.137 / Chapter Chapter 5 --- Summary and Future Works --- p.139 / Chapter 5.1 --- Contribution Summary --- p.140 / Chapter 5.2 --- Future Works --- p.142 / Chapter Appendix A --- Service Time Distribution for the Ideal 802.11 DCF with Exponential Backoff --- p.145 / Chapter Appendix B --- Throughput of802.11 DCF with Window-Based Backoff Scheme --- p.146 / Chapter Appendix C --- Service Time Distribution for the 802.11 DCF under Error-Prone Channels with Exponential Backoff --- p.147 / Chapter Appendix D --- Service Time Distribution for the IEEE 802.15.4 with Exponential Backoff --- p.150 / Bibliography --- p.151

No description available.

Zhang Li. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 71-74). / Abstracts in English and Chinese. / Abstract --- p.ii / 摘要 --- p.iv / Acknowledgments --- p.v / Contents --- p.vi / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Internet Routing and Performance Studies --- p.5 / Chapter 2.1 --- Border Gateway Protocol Version 4 (BGP4) --- p.5 / Chapter 2.2 --- Internet Performance Studies --- p.6 / Chapter 2.3 --- Improve Routing Performance --- p.8 / Chapter 2.3.1 --- Traffic Engineering --- p.8 / Chapter 2.3.2 --- Network-layer Techniques --- p.9 / Chapter 2.3.3 --- Minimum Delay Routing --- p.11 / Chapter Chapter 3 --- Overlay-based Techniques --- p.15 / Chapter 3.1 --- Content Distribution Network --- p.16 / Chapter 3.2 --- Relative Overlay Techniques --- p.16 / Chapter Chapter 4 --- Overlay Minimum Delay Routing --- p.19 / Chapter 4.1 --- Minimum Delay Routing in Overlay Network --- p.21 / Chapter 4.1.1 --- Problem Formulation --- p.21 / Chapter 4.1.2 --- Necessary and Sufficient Conditions for Distributed Computing --- p.25 / Chapter 4.1.3 --- Optimal Overlay Auxiliary Routing (00AR) Algorithm --- p.29 / Chapter 4.2 --- Performance Comparing with Optimal IP routing --- p.31 / Chapter Chapter 5 --- Sub-Optimal Overlay Auxiliary Routing Algorithm --- p.39 / Chapter 5.1 --- Approximation Conditions to Optimal Overlay Routing --- p.40 / Chapter 5.2 --- SOAR algorithm Overview --- p.44 / Chapter 5.3 --- Distributing Traffic over Multiple Paths --- p.49 / Chapter 5.3.1 --- Adaptive load Adjustment --- p.50 / Chapter 5.3.2 --- Per-flow Routing Control --- p.53 / Chapter 5.4 --- Discussion on Marginal Delay of an OAR Link --- p.55 / Chapter Chapter 6 --- Performance Evaluation of Sub-Optimal Overlay Auxiliary Routing --- p.57 / Chapter 6.1 --- Experiment Method Description --- p.57 / Chapter 6.2 --- Comparison of overall delay --- p.61 / Chapter 6.3 --- Effect of the Routing update interval parameters xx and yy --- p.64 / Chapter 6.4 --- Comparison of packet loss rate --- p.66 / Chapter 6.5 --- Comparison of potential maximum data transmission rate --- p.68 / Chapter 6.6 --- Stability of the OAR load-balancing heuristics algorithm --- p.69 / References --- p.71 / Appendix --- p.75

Luk, Chun Pong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 122-125). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction / Motivation --- p.1 / Chapter 1.1 --- Background and Motivation --- p.1 / Chapter 1.2 --- Performance Analysis of Opportunistic Routing in Multi-hop Wireless Network --- p.3 / Chapter 1.3 --- Opportunistic Routing Protocol Design --- p.5 / Chapter 1.4 --- Chapter Summary --- p.6 / Chapter 2 --- Literature Review --- p.8 / Chapter 2.1 --- Introduction --- p.8 / Chapter 2.2 --- Opportunistic Routing Protocols --- p.9 / Chapter 2.2.1 --- Challenges of the Opportunistic Routing Protocol Design --- p.9 / Chapter 2.2.2 --- Overview of Existing Opportunistic Routing Protocols --- p.11 / Chapter 2.2.3 --- Forwarding Set Selection Algorithms --- p.12 / Chapter 2.2.4 --- Actual Forwarder Determination --- p.13 / Chapter 2.2.5 --- Duplicate Suppression Strategies --- p.14 / Chapter 2.2.6 --- Variations of Opportunistic Routing Protocols --- p.16 / Chapter 2.3 --- Performance Evaluation and Analysis of Opportunistic Routing --- p.16 / Chapter 2.4 --- Routing in Networks with Directional Antennas --- p.19 / Chapter 2.4.1 --- Performance Analysis of the use of Directional Antenna in Routing --- p.20 / Chapter 2.4.2 --- Existing Routing and MAC protocols for Networks with Directional Antennas --- p.21 / Chapter 2.5 --- Chapter Summary --- p.22 / Chapter 3 --- Performance Analysis of Opportunistic Routing in Multi-hop Wireless Network --- p.24 / Chapter 3.1 --- Introduction --- p.24 / Chapter 3.2 --- Analytical Derivation of the Expected Progress per Transmission of Opportunistic Routing --- p.25 / Chapter 3.2.1 --- Problem Formulations and Assumptions --- p.26 / Chapter 3.2.2 --- Reception Probability of a Node in a Given Region --- p.28 / Chapter 3.2.3 --- Radio Channel Models --- p.30 / Chapter 3.2.4 --- Average Progress per Transmission --- p.32 / Chapter 3.3 --- Validation and Analytical Results --- p.34 / Chapter 3.3.1 --- Results Validation --- p.34 / Chapter 3.3.2 --- Baseline Models --- p.35 / Chapter 3.3.3 --- Results and Analysis --- p.36 / Chapter 3.4 --- Further Extension of the Model --- p.40 / Chapter 3.5 --- Chapter Summary --- p.42 / Chapter 4 --- Opportunistic Routing in Multi-hop Wireless Networks with Directional Antennas --- p.44 / Chapter 4.1 --- Introduction --- p.44 / Chapter 4.2 --- Performance Analysis of Opportunistic Routing in Networks with Directional Antennas --- p.46 / Chapter 4.2.1 --- Network Model --- p.46 / Chapter 4.2.2 --- Radio Channel Models --- p.47 / Chapter 4.2.3 --- Antenna Models --- p.49 / Chapter 4.2.4 --- Expected Progress per Transmission with Directional Antenna --- p.51 / Chapter 4.2.5 --- Simulation Setup --- p.52 / Chapter 4.2.6 --- Results and Analysis --- p.54 / Chapter 4.3 --- Maximizing the Gain of Opportunistic Routing by Adjusting Antenna Beamwidth and Direction --- p.60 / Chapter 4.3.1 --- Introduction and Motivation --- p.60 / Chapter 4.3.2 --- Network Models --- p.61 / Chapter 4.3.3 --- Algorithms --- p.61 / Chapter 4.3.4 --- Results and Discussions --- p.66 / Chapter 4.3.5 --- Section Summary --- p.71 / Chapter 4.4 --- Chapter Summary --- p.72 / Chapter 5 --- Impact of Interference on Opportunistic Routing --- p.74 / Chapter 5.1 --- Introduction --- p.74 / Chapter 5.2 --- Interference Model --- p.75 / Chapter 5.3 --- MAC Protocols --- p.76 / Chapter 5.4 --- Simulation Results and Discussions --- p.78 / Chapter 5.4.1 --- Simulation Setup --- p.78 / Chapter 5.4.2 --- Baseline Models --- p.78 / Chapter 5.4.3 --- Results and Analysis --- p.79 / Chapter 5.5 --- Chapter Summary --- p.84 / Chapter 6 --- Threshold-based Opportunistic Routing Protocol --- p.86 / Chapter 6.1 --- Introduction --- p.86 / Chapter 6.2 --- Limitations of Existing Opportunistic Routing Protocols --- p.87 / Chapter 6.3 --- System Model --- p.89 / Chapter 6.4 --- Operating Principles of TORP --- p.91 / Chapter 6.5 --- Protocol Details --- p.93 / Chapter 6.5.1 --- Forwarding Set Computation --- p.93 / Chapter 6.5.2 --- Update of Forwarding Set and Remaining Transmission Counts --- p.97 / Chapter 6.5.3 --- Forwarding Threshold Computation and Details of the Packet Forwarding Process --- p.100 / Chapter 6.5.4 --- Node State --- p.101 / Chapter 6.5.5 --- Packet Format --- p.101 / Chapter 6.5.6 --- Batched Acknowledgement --- p.102 / Chapter 6.6 --- Advantages of TORP --- p.102 / Chapter 6.6.1 --- Distributed Forwarding Set Computation --- p.102 / Chapter 6.6.2 --- Threshold-based Forwarding --- p.103 / Chapter 6.6.3 --- MAC-Independence --- p.104 / Chapter 6.7 --- Protocol Extensions --- p.104 / Chapter 6.7.1 --- Implicit ACK --- p.104 / Chapter 6.7.2 --- Progress Recovery --- p.105 / Chapter 6.7.3 --- Modification of TORP for Large Networks --- p.106 / Chapter 6.8 --- Results and Discussions --- p.106 / Chapter 6.8.1 --- Simulation Setup --- p.106 / Chapter 6.8.2 --- Baseline Models --- p.107 / Chapter 6.8.3 --- Performance Evaluations and Analysis --- p.108 / Chapter 6.9 --- Chapter Summary --- p.116 / Chapter 7 --- Conclusion and Future Works --- p.118 / Chapter 7.1 --- Conclusion --- p.118 / Chapter 7.2 --- Future Work --- p.120 / Bibliography --- p.122

Yam, Shing Chung Jonathan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 75-79). / Abstracts in English and Chinese. / Abstract / Acknowledgement / Contents / List of Figures / List of Tables / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.2 / Chapter 1.2 --- Thesis Organization --- p.5 / Chapter 2 --- Literature Review --- p.7 / Chapter 2.1 --- Data Sharing and Dissemination --- p.7 / Chapter 2.2 --- Data Aggregation --- p.12 / Chapter 2.3 --- Sensor Network Database Systems --- p.13 / Chapter 2.4 --- Data Routing and Networking --- p.23 / Chapter 2.5 --- Other Applications --- p.24 / Chapter 3 --- Preliminaries --- p.25 / Chapter 3.1 --- Probability Distribution and Gossipee-selection Schemes --- p.25 / Chapter 3.2 --- The Network Models --- p.28 / Chapter 3.3 --- Objective and Problem Statement --- p.30 / Chapter 3.4 --- Two-tier Gossip Mechanism --- p.31 / Chapter 3.5 --- Semantic-dependent Gossip Mechanism --- p.32 / Chapter 4 --- Results for Two-tier Gossip Mechanisms --- p.34 / Chapter 4.1 --- Background --- p.34 / Chapter 4.2 --- A Time Bound for Solving the Clustered Destination Problem with T-Theorem 1 --- p.39 / Chapter 4.3 --- Further Results´ؤTheorem 2 --- p.49 / Chapter 4.4 --- Experimental Results for Two-tier and N-tier Gossip Mechanisms --- p.51 / Chapter 4.4.1 --- Performance Evaluation of Two-tier Gossip Mechanisms --- p.52 / Chapter 4.4.2 --- Performance Evaluation of N-tier Gossip Mechanisms --- p.56 / Chapter 4.5 --- Discussion --- p.60 / Chapter 5 --- Results for Semantic-dependent Gossip Mechanisms --- p.62 / Chapter 5.1 --- Background --- p.62 / Chapter 5.2 --- Theory --- p.65 / Chapter 5.3 --- "Detection of Single Moving Heat Source with S max(2c1l,c1h ))" --- p.66 / Chapter 5.4 --- Detection of Multiple Static Heat Sources with Two-tier Gossip mechanism --- p.69 / Chapter 5.5 --- Discussion --- p.72 / Chapter 6 --- Conclusion --- p.73 / Chapter 7 --- References --- p.75 / Appendix Prove of Result 4.3 --- p.80

This dissertation investigates the use of a hardware mechanism called Eager Data Transfer (EDT) for achieving the reduction of communication latency for user-level network protocol. To reach the goal, the dissertation addresses the following research issues. First, the development of a communication system performance evaluation tool called Linux/SimOS is presented. Linux/SimOS provides a full system profiling capability to allow measurement at various level including hardware, operating system, and application. Second, the performance analysis of network protocols is presented. For the assessment of overhead related to network protocol operation, Linux/SimOS was used to perform the detailed latency measurements for TCP/IP, UDP/IP, and M-VIA network protocols. Finally, EDT is proposed for reducing communication latency. Since the data transfer time constitutes a significant portion of overall communication latency, the reduction of data transfer time leads to low communication latency. EDT is based on cache coherence interface hardware for reducing data transfer overhead during network protocol operation. Our simulation result shows that EDT is very effective in attaining low communication latency compared to the DMA-based approaches. / Graduation date: 2005

An important objective of tactical ad hoc networks is to deliver threat information from sensors to shooters efficiently and quickly. The information sent to a particular shooter should contain warnings about threats that are within some distance and/or within some time of the shooter's current location. In this thesis we develop a novel multicast model that distributes this form of threat information in a message efficient manner. In addition, information about allied force can also be distributed in a similar way. We present results from extensive simulations that demonstrate the efficiency of our protocol and discuss the scalability of this model to larger networks. / Graduation date: 2001

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xiii, 90 p.; also contains graphics. Vita. Includes bibliographical references (p. 85-89).

Thesis (M.S.)--Rochester Institute of Technology, 2004. / Typescript. Includes bibliographical references (p. 109-110).