• International Journal of Advanced Culture Technology
• /
• v.11 no.1
• /
• pp.395-402
• /
• 2023

The implementation of a hybrid network utilizing Power Line Communication (PLC) and Wi-Fi technologies has been demonstrated to improve signal strength and coverage in areas with poor connectivity due to internet shadow areas. In this study we strategically positioned Wi-Fi relays and utilized the capabilities of PLC technology to significantly improve signal strength and coverage in areas with poor connectivity. We also analyzed the effects of metallic obstacles on Wi-Fi signal propagation and proposed a solution to strengthen the signal enough to pass through them. Our experiment demonstrated the feasibility and potential of using this hybrid network in industrial scenarios for real-time data transmission. Overall, the results suggest that the use of PLC and Wi-Fi hybrid networks can be a cost-effective and efficient solution for overcoming internet connectivity challenges and has the potential to provide high-speed internet access to areas with unreliable signals.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.1-10
• /
• 2007

In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.

• Korea Trade Review
• /
• v.44 no.6
• /
• pp.267-283
• /
• 2019

This study analyzes how the port connectivity network has changed with the restructuring of the liner shipping alliance and explores the impact of these changes on network characteristics using social network analysis (SNA). While due to economies of scale, the scale of ports and liner shipping has expanded, the goal of shipping companies has changed to achieve cost-effectiveness due to the diseconomies of scale. Such changes in the environment have greatly affected ports according to the strategies of major liner alliances, and port centrality has shifted in response to restructuring in strategic alliances. This research confirmed that port centrality has continuously changed, and the reason for this phenomenon was analyzed through the derived main network centrality indices. This finding provides significant implications for port authorities and terminal operators to consider different perspectives when planning for sustainable growth and management.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

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

We present several distributed algorithms for localizing nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.344-350
• /
• 2009

In this paper, we propose a new interconnection network, hierarchical odd network HON($C_d,C_d$), which used the odd network as basic modules. We investigate various topological properties of HON($C_d,C_d$), including connectivity, routing algorithm, diameter and broadcasting. We show that HON($C_d,C_d$) outperforms the three networks, i.e. the odd network, HCN(m,m), and HFN(m,m).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.778-786
• /
• 2012

Sensors that are used on wireless sensor networks can be divided into two types: directional sensors, such as PIR, image, and electromagnetic sensors; and non-directional sensors, such as seismic, acoustic and magnetic sensors. In order to guarantee the line-of-sight of a directional sensor, the installation location of the sensor must be higher than ground level. Among non-directional sensors, seismic sensors should be installed on the ground in order to ensure the maximal performance. As a result, seismic sensors may have network connectivity problems due to communication failure. In this paper, we propose a 3D node deployment method to maximize the coverage and the network connectivity considering the sensor-specific properties. The proposed method is for non-directional sensors to be placed on the ground, while the directional sensor is installed above the ground, using trees or poles, to maximize the coverage. As a result, through the topology that the detection data from non-directional sensors are transmitted to the directional sensor, we can maximize the network connectivity. Simulation results show that our strategy improves sensor coverage and network connectivity.

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

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.34-45
• /
• 2013

Due to its self-configuring nature, the tactical mobile ad hoc network is used for communications between tactical units and the command and control center (CCC) in battlefields, where communication infrastructure is not available. However, when a tactical unit moves far away from the CCC or there are geographical constraints, the data link between two communicating nodes can be broken, which results in an invalid data route from the tactical units to CCC. In order to address this problem, in this paper we propose a hierarchical connectivity maintenance scheme, namely ADLCoM (Autonomous Data Link Connectivity Maintenance). In ADLCoM, each tactical unit has one or more GW (gateway), which checks the status of data links between tactical units. If there is a possibility of link breakage, GWs request ground or aerial unmanned vehicles to become a relay for the data link. The simulation results, based on tactical scenarios, show that the proposed scheme can significantly improve the network performance with respect to data delivery ratio.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.47-56
• /
• 2009

We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.