• ETRI Journal
• /
• 제39권1호
• /
• pp.30-40
• /
• 2017

In this study, we investigate topology control as a means of obtaining the best possible compromise between the conflicting requirements of reducing energy consumption and improving network connectivity. A topology design algorithm capable of producing network topologies that minimize energy consumption under a minimum-connectivity constraint is presented. To this end, we define a new topology metric, called connectivity efficiency, which is a function of both algebraic connectivity and the transmit power level. Based on this metric, links that require a high transmit power but only contribute to a small fraction of the network connectivity are chosen to be removed. A connectivity-efficiency-based topology control (CETC) algorithm then assigns a transmit power level to each node. The network topology derived by the proposed CETC heuristic algorithm is shown to attain a better tradeoff between energy consumption and network connectivity than existing algorithms. Simulation results demonstrate the efficiency of the CECT algorithm.

• 대한교통학회지
• /
• 제28권6호
• /
• pp.167-177
• /
• 2010

본 연구에서는 교통물류거점의 네트워크 연계성 개선효과를 분석하기 위한 방법론을 제시하였다. 기존에 개발된 노드의 연계성 산출 모형을 사용하여 공급 연계성과 체감 연계성을 정의하였고, 교통물류거점의 네트워크 연계성 분석 범위와 분석 대상 노드 설정 알고리즘을 제시하였다. 또한 교통물류거점의 네트워크 연계성 개선효과 분석 과정을 체계화하였으며, 연계성 개선사업의 효과평가 방법 및 기준을 제시하였다. 방법론을 사례 연구에 적용한 결과 적절한 결과를 도출하였으며 전국 도로 네트워크에 실제 적용 가능하다고 판단된다. 교통물류거점의 네트워크 연계성 분석 결과 값들이 어느 정도 축적된 이후에는 네트워크 연계성의 서비스수준을 판단하기 위한 추가 연구가 필요하다.

• 제어로봇시스템학회논문지
• /
• 제19권12호
• /
• pp.1132-1137
• /
• 2013

In swarm robot systems, it is vital to maintain network connectivity to ensure cooperative behavior between robots. This paper deals with the behavior control algorithm of the swarm robots for maintaining network connectivity. To do this, we divide swarm robots into search-robots, base-robots, and relay-robots. Using these robots, we propose behavior control algorithm to maintain network connectivity. The behavior control algorithms to maintain network connectivity are proposed for the local path planning using virtual force and global path planning using the Delaunay triangulation, respectively. Finally, we demonstrate the effectiveness and applicability of the proposed method through some simulations.

• Journal of information and communication convergence engineering
• /
• 제11권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
• /
• 제4권3호
• /
• pp.161-169
• /
• 2002

Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

• 한국통신학회논문지
• /
• 제37B권9호
• /
• pp.767-777
• /
• 2012

Topology control increases channel efficiency by controlling transmission power of a node, and as a result, network lifetime and throughput are increased. However, reducing transmission range causes a network connectivity problem, especially in mobile networks. When a network loses connectivity, the network topology should be re-configured. However, topology re-configuration consumes lots of energy because every node need to collect neighbor information. As a result, network lifetime may decrease, even though topology control is being used to prolong the network lifetime. Therefore, network connectivity time needs to be increased to expend network lifetime in mobile networks. In this paper, we propose an Adaptive-Redundant Transmission Range (A-RTR) algorithm to address this need. A-RTR uses a redundant transmission range considering a node status and flexibly changes a node's transmission range after a topology control is performed.

• Communications for Statistical Applications and Methods
• /
• 제30권6호
• /
• pp.561-575
• /
• 2023

Brain network analysis has attracted the interest of neuroscience researchers in studying brain diseases. Magnetoencephalography (MEG) is especially proper for analyzing functional connectivity due to high temporal and spatial resolution. The application of graph theory for functional connectivity analysis has been studied widely, but research on network modeling for MEG still needs more. Temporal exponential random graph model (TERGM) considers temporal dependencies of networks. We performed the brain network analysis, including static/temporal network statistics, on two groups of epilepsy patients who removed the left (LT) or right (RT) part of the brain and healthy controls. We investigate network differences using Multiset canonical correlation analysis (MCCA) and TERGM between epilepsy patients and healthy controls (HC). The brain network of healthy controls had fewer temporal changes than patient groups. As a result of TERGM, on the simulation networks, LT and RT had less stable state than HC in the network connectivity structure. HC had a stable state of the brain network.

• Investigative Magnetic Resonance Imaging
• /
• 제15권2호
• /
• pp.110-122
• /
• 2011

목적 : 본 연구의 목적은 확산텐서영상에 기반하여 한국 아동 집단의 해부학적 뇌연결성 지도를 확립하고 뇌신경망의 효율성을 평가하는 기법을 개발하는 것이다. 대상 및 방법 : 건강한 아동 12명에서 얻은 확산텐서영상과 뇌구획영상을 바탕으로 구조 연결 행렬을 구하여 집단의 구조 연결성을 평가하였다. 일표본 t-검정을 시행하여 평균적인 구조 연결성을 파악하였고 이 때 얻은 각 피험자의 백질 다발을 표준공간으로 정규화하여 집단의 해부학적 뇌연결망 지도를 확립했다. 뇌신경망의 군집정도(clustering coefficient), 평균이동거리(characteristic path length), 전체/부분 연결망 효율성(global/local efficiency) 등 연결망 속성을 계산한 후 시각화 하였다. 결과 : 연결망 측면에서 한국 아동 집단의 뇌연결성이 작은세상속성을 가짐을 밝혔다. 또한 해부학적 뇌연결망 지도를 얻었는데 대뇌 반구 내의 연결성이 높게 나타남과 뇌간과 운동/감각 영역간에 많은 신경 연결이 집중되어 있음을 확인하였다. 결론 : 한국 아동 집단의 해부학적 뇌연결망 지도를 작성하는 방법론을 제시하여 뇌를 연결성 측면에서 이해하고 발달 장애와 성인 뇌신경망의 효율성을 평가할 수 있는 기본 도구를 확립하게되었다.

• ETRI Journal
• /
• 제37권2호
• /
• pp.262-272
• /
• 2015

In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2004년도 춘계학술발표회논문집
• /
• pp.477-482
• /
• 2004

Due to the traffic congestion of the city and public transportation-oriented policies, public transportation is receiving more attention and being used increasingly However, relatively less research on the design and distribution of public transportation network and limitations in quantitative approaches have made implementation and operation practically difficult. Over- or under-supply of transportation routes caused unbalanced connectivity among areas and differences in time, expenses and metal burden of users. On the other hand, the Space Syntax theory, designed to calculate the connectivity of urban or architectural space, helps generate quantitative connectivity of whole space simply based on the spacial structure. This study modified the original Space Syntax algorithm to fit the public transportation problem and showed how it is appied to a network by creating an artificial network using the GIS.