• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.137-148
• /
• 2012

In this paper, we proposed the location-aware coordinate routing algorithm for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. The x, y and z coordinate axes from divided address space of 16 bit to solve this problems. However, coordinate routing does not take account of wireless link condition. If wiress link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose the location-aware coordinate routing algorithm considering wiress link condition, where reliable data transmission is made and the consumed enegy is minimize. and we compared and connected region and transition region of ZigBee location based routing in the aspect of average number of multi hops, subordinate packet delivery ratio, delay time, and energy consumption of proposed algorithm. It turned out that there were improvements in performances of each items.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.17-25
• /
• 2011

A convergecast is a popular routing scheme in wireless sensor networks (WSNs) in which every sensor node periodically forwards measured data along configured routing paths to a base station (BS). Prolonging lifetimes in energy-limited WSNs is an important issue because the lifetime of a WSN influences on its quality and price. Low-energy adaptive clustering hierarchy (LEACH) was the first attempt at solving this lifetime problem in convergecast WSNs, and it was followed by other solutions including power efficient gathering in sensor information systems (PEGASIS) and power efficient data gathering and aggregation protocol (PEDAP). Our solution-chain routing with even energy consumption (CREEC)-solves this problem by achieving longer average lifetimes using two strategies: i) Maximizing the fairness of energy distribution at every sensor node and ii) running a feedback mechanism that utilizes a preliminary simulation of energy consumption to save energy for depleted Sensor nodes. Simulation results confirm that CREEC outperforms all previous solutions such as LEACH, PEGASIS, PEDAP, and PEDAP-power aware (PA) with respect to the first node death and the average lifetime. CREEC performs very well at all WSN sizes, BS distances and battery capacities with an increased convergecast delay.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.349-352
• /
• 2004

In this paper, we propose a newly energy-efficient routing protocol, which is called Maximum Utility Routing(MUR), in mobile ad hoc networks (MANETs) so as to investigate the minimum energy and maximum lifetimes issues together. We present a utility-based framework so as to meet various incompatible constraints simultaneously and fairly. To explore this issue, we use the concepts and mathematics of microeconomics and game theory. Though simulation results, we show that our routing scheme has much better performance especially in terms of network efficiency, network lifetime, and average power consumption.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.519-531
• /
• 2004

Ad-hoc networks are temporary wireless systems composed of mobile nodes without any fixed infrastructure. The life time of each node in the ad-hoc network significantly affects the life time of whole ad-hoc network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all mobile nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Power-Aware Dynamic Source Routing (PADSR) which selects the best path to make the life time of the network be longer. In PADSR, when a source node finds a path to the destination node, it selects the best path that makes nodes in the network live evenly long. To find the best path, PADSR considers the consumption of transmission energy and residual battery capacity of nodes upon the path. Consequently the network lives longer if we use PADSR.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.371-378
• /
• 2010

In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and uniform energy consumption by nodes. The pair distribution of the energy consumption over all the possible routes to the base station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.1-3
• /
• 2006

최근 정보통신 기술의 발전은 유비쿼터스 컴퓨팅이라는 새로운 정보통신 혁명을 야기하게 되었고, 그로 인해 무선 센서 네트워크의 필요성이 제기되고 있다. 빛, 온도, 습도와 같은 물리적인 정보 수집을 목적으로 가지는 센서 네트워크에서의 라우팅 프로토콜은 기존의 라우팅 프로토콜과는 다른 제약 사항 및 요구 사항을 갖는다. 본 논문에서는 무선 센서 네트워크 환경을 고려한 새로운 라우팅 프로토콜로 Energy-aware Surge 라우팅 프로토콜을 제안 및 구현하였다. Energy-aware Surge 프로토콜은 배터리 리소스에 제약을 갖는 센서 네트워크의 환경을 고려하여, 기존 라우팅 프로토콜과 다르게 센서 노드의 잔여 에너지를 기반으로 계층적인 경로를 설정하게 된다. 성능 검증을 위해 기존 Surge 라우팅 프로토콜을 수정하여 Energy-aware Surge 프로토콜을 구현하였으며, 상용 센서 플랫폼인 MICAz를 이용하여 성능실험을 수행하였다. 성능 실험 및 시뮬레이션 결과를 통해, 제안하는 Energy-aware Surge 라우팅 프로토콜이 무선 센서 노드의 잔여 에너지를 고려하여 패킷의 전달 경로를 적절하게 선택하며, 이를 통해 무선 센서 네트워크의 전체 라이프타임을 효과적으로 증가시키는 것을 확인할 수 있었다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.225-234
• /
• 2012

In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.262-268
• /
• 2007

The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1296-1306
• /
• 2015

Nowadays the research of energy saving on the IP networks have been studied the various methods in many research institutes. This paper suggests the energy saving method in IP networks which have the various energy profiles, and analyzes its energy saving characteristics in detail. Especially this paper proposes the energy profile based OSPF routing method which have the selectable weighted value in OSPF metric and energy consumption in IP network. This paper analyzes the energy saving effects of the various situations to minimize the energy consumption using the various weighted value on the proposed scheme. The results show that the energy saving efficiency can get about 67% at in ingress input load ${\rho}=0.5$ by using random energy profiles in IP networks. Although the number of hops is a slight increased due to routing the paths for the minimum energy consumption in the algorithm of this method, the increment hop number is limited the mean 1.4 hops. This paper confirms that the energy profile of core router has the large effects of energy saving than the energy profile of edge router, and the proposed method has the excellent energy saving characteristics in IP networks.