• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1593-1608
• /
• 2009

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.48-58
• /
• 2009

Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.280-291
• /
• 2001

LL (Leased Line service) is a facility-based service as a traditional business data service, but new competition services, such as FR (Frame Relay), VPN (Virtual Private Network), and ATM (Asynchronous Transfer Mode), are value-added services. Because of different service classifications, it is hard to gather necessary data for the service providers to plan their market strategies and regulations and policies are also applied asymmetrically to each service provider. Therefore an appropriate market classification is required for the business data services. After various methods of market classification are reviewed, the Hendry model is selected in this paper to analyze substitution-degree among brands or among services. Since the structure of virtual competitions is required for the Hendry model to be applied to data service market, the market is analyzed first by the well-known Porter's model. By the analysis of Porter's model, two virtual competition structures are set up - one is for the competitions among leased line service providers, and the other is for the competitions among business data services such as LL, FR, VPN and ATM. After the Hendry model is applied to each competition structure, it is confirmed that 7 LL service providers do not compete directly, but 2 sub-markets exist for the LL service provisions. However, it is shown that 4 business data services compete directly. Using the Switching Probability Matrix from Hendry model, future market shares of LL service providers and market shares of business data services are forecasted. These empirical results are helpful for service providers to set competitive strategies with the minimization of cannibalization effect and they can easily and efficiently predict their market demands.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.574-580
• /
• 2016

In this paper, we will introduce the system that can control multiple vehicles on the road through Single Board Computers and V2I (Vehicle-To-Infrastructure). Also, we will propose the group evasive maneuver decision algorithm, which plays a critical role in deciding whether the vehicles in the system have to conduct evasive maneuvers to avoid obstacles on the road. In order to test this system, we have utilized Wi-Fi and TCP/IP for establishing the communication between multiple vehicles and the relay server, and observed their driving states on the road with obstacles. During the experiments, we have discovered that our original decision algorithm possesses high failure rate when there is frequency interference in ISM (Industrial Scientific Medical) band. In order to reduce this failure rate, we have implemented the data transition detector. This paper will focus on how the use of data transition detector can affect the reliability of the system under the frequency interference of ISM band. If this technology is improved and applied in the field, we will effectively deal with such dangerous situations as multiple collision accidents through vehicle-to-vehicle communication or vehicle-to-infrastructure communication. Furthermore, this can be applied to the autonomous driving technologies. This can be used as the reference data for the development of the similar system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1170-1181
• /
• 2012

Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.333-341
• /
• 2002

This article is written to make a foundation for effective radio network engineering by enabling the accurate traffic assumption between Base Station (BTS : Base Station Transceiver Subsystem) md Repeater through the scientific and systematic analysis of mobile traffic dealt within CDMA Base Station. Among these, Repeater, having direct physical connection with BTS, simply does the remote relay function but the volume of the traffic flowed into the repeater is not accountable. The total BTS traffic is the sum of traffic dealt by the BTS and multiple Repeaters. In this article, we tried traffic analysis of this kind by adopting RTD (Round Trip Delay) which is specially designed to measure distribution of the distance between the Base Station and the Mobile station by differentiating the traffic dealt by BTS from traffic dealt by Repeaters. The fact that the connection between mobile station and BTS via Repeater (which is located remotely) yields far more delay than the direct connection between mobile station and BTS is the clue of this article. Based on this fact, Time Delay equipment was put at the receiving side of the Repeater to add certain amount of delay to the traffic to BTS and the result showed that the 99.78% of the traffic can be identified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.271-280
• /
• 2014

In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.6
• /
• pp.1-8
• /
• 2020

Communication between system modules is applied using the Modbus protocol in industrial sites including smart factories, industrial drones, building energy management systems, PLCs, ships, trains, and airplanes. The existing Modbus was used for serial communication, but the recent Modbus protocol is used for TCP/IP communication.The Modbus protocol supports RTU, TCP and ASCII, and implements and uses protocols in embedded systems. However, the transmission I/O devices for RTU, TCP, and ASCII-based protocols may differ. For example, RTU and ASCII communications transmit on a serial-based communication protocol, but in some cases, Ethernet TCP/IP transmission is required. In particular, since the C language (object-oriented) is used in embedded systems, the complexity of source code related to I/O registers increases. In this study, we designed software that can logically separate I/O functions from embedded devices, and designed the execution logic of each instance requiring I/O processing through a delegate class instance with Modbus RTU, TCP, and ASCII protocol generation. We designed and experimented with software that can separate communication I/O processing and logical execution logic for each instance.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.282-289
• /
• 2019

Reflective and solar LED road studs are being used as a way of securing visibility for road environments. Road markers have various advantages and disadvantages in terms of versatility, efficiency, simplicity and visibility as individual products of reflective type and solar LED. However, in addition to the above, it is possible to prevent secondary accident after accident, It has a common drawback that it is difficult to have. In this paper, we propose a road stud system incorporating a wireless control function using RF - based communication with existing solar LED road studs and a system for controlling them. The proposed system is called the smart road stud system and it can control the equipment through the central control unit and the relay unit connected to the central control room by incorporating the RF communication function in the existing solar LED road stud. In addition, since it is possible to control the lighting method, color, etc. according to the road condition, it is possible to provide the driver with the state of the road to perform the function for preventing the second accident after the accident. It also adds features that minimize the ongoing power consumption of LED and RF communications. In order to verify the validity of the proposed system, prototypes were produced and it was confirmed that it is possible to act as a university for prevention of accident after accident by linking with other traffic system besides accident prevention function by securing existing visibility.