• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.888-908
• /
• 2011

The increasing demand from passengers in vehicles to improve safety, traffic efficiency, and comfort has lead to the growing interest of Wi-Fi based vehicle-to-infrastructure (V2I) communications. Although the V2I system provides fast and cost-effective Internet connectivity to vehicles via roadside Wi-Fi access points (APs), it suffers from frequent handoffs due to the high mobility of vehicles and the limited coverage of Wi-Fi APs. Recently, the Mobile AP (MAP) platform has emerged as a promising solution that overcomes the problem in the V2I systems. The main advantage is that MAPs may yield longer service duration to the nearby vehicles that have similar mobility patterns, yet they provide smaller link capacities than the roadside APs. In this paper, we present a new association control technique that harnesses available connection duration as well as achievable link bandwidth in high-speed vehicular network environments. We also analyze the tradeoff between two association metrics, namely, available connection duration and achievable link bandwidth. Extensive simulation studies based on real traces demonstrate that our scheme significantly outperforms the previous methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.1-9
• /
• 2004

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.3 s.246
• /
• pp.287-294
• /
• 2006

In recent years, capsule endoscope is highlighted for the patient's convenience and the possibility of the application in the small intestine. However, the capsule endoscope has some limitations to get the image of the digestive organ because its movement only depends on the peristaltic motion. In order to solve these problems, locomotion of capsule endoscope is necessary. In this paper, we analyze the locomotive mechanism of earthworm-like robot proposed as locomotive device of capsule endoscope and derive the condition which can Judge the possibility of its mobility using theoretical analysis. Based on a biomechanical modeling and simulation, the critical stroke, that is minimum stroke of the earthworm-like robot to perform motion inside small intestine, is obtained. Also, this derived critical stroke can be validated by the moving test of fabricated earthworm-like robot. Consequently, it is expected that this study can supply useful information to design of earthworm-like robot for mobility of capsule endoscope.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.4
• /
• pp.279-290
• /
• 2013

In this paper, we propose a transmission scheme of MAC protocol that enables secure voice communications by exploiting the wide spectrum and low signal strength characteristics of the ultra wide band technology. In addition, it also supports high level of terminal mobility by deploying mobile ad hoc network schemes. While most of existing UWB MAC protocols are operated as a synchronous mode, the proposed scheme operates in an asynchronous mode for supporting high mobility and sends voice packets without RTS/CTS control packets for efficient voice traffic transmission without retransmission. With simulation program, we prove that the proposed scheme satisfies the required voice quality and packet delivery time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.5
• /
• pp.253-264
• /
• 2008

Cyclic delay diversity (CDD) is considered a simple approach to exploit the frequency diversity, to improve the system performance in orthogonal frequency division multiplexing (OFDM) systems. Also, the linear precoding technique can significantly improve the performance of communication systems by exploiting the channel state information (CSI). In order to achieve enhanced performance, we propose applying linear precoding to the conventional CDD-OFDM transmit diversity schemes over Rayleigh fading channels. The proposed scheme works effectively with the accurate CSI in time-division-duplex (TDD) OFDM systems with CDD, where the reciprocity is assumed instead of channel state feedback. For a BER of $10^{-4}$ and the mobility of 3 km/h, simulation results show that a gain of 6 dB is achieved by the proposed scheme over both flat fading and Pedestrian A (Ped A) channels, compared to the conventional CDD-OFDM system. On the other hand, for a mobility of 120 km/h, a gain of 2.7 dB and 3.8 dB is achieved in flat fading and Vehicular A (Veh A) channels, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1388-1403
• /
• 2011

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2101-2119
• /
• 2013

The spectrum allocation is an attractive issue for mobile cognitive radio (CR) network. However, the time-varying characteristic of the spectrum allocation is not fully investigated. Thus, this paper originally deduces the probabilities of spectrum availability and interference constrain in theory under the mobile environment. Then, we propose a prediction mechanism of the time-varying available spectrum lists and the dynamic interference topologies. By considering the node mobility and primary users' (PUs') activity, the mechanism is capable of overcoming the static shortcomings of traditional model. Based on the mechanism, two prediction-based spectrum allocation algorithms, prediction greedy algorithm (PGA) and prediction fairness algorithm (PFA), are presented to enhance the spectrum utilization and improve the fairness. Moreover, new utility functions are redefined to measure the effectiveness of different schemes in the mobile CR network. Simulation results show that PGA gets more average effective spectrums than the traditional schemes, when the mean idle time of PUs is high. And PFA could achieve good system fairness performance, especially when the speeds of cognitive nodes are high.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.703-709
• /
• 2009

Recently, we are using wireless system based on ZigBee technology. It solves a complicated space and frequency movement. Then, we had studied it for improved performance. So, we are must concerned about routing protocol for improvement of a weak point of physical feature. But many researchers are not focusiong on developing Routing Protocol. In this paper, we proposed improved routing protocol using AODV for wireless system based on ZigBee technology. And it is analyzed the simulation result which compare with original and improved AODV protocol based on ZigBee network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.87-97
• /
• 2009

A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.