• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1222-1227
• /
• 2009

In this paper, we proposed a new method, the CACH(Context-aware Clustering Hierarchy) algorithm in Mobile Ad-hoc Network(MANET) systems. The proposed CACH algorithm based on hybrid and clustering protocol that provide the reliable monitoring and control of a variety of environments for remote place. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. Also, the proposed CACH could be used 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 a new method for CACH could find energy efficient depth of hierarchy of a cluster.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.429-436
• /
• 2005

A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

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

Recently, researches related MANET are progressing dynamically in points of view which MANET need no additional infra and guarantee node mobility. Node mobility in MANET is becoming more important, as people interest in using Ad hoc network under a concept of node mobility as fast automobile not walking. when nodes move fast, there are many problems headed by high cost for searching destination and routing. To deal with this problems We propose new routing protocol, No path-Location Aided Routing (N-LAR). Our algorithm has a better performance in terms of end-to-end delay, packet delivery ratio in MANET with High mobility.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.117-125
• /
• 2009

In hybrid wireless networks, a mobile node in MANET can communicate with other mobile nodes as well as nodes in the Internet. Hybrid mobile networks help to expand the application domains of MANET from limited areas, such as military applications to more diverse and general application areas. Previous routing protocols in hybrid wireless networks have not taken advantage of location information of nodes in a network. By using location information of nodes, a routing protocol can reduce the overhead of control messages for efficient network operations. This paper proposes a routing protocol for hybrid mobile networks, called Location-aided AODV+ (LAp) that is based on ADOV+ and takes advantage of node's location information. Performance evaluation shows that LAp performs better than ADOV+ when there are a sufficient number of nodes in a network for route establishments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1148-1161
• /
• 2012

Recently, developments in the field of communication and network technologies induced new paradigm in the defense weapon system. As a consequence, military authorities develop the Tactical Information Communication Network(TICN) system to adapt to the changing paradigm. One of the most important functions of TICN is real-time communication. As a result, TICN system needs to receive real-time information from the battlefield, and the key technology to support these features is MANET(Mobile Ad-Hoc Network) routing protocol. In this paper, we analyze problems of the shortest path scheme in tactical Ad-Hoc networks, which is widely used in common Ad-Hoc networks. We propose efficient routing protocol for tactical MANET by considering the environment of small combat units, such as node position, speed and data size. The proposed algorithm shows reliable data transfer and low latency in battlefield.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.195-201
• /
• 2024

Vehicular Ad-hoc Networks (VANETs) became very popular in few years and it has been widely used in research and industry communities. VANET is a collection of wireless vehicle nodes forming a temporary network without using any centralized Road Side Unit (RSU). VANET is a subset of Mobile Adhoc Networks (MANET). It improves the safety of vehicles. It also supports Intelligent Transportation Systems.Routing is the major component of communication protocols in VANETs. Packets are to be routed from the source node to destination node. Because of frequent topology changes and routing overhead, selection of routing protocol in VANET is a great challenge. There are various routing protocols available for VANET. This paper involves study of Temporally Ordered Routing protocol (TORA) and performance metrics are analyzed with the help of NS2 Simulator.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.45-50
• /
• 2008

Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. Therefore, in the MANET, a route setup mechanism that makes nodes not within each other's transmission range communicate is required and, for this, the Ad-hoc On-demand Distance Vector (AODV) was proposed as one of the reactive routing protocols well suited for the characteristics of the MANET. AODV uses the hop count as the routing metric and, as a result, a node selects the farthest neighbor node as its next hop on a route, which results in a problem of deteriorating the overall network throughput because of selecting a relatively low data rate route. In this paper, we propose an efficient reactive routing protocol based on the multi-rate aware MAC. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that our proposed mechanism outperforms the existing mechanism.

• Journal of Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.56-66
• /
• 2013

In MANET, the frequent movement of nodes causes the dynamic network topology changes. Therefore, it is required that the routing protocol should be very stable to effectively respond the changes of the network changes. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one paired cluster to make longer radius. Then the headers of the paired cluster manage and operate corresponding member nodes. In the current CBRP, when the cluster header leaves out the cluster, the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster plays the role instead of the left cluster header. This method reduces the routing delay. Concurrently, PCBRP reduces the delay when they route nodes in the paired cluster internally.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.120-129
• /
• 2010

MANET(Mobile Ad Hoc NETwork) is a collection of mobile nodes that are free to move and organize themselves in an arbitrary manner without any fixed infrastructures. These mobile nodes are connected by wireless links and act as routers for all other nodes in the network. As a router each node in MANET consumes its batteries when forwarding a message, and the selection of the best path to minimize the total power needed to route packets is needed to maximize the lifetime of all nodes. In this paper, we propose a routing protocol considering the remaining battery capacity of nodes in the routing paths. The proposed scheme prevents the battery of each node from being overused and increases the lifetime of the network.