• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.911-923
• /
• 2010

In wireless sensor networks (WSNs), cluster based data routing protocols have the advantages of reducing energy consumption and link maintenance cost. Unfortunately, most of clustering protocols have been designed for uniformly distributed sensor networks. However, some urgent situations do not allow thousands of sensor nodes being deployed uniformly. For example, air vehicles or balloons may take the responsibility for deploying sensor nodes hence leading a normally distributed topology. In order to improve energy efficiency in such sensor networks, in this paper, we propose a new cluster formation algorithm named DAEEC (Density Aware Energy-Efficient Clustering). In this algorithm, we define two kinds of clusters: Low Density (LD) clusters and High Density (HD) clusters. They are determined by the number of nodes participated in one cluster. During the data routing period, the HD clusters help the neighbor LD clusters to forward the sensed data to the central base station. Thus, DAEEC can distribute the energy dissipation evenly among all sensor nodes by considering the deployment density to improve network lifetime and average energy savings. Moreover, because the HD clusters are densely deployed they can work in a manner of our former algorithm EEVAR (Energy Efficient Variable Area Routing Protocol) to save energy. According to the performance analysis result, DAEEC outperforms the conventional data routing schemes in terms of energy consumption and network lifetime.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.13-14
• /
• 2007

We propose HERAH(Hierarchical Energy-Aware Routing Algorithm for Heterogeneous Wireless Sensor Networks) that is the hierarchical routing algorithm in WSNs and is established on heterogeneous environment. HERAH performs CH selection by considering residual energy level and uses multi-hop communication within cluster. So, HERAH makes improvements in the energy savings and the network lifetime compared with LEACH.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.564-567
• /
• 2007

애드혹 네트워크는 무선 모바일 기기들만으로 구성 가능한 네트워크로서 무선 모바일기기의 특성상 제한된 에너지를 사용하게 된다. On-Demand 방식의 DSR(Dynamic Source Routing), PSR(Power-aware Source Routing)은 애드 혹 네트워크의 특성에 적합한 라우팅 프로토콜로 경로 탐색 시 브로드 캐스팅을 통해 단말기의 이동성과 전력 보유량을 고려하여 경로를 설정한다. 이러한 경로 탐색 기법은 네트워크를 구성하는 노드 수에 비례하여 경로 탐색시 소모되는 에너지 오버헤드가 증가하므로 대량의 노드들로 이루어진 애드혹 네트워크에서는 상당한 에너지 낭비를 초래한다. HPSR(Hierarchical Power-aware Source Routing)은 이러한 경로 탐색 오버헤드 문제를 보조경로를 이용해 감소 시켰지만, 초기 주 경로가 결정되는 시간에 보조경로 역시 동시에 결정 되는 특성을 가지고 있어, 경로를 이루는 노드의 에너지 정보가 시간적으로 낙후되고 실제 사용 시에는 에너지 효율이 낮은 경로가 되는 문제점이 발생한다. 본 논문에서는 노드들의 최신 에너지 정보로 부분 경로 설정을 함으로써 경로 탐색 오버헤드를 감소시킴과 동시에 변경된 경로의 에너지 효율도 최적화 시킬 수 있는 기법을 제안 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.536-549
• /
• 2012

An ad hoc network consists of nodes with limited energy. Therefore, the data transmission can fail abruptly due to lack of energy of transmitting node. A previous work PAMP proposed to build multiple low-energy paths to support stable packet delivery exploiting the nodes with low energy. It has energy-reservation scheme and multi-path selection scheme for stationary wireless ad hoc networks. In this paper, we propose an extended version of PAMP by incorporating network coding opportunity in path selection process. The simulation results show that our proposed scheme shows better packet delivery ratio and lower energy consumption compared with PAMP and a legacy energy-aware multipath routing protocol REAR.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.35-35
• /
• 2004

• The Journal of the Korea Contents Association
• /
• v.7 no.9
• /
• pp.100-107
• /
• 2007

This paper proposes and efficient routing scheme named MP-DD(MultiPath-Direct Diffusion) which are simple enough to be applicable to the wireless sensor networks. Conventional DD(Direct Diffusion) uses only one optimal path, therefore it consumes more energy of specific nodes. MP-DD uses multiple path and has a information of hop upstream node in the direction of the base-station. Simulation results show that the proposed scheme can increase network survivability compared to conventional DD and EAR(Energy Aware Routing) schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.165-173
• /
• 2011

In Mobile Ad-hoc Network(MANET), mobile nodes are operated by limited batteries. Therefore, it is very important to consume the battery power efficiently to prevent termination of the network. In this paper, we propose Energy-aware Dynamic Source Routing(EDSR) which is based on the Dynamic Source Routing(DSR) to increase the packet transmission and lifetime of the network. If the battery power of a node reaches threshold level, then the node gives up the function of relaying to save battery power except as a source and a destination node. While the conventional DSR doesn't consider the battery consumptions of the nodes, EDSR blocks the nodes from relaying whose battery powers are below the threshold level. Simulation results show the proposed EDSR is more efficient in packet transmission and network lifetime through the balanced battery consumption of the mobile nodes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.9-21
• /
• 2016

Nowadays various methods for energy saving have been studied in IP networks. This paper suggests a 2-phase OSPF routing method for energy saving on IP networks having various energy profiles and analyzes its characteristics. The phase-1 of the routing is an OSPF routing method considering the energy cost of devices besides existing metrics to minimize energy consumption. In the phase-2 of the routing, it makes core nodes go into sleep sate for energy saving and reroutes the paths affected by sleeping core nodes. At this time, we confirm that the characteristics of mean delay and energy efficiency can be satisfied by limiting an allowable hop number in the reroute paths, and utilization rate of nodes and links for assuring energy saving and network-level QoS. Since the efficiency of energy saving and delay characteristics differ according to selection methods of core nodes to go into sleep state, it is that the a method of core node selection based on MP(minimum_path) is more excellent than others in terms of network-level QoS and energy saving in IP networks.