• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1305-1313
• /
• 2010

Last few years, wireless personal area network (WPAN) has been widely researched for various healthcare applications. Due to restriction of device hardware (e.g., energy and memory), we need to design a highly-versatile MAC layer protocol for WBAN (Wireless Body Area Network). In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. This paper presents a priority mechanism referred to as hybrid priority MAC for WBAN. Through extensive simulation, we show the proposed MAC protocol can minimize the average packet latency for urgent data. Thus, when patients have an emergency situation, our MAC allows adequate assistance time and medical treatment for patients. The simulation based on NS-2 shows that our Hybrid Priority MAC has the good performance and usability.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.110-113
• /
• 1999

In this paper. we propose an adaptive handover scheme in wireless network The proposed handover scheme is a hybrid type of virtual path extension and rerouting. The proposed handover scheme chooses the virtual path management scheme according to the service QoS instead of the network topology which is used in the previous hybrid handover schemes. The proposed scheme supports the seamless service and small buffering during virtual path rerouting handover through the multicasting service. To evaluate the performance of the proposed scheme. we compute the number of signaling message used for handover and perform computer simulation. The simulation results show that the proposed scheme provides more efficiency in the handover delay and seamless service than the previous methods.

• Journal of IKEEE
• /
• v.16 no.3
• /
• pp.235-243
• /
• 2012

In this study, we developed two legged multi-joint robot by using wireless servo motor that was applied by wireless sensor network technology, which is widely used recently, and performed an experiment of walking method of two legged multi-joint robot. We constructed the star network with servo motors which were used at each joint of two-legged robot. And we designed the robot for operation by transmission of joint control signal from main control system or by transmission of the status of each joint to the main control system, so it operates with continuously checking the status of joints at same time. We developed the humanoid robot by using wireless digital servo motor which is different from existing servo motor control system, and controlled it by transmitting the information of angles and speeds of robot joints to the motor(node) as a feedback through main control system after connecting power and setting up the IDs to each joint. We solved noisy problem generated from wire and wire length to connection point of the control device by construction of the wireless network instead of using existing control method of wiring, and also solved problem of poor real time response to gait motion by controlling the position with continuous transmission of control signals to each joint. And we found that the effective control of robot is able by performing the simulation on walking motion in advance with the developed control algorithm which was downloaded into installed memory. Also we performed the stable walking with two-legged robot by attaching pressure sensor to robot sole. And we examined the robot gait operated by application of calculated algorithm on robot movement to each joint. In this study, we studied the method of controlling robot gait motion by using wireless servo motors and measured the torque applied to each joint, and found that the developed wireless servo motor by ZigBee sensor network offers easier control of two legged robot gait and better circuit configuration of it than the existing wired control system could do.

• Journal of Multimedia Information System
• /
• v.6 no.2
• /
• pp.61-66
• /
• 2019

VANET (Vehicular Ad-hoc Network) is a mobile Ad-hoc Network which deals with the moving vehicles. VANET supports Intelligent Transport Systems (ITS) which is related to different modes of transport and traffic management techniques. VANETs enabled users to be informed and make them safer. VANET uses IEEE 802.11p standard wireless access protocol for communication. An important and necessary issue of VANET is to design routing protocols. In a network, communication takes place by the use of the routing protocols. There are mainly two types of communications used such as Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) in VANET. Vehicles can send and receive messages among them and also to and from infrastructure used. In this paper, AODV, DSR and DSDV are compared by analysing the results of simulation on various metrics such as average throughput, instant throughput, packet delivery ratio and residual energy. Findings indicates utilization of AODV and DSR is more applicable for these metrics as compared to DSDV. A network simulator (NS2) is used for simulation.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In the wireless network, TCP performs poorly because it was originally designed for wired networks and does not take into consideration wireless characteristics such as mobility, high-loss probability, and hidden-terminal problems. In particular, in the wireless multi-hop networks, a large congestion window increases the probability of contention and packet losses, and TCP performance is degraded severely as a result. So, it is necessary to limit the TCP congestion window size in order keep the probability of contention loss in the system to a minimum. In this paper, we propose a new scheme for determining the maximum congestion window size based on the measured bandwidth and Round-Trip-Time (RTT). Using ns-2 simulation, we show that the proposed scheme reduces the probability of packet contention and improves TCP performance.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.433-435
• /
• 2007

Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.

• Journal of the Semiconductor & Display Technology
• /
• v.7 no.1
• /
• pp.23-27
• /
• 2008

Wireless sensor networks are emerging as a solution for a wide range of data gathering applications. The most difficult challenge for the design of sensor nodes is the need for significant reductions in energy consumption. The threshold methods which filter redundant and similar data can be used to save energy. In this paper, we propose the adaptive threshold method to effectively manage the energy in wireless sensor nodes. In the adaptive threshold method, wireless sensor nodes can change the thresholds dynamically as the sensing environments vary. The simulation results show that the adaptive threshold method works very effectively even when we experience the significant volatility in the data. This scheme can be used in order to monitor the malfunction in the equipment of semiconductor manufacturing line.

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

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

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

Energy efficiency in wireless sensor network is a principal issue because wireless sensor network uses limited energy. In wireless sensor network, because nodes are placed randomly, they may be concentrated in certain area. This dense area causes shortening the life of the concentrated area, and furthermore reducing the life of the entire network. In this paper, we suggest a additional cluster head selection algorithm for reducing the overload of head node in dense area and shows simulation result using our algorithm with LEACH algorithm.