• Convergence Security Journal
• /
• v.13 no.1
• /
• pp.19-24
• /
• 2013

MANET has a highly dynamic topology because it consists of only mobile nodes. Various attacks using these characteristics exist. Among them, damage of the attacks based flooding such as DoS or DDos is large and traceback of the attack node is not easy. It is because route information by moving of intermediate nodes which pass the data changes frequently. In this paper, we propose table-based traceback technique to perform efficient traceback although route information by moving of nodes changes frequently. Cluster head manages route management table in order to form cluster status table and network topology snapshot for storing the location information of mobile nodes when cluster member nodes change. Also, bloom filter is used to reduce the amount of storing route information. The performance of the proposed technique is confirmed through experiment.

• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.13-20
• /
• 2022

Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

• International Journal of Advanced Culture Technology
• /
• v.1 no.2
• /
• pp.7-12
• /
• 2013

Mobility management is an important issue in Mobile Ad Hoc Networks (MANETs) because location information of mobile nodes is frequently changed and it aggravates the performance in MANETs drastically. In this paper, we propose a fuzzy logic based mobility management scheme using group quorum system by considering the mobile nodes' locality in order to manage location information of mobile nodes in MANETs efficiently. The proposed scheme selects mobility databases adaptively from group quorum system by considering the degree of locality of a mobile node. The performance of the proposed scheme is evaluated by an analytical model and compared with that of existing mobility management scheme.

• Annual Conference of KIPS
• /
• 2005.05a
• /
• pp.1461-1464
• /
• 2005

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories, but those are not well-suited for securing ad hoc networks. Moreover, a fundamental issue of securing mobile ad hoc networks is to ensure mobile nodes can authenticate each other. Because of its strength and efficiency, public key and digital signature is an ideal mechanism to construct the authentication service. Although this is already mature in the internet application, providing public key based authentication is still very challenging in mobile ad hoc networks. In this paper I propose a secure public key authentication service based on clustering model and trust model to protect nodes from getting false public keys of the others efficiently when there are malicious nodes in the network.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.389-395
• /
• 2022

A Mobile Sensor Network is widely used in real time applications. A critical need in Mobile Sensor Network is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes"EERA: Energy Efficient Routing Algorithm for Mobile Sensor Network" is divided into five phases. 1, Cluster Formation 2.Cluster head and Transmission head selection 3.Path Establishment / Route discovery and 4,Data Transmission. Experimental Analysis has been done and is found that the proposed method performs better than the existing method with respect to four parameters.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.222-230
• /
• 2009

A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.431-435
• /
• 2005

Mobile Ad-Hoc network is the network(MANET) of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move and communicate freely each other. Recently, many researches for mobility management of mobile nodes are actively carried out by using the location information of mobile nodes. The location management is an important issue in MANET because location information of mobile node is frequently changed in MANET. In this paper, an adaptive mobility management scheme using fuzzy-logic based GQS by considering the mobile locality is proposed in order to manage location information of mobile nodes in MANET efficiently. The proposed scheme selects mobility databases adaptively from GQS by considering the locality of mobile node. The performance of the mobility management scheme proposed in this paper is evaluated by an analytic model and compared with that of existing UQS based mobility management scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1373-1391
• /
• 2022

We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.1
• /
• pp.99-105
• /
• 2012

Given the numbers of smartphones, tablets and other mobile devices shipped every day, more and more users are relying on the cloud as the main driver for satisfying their computing needs, whether it is data storage, applications or infrastructure. Mobile cloud computing is simply cloud computing in which at least some of the devices involved are mobile. Each node is owned by a different user and is likely to be mobile. Using mobile hardware for cloud computing has advantages over using traditional hardware. These advantage include computational access to multimedia and sensor data without the need for large network transfer, more efficient access to data stored on other mobile devices and distributed ownership and maintenance of hardware. It is important to predict job execution time in mobile cloud computing because there are many mobile nodes with different capabilities. This paper analyzes the job execution time for mobile cloud computing in terms of network environment and heterogeneous mobile nodes using a mathematical model.

• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.66-75
• /
• 2007

The traditional centralized network management method using the SNMP has problems, such as, increase of communication traffic and severe bottleneck phenomena at the specific manager-node caused by a frequent polling mechanism. Several mobile agent based network management methods have been studied to solve and overcome these problem. However, in these mobile agent based methods, as the number of nodes to be managed is increased, the mobile data are increased accumulatively and the effectiveness of the network management is decreased. In this paper, we propose the split management method by using mobile agents to handle these problems. In our method, the nodes are divided into groups to be handled by separate mobile agents. Each mobile agent visits its own nodes and gets management information from them. We demonstrate the effectiveness of our proposed method using experimental results.