• 한국산학기술학회논문지
• /
• 제7권2호
• /
• pp.213-218
• /
• 2006

본 논문에서는 자동차 에드혹망에서의 위치기반 라우팅 프로토콜과 비위치기반 라우팅 프로토콜의 성능을 비교하고 분석하였다. 여러 가지 성능평가 요소로 분석되어진 프로토콜들은 위치기반 라우팅 프로토콜의 GPSR (Greedy Perimeter Stateless Routing)과 비위치기반 라우팅 프로토콜의 AODV (Ad-hoc On-Demand Distance Vector)과 DSR (Dynamic Source Routing) 프로토콜들이다. 패킷 전송율, 접속시 첫 번째 패킷의 지연, 그리고 거리에 따른 평균 홉수의 3가지 프로토콜 특성들을 비교하였다. 시뮬레이션의 결과로 AODV는 DSR 보다 우수한 성능을 보였다. 그러나, 자동차 에드혹망의 높은 이동성 때문에 위치기반 라우팅 프로토콜인 GPSR이 AODV와 DSR과 같은 비위치기반 라우팅 프로토콜들보다 우수한 성능을 보여주었다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2003년도 추계학술대회 및 정기총회
• /
• pp.139-144
• /
• 2003

Mobile Node has to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). Fast Handoff is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to quarantee QoS as a main issue in mobile IP research area. Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• 한국통신학회논문지
• /
• 제38B권11호
• /
• pp.934-936
• /
• 2013

A routing scheme for a group of mobile users for wireless ad-hoc networks is presented. The proposed scheme mines social activity patterns from wireless traces, and exploits social user group for efficient data routing among users based on a data publish approach. Simulation results based on real-world wireless traces show that our routing scheme reduces routing cost for a large mobile user group with a factor of 1.8 compared to a baseline counterpart.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2203-2217
• /
• 2016

To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
• /
• pp.136-138
• /
• 2006

The high-rate Wireless Personal Area Networks (WPANs) which IEEE 802.15.3 standard support, foster the Digital Home Network (DHN) scenarios with high rate multimedia data transmission. Actually, there are a few routing protocols for ad-hoc networks which considered the terminal location information and routing metric to reduce the energy consumption and optimize the routing path in mobile system. Based on other routing protocols, this paper presents the reliable location-based routing algorithm which is an adaptation to these networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2052-2067
• /
• 2011

Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.504-527
• /
• 2015

Underwater wireless sensor networks (UWSNs) are similar to the terrestrial sensor networks. Nevertheless, there are different characteristics among them such as low battery power, limited bandwidth and high variable propagation delay. One of the common major problems in UWSNs is determining an efficient and reliable routing between the source node and the destination node. Therefore, researchers tend to design efficient protocols with consideration of the different characteristics of underwater communication. Furthermore, many routing protocols have been proposed and these protocols may be classified as location-based and location-free routing protocols. Pressure-based routing protocols are a subcategory of the location-free routing protocols. This paper focuses on reviewing the pressure-based routing protocols that may further be classified into non-void avoidance protocols and void avoidance protocols. Moreover, non-void avoidance protocols have been classified into single factor based and multi factor based routing protocols. Finally, this paper provides a comparison between these protocols based on their features, performance and simulation parameters and the paper concludes with some future works on which further study can be conducted.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.356-367
• /
• 2007

In large networks, maintaining precise global network state information is impossible. The imprecise network state information has significant impacts on Quality-of-Service(QoS) routing and path establishment. In this paper, we develop analytical models for investigating the QoS routing schemes that are designed to tolerate imprecise network state information, and study the performance of various QoS routing schemes, including randomized routing, multi-path routing, and probability based routing, using both the models and simulations. We further propose a new mechanism, called local rerouting, that improves the effectiveness of QoS path establishment in the presence of imprecise global network state information. Local rerouting is orthogonal to existing schemes for dealing with imprecise state information and can be used in conjunction with them to alleviate the impacts of the imprecise information. The results of our performance study indicate that local rerouting is robust and effective.

• 한국통신학회논문지
• /
• 제35권9B호
• /
• pp.1281-1286
• /
• 2010

개미 기반 라우팅 방안은 개미집단 최적화 알고리즘의 한 부류로, 자연에서 서식하는 개미의 행동양식을 라우팅에 적용한 방안이다. 이동 애드혹 네트워크는 토폴로지가 동적으로 변하므로 경로 설정이 지역적 정보에 기반을 둘 필요가 있다. 따라서 이동 애드혹 네트워크에서의 라우팅은 개미집단 최적화의 한 응용분야로 알려져 있다. 본 논문에서는 이동 애드혹 네트워크에 적용한 개미 기반 라우팅 알고리즘인 SIR (swarm intelligence routing)에 경로선택과 링크 장애 시 처리 방법을 개선한 방안인 EPMAR (ant-based routing method using enhanced path maintenance)을 제안하고, 그 성능을 AntHocNet 및 SIR과 비교, 분석하였다. 분석 결과, 제안한 방안이 AntHocNet이나 SIR보다 패킷 전달율은 높고, 치명적 경로 장애가 더 적게 발생함을 입증하였다.