• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.733-739
• /
• 2011

Recently, a lots of research proposals and results on mobile sensor network are actively announced. The most of such works are based on general-purposed network simulators such as ns-2, mathlab, etc. But, It is not easy to model and simulate the detail activities of each sensor node, data deliveries between them, and its cost such as power consumption and resource utilization, so that the simulation results of those simulators show the limited aspects of overall networks features or performance metrics. In this paper proposed, power consumption of each node, performance, mobility, and location information in operation-level of the network that can simulate a wireless sensor network simulator platform. Because the network routing algorithm analysis of being developed in an existing becomes available, the proposed simulator can usability in the new network routing algorithm development.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.241-244
• /
• 2012

In mobile ad-hoc networks, it should be the most important issue to reduce the power consumption of communications, because the resource of a node is limited in these networks. In existing cluster-based routing protocols, cluster headers participate in almost all communication processes. Therefore the lifetime of the cluster header is shortened and it does not have the effective route. In the proposed cluster-based routing protocol, the cluster header transmits a control packet which gives the route information to member nodes. This makes that the cluster header decreases the number of participating in communications, and that node members do not have to communicate trough the cluster header. This results in extending the lifetime of the cluster header, and having the effective route, data transmission rate and improved stability of routes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1429-1432
• /
• 2004

MANET(Mobile Ad Hoc Network)이란 어떠한 기반 구조나 중앙의 관리없이 동적으로 임시 네트워크를 형성하는 무선 mobile node의 집합이다. 이 논문에서는 MANET에서 근원지 node가 목적지 node로의 route를 발견하기 위해 전체 네트워크를 대상으로 route request 패킷을 flooding 할 경우 결과적으로 네트워크의 성능을 저하시킨다는 점과 mobile node가 제한된 양의 power를 가지고 있다는 점에 초점을 맞추어 연구가 진행되었다. 다시 말해 이 논문에서 제안된 ZTPA 라우팅 프로토콜은 기존의 ZRP를 기본으로 서로 겹치지 않는 격자 모양의 zone으로 네트워크가 구성된다. 또한 proactive 라우팅이 이루어지는 IARP에서 route 설정시 현재 node에 남아있는 power를 고려한 CMMBCR 라우팅 프로토콜이 사용되며 이와 더불어 두 개의 임계치(SVSZ, FVSZ)를 사용함으로써 설정된 route의 수명을 연장하고 신뢰성 있는 데이터 전송이 가능하여 전체적인 네트워크의 성능 향상을 야기할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.42-50
• /
• 2008

Unlike a cellular network, a mobile ad hoc network(MANET) is constructed only by mobile nodes without access point. Mobile nodes in MANET operate with scarce resources and restricted battery. If battery of intermediate node is exhausted, overall network might be diverged. Therefore, power-aware is really important. An on-demand multipath routing protocol which is proposed to compensate for shortcoming of on-demand single path routing protocol can reduce mute discovery overhead because route discovery starts only when all routes are disconnected. AOMDV(Ad hoc On-demand Multipath Distance Vector) which is on-demand multipath routing protocol based on AODV, reduces 40% of route discovery frequency. However, AOMDV have none of power-aware. So AOMDV have problem that route discovery for power exhaustion is not reduced at all. This paper proposes new power-aware path selection algorithm for AOMDV and scheme that broadcast REER packets when mobile node's battery can be gone. Performance comparison of proposed algorithm with AOMDV using ns-2 simulator shows that route discovery of proposed algorithm is reduced maximally 36.57% than AOMDV's.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.1-6
• /
• 2017

Recent researches on radio frequency energy harvesting networks(RF-EHNs) with limited energy resource like battery have been focusing on the development of a new scheme that can effectively extend the whole lifetime of a network to semipermanent. In order for considerable increase both in the amount of energy obtained from radio frequency energy harvesting and its charging effectiveness, it is very important to design a network that supports energy harvesting and data transfer simultaneously with the full consideration of various characteristics affecting the performance of a RF-EHN. In this paper, we proposes an interference-based charging aware routing protocol(ICARP) that utilizes interference information and charging time to maximize the amount of energy harvesting and to minimize the end-to-end delay from a source to the given destination node. To accomplish the research objectives, this paper gives a design of ICARP adopting new network metrics such as interference information and charging time to minimize end-to-end delay in energy harvesting wireless networks. The proposed method enables a RF-EHN to reduce the number of packet losses and retransmissions significantly for better energy consumption. Finally, simulation results show that the network performance in the aspects of packet transmission rate and end-to-end delay has enhanced with the comparison of existing routing protocols.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.8
• /
• pp.23-32
• /
• 1998

In this paper, we propose a memory compiler to genrate embedded RAMs and ROMs for ASIC chips. We design the leaf cells to be compsoed of memory blocks. The compiler is built using tile-based method to simplify routing. The compiler can genrate any memory layouts to satisfy 64 to 4096 words and 4 to 256 bits per word. The technology we used here is 0.8.mu.m single poly double metal CMOS process. The address access time and power consumption are verifie dthrough the HSPICE simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.69-76
• /
• 2010

We describe an all-optical circuit which recognizes the header information of packet-by-packet in the access networks based on FTTH. The circuit's operation is confirmed by an experiment in the recognition of 3 and 4 header bits. The output from the header recognition circuit appears in a signal assigned in the time axis according to the header information. The recognition circuit of header for self-routing has a very simple structure using only delay lines and switches. The circuit is expected that it can be constructed of the high reliability and the low cost. Also, the circuit can solve the problems of the power loss and private security which is the weak point of the TDM-PON method by being established a unique transmission line to each subscriber.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.61-69
• /
• 2009

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

• Convergence Security Journal
• /
• v.14 no.2
• /
• pp.43-50
• /
• 2014

Recently, lot of researches for the multi-level protocol have been done to balance the sensor node energy consumption of WSN and improve the node efficiency to extend the life of the entire network. Especially in multi-hop protocol, a variety of models have been proposed to improve energy efficiency and apply it to WSN protocol. In this paper, we analyze LEACH algorithm and propose new method based on center of local clustering routing algorithm in wireless sensor networks. We also perform NS-2 simulation to show the performance of our model.