• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.889-894
• /
• 2004

Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.73-80
• /
• 2007

In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.542-558
• /
• 2016

Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.417-424
• /
• 2007

Mesh networks using WLAN technology have been paid attention as a key wireless access technology. However, many technical issues still exist for its successful deployment. One of those issues is the routing problem that addresses the path setup through a WLAN mesh network for the data exchanges between a station and a wired network. Since the characteristics of a WLAN mesh network can be very dynamic, the use of single routing protocol would not fit for all environments whether it is reactive or proactive. Therefore, it is required to develop an adaptive routing protocol that modifies itself according to the changes in the network parameters. As a logical first step for the development, an analytical model considering all the dynamic features of a WLAN mesh network is required to evaluate the performance of a reactive and a proactive routing scheme. In this paper, we propose an analytical model that makes us scrutinize the impact of the network and station parameters on the performance of each routing protocol. Our model includes the size of a mesh network, the density of stations, mobility of stations. and the duration of network topology change. We applied our model to the AODV that is a representative reactive routing protocol and DSDV that is a representative proactive routing protocol to analyze the tradeoff between AODV and DSDV in dynamic network environments. Our model is expected to help developing an adaptive routing protocol for a WLAN mesh network.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.543-550
• /
• 2005

Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.205-212
• /
• 2008

In the environment with multiple heterogeneous wireless sensor networks with a single point of sensed data collection or a gateway (GW), relay points (RPs) may be required for the energy efficient delivery of sensed data from static or mobile sinks to the GW. The optimal placement of RPs becomes an even more difficult problem if static sinks are dynamically added or the trajectory of mobile sinks can not be known in advance. In order to resolve this problem, we propose a mechanism to deploy RPs in a grid pattern and to use the tree-based relaying network for reducing the cost of the RP and for reducing the control overhead incurred by the route setup from sinks to the GW. For the performance evaluation of our proposed mechanism, we have carried out a numerical analysis on a single route setup from a sink to the GW and, for more general performance evaluations, ns-2 based simulations have been carried out. According to the performance evaluation results, our tree-based relaying network mechanism outperforms that based on AODV in terms of the data delivery time, the network service time and the control overhead.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.871-878
• /
• 2004

Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.