• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.261-270
• /
• 2009

We propose a tree-based integration of infrastructure networks and MANETs (TUM) to efficiently extend the scope of mobile Internet protocol to mobile ad hoc networks and devise a tree-based routing protocol (TBRP) that is suitable for the TUM architecture. Infrastructure networks have a number of fixed Internet Gateways that connect two heterogeneous networks. Mobile nodes form a number of small trees named pMANETs, each of them growing from anchor node which can communicate directly with an Internet Gateway. A new node registers with foreign agent and home agent along the tree path without resorting to an inefficient flooding. Furthermore, the TBRP sets up a routing path efficiently by exploiting the tree information without relying on flooding. We show by resorting to simulation that our approach is competitive against the conventional AODV based approach.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.10-17
• /
• 2014

This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the traffic throughput of user & routing traffic, delay, and frequency interference. When the conditions of tactical environment are applied in our simulations and the above-mentioned performances are analyzed, we find the OLSR protocol is more excellent. Plus, we compare the results of MANETs performance when applying optimum transmission range and the default transmission range(10km), and analyze the reasonability of the calculation of optimum transmission range proposed by this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.64-76
• /
• 2017

Routing in mobile ad hoc networks (MANETs) is highly challenging because of the dynamic nature of network topology. AntHocNet is a bio-inspired routing protocol for MANETs that mimics the foraging behavior of ants. However, unlike many other MANET routing protocols, the paths constructed in AntHocNet are unidirectional, which requires a separate path setup if a route in the reverse direction is also required. Because most communication sessions are bidirectional, this unidirectional path setup approach is often inefficient. Moreover, AntHocNet suffers from looping problems because of its property of multiple paths and stochastic data routing. In this paper, we propose a modified path setup procedure that constructs bidirectional paths. We also propose solutions to some of the looping problems in AntHocNet. Simulation results show that performance is significantly enhanced in terms of overhead, end-to-end delay, and delivery ratio when loops are prevented. Performance is further improved, in terms of overhead, when bidirectional paths setup is employed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.410-411
• /
• 2011

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2011.10a
• /
• pp.82-83
• /
• 2011

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2861-2880
• /
• 2018

Mobile Ad hoc Networks (MANETs) have become a viable platform owing to their potential of providing communication without any pre-existing infrastructure and central administrating authority. Mutual support and co-operation among nodes are prerequisites for performing functions in such networks. The scarcity of resources makes it economical for nodes to conserve their resources and misbehave by avoiding participation in the network. Therefore, a mechanism is required to detect and handle such misbehaving nodes and promote co-operation in the network. Existing techniques for handling misbehaving nodes focus only on their current behaviour without considering the antecedent behaviour of nodes. In real world, a node may dynamically change its behaviour in accordance to its requirements. Hence, an efficient mechanism is required for providing security against such misbehaviour. This paper proposes an Adaptive Security Model which contemplates the present as well as anterior behaviour of nodes for providing security against dynamic node behaviour. The adaptivity of the model is nested in its ability to requite well-behaving nodes and penalize misbehaving ones in conformity with their overall behaviour. Simulation results indicate the efficiency of proposed scheme in securing the network from the menace of dynamic behaviour of nodes.

• The KIPS Transactions:PartD
• /
• v.17D no.4
• /
• pp.245-252
• /
• 2010

In this paper, we propose an effective filtering method for skyline queries in mobile ad hoc networks (MANETs). Most existing researches assume that data is uniformly distributed. Under these assumptions, the previous works focus on optimizing the energy consumption due to the limited battery power. However, in practice, data distribution is skewed in a specific region. In order to reduce the energy consumption, we propose a new filtering method considering the data distribution. We verify the performance of the proposed method through a comparative experiment with an existing method. The results of the experiment confirm that the proposed method reduces the communication overhead and execution time compared to an existing method.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.610-614
• /
• 2011

Nowadays Mobile Ad Hoc Networks (MANETs) are a very popular and emerging technology in the world. MANETs helps mobile nodes to communicate with each other anywhere without using infrastructure. For this purpose we need good routing protocols to establish the network between nodes because mobile nodes can change their topology very fast. Mobile node movements are very important features of the routing protocol. They can have a direct effect on the network performance. In this paper, we are going to discuss random walk and random waypoint mobility models and their effects on routing parameters. Previously, mobility models were used to evaluate network performance under the different routing protocols. Therefore, the network performance will be strongly modeled by the nature of the mobility pattern. The routing protocols must rearrange the changes of accurate routes within the order. Thus, the overheads of traffic routing updates are significantly high. For specific network protocols or applications, these mobility patterns have different impacts.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.49-54
• /
• 2011

In this paper, End-to-End VoIP(Voice over Internet Protocol) performance over large scale MANET(Mobile Ad-hoc Networks) is evaluated. VoIP implementation model, which can be used for large scale MANET, is suggested through this evaluation. VoIP simulator based on NS-2 network simulator is used for performance measurement. Call connection ratio as a connection performance, MOS and network delay as a transmission performance, packet loss rate as other performance is measured with this simulation. Finally, maximum $10{\sim}15km^2$ as a single MANET, 500 nodes and 100 call connections is suggested for VoIP implementation and operation conditions over large scale MANETs.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.