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

• Journal of Environmental Impact Assessment
• /
• v.22 no.3
• /
• pp.219-230
• /
• 2013

Species distribution modeling is one of the most effective habitat analysis methods for wildlife conservation. This study was for evaluating the suitability of species distribution to distance between forest patches in Seoul city using tits. We analyzed the distribution of the four species of tits: varied tit (Parus varius), marsh tit (P. palustris), great tit (P. major) and coal tit (P. ater), using the landscape indexes and connectivity indexes, and compared the resulting suitability indexes from 100m to 1,000m. As factors affecting to the distribution of tits, we calculated landscape indices by separating them into intra-patch indices (i.e. logged patch area (PA), area-weighted mean patch shape index (PSI), tree rate (TR)) and inter-patch indices (i.e. patch degree (PD), patch betweenness (PB), difference probability of connectivity (DPC)), to analyze the internal properties of the patches and their connectivity by tits occurrence data using logistic regression modeling. The models were evaluated by AICc (Akaike Information Criteria with a correction for finite sample sizes) and AUC (Area Under Curve of ROC). The results of AICc and AUC showed DPC, PA, PSI, and TR were important factors of the habitat models for great tit and marsh tit at the level of distance 500~800m. In contrast, habitat models for coal tit and varied tit, which are known as forest interior species, reflected PA, PSI, and TR as intra-patch indices rather than connectivity. These mean that coal tit and varied tit are more likely to find a large circular forest patch than a small and long-shaped forest patch, which are higher rate of forest. Therefore, different strategies are required in order to enhance the habitats of the forest birds, tits, in a region that has fragmented forest patches such as Seoul city. It is important to manage forest interior areas for coal tit and varied tit, which are known as forest interior species and to manage not only forest interior areas but also connectivity of the forest patches in the threshold distance for great tit and marsh tit as adapted species to the urban ecosystem for sustainable ecosystem management.

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

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2009.06a
• /
• pp.186-186
• /
• 2009

The characterization strategy of fracture networks are classified into a deterministic or statistical characterization according to the type of required information. A deterministic characterization is most efficient for a sparsely fractured system, while the statistics are sufficient for densely fractured rock. In this study, the ensemble mean and variability of the effective connectivity is systematically analyzed with various density values for different network structures of a power law size distribution. The results of high resolution Monte Carlo analyses show that statistical characteristics can be a necessary information to determine the transport properties of a fracture system when fracture density is greater than a percolation threshold. When the percolation probability (II) approaches unity with increasing fracture density, the effective connectivity of the network can be safely estimated using statistics only (sufficient condition). It is inferred from conditional simulations that deterministic information for main pathways can reduce the uncertainty in estimation of system properties when the network becomes denser. Overall results imply that most pathways need to be identified when II < 0.5 statistics are sufficient when II $\rightarrow$ 1 and statistics are necessary and the identification of main pathways can significantly reduce the uncertainty in estimation of transport properties when 0.5$\ll$1. It is suggested that the proper estimation of the percolation probability of a fracture network is a prerequisite for an appropriate conceptualization and further characterization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5014-5034
• /
• 2016

This paper discusses how to effectively guarantee the coverage and connectivity quality of wireless sensor networks when joint perception model is used for the nodes whose communication ranges are multi-level adjustable in the absence of position information. A Connect Coverage Algorithm Based on Joint Sensing model (CCAJS) is proposed, with which least working nodes are chosen based on probability model ensuring the coverage quality of the network. The algorithm can balance the position distribution of selected working nodes as far as possible, as well as reduce the overall energy consumption of the whole network. The simulation results show that, less working nodes are needed to ensure the coverage quality of networks using joint perception model than using the binary perception model. CCAJS can not only satisfy expected coverage quality and connectivity, but also decrease the energy consumption, thereby prolonging the network lifetime.

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

• BMB Reports
• /
• v.51 no.8
• /
• pp.369-370
• /
• 2018

In previous studies, memory storage was localized to engram cells distributed across the brain. While these studies have provided an individual cellular profile of engram cells, their synaptic connectivity, or whether they follow Hebbian mechanisms, remains uncertain. Therefore, our recent study investigated whether synapses between engram cells exhibit selectively enhanced structural and functional properties following memory formation. This was accomplished using a newly developed technique called "dual-eGRASP". We found that the number and size of spines on CA1 engram cells that receive inputs from CA3 engram cells were larger than at other synapses. We further observed that this enhanced connectivity correlated with induced memory strength. CA3 engram synapses exhibited increased release probability, while CA1 engram synapses produced enhanced postsynaptic responses. CA3 engram to CA1 engram projections showed strong occlusion of long-term potentiation. We demonstrated that the synaptic connectivity of CA3 to CA1 engram cells was strengthened following memory formation. Our results suggest that Hebbian plasticity occurs during memory formation among engram cells at the synapse level.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.200-203
• /
• 1995

This paper proposes a spoken Korean processing model which is extensible to large vocabulary continuous spoken Korean system. The integration of phoneme level speech recognition with natural language processing can support a sophisticated phonological/morphological analysis. The model consists of a diphone speech recognizer, a viterbi dictionaly searcher and a morpheme connectivity information checker. Two-level hierarchical TDNNs recognize newly defined Korean diphones. The diphone sequences are segmented and converted to the most probable morpheme sequences by the Viterbi dictionary searcher. The morpheme sequency are then examined by the morpheme connectivity information checker and the correct morpheme sequence which has the greatest probability is collected. The experiments show that the morphological analysis for spoken Korean can be achieved for 328 Eojeols with 80.6% success rate.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.535-539
• /
• 2007

We study an degree of alternativeness and a survivability of alternate routing algorithm in mobile ad-hoc tactical communication networks. The common channel signaling scheme is used and flood search routing algorithm is used for analysis. We also study a connectivity performance for flood search routing, restricted flooding and hybrid routing. From the results we expect low blocking probabilities with alternate routing and the conventional flood search routing shows better connectivity performance which results in high survivability.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.191-195
• /
• 2013

This paper proposes an automatic method for discovering cross-lingual links from English Wikipedia documents to Korean ones in order to increase connectivity among vast web resources. Compared to the existing methods roughly estimating link probability of phrases, candidate anchors are selected from English documents by using various information such as title lists and linking probability extracted from Wikipedia dumps and the results of named-entity recognition, and the anchors are translated into Korean words, and then the most suitable Korean documents with the words are selected as cross-lingual links. The experimental results showed 0.375 of MAP.