• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.3 s.333
• /
• pp.43-50
• /
• 2005

In this paper, quaternary logic gates using Down literal circuit(DLC) has been designed, and then synchronous Quaternary un/down counter using those gates has been proposed The proposed counter consists of T-type quaternary flip flop and 1-of-2 threshold-t MUX, and T-type quaternary flip flop consists of D-type quaternary flip flop and quaternary logic gates(modulo-4 addition gates, Quaternary inverter, identity cell, 1-of-4 MUX). The simulation result of this counter show delay time of 10[ns] and power consumption of 8.48[mW]. Also, assigning the designed counter to MVL(Multiple-valued Logic) circuit, it has advantages of the reduced interconnection and chip area as well as easy expansion of digit.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.9-17
• /
• 2010

The mobility of nodes are different in wireless ad hoc networks. Routes have to be refreshed frequently due to the mobility of the nodes acting as routers. Path consists of a few highly mobile nodes should be avoided to forward packets, because even only one highly mobile node may result in the break of path. We develop a mobility aware method to evaluate path stability for multipath routing in wireless Ad Hoc networks. Specifically, we extend it to a well-studied multipath routing protocol known as ad hoc on-demand multipath distance vector (AOMDV). The resulting protocol is referred to as path stability evaluation (PSE). Performance comparison of AOMDV with PSE are studied through ns-2. Simulation shows that PSE has optimistic results in performance metrics such as packet delivery, end-to-end delay, routing overhead and throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1551-1557
• /
• 2006

Since subscribers, who pay the same communication fees, have a strong desire to take similar services with the other users, it is an important issue to provide fairness among those subscribers wherever they are located. Therefore, in this paper we propose a QoS packet scheduler that can provide fairness among wireless LAN terminals and evaluate its performance using computer simulation. The key idea of this scheduler is to reduce the CW value of the wireless LAN terminal that has failed in sending its packets due to channel transmission error in order to offer the wireless MM terminal a higher transmission priority which is the idea of service compensation. We evaluate its performance using NS-2 network simulator, compare its numerical results to those of IEEE 802.11e without this scheme, and conclude that this scheme can reduce throughput difference between similar wireless LAN terminals.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.774-784
• /
• 2009

A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime. To improve the sensitivity of wireless sensor networks, an efficient scheduling algorithm and energy management technology for minimizing the energy consumption at each node is desired. ill this paper, we propose energy-aware routing mechanism for maximum lifetime and to optimize the solution quality for sensor network maintenance and to relay node from its adjacent cluster heads according to the node"s residual energy and its distance to the base station. Proposed protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of where the sink is located outside or inside the cluster. Simulation results of proposed scheme show that our mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime. To verify propriety using NS-2, proposed scheme constructs sensor networks adapt to current model and evaluate consumption of total energy, energy consumption of cluster head, average energy dissipation over varying network areas with HEED and LEACH-C.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.255-263
• /
• 2009

In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1164-1172
• /
• 2007

To solve scalability problem in the ZigBee Network, this paper presents a new mesh routing protocol for ZigBee, called ZigBee Cluster Label (ZiCL). ZiCL divides the ZigBee network into one or more logical clusters and then assigns a unique Cluster Label to each cluster so that it discovers a route of a destination node based on Cluster Label. When a node collects new Cluster Label information of a destination node according to discovery based on Cluster Label, ZiCL encourages nodes with the same Cluster Label to share the information. Consequen tly, it contributes on reducing numerical potential route discoveries and improving network performances such as routing overhead, end-to-end delay, and packet delivery ratio. Simulation results using NS-2 show ZiCL performs well.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.84-90
• /
• 2006

With the widespread of the wireless Internet and wireless LAN, different wireless technologies such as 3G cellular networks and WLAN will cooperate to support more users and applications with higher data rate over wider areas. When a mobile node moves around in the hybrid networks, it needs to perform seamless vertical handoffs between different wireless networks to provide high performance data transmission. When an application with TCP connection in a mobile node performs a vertical handoff, TCP performance is degraded due to packet losses even though it maintains the previous TCP state information during handoff, because 3G and WLAN have different available bandwidth. In this paper, we propose a new congestion control algorithm for vertical handoff to improve the TCP performance by measuring the rough end-to-end available bandwidth and calculating the slow-start threshold. By ns-2 simulation, we show that the proposed algorithm enhances the TCP performance during vertical handoffs compared to the previous algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.3
• /
• pp.68-74
• /
• 2008

Ethernet is the very successful technology in private local area network. Therefore, we can obtain the advantage to reduce network overhead due to such as protocol translation when to apply Ethernet to the public backbone network. However, in order to do that, it is required to restore the network within 50msec when link failure occurs, in order to provide seamless connections to end users. Currently, ITU-T standardized the automatic protection switching (APS) based Ethernet protection switching system. In this paper, we propose the improved Ethernet protection switching system to minimize the number of Ethernet frames lost when the network is restored from the failure. The proposed mechanism is analyzed by using simulation based on ns-2 and numerical results show that the proposed one provides superior performance.

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

Service discovery protocols is software components to find specific services or resources on network. The SLP defined by IETF protocol is a framework for automatic service discovery on IP based networks. Automatic service discovery is an important component on ubiquitous computing environment. This paper proposes a service discovery architecture named as SLPA(Service Location Protocol based on AMAAM). AMAAM(Mobility Agent Advertisement Mechanism) is an aggregation-based Mobile IP implementation in MANET. In SLPA, the role of the directory agent is assigned to the mobility agent in AMAAM. The mobility agent periodically beacons an advertisement message which contains both the advertisement of the directory agent in SLP and the advertisement of the mobility agent in Mobile IP. For evaluating the functional correctness of SLPA and the overhead of maintaining a service directory of SLPA. We simulate SLPA using ns-2 and analyze the overhead of control overheads for the aggregation. Through the simulation experiments we show the functional correctness of the proposed architecture and analyze the performance results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.25-31
• /
• 2009

In this paper we propose an improved energy aware greedy perimeter stateless routing protocol (EAGPSR) for wireless ad hoc network. The existing greedy perimeter stateless routine (GPSR) has some problems with overloaded node and void situation. The improved EAGPSR protocol is proposed to remedy these problems. It also gives the solution for the fundamental problem in geographical routine called void communication. It considers two parameters (Residual Energy of battery and distance to the destination) for the next hop selection. In order to use efficiently limited-energy of node in wireless ad hoc network, network lifetime is focused. To evaluate the performance of our protocol we simulated EAGPSR in ns-2. The simulation results show that the proposed protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR) and the existing Energy aware greedy perimeter stateless routing protocol (EAGPSR).