• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.8
• /
• pp.1082-1087
• /
• 2021

In MANET(mobile ad hoc network), Mobility models vary according to the application-specific goals. The most widely used Random WayPoint Mobility Model(RWPMM) is advantageous because it is simple and easy to implement, but the random characteristic of nodes' movement is not enough to express the mobile characteristics of the entire sensor nodes' movements. The random mobility model is insufficient to express the inherent movement characteristics of the entire sensor nodes' movements. In the proposed Stochastic mobility model, To express the overall nodes movement characteristics of the network, the moving nodes are treated as random variables having a specific probability distribution characteristic. The proposed Stochastic mobility model is more stable and energy-efficient than the existing random mobility model applies to the routing protocol to ensure improved performances in terms of energy efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.444-446
• /
• 2021

MANETs(Mobile Ad-hoc Networks) are composed of mobile nodes that are not subordinate to fixed networks and have the feature that can form their own networks. they are used in various fields for specific goals. The mobility model in MANET can be applied in various ways depending on the purpose of usage. The random mobility model has the advantage of being simple and easy to implement, so it is being used the most. In a MANET, it is assumed that each node moves independently. The random movement model is a good model for expressing this independence of each node. However, it is insufficient to express the characteristics of all nodes with only random properties of individual nodes. This paper limits the stochastic mobility model applicable in MANET. we compare the proposed stochastic mobility model and the random mobility model. We confirm that the proposed mobility model is applied to the routing protocol to show improved characteristics in terms of energy consumption efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.571-576
• /
• 2013

Despite the development of the Internet, both in terms of technology and coverage, there are still remote areas and scenarios where connectivity is very difficult to achieve. Pocket Switched Network is a network paradigm that takes the advantage of human mobility to disseminate data. Factors such as mobility of nodes, link failures, discharged batteries, are among the challenges that may compromise connectivity in these networks. This paper presents a performance analysis of existing routing schemes for PSN in terms of delivery probability, overhead ratio, average latency and average residual energy when the number of nodes is increased. We seek to identify a scheme that maximizes data delivery while minimizing communication overhead and thus extending the network lifetime.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.163-169
• /
• 2016

To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

• Journal of Korea Water Resources Association
• /
• v.53 no.6
• /
• pp.437-450
• /
• 2020

This study presents a probabilistic distributed hydrological model for Ephemeral catchment, where zero flow often occurs due to the influence of distinct climate characteristics in South Korea. The gridded hydrological model is developed by combining the Sacramento Soil Moisture Accounting Model (SAC-SMA) runoff model with a routing model. In addition, an error model is employed to represent a probabilistic hydrologic model. To be specific, the hydrologic model is coupled with a censoring error model to properly represent the features of ephemeral catchments. The performance of the censoring error model is evaluated by comparing it with the Gaussian error model, which has been utilized in a probabilistic model. We first address the necessity to consider ephemeral catchments through a review of the extensive research conducted over the recent decade. Then, the Yongdam Dam catchment is selected for our study area to confirm the usefulness of the hydrologic model developed in this study. Our results indicate that the use of the censored error model provides more reliable results, although the two models considered in this study perform reliable results. In addition, the Gaussian model delivers many negative flow values, suggesting that it occasionally offers unrealistic estimations in hydrologic modeling. In an in-depth analysis, we find that the efficiency of the censored error model may increase as the frequency of zero flow increases. Finally, we discuss the importance of utilizing the censored error model when the hydrologic model is applied for ephemeral catchments in South Korea.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.563-568
• /
• 2007

This paper proposes a routing establishment method for improving path stability in mobile ad-hoc networks. In mobile ad-hoc networks, the network topology is highly dynamic due to the node mobility unlike wired networks. Since the existing methods are based on the shortest path algorithm with the minimum hop count regardless of the path stability, it could lead to packet loss and path disconnection in mobile ad-hoc networks. In particular, if control packets and critical data are transmitted on the unstable path, it causes serious problems. Therefore, this paper proposes one approach in order to minimize packet loss and path disconnection by considering the node mobility. After the destination node receives multiple RREQ messages, it selects the stable path through the proposed MinMax algorithm according to the node speed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.273-279
• /
• 2003

Hypercube multicomputers have been drawing considerable attention from many researchers due to their regular structure and short diameter. One of keys to the performance of Hypercube is the efficiency of communication among processors. Among several communication patterns, multicast is important, which is found in a variety of applications as data replication and signal processing. As the number of processors increases, the probability of occurrences of fault components also increases. So it would be desirable to design an efficient scheme that multicasts messages in the presence of faulty component. In fault-tolerant routing and multicast, there are local information based scheme, global information based scheme and limited information based scheme in terms of information. In general, limited information is easy to obtain and maintain by compressing information in a concise format. In this paper, we propose a new routing scheme and a new multicast scheme using recently proposed fully reachability information scheme and new local information scheme. The proposed multicast scheme increases multicast success possibility and reduce deroute cases. Experiments show that multicast success possibility can increase at least 15% compared to previous method.