모바일 노드의 잔여 에너지를 고려한 향상된 HCTC 알고리즘

Abstract

HCTC algorithm using stochastic properties of the RWP(Random Waypoint) mobility model is more efficient than CBTC in the energy consumption point of view. Node distribution of the RWP mobility component in HCTC algorithm is based on Border Effect. HCTC algorithm uses the feature of RWP mobility component to preserve energy of each node. Node density and directional information are used, when the topology of HCTC is organized. We can get these information without additional hardware such GPS(Global Positioning System). So, it can work in-door environment efficiently. However, some nodes of HCTC consume more energy to maintain paths among nodes than CBTC. Because HCTC algorithm process that the highest density node has more paths to neighbor nodes than normal node. In some networks that have limited energy of node, consuming all energy of a node is very critical problem in the whole network point of view. Because paths can’t be maintained by an exhausted node any more. And also it can’t perform own function. A disabled node determines the lifetime of whole network. And the lifetime of whole network can be increased through adjusting transmission power range such in case of HCTC. In this paper, we propose E-HCTC algorithm that can improve more lifetime considering remaining energy of node.