• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.158-165
• /
• 2008

In this paper, we present a MMPR (Minimizing the Maximum Used Power Routing) Algorithm in a MANET (Mobile ad hoc network) by modifying the route selection algorithm in well-known routing MANET protocol. In the previous route selection algorithms, the metric for cost function is the minimal hop which does not consider the energy status. MMPR uses the metric with used energy The node that want to know the route for some destination begins calculating the route cost function with alpha which is the maximum used energy in the known route. If the new route that contains the node whose used energy is greater than previous known alpha is known to the node that want to send a packet in some moment, the probability of selecting the new route is lower. Experimental results with MMPR show higher performance in both the maximum used energy and the number of dead nodes than that of the CMMBCR (Conditional Max-Min Battery Routing).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2699-2707
• /
• 2013

We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.

• Journal of IKEEE
• /
• v.12 no.1
• /
• pp.8-17
• /
• 2008

Recently, GMAHN that provides interface between MANET and Wired Network has been focused in mobile communication. It is necessary that the technology provide reliable data transmission technology between mobile node and wired network in MANET environment that is varied by the node movement. In this paper, using the TCP protocol(Tahoe, Reno, Vegas, SACK)that increases reliability between source and destination, we applied the TCP protocol mechanism to various environment, and proposed the most efficient TCP mechanism by comparing each mechanism.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.88-98
• /
• 2006

VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.27-34
• /
• 2005

Mobile Ad Hoc Networks (MANETs) are self-organized networks that do not rely in their operation on wired infrastructure. As in any networking technology, security is an essential element in MANET as well, for proliferation of this type of networks. But supporting secure communication in MANETs proved to be a significant challenge, mainly due to the fact that the set of nodes in the network can change frequently and rapidly and due to the lack of access to the wired infrastructure. In particular, the trust model and the authentication protocols, which were developed for wired and infrastructure-based networks, cannot be used in MANETs. In this paper, we address the problem of efficient authentication of distributed mobile users in geographically large networks. In particular, we propose a new authentication scheme for this case of MANETs. The proposed scheme exploits Randomized Groups to efficiently share authentication information among nodes that together implement the function of a distributive Certification Authority (CA). We then evaluate the performance of authentication using Randomized Groups.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.55-63
• /
• 2007

Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.319-326
• /
• 2014

IEEE 802.11 WLAN uses CSMA/CA(Carrier Sense Multiple Access/Collision Avoidance) method in MAC(Media Access Control) protocol, and through the carrier sense checks whether other users use the channel during the data transmission to avoid the data collision. Currently, IEEE 802.11 standard recommends the use of a fixed threshold which gives an impact on carrier sensing range. However, the existing scheme using the fixed threshold causes the operation of network to be inefficiency owing to the mobility in MANET(Mobile Ad hoc NETwork). In this paper, we found the better network throughput to be obtained by applying the proposed scheme, which chooses properly the carrier sensing threshold and transmission rate considering SINR(Signal to Interference-plus-Noise Ratio), to the MANET.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.204-212
• /
• 2011

Mobile P2P(Peer-to-Peer) protocols in MANET(mobile ad-hoc networks) have gained much attention recently. Existing P2P protocols can be categorized into structured and unstructured ones. In MANET, structured P2P protocols show large control traffic because they does not consider the locality of P2P data and unstructured P2P protocols have a scalability problem with respect to the number of nodes. Hybrid P2P protocols combine advantages of the structured and unstructured P2P protocols. Cluster-based P2P protocol is one of the hybrid P2P protocols. Our study makes an analysis of the cluster-based P2P protocol and derives the optimal cluster formation in MANET. In the derived optimal cluster formation, the cluster-based P2P protocol shows better performance than Gnutella protocol with respect to control traffic.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.23-26
• /
• 2012

In MANET, the nodes, configuring a path, act as routers and they have various mobilities. If the path is broken by a node's moving, a new path has to be found again. For this reason, the node with high mobility should be excluded from configuring a path as far as possible. In this paper, we propose an algorithm which excludes nodes with high mobility from constructing a path by collecting and managing the information of mobility. As the result, the proposed algorithm provides more stable paths. In this algorithm, we appends MRecord Field and Relieve Field in the routing table to collect and manage the mobility information by extending current AOMDV. In addition, we add Mbl Field to RREP (Route Reply) message to adapt the collected information to configure the real path.