行動隨意網路中具負載平衡之節能網格路由

Triangular Energy Saving Routing Protocol with Load Balance in Mobile Ad Hoc Networks

陳柏君(Po-Chun Chen)

指導教授 ： 段裘慶

國立臺北科技大學/電資學院/電腦與通訊研究所/碩士(2008年)

https://doi.org/10.6841/NTUT.2008.00309

摘要

近年來由於無線通訊技術的進步，促使具有移動性、高品質傳輸、及多媒體特性的無線行動節點的蓬勃發展。行動隨意網路是由許多無線行動節點所組成，由於其無需基礎設施與網路自我形成之特性，近來越多的應用相繼誕生。然而行動節點電能需仰賴電池供應，在受限的電能下，如何有效的減少電能消耗，以延長節點存活時間一直是行動隨意網路研究重點之一。
於行動隨意網路中，有許多相關的節能路由協定被提出，其中網格路由協定為常用的節能路由協定之一。網格路由協定中，每一網格均需選出一節點擔任閘道節點，但在閘道節點競選的過程中往往會消耗多餘的電能，在節點密度較高的環境中，其所消耗的電能更為顯著。故本研究以網格架構為基礎，在維持網路正常運作下，針對如何減少閘道節點競選時所需消耗的電能，提出「行動隨意網路中具負載平衡之節能網格路由協定(TESLB)」。
TESLB主要藉由全球定位系統或其他定位裝置來獲得地理位置資訊，並利用所獲得的地理位置資訊將通訊區域切割成許多虛擬網格。於TESLB中，閘道節點主要是透過節點剩餘電能與初始電能的比值關係來產生，使得閘道節點能由網格中剩餘電量較多之節點擔任，有效提升節點平均存活時間。除了改善閘道節點競選機制外，另提出三角節能路由協定應用於TESLB閘道節點間的路由選擇。透過此協定閘道節點可選擇較節能的路徑來傳輸資料，且閘道節點能根據與下一個接收節點之間的距離調整傳輸功率，以減少不必要的電能消耗。當路由中節點位置改變或是電能不足而失效時，TESLB也能及時更新路由資訊以確保路由的完整性。
最後，將針對閘道節點選擇機制、網路負載平衡、三角節能路由作效能評估，並以網路存活時間、路由所耗電能、節點存活率作為量測標的。經由模擬實驗比較TESLB、GRID與LB2R等三項基於地理位置資訊的節能路由之效能優劣。經實驗結果得知，雖TESLB路由平均傳輸距離較長，傳輸所耗的時間也會較長，但在閘道節能與路由部分均有較佳的節能效果。此外，在電能負載平衡上也能使電能消耗平均分散在各節點上。在路由的平均存活時間上，TESLB也能提升路由的存活時間、減少路由搜尋次數。在低密度與高速的網路環境中，TESLB總體網路運作時間為GRID的2.17倍、LB2R的2.01倍。

關鍵字

虛擬網格 ； 行動隨意網路 ； 閘道節點 ； 三角節能路由 ； 負載平衡

並列摘要

In mobile ad hoc networks (MANET), many wireless mobile nodes with mobility, multimedia, QoS etc., are provided since the wireless techniques are developed rapidly. A mobile ad hoc network consists of a set of mobile nodes. A MANET does not need the base stations and could be formed by mobile nodes. Many applications have been adopted MANETs. Due to the limited battery energy, how to reduce the energy consumption of nodes to prolong the network lifetime is an important issue in MANETs.
Therefore, many energy-saving routing protocols were proposed. Among the existed routing protocols, the grid routing protocol is the general solution for energy saving. In grid routing protocol, one node must be elected as the gateway node in each grid. However, nodes consume extra energy to elect the gateway node, especially when the node density is high. In this paper, we propose a triangular energy saving routing protocol with load balance (TESLB) in MANETs to solve the above issues. Our proposed protocol could reduce the energy consumption of nodes in the gateway node election and keep MANETs connected. TESLB partitions the network area into many virtual square grids according to the location information by global position system (GPS). A gateway is elected by the ratio between the remaining energy and the initial energy of nodes. In this way, the elected gateway has the highest energy in the grid. On the other hand, this way can also prolong the average life time effectively. TESLB not only improves the grid header election but also provides a triangular energy saving routing protocol. The gateway choose the path that can save the most of power to transfer packets by this protocol. Moreover, nodes can adjust the radio power according to the distance between the gateway and the next node; thus, nodes can reduce the unnecessary power consumption. While the node locations have changed or the nodes were dead on a route, TESLB can update the information of routing to ensure the completeness of MANETs.
We measure and compare the network lifetime, energy consumption, and alive node ratio in TESLB, GRID (A Fully-Aware Routing Protocol for Mobile Ad Hoc Networks), and LB2R (A Location-Aided Power-Aware Routing Protocol in Mobile Ad Hoc Networks). The experimental results show that TESLB outperform GRID and LB2R in energy-saving on the gateway election and routing. Besides, TESLB can distribute the energy consumption over each node on load-balance. In the routing’s average lifetime, TESLB can also prolong the routing time and decrease the routing discovery times. In the low density of nodes and high moving speed, the network’s total working time of TESLB is 2.17 and 2.01 times as large as that of GRID and LB2R, respectively.

並列關鍵字

Virtual grid ； mobile ad hoc networks ； gateway ； triangular energy saving routing ； load balance

參考文獻

[2] D. Johnson, D. Maltz, and J. Jetcheva, “The Dynamic Source Routing (DSR) Protocol for Mobile Ad Hoc Networks,” IETF Internet draft, draft-ietfmanet-dsr-10.txt, July 19, 2004.

[3] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” IETF RFC 3561, July 2003.

[5] Z. Haas and M. Pearlman, “The performance of query control schemes for the zone routing protocol,” ACM SIGCOMM, pp. 167–177, Aug. 1998.

[7] W. B. Heinzelman, P. Chandrakasan, and H. Balakrishnan, “An Application-Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660–670, Oct. 2002.

[8] M.J. Handy, M. Haase, and D. Timmermann, “LEACH-C: Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-head Selection,” Mobile and Wireless Communications Network, pp. 368–372, Sept. 2002.