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

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.99-108
• /
• 2010

The Wireless Ad Hoc network is discussed as a core technology for ubiquitous computing, and the smart tag technology is currently being actively discussed as a part of the sensor network. Thus, considering its security may advance the realization of ubiquitous computing. RFID (Radio Frequency Identification) technology using the smart tag technology as a part of the sensor network is currently in the limelight. In particular, when RFID is applied to a knowledge management system managing various data, data mobility and management convenience are ensured and automated knowledge service can be provided to users. Accordingly, this paper to proposed a secure scheme for mobility knowledge management systems using multi-agents differentiated from the existing knowledge management systems. Specifically, the proposed scheme designates user's authentication and privilege information in multi-agents and provides effective knowledge service through grouping based on user information. Moreover, even user's movement, the proposed scheme ensures service availability and provides continuous information through communication with multi-agent systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.844-851
• /
• 2004

Various types of error are caused due to many factors of various environment in air interface channel of wireless communications. In this case, the reliability of the channel is much lower than that of wired case. IEEE 802.15.3 high-rate WPAN, which operates in an ad hoc networking environment, is more susceptible to such errors. The problem has been investigated for wireless LANs, for example, as follows. If the queue size of a certain node is longer than that of other nodes, the node estimates that its channel state is bad and the resource of the node is decreased. However this method has a disadvantage that a central controller must always monitor the status. To avoid this disadvantage, in this paper, a new MAC protocol that the throughput of overall piconet is increased by LDS (Link-status Dependent Scheduling) is proposed.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.216-225
• /
• 2004

In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.91-94
• /
• 2006

In this paper, we deployed the tunnel inspection and monitoring system by wireless sensor network. It is shown that the wireless sensor network which is composed of sensor, wireless communication module, and gateway system can be applied to tunnel monitoring system. Sensors included herein are acceleration transducers, fire-alarm sensors, water-level sensors, and magnetic contact sensors. It is also found that the wireless sensor network can deliver sensing data reliably by ad-hoc networking technology. The gateway system that can send the sensing data to server by CDMA (code division multiple access) is developed. Finally, monitoring system is constructed by web service technology, and it is observed that this system can monitor the present state of tunnel without difficulties. Furthermore, the above system provides an alternative to inspect and monitor the tunnel efficiently where the conventional wired system cannot be applied.

• Information and Communications Magazine
• /
• v.20 no.5
• /
• pp.645-656
• /
• 2003

최근에 정보 산업과 이동 통신 기술이 발전함에 따라 퍼스널 컴퓨터를 넘어 컴퓨터의 개념이 매우 빠르게 확장되고 있다. 이동 정보 단말 형태의 PDA, HPC(hand-held PC), 휴대폰 등이 개발되었고, 셋탑박스(set-top box), 지능형 디지털 TV, 인터넷 냉장고 등의 정보가전은 임베디드 운영체제(embedded OS)를 내장하여 컴퓨터로 발전하고 있으며, 제어 및 계측 기기들도 마이크로 프로세서를 내장하여 임베디드 시스템으로 발전하고 있다. 이렇게 새롭게 확장된 컴퓨터 시스템들은 인간 생활의 편리성과 다양성을 위해 상호 연결되어 하나의 네트워크를 형성하고 있으며, 상호간에 정보를 공유하고 협력하여 언제 어디서나 통신 및 컴퓨팅이 가능한 유비쿼터스 네트워킹(Ubiquitous Networking)으로 발전하고 있다. 본 논문에서는 이러한 유비쿼터스 네트워킹에서 필요한 컴퓨팅 미들웨어(Middleware) 기술의 최근 동향을 살펴보고 본 연구에서 제안하는 새로운 미들웨어 기술을 설계한다. 이러한 미들웨어 기술은 편재(遍在)되어 있는 컴퓨팅 장치를 상호 이용하기 위해 컴퓨터의 환경을 탐지하여 저장하고 재이용하는 상황 인식 기술, 편재된 장치들이 네트워크에 연결되면서 정보를 전달하는 Ad-hoc 네트워킹과 동적 라우팅 기술, 그리고 정보 전달을 위해 제어 코드와 데이터를 패킷 (packet) 형태로 전달하는 협력 메시지(Cooperative Message) 기술 등이 포함된다.