• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.132-140
• /
• 2021

Under the mobile ad-hoc network system, the main reason for causing congestion is because of the limited availability of resources. On the other hand, the standardised TCP based congestion controlling mechanism is unable to control and handle the major properties associated with the shared system of wireless channels. It creates an effect on the design associated with suitable protocols along with protocol stacks through the process of determining the mechanisms of congestion on a complete basis. Moreover, when bringing a comparison with standard TCP systems the major environment associated with mobile ad hoc network is regraded to be more problematic on a complete basis. On the other hand, an agent-based mobile technique for congestion is designed and developed for the part of avoiding any mode of congestion under the ad-hoc network systems.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.8
• /
• pp.41-48
• /
• 2016

In this paper, we propose an election protocol based on mobile ad-hoc network. In distributed systems, a group of computer should continue to do cooperation in order to finish some jobs. In such a system, an election protocol is especially practical and important elements to provide processes in a group with a consistent common knowledge about the membership of the group. Whenever a membership change occurs, processes should agree on which of them should do to accomplish an unfinished job or begins a new job. The problem of electing a leader is very same with the agreeing common predicate in a distributed system such as the consensus problem. Based on the termination detection protocol that is traditional one in asynchronous distributed systems, we present the new election protocol in distributed systems that are based on MANET, i.e. mobile ad hoc network.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.6
• /
• pp.92-100
• /
• 2008

Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base stations. Recently, Ad-hoc networks are evolving to support multimedia contents according to expansion of ad hoc multi-hop communication system. Wireless ad-hoc network is different from the conventional wired network by frequent changes in network topology, number of routers and resources, there are a number of problems in applying conventional routing protocol to ad-hoc network. The AODV routing protocol is proposed for mobile node in ad-hoc networks. AODV protocol that provides to guarantee QoS for data transmission in ad hoc networks that link break frequently occurs. In this paper, AODV routing protocol based NDIS(Network Driver Interface Specification) is implemented. We design high performance image transmission that can operate with software(AODV) for ad-hoc networks without degradation. and verify operation of AODV routing protocol on the test bed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2005

An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.99-104
• /
• 2003

Ad-hoc is the wireless network and consists of moving Hosts in environments which don't have a network-based Frame. Because ad-hoc is considered as broadcast network and network which has useful benefits, multicast muting protocols have been studied on ad-hoc network For this work we scrutinized ad-hoc and multicast routing protocols presented in previous works. And we presents a protocol for Ad-hoc network.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1127-1136
• /
• 2004

This paper proposes a novel multicasting algorithm, called ANMAS (Ad hoc Network Multicasting with Ant System), for Mobile Ad hoc Network (MANET). The algorithm utilizes the indirect communication method of the ants via 'pheromone' to effectively obtain dynamical topology change information, generating safer multicasting paths, and adapts the well-known CBT (Core Based Tree) multicasting algorithm into the ANMAS framework with proper modificiations to make 'tolerable' multicasting group in the MANET environment. We show the efficiency and the effectiveness of ANMAS via simulation studies.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.5
• /
• pp.121-127
• /
• 2009

Wireless devices can communicate between each other without existing infrastructure in mobile Ad-hod network. Ad hoc networks can be used under difficult conditions, where it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio (CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. In this paper, we simulate and compare the performance of conventional single and cooperative spectrum sensing with CR system using ad-hoc networks. And we demonstrate performance improvement by analyzing the system performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.680-699
• /
• 2015

The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.2
• /
• pp.107-114
• /
• 2024

Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.