• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.227-238
• /
• 2012

In this paper, we propose a practical time-division half-duplex Estimate and Forward (EF) relaying protocol. The conventional EF relaying protocol works well only when the relay node is near the destination node. The proposed EF relaying protocol, however, determines adaptively relay parameters such as the quantization level of relay node and the power allocation between source and relay nodes according to the channel conditions. By doing so, the proposed EF relaying protocol provides low probability of bit error even when the relay node is far from the destination node. Consequently, the proposed EF protocol is suitable for the mobile relay systems. It is shown by simulations that the proposed EF relaying protocol shows lower bit error rate for all relay positions than a conventional EF protocol.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.423-434
• /
• 2007

Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

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

Vehicle-to-Vehicle (V2V) is a special type of vehicle ad-hoc network (VANET), and known as a solution to provide communication among vehicles and reduce vehicle accidents. Geographical routing protocols as Greedy Perimeter Sateless Routing (GPSR) are very suitable for the V2V communication due to special characters of highway and device for vehicles. However, the GPSR has problem that appears local maximum by some stale neighbor nodes in the greedy mode of the GPSR. It can lose transmission data in recovery mode, even if the problem is can be solved by the recovery mode of the GPSR. We therefore propose a Greedy Perimeter Reliable Routing (GPRR), can provide more reliable data transmission, to resolve the GPSR problem in the V2V environment. Simulation results using ns-2 shown that the GPRR reveals much better performance than the GPSR by remarkably reducing the local maximum rate in the greedy mode.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.731-740
• /
• 2012

To offer indoor location-aware services, the needs for efficient and accurate indoor localization system has been increased. In order to meet these requirement, we presented the BLIDx(Bidirectional Location ID exchange) protocol that is efficient localization system based on sensor network. The BLIDx protocol can cope with numerous mobile nodes simultaneously but the precision of the localization is too coarse because that uses cell based localization method. In this paper, in order to compensate for these disadvantage, we propose the fingerprint overlapping method by modifying a fingerprinting methods in WLAN, and localization system using proposed method was designed and implemented. Our experiments show that the proposed method is more accurate and robust to noise than fingerprinting method in WLAN. In this way, it was improved that low location precision of BLIDx protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.7
• /
• pp.404-412
• /
• 2014

Exploiting multiple antennas at mobile devices is difficult due to limited size and power. In this paper, a distributed MIMO protocol achieving the capacity of conventinal MIMO systems is proposed and analyzed. For exploiting distributed MIMO features, Quantize-Map-and-Forward (QMF) scheme shows improved performance than Amplify-and-Forward (AF) scheme. Also, the protocol based on multiple access channel (MAC) is proposed to improve the multiplexing gain. We showed that sufficient condition of the number of slave nodes to achieve the gain of a MAC based protocol. Because the base station can support multiple clusters operating in distributed MIMO, the total cellular capacity can be extremely enhanced in proportional to the number of clusters.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.504-513
• /
• 2013

Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.3
• /
• pp.5-12
• /
• 2010

A novel algorithm which computes the orientations and the locations of mobile robots with repeating feature of ceiling textures is proposed. For orientation computation, the relative angle between a strait line on a ceiling image and the center line of the robot is firstly computed. The relative angle is added to the global reference angles of straight lines of the ceiling and a group of robot orientation candidates is composed. The robot orientation is determined from such orientation candidate group by choosing the closest one to the previous robot orientation. Similarly, the location of the robot is determined from the robot location candidate group by choosing the closest one to the previous robot location, where robot location candidate group is composed by adding the relative location of the robot to global locations of neighboring nodes of the previous robot locations. The experiment has been done to test the accuracy of the algorithm in computing locations and orientations.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.40-48
• /
• 2007

MANET constructs a network that is free and independent between sensor nodes without infrastructure. Also, there are a lot of difficulties to manage data process, control etc.. back efficiently from change of topology by transfer of sensor node that compose network. Especially, because each sensor node must consider mobility certainly, problem about energy use happens. To solve these problem, mechanisms that compose cluster of cluster header and hierarchic structure between member were suggested. However, accompanies inefficient energy consumption because sensing power level of sensor node is fixed and brings energy imbalance of sensor network and shortening of survival time. In this paper, I suggested intelligent clustering mechanism for efficient energy management to solve these problem of existent Clustering mechanism. Proposed mechanism corresponds fast in network topology change by transfer of sensor node, and compares in existent mechanism in circumstance that require serial sensing and brings elevation survival time of sensor node.Please put the abstract of paper here.