• 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 Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1214-1221
• /
• 2007

Ad-hoc network is soft wireless communication network that is consisted of mobile node and clusters without helping of infrastructure. We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. Proposed structure is consisted of context awareness parameters as like distance between each nodes. The proposed architecture performs two types of routing discovery. One is Flooding Discovery Routing(FDR) for comparing analysis step and Local Discovery Routing(LDR) to compose path of node forecast(preservation) step from node's state value. The inference network structure of proposed RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) adopts a tree structure to enhance an efficient packet in various environment between mobile node. We will have developed an algorithm that will desist multi-hierarchy Layered networks to simulate a desired system.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.627-634
• /
• 2006

Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.13-19
• /
• 2008

A mobile ad-hoc network routing protocols for transmission of multimedia contents need to have low delay time and to maintain the established route because it should secure quality of service(QoS) of the network. In this paper, the proposed protocol, termed HODMRP (History-based On-Demand Multicast Routing Protocol), is enhanced On-Demand Multicast Routing Protocol (ODMRP) by adding the criterion which is the session history for establishing route. The characteristic of this protocol is that data can be transmitted using the redundant route which is already selected by session history, if it occurs that the route is broken, HODMRP have better Packet Delivery Ratio (PDR) value and lower delay time than ODMRP by the simulation results.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that 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, 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. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.890-893
• /
• 2008

자율성 및 이동성 갖는 네트워크 구조의 하나인 MANET(Mobile Ad-Hoc Networks)은 각 node들은 그 특성에 따라서 clustering service을 한다. node의 전송과정 중 path access에 대하여 중요성 또한 강조되고 있다. 일반적인 무선 네트워크 상에서의 node들은 clustering을 하게 되는데 그 과정에서 발생되는 여러 가지 문제점을 가지고 전송이 이루어진다. 모든 node들이 송, 수신상의 전송 범위(Beam forming area)가지고 있으며, 이러한 각 node들의 전송범위 내에 전송이 이루어지는 전통적인 전송기술 mechanism을 찾는다. 이러한 전송상황에서의 송신하는 node와 수신된 node간에 발생되고 있는 중복성의 문제점으로 즉, 상호적용에 의한 네트워크 duplicate(overlapping)이 크게 우려가 되고 있다. 이러한 전송상의 전송 범위 중첩, node간의 packet 간섭현상, packet의 중복수신 및 broadcasting의 storming현상이 나타난다. 따라서 본 논문에서는 상황정보의 속성을 이용한 계층적 상호 head node들의 접근된 위치와 연계되는 전송속도, 보존하고 있는 head node들의 에너지 source value, doppler효과를 통한 head node의 이동방향 등 분석한다. 분석된 방법으로 전송상의 계층적 path가 구성된 경험적 path 속성을 통한 네트워크 connectivity 신뢰성을 극대화 할 뿐만 아니라 네트워크의 전송 범위 duplicate을 사전에 줄일 수 있고 전송망의 최적화를 유지할 수 있는 기법의 하나인 상황정보를 이용한 ad hoc network의 ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) clustering 기법을 제안한다.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.765-766
• /
• 2008

In this paper, It has been emphasized of important path access during transmit of node when each node transmit broadcast service which one's of new MANET (Mobile Ad hoc Networks) of autonomy and mobility network structures. It has proposed analysis methods are hierarchical path structure of transmit which experience context aware through confidence to network connectivity alone as issue which can be reduce duplicate of beam forming on networks and maintenance one's of method got to optimized of transmission network that status information of context awareness using ad hoc ODDMRP(Ontology Doppler effect Dynamic Multicast Routing Protocol) path method.

• 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]는 라우팅 프로토콜 실험을 수행하고 결과를 도출하는데 사용되어 왔다. 실험을 통하여 최적의 라우팅 프로토콜에 대한 연구방향 및 개선될 사항을 찾고자 한다.