• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.722-730
• /
• 2008

This paper proposes two novel algorithms enabling mobile robots to cooperate with each other in a reliability-based system and a time-critical system. In the reliability-based cooperative system, the concepts of a mobile ad hoc network (MANET) and an object entropy are adopted in order to coordinate a specific task. A logical robot group is created based on the exchange of request and reply messages in a robot communication group whose organization depends on transmission range. In the time-critical cooperative system, relational entropy is used to define the relationship between mobile robots. A group leader is selected based on optimizing power consumption. The proposed algorithm has been verified based on the computer-based simulation and soccer robot experiment. The performance metrics are defined. The metrics include the number of messages needed to make a logical robot group and to obtain the relationship of robots and the power consumption to select a group leader. They are verified by simulation and experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1281-1286
• /
• 2010

Ant-based routing methods belong to a class of ant colony optimization algorithms which apply the behavior of ants in nature to routing mechanism. Since the topology of mobile ad-hoc network(MANET) changes dynamically, it is needed to establish paths based on the local information. Subsequently, it is known that routing in MANET is one of applications of ant colony optimization. In this paper, we propose a routing method, namely EPMAR, which enhances SIR in terms of route selection method and the process upon link failure. The performance of the proposed method is compared with those of AntHocNet and SIR. Based on he analysis, it is proved that the proposed method provided higher packet delivery ratio and less critical link failure than AntHocNet and SIR.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.216-225
• /
• 2004

In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.1
• /
• pp.35-43
• /
• 2018

MANET composed of only wireless nodes is increasingly utilized in various fields. However, it is exposed to many security vulnerabilities because it doesn't have any infrastructure and transmits data by using multi-hop method. Therefore, MANET should be applied the intrusion detection technique that can detect efficiently malicious nodes and decrease impacts of various attacks. In this paper, we propose a distributed intrusion detection technique that can detect the various attacks while improving the efficiency of attack detection and reducing the false positive rate. The proposed technique uses the cluster structure to manage the information in the center and monitor the traffic of their neighbor nodes directly in all nodes. We use three parameters for attack detection. We also applied an efficient authentication technique using only key exchange without the help of CA in order to provide integrity when exchanging information between cluster heads. This makes it possible to free the forgery of information about trust information of the nodes and attack nodes. The superiority of the proposed technique can be confirmed through comparative experiments with existing intrusion detection techniques.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.9-17
• /
• 2009

A Mobile Ad hoc network(MANET) is a network consisting of a set of wireless mobile nodes, which communicate with each other without centralized control or established infrastructure. In this paper, to obtain a better understanding of AODV(Ad hoc On-Demand Distance Vector Routing Protocol)and OLSR(Optimized Link State Routing Protocol) routing protocols, different performances are simulated and analyzed using OPNET modeler 14.5 with the various performance metrics, such as packet delivery ratio, end-to-end delay and routing overhead. As a conclusion, in static analysis, the routing overhead of OLSR is affected by the number of nodes, but not data traffic. In AODV case, it is affected by both data traffic and number of nodes. In mobility analysis, routing overhead is not greatly affected by mobility speed in AODV and OLSR, and the PDR(Packet Delivery Ration) of OLSR is decreased as the node speed increased, while AODV is not changed. AS to delay, AODV is always higher than OLSR in both static and nobility cases.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.2086-2098
• /
• 2018

Security plays a vital role and is the key challenge in Mobile Ad-hoc Networks (MANET). Infrastructure-less nature of MANET makes it arduous to envisage the genre of topology. Due to its inexhaustible access, information disseminated by roaming nodes to other nodes is susceptible to many hazardous attacks. Intrusion Detection and Prevention System (IDPS) is undoubtedly a defense structure to address threats in MANET. Many IDPS methods have been developed to ascertain the exceptional behavior in these networks. Key issue in such IDPS is lack of fast self-organized learning engine that facilitates comprehensive situation awareness for optimum decision making. Proposed "Intelligent Behavioral Hybridized Intrusion Detection and Prevention System (IBH_IDPS)" is built with computational intelligence to detect complex multistage attacks making the system robust and reliable. The System comprises of an Intelligent Client Agent and a Smart Server empowered with fuzzy inference rule-based service engine to ensure confidentiality and integrity of network. Distributed Intelligent Client Agents incorporated with centralized Smart Server makes it capable of analyzing and categorizing unethical incidents appropriately through unsupervised learning mechanism. Experimental analysis proves the proposed model is highly attack resistant, reliable and secure on devices and shows promising gains with assured delivery ratio, low end-to-end delay compared to existing approach.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.637-640
• /
• 2011

Recently, rapid spreading of smart-phone make an expectation for increase of practical application for MANET(Mobile Ad-Hoc Network) which is not used infrastructure like as base-station. One of important application for MANET will be VoIP(Voice over Internet Protocol) known as Internet telephony. On the other hand, information intrusions causing serious problems is not allowed exception of MANET. Especially, there are some dangerous problems of intrusions to MANET, differently to other networks, because of it's usage of military purpose or emergency application of rescue. In this paper, to analyze this intrusion problem on MANET with blackhohe attacks, effect of intrusion to transmission performance is studied. VoIP traffic is assumed as an application service on MANET, computer simulation with NS-2 is used for this analysis.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.461-472
• /
• 2006

In this paper, we propose a novel on-demand multicasting algorithm, 'Durable Distance Vector Multicasting(DDVM),' for Mobile Ad hoc Network(MANET). DDVM has a more efficient routing-control complexity than Link State Routing(LSR) and with the smaller complexity, DDVM provides a high delivery ratio for MANET with high mobility by adapting to dynamic topological changes. This is achieved by adding 'combined path durability' statistic into the routing-control information of Distance Vector Routing(DVR). The routing-path duration statistic is computed in a fully distributed manlier at each node in the network based on only local information from neighbour nodes. We show by simulation studies the effectiveness of DDVM compared with On-demand Multicast Routing Protocol(ODMRP).

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.147-154
• /
• 2007

Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase's while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR's performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.

• Journal of Multimedia Information System
• /
• v.3 no.4
• /
• pp.129-134
• /
• 2016

A routing protocol in mobile ad hoc networks is important, and a location based routing has attracted attention. We have proposed a method, in which plural mobile agents (MA) manage location information and construct a route and the number of MA dynamically changes depending on the network situation. However, the area where each MA manages is not always appropriate. This would increase the network load due to unnecessary split and mergence of MAs. To solve this problem, in this paper, we propose an enhanced method. In this method, the MA management area is properly determined based on distribution of nodes. From the performance evaluation, we show that the proposed method outperforms conventional methods in terms of packet delivery rate when network load is high.