• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.131-134
• /
• 2008

A Mobile Ad hoc NETwork(MANET) is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies. In the highly dynamic environment of MANET, energy efficiency is an important performance measure since it directly affects the network lifetime. The failure of energy severely impacts a communications system in crucial communications environments, such as disasters salvage. In this study, we propose a new packet switching routing that can increase the durability of the energy resource and therefore, the lifetime of the mobile nodes and MANET. The performance of the packet switching routing on the node-disjoint multipath and that of AODV are compared by NS2 simulation. The simulation results indicate that this new switching routing can extend the lifetime of a MANET.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.604-612
• /
• 2018

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.65-72
• /
• 2010

In ad-hoc network, the technique to efficiently consume the limited amounts of energy is an important issue since the wireless terminal node is operated on batteries as their energy resource. In order to extend the system lifetime, through a balanced energy consumption, we must delay the situation in which a particular terminal node's energy is depleted and results in system disconnection. Also, the link, which has low reliability due to the mobility of the node, should be avoided considering the key element when setting up the route. The proposed CMLR method in this paper enables to increase the efficiency of energy consumption with a new cost function considering the residue energy of node, error rate of link, and transmission energy consumption. This method is extending the network lifetime and increasing the energy efficiency by compromising the value between the minimization of the transmission energy consumption and maximization of the node's lifetime. Through the simulations the proposed CMLR algorithm was verified by showing better performance over the conventional methods in terms of network lifetime and path efficiency.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.25-33
• /
• 2021

Energy-harvesting wireless sensor networks(EH-WSNs) can collect energy from the environment and overcome the technical limitations of existing power. Since the transmission distance in a wireless sensor network is limited, the data are delivered to the destination node through multi-hop routing. In EH-WSNs, the routing protocol should consider the power situations of nodes, which is determined by the remaining power and energy-harvesting rate. In addition, in applications such as environmental monitoring, when there are urgent data, the routing protocol should be able to transmit it stably and quickly. This paper proposes an adaptive routing protocol that satisfies different requirements of normal and urgent data. To extend network lifetime, the proposed routing protocol reduces power imbalance for normal data and also minimizes transmission latency by controlling the transmission power for urgent data. Simulation results show that the proposed adaptive routing can improve network lifetime by mitigating the power imbalance and greatly reduce the transmission delay of urgent data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8A
• /
• pp.691-701
• /
• 2011

In rotatable directional sensor networks, maximizing network lifetime while covering all the targets and forwarding the sensed data to the sink is a challenge problem. In this paper, we address the Maximum Directional Cover Tree (MDCT) problem of organizing the directional sensors into a group of non-disjoint subsets to extend the network lifetime. Each subset in which the directional sensors cover all the targets and forward the sensed data to the sink is activated at one time. For the MDCT problem, we first present an energy consumption model which mainly takes into account the energy consumption for rotation work. We also develop the Directional Coverage and Connectivity (DCC)-greedy algorithm to solve the MDCT problem. To evaluate the algorithm, we conduct simulations and show that it can extend the network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3621-3640
• /
• 2016

In the process of k-coverage of the target node, there will be a lot of data redundancy forcing the phenomenon of congestion which reduces network communication capability and coverage, and accelerates network energy consumption. Therefore, this paper proposes a novel energy balanced k-coverage control algorithm based on probability model (EBKCCA). The algorithm constructs the coverage network model by using the positional relationship between the nodes. By analyzing the network model, the coverage expected value of nodes and the minimum number of nodes in the monitoring area are given. In terms of energy consumption, this paper gives the proportion of energy conversion functions between working nodes and neighboring nodes. By using the function proportional to schedule low energy nodes, we achieve the energy balance of the whole network and optimizing network resources. The last simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but also completely inhibit the rapid energy consumption of node, and extend the network lifetime.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.27-30
• /
• 2005

Because of unreplenishable power resources, reducing node energy consumption to extend network lifetime is an important requirement in wireless sensor networks. In addition both path length and path cost are important metrics affecting sensor lifetime. We propose a dynamic clustering scheme based on location in wireless sensor networks. Our scheme can localize the effects of route failures, reduce control traffic overhead, and thus enhance the reachability to the destination. We have evaluated the performance of our clustering scheme through a simulation and analysis. We provide simulation results showing a good performance in terms of approximation ratios.

• Smart Media Journal
• /
• v.6 no.4
• /
• pp.24-31
• /
• 2017

In wireless sensor networks, sensor nodes are deployed in a remote, harsh environment. When the power of the sensor node is consumed in such a network, the sensor nodes become useless together with the deterioration of the quality and performance of the sensor network which may save human life. Although many clustering protocols have been proposed to improve the energy consumption and extend the life of the sensor network, most of the previous studies have shown that the overhead of the cluster head is quite large. It is important to design a routing protocol that minimizes the energy consumption of each node and maximizes the network lifetime because of the power limitations of the sensor nodes and the overhead of the cluster heads. Therefore, in this paper, we propose an efficient clustering scheme that reduces the burden of cluster heads, minimizes energy consumption, and uses algorithms that maximize network lifetime. Simulation results show that the proposed clustering scheme improves the energy balance and prolongs the network life when compared with similar techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2644-2657
• /
• 2018

To utilize the energy of sensor nodes efficiently and extend the network lifetime maximally is one of the primary goals in wireless sensor networks (WSNs). Thus, designing an energy-efficient protocol to optimize the determination of cluster heads (CHs) in WSNs has become increasingly important. In this paper, we propose a novel energy-efficient protocol based on an improved Grey Wolf Optimizer (GWO), which we refer to as Fitness value based Improved GWO (FIGWO). It considers a fitness value to improve the finding of the optimal solution in GWO, which ensures a better distribution of CHs and a more balanced cluster structure. According to the distance to the CHs and the BS, sensor nodes' transmission distance are recalculated to reduce the energy consumption. Simulation results demonstrate that the proposed approach can prolong the stability period of the network in comparison to other algorithms, namely by 31.5% in comparison to SEP, and even by 57.8% when compared with LEACH protocol. The results also show that the proposed protocol performs well over the above comparative protocols in terms of energy consumption and network throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.