• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.8
• /
• pp.1082-1087
• /
• 2021

In MANET(mobile ad hoc network), Mobility models vary according to the application-specific goals. The most widely used Random WayPoint Mobility Model(RWPMM) is advantageous because it is simple and easy to implement, but the random characteristic of nodes' movement is not enough to express the mobile characteristics of the entire sensor nodes' movements. The random mobility model is insufficient to express the inherent movement characteristics of the entire sensor nodes' movements. In the proposed Stochastic mobility model, To express the overall nodes movement characteristics of the network, the moving nodes are treated as random variables having a specific probability distribution characteristic. The proposed Stochastic mobility model is more stable and energy-efficient than the existing random mobility model applies to the routing protocol to ensure improved performances in terms of energy efficiency.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06d
• /
• pp.375-379
• /
• 2010

Delay-Disruption Tolerant Network(DTN)는 stored-and-forward를 통한 비대칭 통신을 하며 이러한 통신에 적합한 라우팅을 고려하기 위한 연구가 지속적으로 진행 되고 있다. 이러한 라우팅은 Bundle layer에 스토리지를 두어 종 단간 연결이 끊어지더라도 메시지를 보존 할 수 있으며, 현재 이러한 DTN의 특징을 Mobile Ad-hoc Network(MANET)에 적용하여 노드의 이동성을 보다 다이나믹하게 유지 할 수 있도록 하는 연구가 진행되고 있다. 본 논문에서는 이동성이 잦은 지역에서 메시지를 효과적으로 전송하기 위하여 MANET과 DTN 의 특징이 적용된 네트워크 환경에서 AODV 라우팅 테이블 안에 Score를 두어 경로 재탐색이나 메시지 전송이 반복될 경우 Score 값을 기준으로 보다 우월한 노드를 찾을 수 있게 하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.571-573
• /
• 2009

Mobile Ad-hoc Network(MANET) needs efficient node management because the wireless network has energy constraints. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. Previously proposed a hybrid routing CACH prolong the network lifetime and decrease latency. However the algorithm has a problem when node density is increase. In this paper, we propose a new method that the CACHE(Context-aware Clustering Hierarchy and Energy efficient) algorithm. The proposed analysis could not only help in defining the optimum depth of hierarchy architecture CACH utilize, but also improve the problem about node density.

• Journal of Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.56-66
• /
• 2013

In MANET, the frequent movement of nodes causes the dynamic network topology changes. Therefore, it is required that the routing protocol should be very stable to effectively respond the changes of the network changes. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one paired cluster to make longer radius. Then the headers of the paired cluster manage and operate corresponding member nodes. In the current CBRP, when the cluster header leaves out the cluster, the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster plays the role instead of the left cluster header. This method reduces the routing delay. Concurrently, PCBRP reduces the delay when they route nodes in the paired cluster internally.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.481-484
• /
• 2012

차로에서 차량의 많은 증가는 안전과 무선통신의 가용성에 대한 필요성을 높여 왔다. Vehicular ad hoc networks(VANETs)은 다양한 차량 어플리케이션을 위한 용도와 상용분야로의 개발을 점차적으로 해오고 있다. 차량 간의 효과적인 통신범위를 제공하기 위해서 최적화된 라우팅 프로토콜이 필요하다. 지금까지 목적지까지 최적의 경로를 찾는 mobile ad hoc networks(MANETs)를 위한 많은 기존의 프로토콜들이 존재한다. 본 논문에서는 두 개의 라우팅 프로토콜들을 비교함으로써 VANET 환경을 위한 프로토콜 개선방향을 제시하였다. Multicast Ad-hoc On-Demand Distance Vector(MAODV)[1][2] 라우팅 프로토콜의 솔루션은 목적지 대상으로 최적의 경로를 탐색함으로써 더욱 향상된 결과를 보여준다. NS-2[3]는 라우팅 프로토콜 실험을 수행하고 결과를 도출하는데 사용되어 왔다. 실험을 통하여 최적의 라우팅 프로토콜에 대한 연구방향 및 개선될 사항을 찾고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1829-1836
• /
• 2009

A wireless Ad-hoc network is willing to send and receive data and for other nodes, and it is a temporal network where the nodes with mobility are automatically constituted. This network has been studied to construct networks in the state where there is no infrastructure. The limited nodes and its frequent moving in a wireless Ad-hoc network have resulted in frequent network disconnection. Therefore, the data transmission rate should be secured in a wireless Ad-hoc network. This study proposes the method to improve QoS of data transmission considering the mobility of nodes that respond to path searching by means of AOMDV routing protocol. By applying the suggested method, it is possible to raise the transmission rate by improving the reliability of transmission path.

• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2014

Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.277-280
• /
• 2009

Mobile Ad-hoc Network(MANET) could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method that the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.