• 제목/요약/키워드: link connectivity

검색결과 110건 처리시간 0.029초

전술 모바일 애드혹 네트워크에서 무인기를 이용하는 이동 예측 기반의 데이터 링크 연결 유지 알고리즘 (Mobility Prediction Based Autonomous Data Link Connectivity Maintenance Using Unmanned Vehicles in a Tactical Mobile Ad-Hoc Network)

  • 르반둑;윤석훈
    • 한국통신학회논문지
    • /
    • 제38B권1호
    • /
    • pp.34-45
    • /
    • 2013
  • 자가구성 능력을 가진 전술모바일애드혹 네트워크는 기간망을 사용할 수 없는 전술환경에서 단위전술부대와 중앙지휘소와의 통신연결을 제공하기 위해 사용된다. 하지만, 작전 전술부대가 임무수행을 위해 중앙지휘소로부터 장거리 위치로 이동하거나 지형적 장애물이 있는 경우에는 통신단말간 데이터링크가 단절되어 전술부대로부터 지휘소까지의 데이터 경로가 유효하지 않을 수 있다. 이러한 문제를 해결하기 위하여 본 논문에서는 ADLCoM(Autonomous Data Link Connectivity Maintenance) 구조를 제안한다. ALDCoM하에서 각 전술그룹단위는 하나이상의 GW 노드 (게이트웨이)를 갖으며 GW 노드들은 전술부대 및 지휘소 간의 데이터 링크상태를 지속적으로 확인한다. 만약 데이터링크가 단절될 가능성이 높다면 하나이상의 육상 또는 공중 무인기를 데이터링크를 위한 릴레이로서 동작하도록 요청하여 전술 부대 및 지휘소간, 또는 전술 부대간의 데이터링크의 연결을 지속적으로 유효하게 유지 시킨다. 전술환경을 모의한 시뮬레이션을 통하여 ADLCoM구조가 전술모바일애드혹망의 성능을 현저히 높일 수 있음을 보인다.

Localized Algorithm to Improve Connectivity and Topological Resilience of Multi-hop Wireless Networks

  • Kim, Tae-Hoon;Tipper, David;Krishnamurthy, Prashant
    • 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.

MANET에서 경로 연속성 증대방안에 대한 연구 (A Threshold based Connectivity Enhancement Scheme for Mobile Ad-hoc Networks)

  • 장윤철;박상준;김병기
    • 한국정보과학회논문지:정보통신
    • /
    • 제32권2호
    • /
    • pp.215-219
    • /
    • 2005
  • Ad-hoc 네트워크 내의 무선 이동 노드들은 일반적으로 전원 용량이 충분하지 않기 때문에 통신 중의 전원관리가 매우 중요하다. 이러한 전력 소모를 고려한 프로토콜로 MTPR, MBCR, MMBCR, CMMBCR 등이 제안되어 있으나, 전송 중 중간노드가 방전되어 링크가 단절되는 현상은 고려하지 못하고 있다. 따라서 경로의 연속성을 보장하기에는 미흡하다. 본 논문에서는 경로의 연속성을 증대하기 위한 세 가지 방안을 제안한다. 신호 세기가 임계치 이하인 경우 사전에 대체 경로를 설정하여 링크 단절에 대비한다. 전원용량이 임계치 이하로 떨어지는 경우에도 이를 미리 알려 대체 경로를 설정한다. 또한 멀티채널상의 중간 노드는 잔여 용량과 신규 링크 설정 요청에 필요한 전력을 비교하여 선택적으로 허락함으로써 중간 노드의 수명을 연장시키는 방안을 제안한다. 시뮬레이션 결과를 통하여 제안된 방안이 경로 연속성을 강화시키며, 신뢰적인 연결 관리에 의하여 지연 시간을 줄이는 성능 향상을 보였다.

Connectivity Analysis of Cognitive Radio Ad-hoc Networks with Shadow Fading

  • Dung, Le The;An, Beongku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권9호
    • /
    • pp.3335-3356
    • /
    • 2015
  • In this paper, we analyze the connectivity of cognitive radio ad-hoc networks in a log-normal shadow fading environment. Considering secondary user and primary user's locations and primary user's active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio ad-hoc networks in three aspects and compare with the connectivity of ad-hoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multi-hop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio ad-hoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user's density and primary user's average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user's average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio ad-hoc networks in practical wireless environment.

Improving the Performance of Multi-Hop Wireless Networks by Selective Transmission Power Control

  • Kim, Tae-Hoon;Tipper, David;Krishnamurthy, Prashant
    • Journal of information and communication convergence engineering
    • /
    • 제13권1호
    • /
    • pp.7-14
    • /
    • 2015
  • In a multi-hop wireless network, connectivity is determined by the link that is established by the receiving signal strength computed by subtracting the path loss from the transmission power. Two path loss models are commonly used in research, namely two-ray ground and shadow fading, which determine the receiving signal strength and affect the link quality. Link quality is one of the key factors that affect network performance. In general, network performance improves with better link quality in a wireless network. In this study, we measure the network connectivity and performance in a shadow fading path loss model, and our observation shows that both are severely degraded in this path loss model. To improve network performance, we propose power control schemes utilizing link quality to identify the set of nodes required to adjust the transmission power in order to improve the network throughput in both homogeneous and heterogeneous multi-hop wireless networks. Numerical studies to evaluate the proposed schemes are presented and compared.

환경친화적인 도시공원녹지계획 연구 - 생물서식처 연결성 향상을 위한 서울시 녹지조성 방안을 중심으로 - (Environment Friendly Urban Open Space Planning - Enhancing the Connectivity of Habitats in Seoul, Korea -)

  • 안동만;김명수
    • 한국조경학회지
    • /
    • 제31권1호
    • /
    • pp.34-41
    • /
    • 2003
  • Connectivity is a quantitative indicator of landscape structure, and connectivity of urban green areas is an indicator of ecological integrity in urban landscapes. The purposes of this study are to assess the connectivity of urban green areas in Seoul, and to develop a method of siting new green areas for better connectivity. Diverse methods for connectivity assessment and indices of connectivity are reviewed and applied to the connectivity assesment of green areas in Seoul. The indices of connectivity of green areas in Seoul turned out to be higher than expected, maybe because many of them are rather evenly distributed, serving as stepping stones, and because there are many riparian corridors, including the Han River. Analysis also shows the optimum location of new green space patches or corridors will be those spots that would link the mainland, or large green areas outside the city, and existing green areas in the city. Restoration of urban streams as ecological corridors will significantly enhance connectivity. Three different scenarios with increasing numbers of new green areas in the city were then prepared. The changes of connectivity were measured and the possible success rates of animal dispersal were simulated. The results revealed that restoration of streams will increase the connectivity and success rates of animal dispersal.

Dynamic Reverse Route for On-Demand Routing Protocol in MANET

  • Zuhairi, Megat;Zafar, Haseeb;Harle, David
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권5호
    • /
    • pp.1354-1372
    • /
    • 2012
  • Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

Seamless Routing and Cooperative Localization of Multiple Mobile Robots for Search and Rescue Application

  • Lee, Chang-Eun;Im, Hyun-Ja;Lim, Jeong-Min;Cho, Young-Jo;Sung, Tae-Kyung
    • 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.

Architectures and Connection Probabilities forWireless Ad Hoc and Hybrid Communication Networks

  • Chen, Jeng-Hong;Lindsey, William C.
    • 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).

A Study of Connectivity in MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, H.;Jafarkhani, H.;Kazemitabar, J.
    • Journal of Communications and Networks
    • /
    • 제11권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.