Networks: Emerging Topics in Computer Science

Igor Bilogrevic, Arshin Rezazadeh, Ladan Momeni

  • 出版商: CreateSpace Independ
  • 出版日期: 2013-03-16
  • 售價: $3,310
  • 貴賓價: 9.5$3,145
  • 語言: 英文
  • 頁數: 284
  • 裝訂: Paperback
  • ISBN: 1461098718
  • ISBN-13: 9781461098713
  • 相關分類: Computer-Science
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

Networks - Emerging Topics in Computer Science is suitable for advanced undergraduate students and postgraduate students who are searching for research topics related to networks or requiring some brainstormings against network applications. It discusses various aspects related to networks, from larget-scale/geo-scale networks to micro-scale networks such as network-on-chip (NoC). The contents of this book is designed in the way such that it tries to make a good balance among different major topics in networks (e.g., network models, network theories, network infrastructures and network applications), so that it suits people from different backgorunds, especially those who are strong in one area but are not familiar with other areas. This book is an invaluable companion for students from their first encounter with the subject to more advanced studies, while the high quality artworks are designed to present the key concepts with simplicity, clarity and consistency.

There are totally 12 chapters in this book. Chapter 1 studies how to perform sink selection and route selection jointly in order to improve the performance of a wireless sensor network.

Chapter 2 attempts to provide an optimal handover point between multi-rate WLAN by employing two kinds of information: (1) the most frequently used data rate (MFDR) for assessing the stable communication performance of a multi-rate WLAN, and (2) the frame retransmission ratio (FRR) for assessing its exact communication performance.

Chapter 3 proposes a probabilistic cost model for estimating costs for wireless network projects. By using the Poisson process at a desired level of confidence, the proposed probabilistic cost model provides an alternative method for cost planning with adequate contingency costs. In

Chapter 4, the authors point out the importance of packet generation according to population, decentralized routing strategy without global information, and link hierarchy at spatially fine-coarse-grained levels. Moreover, the authors propose a naturally embedded network structure by a self-organization that is better than the optimal search of Levy flights.

Chapter 5 introduces an algorithm for multi-agent localization and target tracking from relative measurements in a dynamic system. The algorithm is shown to converge swiftly under communication and computation constraints and is shown to approach optimal as such constraints ebb.

Chapter 6 investigates the performances of land mobile satellite systems over shadowed-Rice fading channels and proposed some important performance metrics.

Chapter 7 discusses a step-by-step method to design source routing for Network on Chip, especially for platforms with small sizes and regular topologies like mesh.

Chapter 8 presents a routing approach called cognitive routing for the design of NoC. The approach can select optimized routes based on a routing cost function and it can integrate a large number of IP cores which are mutually communicating.

In Chapter 9, the authors proposes a systematic approach to reduce an infinite set of inequalities that describe the multiple multicast capacity of an arbitrary network into a finite set of inequalities. The authors first extend the Japanese theorem from multiple unicase networks to multiple multicast networks, then discuss the consequence of the reduction method on characterizing the multiple multicast capacity of ring networks.

Chapter 10 proposes a truly concurrent variant of pi-calculus, which admits parallel performance of atomic actions.

In Chapter 11, the authors introduced a cross-layer design approach for differentiated quality of service enforcement between competing real-time flows.

Finally, Chapter 12 presents a case study of mobile commerce in rural economy countries, which is an area highly related to the application of mobile network.

商品描述(中文翻譯)

《網路 - 計算機科學中的新興主題》適合尋找與網路相關的研究主題或需要針對網路應用進行一些腦力激盪的高年級本科生和研究生。書中討論了與網路相關的各種面向,從大規模/地理規模的網路到微型網路,如片上網路(NoC)。本書的內容設計旨在在網路的不同主要主題(例如,網路模型、網路理論、網路基礎設施和網路應用)之間取得良好的平衡,以便適合來自不同背景的人,特別是那些在某一領域強但對其他領域不熟悉的人。本書是學生從首次接觸該主題到更高級研究的寶貴伴侶,而高品質的插圖旨在以簡單、清晰和一致的方式呈現關鍵概念。

本書共分為12章。第一章研究如何聯合進行匯聚點選擇和路由選擇,以提高無線感測器網路的性能。

第二章試圖通過使用兩種信息提供多速率WLAN之間的最佳切換點:(1) 用於評估多速率WLAN穩定通信性能的最常用數據速率(MFDR),以及 (2) 用於評估其確切通信性能的幀重傳比(FRR)。

第三章提出了一種概率成本模型,用於估算無線網路項目的成本。通過在所需的置信水平下使用泊松過程,所提出的概率成本模型提供了一種替代的成本規劃方法,並包含足夠的應急成本。

在第四章中,作者指出根據人口生成數據包的重要性、無需全局信息的去中心化路由策略,以及在空間上細粒度和粗粒度層級的鏈接層次結構。此外,作者提出了一種通過自我組織自然嵌入的網路結構,這種結構優於Levy飛行的最佳搜索。

第五章介紹了一種從相對測量中進行多代理定位和目標追蹤的算法。該算法在通信和計算約束下迅速收斂,並在這些約束減少時接近最佳。

第六章研究了在陰影-瑞斯衰落通道上地面移動衛星系統的性能,並提出了一些重要的性能指標。

第七章討論了一種逐步設計片上網路源路由的方法,特別適用於小型和規則拓撲(如網格)的平台。

第八章提出了一種稱為認知路由的路由方法,用於設計NoC。該方法可以根據路由成本函數選擇最佳路徑,並能整合大量相互通信的IP核心。

在第九章中,作者提出了一種系統化的方法,將描述任意網路的多重多播容量的無限不等式集減少為有限不等式集。作者首先將日本定理從多重單播網路擴展到多重多播網路,然後討論該減少方法對環形網路多重多播容量特徵化的影響。

第十章提出了一種真正的並發pi演算變體,允許原子行為的並行執行。

在第十一章中,作者介紹了一種跨層設計方法,用於在競爭的實時流之間強制執行差異化的服務質量。

最後,第十二章呈現了一個關於農村經濟國家移動商務的案例研究,這一領域與移動網路的應用密切相關。