• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.141-148
• /
• 2012

This paper presents a simple but efficient scheme incorporating a reputation-based approach and a cross-layer approach, called the SIM scheme, for maintaining reliable connectivity and high performance in ad-hoc wireless networks. The SIM scheme incorporates the following two things: an ad-hoc routing scheme with a reputation-based approach exploiting the game theory concept based on an evolutionarily stable strategy, and a cross-layer approach between the network layer and the transport layer employing a reputation-based approach.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.974-977
• /
• 1999

In this paper, we have proposed the hardware architecture which implements the algorithm for retaining the connectivity which prevents disconnecting in the gray-scale image thinning To perform the image thinning in a real time which find a skeleton in image, it is necessary to examine the connectivity of the skeleton in a real time. The proposed architecture finds the connectivity number in the 4-clock period. The architecture is consists of three blocks, PS(Parallel to Serial) Converter and State Generator and Ridge Checker. The PS Converter changes the 3$\times$3 gray level image to four sets of image pixels. The State Generator examine the connectivity of the central pixel by searching the data from the PS Converter. the 3$\times$3 gray level image determines. The Ridge Checker determines whether the central pixel is on the skeleton or not The proposed architecture finds the connectivity of the central pixel in a 3$\times$3 gray level image in the 4-clocks. The total circuits are verified by the design tools and operate correctly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1306-1312
• /
• 2017

The route request (RREQ) packet is selectively re-broadcasted in the routing protocols that improve the broadcast storm problem of the ad-hoc on-demand routing protocol (AODV). However, in a low node density scenario, the connectivity of these selective rebroadcast schemes becomes less than that of the AODV. In order to clarify the requirements of these selective re-broadcast routing protocols, it is necessary to investigate the relationship between the node density and the connectivity. In this paper, we drive a probability to preserve the connectivity of the GAODV at an intermediate rebroadcast node. In addition, we present an intuitive method to approximate the end-to-end connectivity of the GAODV. We draw the required node density to guarantee the connectivity of 0.9 and 0.99 through computer simulations, and verify the validity of the derived theoritical connectivity by comparing with the simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1152-1159
• /
• 2010

Wireless Mesh Networks (WMNs) provides Internet accesses to users by forming backbone networks via wireless links. A key problem of WMN is network capacity. For this, multi-channel and multi-rate functions of IEEE 802.11 can be utilized. Depending on channel assignments, multi-channel determines node connectivity and channel diversity. Also, in IEEE 802.11 multi-rate networks, the rate anomaly problem occurs, the phenomenon that low-rate links degrades the performance of high-rate links. In this paper, we propose rate separating multi-channel (RSMC) protocols that improves the node connectivity and channel diversity, and mitigates the rate anomaly problem. RSMC increases the channel diversity by forming tree-based WMNs and decreases the rate anomaly by separating different rate links on the tree via channels. In addition, it uses network connectivity (NC) algorithm to increase the node connectivity. Through simulations, we demonstrate that the RSMC shows improved performance than existing multi-channel protocols in terms of aggregate throughput, node connectivity, channel diversity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2338-2356
• /
• 2019

Vehicular ad-hoc network (VANET) is the name of technology, which uses 'mobile internet' to facilitate communication between vehicles. The aim is to ensure road safety and achieve secure communication. Therefore, the reliability of this type of networks is a serious concern. The reliability of VANET is dependent upon proper communication between vehicles within a given amount of time. Therefore a new formula is introduced, the terms of the new formula correspond 1 by 1 to a class special ST route (SRORT). The new formula terms are much lesser than the Inclusion-Exclusion principle. An algorithm for the Source-to-Terminal reliability was presented, the algorithm produced Source-to-Terminal reliability or computed a Source-to-Terminal reliability expression by calculating a class of special networks of the given network. Since the architecture of this class of networks which need to be computed was comparatively trivial, the performance of the new algorithm was superior to the Inclusion-Exclusion principle. Also, we introduce a mobility metric called universal speed factor (USF) which is the extension of the existing speed factor, that suppose same speed of all vehicles at every time. The USF describes an exact relation between the relative speed of consecutive vehicles and the headway distance. The connectivity of vehicles in different mobile situations is analyzed using USF i.e., slow mobility connectivity, static connectivity, and high mobility connectivity. It is observed that $p_c$ probability of connectivity is directly proportional to the mean speed ${\mu}_{\nu}$ till specified threshold ${\mu}_{\tau}$, and decreases after ${\mu}_{\tau}$. Finally, the congested network is connected strongly as compared to the sparse network as shown in the simulation results.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.26-32
• /
• 2014

Vehicular-to-anything (V2X) technology is attractive for wireless vehicular ad-hoc networks (VANETs) because it allows for opportunistic choice of a vehicular protocol between vehicular-to-vehicular (V2V) and vehicular-to-infrastructure (V2I) communications. In particular, achieving seamless connectivity in a VANET with nearby network infrastructure is challenging. In this paper, we propose a density-based opportunistic broadcasting (DOB) protocol, in which opportunistic connectivity is carried out by using the nearby infrastructure and opposite vehicles for solving the problems of disconnection and long end-to-end delay times. The performance evaluation results indicate that the proposed DOB protocol outperforms the considered comparative conventional schemes, i.e., the shortest path protocol and standard mobile WiMAX, in terms of the average end-to-end delay, packet delivery ratio, handover latency, and number of lost packets.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.662-664
• /
• 2011

무선 센서 네트워크에서 관심지역이 각 센서에 의하여 얼마나 잘 센싱되는지의 정도에 대한 커버리지(coverage)와 센서에 의하여 센싱된 데이터를 싱크노드까지 얼마나 잘 전달될 수 있는지의 정도에 관한 연결성(connectivity)은 중요한 연구 분야이다. 이와 관련하여 본 논문에서는 센서 네트워크에서 p-coverage와 q-connectivity ($q{\leq}6$)를 만족하는 최적의 센서 배치패턴 문제에 관한 연구 결과를 기술한다. 특히, 1-coverage의 경우 최적이라 알려진 삼각 격자 패턴에 대하여 p-coverage와 6-connectivity을 만족하도록 하는 배치 방법을 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3572-3593
• /
• 2015

This article investigates the topology control problem in the space information network (SIN) using a hierarchical autonomous system (AS) approach. We propose an AS network topology control (AS-TC) algorithm to minimize the time delay in the SIN. Compared with most existing approaches for SIN where either the purely centralized or the purely distributed control method is adopted, the proposed algorithm is a hybrid control method. In order to reduce the cost of control, the control message exchange is constrained among neighboring sub-AS networks. We prove that the proposed algorithm achieve logical k-connectivity on the condition that the original physical topology is k-connectivity. Simulation results validate the theoretic analysis and effectiveness of the AS-TC algorithm.

• Journal of the Ergonomics Society of Korea
• /
• v.33 no.5
• /
• pp.377-386
• /
• 2014

Objective: In this study, we used resting-state fMRI data to map differences in functional connectivity between a comprehensive set of 8 distinct cortical and subcortical brain regions in healthy controls and Internet addicts. We also investigated the relationship between resting state connectivity strength and the level of psychopathology (ex. score of internet addiction scale and score of Barratt impulsiveness scale). Background: There is a lot of evidence of relationship between Internet addiction and impaired inhibitory control. Clinical evidence suggests that Internet addicts have a high level of impulsivity as measured by behavioral task of response inhibition and a self report questionnaire. Method: 15 Internet addicts and 15 demographically similar non-addicts participated in the current resting-state fMRI experiment. For the connectivity analysis, regions of interests (ROIs) were defined based on the previous studies of addictions. Functional connectivity assessment for each subject was obtained by correlating time-series across the ROIs, resulting in $8{\times}8$ matrixs for each subject. Within-group, functional connectivity patterns were observed by entering the z maps of the ROIs of each subject into second-level one sample t test. Two sample t test was also performed to examine between group differences. Results: Between group, the analysis revealed that the connectivity in between the orbito frontal cortex and inferior parietal cortex, between orbito frontal cortex and putamen, between the orbito frontal cortex and anterior cingulate cortex, between the insula and anterior cingulate cortex, and between amydgala and insula was significantly stronger in control group than in the Internet addicts, while the connectivity in between the orbito frontal cortex and insula showed stronger negative correlation in the Internet addicts relative to control group (p < 0.001, uncorrected). No significant relationship between functional connectivity strength and current degree of Internet addiction and degree of impulsitivy was seen. Conclusion: This study found that Internet addicts had declined connectivity strength in the orbitofrontal cortex (OFC) and other regions (e.g., ACC, IPC, and insula) during resting-state. It may reflect deficits in the OFC function to process information from different area in the corticostriatal reward network. Application: The results might help to develop theoretical modeling of Internet addiction for Internet addiction discrimination.