• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.141-156
• /
• 2011

In this paper we develop a link cost function for data delivery in sensor network. Usually most conventional methods determine the optimal coefficients in the cost function without considering the surrounding environment of the node such as the wireless propagation environment or the topological environment. Due to this reason, there are limitations to improve the quality of data delivery such as data delivery ratio and delay of data delivery. To solve this problem, we derive a new cost function using the concept of Partially Connected Neural Network (PCNN) which is modeled according to the input types whether inputs are correlated or uncorrelated. The correlated inputs are connected to the hidden layer of the PCNN in a coupled fashion but the uncoupled inputs are in an uncoupled fashion. We also propose the training technique for finding an optimal weight vector in the link cost function. The link cost function is trained to the direction that the packet transmission success ratio of each node maximizes. In the experimental section, we show that our method outperforms other conventional methods in terms of the quality of data delivery and the energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.147-169
• /
• 2024

In pace with the development of network technology at lightning speed, social networks have been extensively applied in our lives. However, as social networks retain a large number of users' sensitive information, the openness of this information makes social networks vulnerable to attacks by malicious attackers. To preserve the link privacy of individuals in social networks, an uncertain graph method based on node random response is devised, which satisfies differential privacy while maintaining expected data utility. In this method, to achieve privacy preserving, the random response is applied on nodes to achieve edge modification on an original graph and node differential privacy is introduced to inject uncertainty on the edges. Simultaneously, to keep data utility, a divide and conquer strategy is adopted to decompose the original graph into many sub-graphs and each sub-graph is dealt with separately. In particular, only some larger sub-graphs selected by the exponent mechanism are modified, which further reduces the perturbation to the original graph. The presented method is proven to satisfy differential privacy. The performances of experiments demonstrate that this uncertain graph method can effectively provide a strict privacy guarantee and maintain data utility.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.147-163
• /
• 1994

This paper presents three methods of generating the transportation network data out of the topological geographic database in the hope that the conversion of the geographic database file containing the topology to the conventional node-link type trans¬portation network file may facilitate the integration between transportation planning mod¬els and GIS by alleviating the inherent problems of both computing environments. One way of the proposed conversion method is to use the conversion software that allows the bi-directional conversion between the UTPS (Urban Transportation Planning System) type transportation planning model and GIS. The other two methods of data structure conversion approach directly transform the GIS's user-level topology into the transportation network data topology, and have been introduced with codes programmed with FORTRAN and AML (Arc Macro Language) of ARC/INFO. If used successfully, any approach would not only improve the efficiency of transportation planning process and the associated decision-making activities in it, but enhance the productivity of trans¬portation planning agencies.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.69-81
• /
• 2013

Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.31-37
• /
• 2013

Mobile ad hoc networks (MANET) refers to a network designed for special applications for which it is difficult to use a backbone network. In MANETs, applications are mostly involved with sensitive and secret information. Since MANET assumes a trusted environment for routing, security is a major issue. In this paper we analyze the vulnerabilities of a pro-active routing protocol called optimized link state routing (OLSR) against a specific type of denial-of-service (DOS) attack called node isolation attack. Analyzing the attack, we propose a mechanism called enhanced OLSR (EOLSR) protocol which is a trust based technique to secure the OLSR nodes against the attack. Our technique is capable of finding whether a node is advertising correct topology information or not by verifying its Hello packets, thus detecting node isolation attacks. The experiment results show that our protocol is able to achieve routing security with 45% increase in packet delivery ratio and 44% reduction in packet loss rate when compared to standard OLSR under node isolation attack. Our technique is light weight because it doesn't involve high computational complexity for securing the network.

• Journal of Korea Water Resources Association
• /
• v.40 no.4
• /
• pp.313-324
• /
• 2007

An irregular cell-based numerical model was developed to analyze underground space flooding. In this model, the flow characteristics in underground space were computed by link-node system. Also, the model can simulate the underground flood flow related to the influence of stairs and wall-structures. Empirical discharge formula were introduced to analyze weir-type flow for shopping mall, and channel-type flow for subway railroad respectively. The simulated results matched in reasonable range compared with the observed depth. The dual-drainage inundation analysis model and the underground space flood analysis model were integrated using visual basic application of ArcGIS system. The developed model can help the decision support system of flood control authority for redesigning and constructing flood prevention structures and making the potential inundation zone, and establishing flood-mitigation measures.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.265-275
• /
• 2023

The purpose of this paper is to devise an optimal route allocation algorithm for automated vehicle(AV) in monitoring quality of road infrastructure to support the road safety. The tasks of an AV in this paper include visiting node-links at least once during its operation and checking status of road infrastructure, and coming back to its depot.. In selecting optimal route, its priority goal is visiting the node-links with higher risks while reducing costs caused by operation. To deal with the problem, authors devised reward maximizing algorithm for AVs. To check its validity, the authors developed simple toy network that mimic node-link networks and assigned costs and rewards for each node-link. With the toy network, the reward maximizing algorithm worked well as it visited the node-link with higher risks earlier then chinese postman route algorithm (Eiselt, Gendreau, Laporte, 1995). For further research, the reward maximizing algorithm should be tested its validity in a more complex network that mimic the real-life.

• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.2
• /
• pp.50-61
• /
• 2022

This work demonstrates the design and evaluation of Aqua-Aware, a lightweight miniaturized light emitting diode (LED) based underwater compact sensor node which is used to obtain different characteristics of the underwater environment. Two optical sensor nodes have been designed, developed, and evaluated for a short and medium link range called as Aqua-Aware short range (AASR) and Aqua-Aware medium range (AAMR), respectively. The hardware and software implementation of proposed sensor node, algorithms, and trade-offs have been discussed in this paper. The underwater environment is emulated by introducing different turbulence effects such as air bubbles, waves and turbidity in a 4-m water tank. In clear water, the Aqua-Aware achieved a data rate of 0.2 Mbps at communication link up to 2-m. The Aqua-Aware was able to achieve 0.2 Mbps in a turbid water of 64 NTU in the presence of moderate water waves and air bubbles within the communication link range of 1.7-m. We have evaluated the luminous intensity, packet success rate and bit error rate performance of the proposed system obtained by varying the various medium characteristics.