• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

結合藍牙低功耗的 IEEE 802.11無線網路負載平衡機制 / Load Balance for IEEE 802.11 Wireless LAN with Bluetooth Low Energy

李致賢, Lee, Chih Hsien Unknown Date (has links)
在使用者較為密集的場合中,常會碰到無線網路壅塞的問題,例如在一個大型會議廳中,常會在各個IEEE 802.11頻道上部署不同的WiFi AP(Access Point),來分散使用者的連線。但是由於IEEE 802.11的連線機制是屬於使用者主導(client driven),只能透過使用者去選定AP進行連線,對於使用者裝置來說,,連線到不同AP的優先順序,是依照接收到不同AP的信號強度(RSSI)作為排序指標。這種做法會讓在空間上使用者分佈不平均的環境中,造成多數使用者UE只連線到少數AP,而其餘AP資源閒置無用的情形。 本論文提出一個IEEE 802.11的負載平衡解決方案,結合藍牙低功耗(Bluetooth Low Energy,BLE)及IEEE 802.11成為一個智慧型AP架構。我們利用藍牙低功耗通訊協定GATT (Generic Attribute Profile)分派AP給不同使用者進行連線,再結合馬可夫鏈平穩狀態分佈(Markov Chains Stationary Distribution)演算法,依照使用者在AP網路拓樸中的歷史分佈紀錄,將多個AP的分派轉化為Erlang-C模型的排隊系統以計算AP分派規則,藉此達到系統的負載平衡。 / Usually, a user crowded space encounters wireless network congestion problem. For example, a large conference hall often deploys different wireless AP (Access Point) on each IEEE 802.11 channel to separate users’ connections. However, since the connection mechanism of IEEE 802.11 is client driven, the AP connection is selected by the user and the selection is according to the received signal strength (RSSI) from different APs. This conventional approach may result in most of the user devices connect to relatively limited number of APs, and the resource of the rest of the APs left unused. This paper proposes a smart AP architecture which is able to manage load balance for IEEE 802.11 Wireless LAN using Bluetooth Low Energy (BLE) GATT (Generic Attribute Profile) protocol in order to appropriately assign AP to different user devices. The core AP assignment algorithm is based on Markov chain stationary distribution. Simulation results show that the proposed BM-MS (BLE Management with Markov-Chains Stationary Load Balance) method outperforms RSSI based method in terms of system throughput and average user data rate.
2

車用行動網路中以車行方向為基礎的貪婪路由演算法 / Moving Direction Based Greedy Routing Algorithm for VANET

黃祥德 Unknown Date (has links)
由於VANET上的行動節點移動速度快,加上受到道路及交通號制的限制,導致網路拓樸快速改變,容易造成網路斷訊,影響資料封包在網路上的傳送效能。在傳統的MANET上有許多用來傳送資料封包的路由機制,並不直接適用在VANET上。隨著Global Position System (GPS)的普及,越來越多的車輛都具備GPS,用以輔助行車定位之用。在本研究中我們將透過GPS取得車輛的地理資訊,提出一個適用於VANET中以車行方向為基礎的貪婪路由演算法(MDBG)。 本論文目的在強化VANET網路上資料封包的路由選擇策略。所提出的路由機制將會透過hello message來取得相鄰車輛的位置和車行方向,並利用目標要求(DREQ)、目標回應(DREP)來獲得目標車輛的資訊。進而運用車輛的車行方向,選擇適當的相鄰車輛找出一條穩定的路由路徑。當來源車輛和目標車輛的車行方向相同時,AODV能有不錯的效能表現。而我們的路由演算法(MDBG)將強化當來源車輛和目標車輛的車行方向相反,並且逐漸遠離時的效能表現。實驗模擬的結果顯示MDBG在封包到達率、吞吐量和平均端對端延遲上較之於AODV及DSR演算法有更優異的表現。 / Packets transmission over VANET is intermittent due to rapid change of network topology. This comes from both high mobility of mobile nodes and road limitation. Intermittent transmission causes inefficient packet delivery. Those routing protocols applicable to MANET might not be suitable for VANET. On the other hand, Global Position System (GPS) is becoming prevalent in assisting positioning for vehicles. In this research, we develop a Moving Direction Based Greedy (MDBG) routing algorithm for VANET. MDBG algorithm is based on the geographical information collected by GPS. The objective of the thesis is to enhance routing decision in packet delivery. The "hello message" is used to retrieve the locations and moving directions of neighboring vehicles. Destination REQuest (DREQ) and Destination REPly (DREP) messages are used to retrieve target vehicle information. The source vehicle will thus use these information together with its own moving direction information to establish a stable routing path by selecting appropriate neighboring vehicles. AODV algorithm is proved to have good performance as both the source vehicle and target vehicle have the same moving direction. MDBG algorithm is proposed to leverage the problem as source vehicle and target vehicle move far apart in opposite directions. Simulation results show that MDBG outperforms both AODV and DSR in packet arrival rate, throughput and average end-to-end delay.

Page generated in 0.1528 seconds