• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.334-342
• /
• 2014

Military communications for future warfare have limited resources but highly requirements. MANET has a lot of advantages for future military network due to easily deploying without infrastructure and supporting dynamic topology in restricted environments. But, one of the biggest issues for MANET is difficulty of transmitting data due to link failure in dynamic topology. Content Centric Networking is a future Internet paradigm which solves various IP network problem. In this paper, we propose a future military communication routing scheme using CCN in military tactical MANET. Simulation results show our scheme gets lower control message overhead and faster data downloads as number of node increases and mobile speed increases than other two schemes.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.309-313
• /
• 2009

In this paper, end-to-end VoIP(Voice over Internet Protocol) performance is evaluated by simulation with NS-2 simulation tool. There are many results studied and published for VoIP performance over TCP/IP networks. But, almost all of them were focused on wired or wireless Internet environments. About MANET (Mobile Ad Hoc Network), VoIP is currently studying several points of research. In this paper, analysis of VoIP performance is done with focusing on the mobility of MANETs. MOS(Mean Opinion Score), network delay, packet loss rates are considered as end-to-end QoS performance parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.865-875
• /
• 2008

In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.610-613
• /
• 2013

Vehicular Ad Hoc NETwork (VANET), a subclass of Mobile Ah Hoc NETwork (MANET) has been a tech-buzz for the last couple of decades. VANET, yet not deployed, promises the ease, comfort, and safety to both drivers and passengers once deployed. The by far most important factor in successful VANET application is the data dissemination scheme. Such data includes scheduled beacons that contain whereabouts information of vehicles. In this paper, we aim at regularly broadcasted beacons and devise an algorithm to disseminate the beacon information up to a maximum distance and alleviate the broadcast storm problem at the same time. According to the proposed scheme, a vehicle before re-broadcasting a beacon, takes into account the current vehicular density in its neighborhood. The re-broadcasters are chosen away from the source of the beacon and among the candidate re-broadcasters, if the density in the neighborhood is high, then the candidate rebroadcaster re-broadcasts the beacon with high probability and with low probability, otherwise. We also performed thorough simulations of our algorithms and the results are sound according to the expectations.

• Convergence Security Journal
• /
• v.18 no.5_1
• /
• pp.53-58
• /
• 2018

MANET transmits data by hop-by-hop method because it is composed of mobile nodes without support of any infrastructure. Its structure is very similar to a block chain. However, it is exposed to various threats such as data tampering or destruction by malicious nodes because of transmission method. So, ensuring the integrity of transmitted data is an important complement to MANET. In this paper, we propose a method to apply the block chain technique in order to protect the reliability value of the nodes consisting the network from malicious nodes. For this, hierarchical structure of a cluster type is used. Only cluster head stores the reliability information of the nodes in a block and then, this can be spread. In addition, we applied block generation difficulty automatic setting technique using the number of nodes selecting cluster head and the reliability of cluster head to prevent the spread of wrong blocks. This can prevent block generation and spread by malicious nodes. The superior performance of the proposed technique can be verified by comparing experiments with the SAODV technique.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.9-16
• /
• 2011

This paper represents an interworking architecture for keeping the VLC audio quality between Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 Mobile Ad hoc Network (MANET) where both mobile routers and mobile nodes are moving dynamically. Systematic performance analysis on the interworking architecture has been conducted by using OPNET simulator to show the results such as Packet Delivery Ratio (PDR) and throughput. Based on simulation results, when the number of MANET nodes is small, PDR remains relatively stable even though data packets increase. However, with the many MANET nodes, PDR decreases as data traffic increases. Throughput is affected by the number of MANET nodes. Especially when the MANET node density has increased further, throughput is much higher, but it is not affected by the mobility speed. However, FTP download and upload response time is not affected much by both the number of MANET nodes and the mobility speed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1222-1227
• /
• 2009

In this paper, we proposed a new method, the CACH(Context-aware Clustering Hierarchy) algorithm in Mobile Ad-hoc Network(MANET) systems. The proposed CACH algorithm based on hybrid and clustering protocol that provide the reliable monitoring and control of a variety of environments for remote place. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. Also, the proposed CACH could be used localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that a new method for CACH could find energy efficient depth of hierarchy of a cluster.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.40-52
• /
• 2010

A mobile ad hoc network is instant and heuristic, and it is also vulnerable and volatile. Since topology and route changes are frequent, no single routing protocol designed for a conventional network performs well. Some protocols suffer from significant performance degradation when the number of nodes increases, or when nodes become highly mobile. In this paper we investigate a way to adaptively select a routing protocol that fits to the real-time network conditions. The first phase of our study is to analyze the performances of two classes of routing protocols under various network scenarios. The second phase consists of constructing a routing protocol selection reference. All nodes continue to monitor the status of neighbor nodes and control packets exchanged. Then, the aggregated information is periodically compared against the protocol selection reference. The selected routing protocol is maintained throughout the network until the network property changes substantially. The performance of the proposed algorithm is verified by a set of computer simulations using the OPNET modeler. The experimental results show that selectively changing routing protocol adaptive to the network conditions greatly improves the efficacy of bandwidth utilization.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.119-125
• /
• 2010

In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.