• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.369-379
• /
• 2011

During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.25-26
• /
• 2011

해안선 및 해안지형은 지진활동 및 화산활동 등으로 인해 해양의 지형은 때때로 변화한다. 때문에 해양 선박 경로에는 많은 지형 변화와 기상 조건 등에 의해 큰 위험이 존재한다. 선박들은 이런 위험을 방지 또는 대책마련을 위하여 많은 장비를 탑재하여 항해의 안전을 도모한다. 대형 선박의 경우 AIS 장비 등의 도움으로 항해사의 중요한 업무를 보조하고, 주변 상황 인지를 통해 위험요소를 최대한 억제하게 된다. 하지만 대형 선박은 AIS 등과 같은 대형 장비의 탑재가 가능한 반면, 해양 근해만을 항해하게 되는 소형 선박의 경우 고가의 장비를 탑재하기 위한 비용, 공간의 제약의 부담이 있다. 이 때문에, 모바일 시스템 이용하여 항해지도 및 다양한 정보를 제공받게 된다면 비용과 공간의 제약을 크게 줄일 수 있게 된다. 따라서 본 논문에서는 모바일 시스템 이용하여 해양선박의 항해정보를 서비스할 수 있도록 지도 서비스 및 기상정보 등의 다양한 정보를 제공할 수 있는 기초를 마련하였다.

• Journal of Distribution Science
• /
• v.10 no.2
• /
• pp.29-41
• /
• 2012

This paper undertakes a conceptual review of transaction cost to broaden the understanding of the transaction cost analysis (TCA) approach. More than 40 years have passed since Coase's fundamental insight that transaction, coordination, and contracting costs must be considered explicitly in explaining the extent of vertical integration. Coase (1937) forced economists to identify previously neglected constraints on the trading process to foster efficient intrafirm, rather than interfirm, transactions. The transaction cost approach to economic organization study regards transactions as the basic units of analysis and holds that understanding transaction cost economy is central to organizational study. The approach applies to determining efficient boundaries, as between firms and markets, and to internal transaction organization, including employment relations design. TCA, developed principally by Oliver Williamson (1975,1979,1981a) blends institutional economics, organizational theory, and contract law. Further progress in transaction costs research awaits the identification of critical dimensions in which transaction costs differ and an examination of the economizing properties of alternative institutional modes for organizing transactions. The crucial investment distinction is: To what degree are transaction-specific (non-marketable) expenses incurred? Unspecialized items pose few hazards, since buyers can turn toalternative sources, and suppliers can sell output intended for one order to other buyers. Non-marketability problems arise when specific parties' identities have important cost-bearing consequences. Transactions of this kind are labeled idiosyncratic. The summarized results of the review are as follows. First, firms' distribution decisions often prompt examination of the make-or-buy question: Should a marketing activity be performed within the organization by company employees or contracted to an external agent? Second, manufacturers introducing an industrial product to a foreign market face a difficult decision. Should the product be marketed primarily by captive agents (the company sales force and distribution division) or independent intermediaries (outside sales agents and distribution)? Third, the authors develop a theoretical extension to the basic transaction cost model by combining insights from various theories with the TCA approach. Fourth, other such extensions are likely required for the general model to be applied to different channel situations. It is naive to assume the basic model appliesacross markedly different channel contexts without modifications and extensions. Although this study contributes to scholastic research, it is limited by several factors. First, the theoretical perspective of TCA has attracted considerable recent interest in the area of marketing channels. The analysis aims to match the properties of efficient governance structures with the attributes of the transaction. Second, empirical evidence about TCA's basic propositions is sketchy. Apart from Anderson's (1985) study of the vertical integration of the selling function and John's (1984) study of opportunism by franchised dealers, virtually no marketing studies involving the constructs implicated in the analysis have been reported. We hope, therefore, that further research will clarify distinctions between the different aspects of specific assets. Another important line of future research is the integration of efficiency-oriented TCA with organizational approaches that emphasize specific assets' conceptual definition and industry structure. Finally, research of transaction costs, uncertainty, opportunism, and switching costs is critical to future study.

• Journal of Intelligence and Information Systems
• /
• v.26 no.3
• /
• pp.1-36
• /
• 2020

This study is to reveal the acceptance factors of the Market Sentiment Index (MSI) created by reflecting the investor sentiment extracted by processing unstructured big data. The research model was established by exploring exogenous variables based on the rational behavior theory and applying the Technology Acceptance Model (TAM). The acceptance of MSI provided to investors in the stock market was found to be influenced by the exogenous variables presented in this study. The results of causal analysis are as follows. First, self-efficacy, investment opportunities, Innovativeness, and perceived cost significantly affect perceived ease of use. Second, Diversity of services and perceived benefits have a statistically significant impact on perceived usefulness. Third, Perceived ease of use and perceived usefulness have a statistically significant effect on attitude to use. Fourth, Attitude to use statistically significantly influences the intention to use, and the investment opportunities as an independent variable affects the intention to use. Fifth, the intention to use statistically significantly affects the final dependent variable, the intention to use continuously. The mediating effect between the independent and dependent variables of the research model is as follows. First, The indirect effect on the causal route from diversity of services to continuous use intention was 0.1491, which was statistically significant at the significance level of 1%. Second, The indirect effect on the causal route from perceived benefit to continuous use intention was 0.1281, which was statistically significant at the significance level of 1%. The results of the multi-group analysis are as follows. First, for groups with and without stock investment experience, multi-group analysis was not possible because the measurement uniformity between the two groups was not secured. Second, the analysis result of the difference in the effect of independent variables of male and female groups on the intention to use continuously, where measurement uniformity was secured between the two groups, In the causal route from usage attitude to usage intention, women are higher than men. And in the causal route from use intention to continuous use intention, males were very high and showed statistically significant difference at significance level 5%.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.89-99
• /
• 2003

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.9
• /
• pp.49-57
• /
• 2009

In this paper, we propose a multiple voltage scheduling method which reduces energy consumption considering both timing constraints and resource constraints. In the other multiple voltage scheduling techniques, high voltage is assigned to operations in the longest path and low voltage is assigned to operations that are not on the longest path. However, in those methods, voltages are assigned to specific operations restrictively. We use a simulated annealing technique, in which several voltages are assigned to specific operations flexibly regardless of whether they are on the longest path. In this paper, a post processing algorithm is proposed to further reduce the energy consumption. In some cases, designers may want to reduce the level shifters. To make tradeoff between the total energy and the number (or energy) of level shifters weighted term can be added to the cost function. When the level shifter energy is weighted six times, for example, the number of level shifters is reduced by about 24% and their energy consumption is reduced by about 20%.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.289-296
• /
• 2008

In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.91-98
• /
• 2004

This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.7
• /
• pp.156-161
• /
• 2020

In an environment that operates multiple UAVs, the use of a decentralized task allocation algorithm has more robustness from a single failure of UAV on the mission because there is no central command center. In addition, UAVs have situational awareness and redistribute tasks among themselves, which can expand the mission range. The use of multiple UAVs in a mission has increased as the agent hardware has decreased in size and cost. The decentralized mission-planning algorithm has the advantages of a larger mission range and robustness to a single failure during the mission. This paper extended the type of mission the uses CBBA, which is the most well-known decentralized task allocation algorithm, to the point mission and en-route mission. This will describe the real mission situation that has the purpose of surveillance. A Monte-Carlo simulation was conducted in the case of multiple agents in the task-rich environment, and the global rewards of each case were compared.