• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.223-224
• /
• 2009

A wireless ad hoc network is a decentralized wireless network. The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. In this paper, we proposed new route maintenance algorithm to improve the efficiency and effective in order to reach destination node. In this algorithm we improve existing route maintenance in Dynamic Source Routing protocol, to improve the algorithm we make a new message we call Emergency Message (EMM). The emergency message used by the node moved to provide information of fault detection.

• Journal of Electrical Engineering and Technology
• /
• 제12권2호
• /
• pp.890-903
• /
• 2017

The problem of determining a smooth and collision-free path with maximum possible speed for a Mobile Robot (MR) which is chasing a moving target in a dynamic environment is addressed in this paper. Genetic Network Programming with Reinforcement Learning (GNP-RL) has several important features over other evolutionary algorithms such as it combines offline and online learning on the one hand, and it combines diversified and intensified search on the other hand, but it was used in solving the problem of MR navigation in static environment only. This paper presents GNP-RL based on predicting collision positions as a first attempt to apply it for MR navigation in dynamic environment. The combination between features of the proposed collision prediction and that of GNP-RL provides safe navigation (effective obstacle avoidance) in dynamic environment, smooth movement, and reducing the obstacle avoidance latency time. Simulation in dynamic environment is used to evaluate the performance of collision prediction based GNP-RL compared with that of two state-of-the art navigation approaches, namely, Q-Learning (QL) and Artificial Potential Field (APF). The simulation results show that the proposed GNP-RL outperforms both QL and APF in terms of smooth movement and safer navigation. In addition, it outperforms APF in terms of preserving maximum possible speed during obstacle avoidance.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2007년도 학술대회
• /
• pp.69-72
• /
• 2007

In this paper, we analyze the performance of the network management system with intelligent mobile agent system. The proposed system dynamically selects appropriate its destinations. Thus, the system has an advantage of flexible network management in mobile network environments as well as dynamic change of traffic. Comparing its delay and throughput performance with the conventional SNMP based network management system, we find that the proposed mobile agent system performs better efficiency than the conventional one.

• International Journal of Contents
• /
• 제5권2호
• /
• pp.43-52
• /
• 2009

The article first presents a broad overview of the design and management for survivable network. We review the concept of network survivability, various protection and restoration schemes. Also we introduce design architectures of Quantitative model and a Survivable Ad hoc and Mesh Network Architecture. In the other side of study like these(traditional engineering approach), there is the concept of the survivable network systems based on an immune approach. There is one sample of the dynamic multi-routing algorithms in this paper.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.772-772
• /
• 1994

• 한국당과학회:학술대회논문집
• /
• 한국당과학회 2006년도 제1회 연례학술대회
• /
• pp.45-45
• /
• 2006

• 대한교통학회지
• /
• 제20권3호
• /
• pp.129-147
• /
• 2002

본 연구에서 변동등식에 근거한 동적경로선택조건을 도출하여 동적통행배정모형을 제안한다. 동적경로선택조건은 운전자에 의해 이용된 경로, 링크 그리고 출발지의 출발시간을 고려하여 도출되며 이 조건을 동적통행배정모형으로 전환하는 과정에서 모형의 변동등식문제로 압축된다. 등식이론에 근거한 모델의 이론적 배경을 입증하기 위해 제안된 동적통행배정모형이 필요충분조건을 만족함이 증명되었다. 해법으로서 기존의 제안된 네트워크의 시간과 공간확장기법을 채택하지 않고 물리적 네트워크가 직접 알고리즘에 반영되도록 하기 위해 각 링크의 시간대별 통행량과 방출통행량을 링크진입통행으로 표현하여 시간종속 통행시간함수를 단일변수로 처리하여 대각화알고리즘에 반영하였다. 소규모 비대칭 네트워크 적용결과 사용자 동적최적경로선택조건이 만족됨을 입증하였는데 단위시간간격이 적을수록 개선된 효과를 보여준다. I-394네트워크 실험결과로서 기존의 변동부등식에 근거한 알고리즘에 비해 제안된 알고리즘이 최소한 93%이상의 컴퓨터연산 속도의 개선효과를 가져왔다. 등식이론에 근거한 모델개발의 장점으로서는 제안된 모델의 최적해의 계산시간이 전체시간의 증가에 전혀 영향을 받지 않는다는 것으로 이는 동적통행배정모형에 적용될 네트워크의 규모가 커질수록 제안된 알고리즘의 계산 효율성은 더욱 증가하는 것을 의미한다. 따라서 제안된 동적통행배정모형은 대규모 시간종속적 교통망에서 교통상황의 변화에 민감하게 반응할 수 있는 실시간첨단교통제어의 핵심기능으로서 역할수행이 기대된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권4호
• /
• pp.1817-1836
• /
• 2020

Network convergence is considered as one of the key solutions to the problem of achieving future high-capacity and reliable communications. This approach overcomes the limitations of separate wireless technologies. Efficient interface selection is one of the most important issues in convergence networks. This paper solves the problem faced by users of selecting the most appropriate interface in the heterogeneous radio-access network (RAN) environment. Our proposed scheme combines a hierarchical evaluation of networks and game theory to solve the network-selection problem. Instead, of considering a fixed weight system while ranking the networks, the proposed scheme considers the service requirements, as well as static and dynamic network attributes. The best network is selected for a particular service request. To establish a hierarchy among the network-evaluation criteria for service requests, an analytical hierarchy process (AHP) is used. To determine the optimum network selection, the network hierarchy is combined with game theory. AHP attains the network hierarchy. The weights of different access networks for a service are calculated. It is performed by combining AHP scores considering user's experienced static network attributes and dynamic radio parameters. This paper provides a strategic game. In this game, the network scores of service requests for various RANs and the user's willingness to pay for these services are used to model a network-versus-user game. The Nash equilibria signify those access networks that are chosen by individual user and result maximum payoff. The examples for the interface selection illustrate the effectiveness of the proposed scheme.

• 한국공간정보시스템학회 논문지
• /
• 제10권4호
• /
• pp.59-66
• /
• 2008

GeoSensor 네트워크란 지리공간상에서 발생하는 다양한 현상들을 모니터링하는 특정형태의 센서네트워크 인프라 및 관련 소프트웨어를 의미한다. 그리고 이러한 GeoSensor 네트워크는 데이터스트림과 공간 속성의 데이터를 가진 스트림, 또는 공간 릴레이션과의 조합으로 구현될 수 있다. 하지만, 최근까지 연구된 센서 네트워크 시스템은 공간 정보를 배제한 센서 데이터스트림에 대한 저장 및 검색 방안 연구에 치중되어 있다. 따라서 본 논문은 GeoSensor 네트워크에서 데이터스트림과 공간 데이터가 결합된 형태의 공간 데이터스트림의 정의 및 그들 간의 조인 전략들을 제안한다. 본 논문에서 정의하고 있는 공간 데이터스 트림에는 이동 객체 형태의 동적 공간 데이터스트림과 고정된 형태의 정적 공간 데이터스트림이 있다. 동적공간 데이터스트림은 GPS와 같이 동적으로 이동하는 센서에 의해 전송되는 데이터스트림을 말한다. 반면, 정적 공간 데이터스트림은 일반 센서 형태의 데이터스트림과 이러한 센서들의 위치 값을 가지고 있는 릴레이션과의 조인으로 만들어 진다. 본 논문은 동적 공간 데이터스트림과 정적 공간 데이터스트림의 조인 및 조인 비용을 추정하는 모델을 제안하고 있다. 또한, 실험을 통해 제안하는 비용 모델의 검증 및 조인 전략에 따른 조인 성능을 보이고 있다.