An Energy-efficient Clustering Algorithm for Wireless Ad Hoc Networks

以效能考量之ad-hoc式無線網路群集演算法

李棟村(Tung-Tsun Lee)

《宜蘭技術學報》 9期電機資訊專輯 (2002/12) Pp. 65-73

https://doi.org/10.6179/nit.eec.2002.09.18

摘要

本文考慮能量消耗、平衡負載及較好之骨幹之形成來考量ad hoc式無線網路的群集問題，能量消耗於群集首( clusterhead)及其成員間為選群集首主要考量點，組員必須經常地將其狀況與群集首問做溝通，如此群集首方能得到最新訊息且群集內之路由及訊息之傳遞亦較能有效達成;再者，考慮群集過程之平衡負載一搬來說一無線網路節點只配有限電量，所以期望大部分的節點均有機會可當作群集首且每一群集能平均分配成員;其次，如果群集首能位於由節點及線段所形成之圖(graph)之內部，如此將會形成較好之骨幹來，主要原因是如果群集是由很多位於周圍之單一節點組成的話，由群集首及閘道相互合作而成之路由工作會變的較沒有效率.此篇提出一簡單演算法考慮這些因素，由模擬得知可確實達成此目標。

關鍵字

群集技術 ； ad hoc網路 ； 多次跳達無線網路

並列摘要

In this paper, we try to cluster nodes in ad hoc networks considering of energy consumption, load -balanced and well-backboned factors. The energy spent in communication between clusterhead and its members are considered to be the major factor in c1usterhead election. The member of a clusterhead has to report its position with respect to its c1usterhead in a timely fashion , such that the clusterhead can get the fresh information. And, the routing and message delivering can be done within cluster effectively. Furthermore, the load -balanced factor is considered in clustering process. A mobile node is equipped with limited power in general; therefore, it is desirable if most of nodes have the chance to be clusterhead, and most of clusters contain average number of members. Moreover, the well-backboned architecture formed by cluster is beneficial if clusterheads are within the inner of the graph derived from nodes and edges between communicable nodes. The reason is that routing process is achieved by the cooperation of c1usterheads and gateway nodes; the routing activity is less effective if cluster is consisted of a single nod e located at boundary of graph. A simple algorithm considered upon these factors is proposed. The objectives can be achieved from the observation of simulations.

並列關鍵字

clustering technique ； ad hoc network ； multihop wireless network