• 한국정보전자통신기술학회논문지
• /
• 제3권2호
• /
• pp.46-49
• /
• 2010

This paper has proposedfor wireless Ad-hoc networks with robust route maintenance schemes. The device feature Bluetooth and/or IEEE 802.11 network interfaces and communicate in a decentralized manner. The nodes have the responsibility of self-organizing so that the network is robust to the variations in network topology due to node mobility as well as the fluctuations of the signal quality in the wireless environment.

• 정보과학회 논문지
• /
• 제42권2호
• /
• pp.190-202
• /
• 2015

스마트폰내 GPS 및 다양한 센서 데이터를 이용하여 스마트폰 사용자의 이동 패턴을 학습하고, 이를 기반으로 사용자 목적지와 경로를 예측하여 사용자의 의도에 맞는 서비스를 제공하는 위치기반 지능형 개인화 서비스(Intelligent personal assistant) 연구가 활발히 진행 되고 있다. 위치기반 개인화 서비스의 지능성은 불완전한 센서 데이터로부터 사용자 이동 정보를 처리하여, 실시간으로 사용자의 경로를 예측하는 정확성과 효율성에 좌우된다. 본 논문은 불완전한 정보로부터 사용자의 경로와 목적지를 추론하는 동적 베이지안 네트워크 기반의 강인한 파티클 필터(Robust particle filter)를 제안한다. 제안한 강인한 파티클 필터 방법은 부정확하고, 불완전한 센서 정보를 보완할 수 있는 파티클 생성, 실시간에 계산 복잡도를 감소시키는 효율적인 스위칭 함수와 가중치 함수, 파티클의 정확도를 향상시키는 재표본화로 구성되며, 사용자의 목적지와 경로의 예측 정확성과 효율성의 성능을 향상시켰다.

• Journal of Communications and Networks
• /
• 제6권4호
• /
• pp.362-375
• /
• 2004

An ad hoc network is a multi-hop wireless network. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple, and energy conserving. We have proposed PoolODMRP to reduce its control overhead greatly by its one-hop local route maintenance. However, PoolODMRP still has some shortcomings. In this paper, we propose PDAODMRP (passive data acknowledgement ODMRP) to extend PoolODMRP. Compared with PoolODMRP, PDAODMRP has the following contributions: (1) It knows the status of its downstream forwarding nodes by route information collected from data packets instead of BEACON signal of MAC layer; (2) it max simplifies the route information collected from data packets by pool nodes; (3) it adopts a dynamic local route maintenance to enforce its local route maintenance; (4) it adopts the route evaluation policy of NSMP (neighbor supporting multicast protocol). Compared with PoolODMRP, PDAODMRP has lower control overhead, lower data delivery delay, and lower data overhead.

• 한국전자통신학회논문지
• /
• 제4권1호
• /
• pp.14-19
• /
• 2009

노드의 이동성과 한정된 배터리 용량으로 무선애드혹 네트워크에서는 종종 경로 단절이나 패킷 손실이 발생한다. 본 논문에서는 수신 신호 세기의 변화를 측정함으로써 경로 단절 확률과 패킷손실을 줄일 수 있는 AODV (Ad hoc On-demand Distance Vector routing)에 기반을 둔 향상된 라우팅 프로토콜을 제안한다. 라우팅을 결정하기 위해 노드 이동성과 경로의 홉으로 이루어진 새로운 측정 함수를 사용하고, 데이터 전송 중 노드의 움직임에 의한 경로의 단절을 방지하기 위해 새로운 경로 관리 기법을 소개한다. 이웃 노드의 움직임을 감지되면, 경로가 단절되기 전에 라우팅 에이전트는 다음 홉 노드를 이웃노드로 변경한다. 시뮬레이션 결과를 통해 제안한 라우팅 기법의 성능이 기존의 AODV 방식보다 우수함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권5호
• /
• pp.1354-1372
• /
• 2012

Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

• 한국멀티미디어학회논문지
• /
• 제13권6호
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.

• 디지털산업정보학회논문지
• /
• 제13권2호
• /
• pp.43-51
• /
• 2017

Recently, MANET has been used in many fields as the range of applications increases. However, the dynamic topology that MANET has makes it difficult to route and provides the cause of exposure to security vulnerabilities. Therefore, the security features that can be robust to many attacks must have been applied in the routing technique provided in the MANET. In this paper, we propose a secure routing method that secure route is established by reliability evaluation of nodes and secure data communication has applied through key exchange mechanism. The proposed technique used hierarchical structure for efficiency of reliability evaluation of nodes. The reliability of nodes is performed by trust management node and reliability of nodes managed periodically is broadcasted. And the key exchange for secure data transmission is dene without CA as the certificate issuing organization. This allows fast key exchange and the integrity of data transmission improved. The proposed technique improves the security of the data transmission because a secure route to the destination node is established by the reliability evaluation and the data transmission is performed after the key between the source node and the destination node is exchanged through the established route.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권6호
• /
• pp.445-453
• /
• 2016

Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

• 정보처리학회논문지C
• /
• 제14C권1호
• /
• pp.87-94
• /
• 2007

모바일 Ad hoc 네트워크에서 AODV와 DSR을 포함한 대표적인 표준 라우팅 프로토콜들은 대부분 난일 최단 경로를 구축하고 사용한다. 이러한 단일 경로 라우팅은 경로가 단절되었을 때 경로를 처음부터 다시 재구축해야 하는 번거로움과 이에 따른 부하 발생이 불가피하다. 이런 문제점들을 해결하기 위한 방법으로 빠른 대체 경로 이용이 가능한 다중 경로 라우팅 프로토콜에 관한 연구들이 활발하게 진행되고 있다. 본 논문에서는 AODV 기반의 지역 경로 탐색에 의한 노드 비중첩 다중 경로 검색 기법을 제안한다. 이는 송신지로부터 수신지로의 완전 분리된 노드 비중칩 다중 경로들을 최대한 많이 찾아 구축함으로 경로의 강건함을 확보하고 보다 안정적인 라우팅을 제공한다.

• 한국시뮬레이션학회논문지
• /
• 제18권4호
• /
• pp.175-184
• /
• 2009

해양센서네트워크에서 센서 노드간의 거리는 네트워크의 성능을 좌우하는 매우 중요한 요소 중 하나이다. 본 논문은 해양환경에 적합한 통신 경로를 설계하기 위하여 효율적인 거리를 설정하고 레벨(Level)을 나누는 기법을 제안한다. 제안한 기법으로 설정된 경로를 유지하고 에너지 효율을 극대화 하여 전체 네트워크의 수명을 연장하는 방안을 연구하는 것에 목적을 두었다. 설정된 경로는 내 외부적인 요소들에 의해 유동적으로 변경될 수 있으며 제안된 경로 강화 기법을 통해 더욱 견고한 해양센서 네트워크를 구축한다.