頁籤選單縮合
題 名 | An Efficient K-hop Clustering Routing Scheme for Ad-hoc Wireless Networks |
---|---|
作 者 | Su,Da-chun; Hwang,Shiow-fen; Dow,Chyi-ren; Wang,Yi-wen; | 書刊名 | 網際網路技術學刊 |
卷 期 | 3:2 2002.04[民91.04] |
頁 次 | 頁139-146 |
分類號 | 448.6 |
關鍵詞 | |
語 文 | 英文(English) |
英文摘要 | Ad-hoc networks are wireless multihop networks without any base station. In ad-hoc networks, mobile host can move arbitrarily and no centralized management mechanism can be exerted. Under the limited resources such as network bandwidth, memory capacity, and battery power, the storage capability of network information among mobile hosts and the efficiency of routing schemes in ad-hoc wireless networks become more important than if traditional networks. Hierarchical structure can be implement by the clustering technique and is proposed to reduce the size of storage or the routing overhead. Most of the current clustering scheme are based on 1-hop structure. However, in the large scale networks, the superiority of 1-hop clustering schemes are no more evident. In this paper, we will propose a k-hop clustering routing algorithm which is a hybrid reactive/proactive routing scheme. Simulation results demonstrate our scheme gets the less number of clusters and is more stable when a topology changes. In addition, this algorithm also reduces the location search overhead and the cost of routing tables. |
本系統中英文摘要資訊取自各篇刊載內容。