• 제목/요약/키워드: Link-Node

검색결과 624건 처리시간 0.024초

A Mesh Router Placement Scheme for Minimizing Interference in Indoor Wireless Mesh Networks (실내 무선 메쉬 네트워크에서의 간섭 최소화를 위한 메쉬 라우터 배치 기법)

  • Lee, Sang-Hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • 제16권4호
    • /
    • pp.421-426
    • /
    • 2010
  • Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

An analysis on the development of a new multicasting method for telecommunication networking (텔레커뮤니케이션 네트워크상 멀티캐스팅 신기술 개발 분석)

  • Cho, Myeong-Rai
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • 제5권3호
    • /
    • pp.27-45
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

TCP Performance Study in Vertical Handoff across Heterogeneous Wireless Networks (이질적 무선망 사이의 수직적 핸드오프에서의 TCP 성능 분석)

  • Pack Sangheon;Choi Yanghee
    • Journal of KIISE:Information Networking
    • /
    • 제32권1호
    • /
    • pp.20-28
    • /
    • 2005
  • TCP(Transmission Control Protocol) is one of the most important Internet protocols, which is widely used in wireless networks as well as wired networks. However, when TCP is deployed for wireless networks, it takes severe performance degradation because TCP was designed for wired network. To overcome this drawback, a number of TCP variants have been proposed in the literature. However, most previous schemes did not consider TCP enhancement over heterogeneous networks. In heterogeneous networks, an mobile node (MN) may move from one access network to another(i.e., vertical handover). In the case of vertical handover, an MN experiences a TCP performance degradation caused by the packet loss and the sudden change of link characteristics between two different access networks. In this work, we investigate the TCP performance degradation occurred in vortical handover across heterogeneous networks. First, we have conducted the measurement study over GPRS-WLAN testbed. In the measurement study. we observed the TCP performance degradation in the case of handover from WLAN to GPRS. In order to study more different TCP behaviors during vertical handover, we performed comprehensive simulations using a network simulator 2(ns-2). Based on measurement and simulation results, we investigated how to improve TCP performance in vertical handover and we concluded that the existing mechanisms cannot be perfect solutions and new mechanisms are strongly required.

Hypermedia, Multimedia and Hypertext: Definitions and Overview (하이퍼미디어.멀티미디어.하이퍼텍스트: 정의(定義)와 개관(槪觀))

  • Kim, Ji-Hee
    • Journal of Information Management
    • /
    • 제25권1호
    • /
    • pp.24-46
    • /
    • 1994
  • In this paper I will discuss definitions of hypermedia, multimedia and hypertext. Hypertext is the grouping of relevant information in the form of nodes. These nodes are then connected together through links. In the case of hypertext the nodes contain text or graphics. Multimedia is the combining of different media types for example sound, animation, text, graphics and video for the presentation of information by making use of computers. Hypermedia can be viewed as an extension of hypertext and multimedia. It is based on the concept of hypertext that uses nodes and links in the structuring of information in the system. In this case the nodes consist of an the different data types that are mentioned in the multimedia definition above. The 'node-and-link' concept is used in organisation of the information in hypermedia systems. The 'book' metaphor is an example of the way these systems are implemented. This concept is explained and a few advantages and disadvantages of making use of hypermedia systems are discussed. A new approach for the development of hypermedia systems, namely the knowledge-based approach is now looked into. Joel Peing-Ling Loo proposed this approach because he thought that it is the most effective way for handling this kind of technology. A semantic-based hypermedia model is developed in this approach to formulate solutions for the restrictions in presenting information authoring, maintenance and retrieval. The knowledge-based presentation of information includes the use of conventional data structures. These data structures make use of frames(objects), slots and the inheritance theory that is also used in expert systems. Relations develop between the different objects as these objects are included in the database. Relations can also exist between frames by means of attributes that belong to the frames.

  • PDF

Development of Integrated Accessibility Measurement Algorithm for the Seoul Metropolitan Public Transportation System (서울 대도시권 대중교통체계의 통합 시간거리 접근성 산출 알고리즘 개발)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Korean Regional Science Association
    • /
    • 제33권1호
    • /
    • pp.29-41
    • /
    • 2017
  • This study proposes an integrated accessibility measurement algorithm, which is applied to the Seoul Metropolitan public transportation system consisting of bus and subway networks, and analyzes the result. We construct a public transportation network graph linking bus-subway networks and take the time distance as the link weight in the graph. We develop a time-distance algorithm to measure the time distance between each pair of transit stations based on the T-card transaction database. The average travel time between nodes has been computed via the shortest-path algorithm applied to the time-distance matrix, which is obtained from the average speed of each transit route in the T-card transaction database. Here the walking time between nodes is also taken into account if walking is involved. The integrated time-distance accessibility of each node in the Seoul Metropolitan public transportation system has been computed from the T-card data of 2013. We make a comparison between the results and those of the bus system and of the subway system, and analyze the spatial patterns. This study is the first attempt to measure the integrated time-distance accessibility for the Seoul Metropolitan public transportation system consisting of 16,277 nodes with 600 bus routes and 16 subway lines.

Analysis and Evaluation on the Location of Gu-Office Facility using Geographic Information System : The case of Mapo Gu-Office in Seoul (GIS 기법을 이용한 구청사 입지분석 및 타당성 검토)

  • Huh, Jun;Jang, Hoon;Lee, Hyun-Suk
    • 한국지형공간정보학회:학술대회논문집
    • /
    • 한국지형공간정보학회 2004년도 추계학술발표대회 논문집
    • /
    • pp.5-10
    • /
    • 2004
  • The purpose of this research is to measure a gravitational attraction about urban pulbic service facilities and to evaluate the location of public service facilities. It is important in that these facilities should provide more inexpensive and convenience public service to users. To do this, the GIS's spatial analysis and gravity model were used to analyze the efficiency of the public facilities. The gravity model was conducted as the main analysis method, and another model for this analysis was the discrete model. The gravity model is originally to anticipate migration flows, traffic flows and other types of movements so that this model compares the gravitational attraction between places. The discrete model is to find the optimal location and to evaluate a location of facility regarding urban areas as the combination of node and link. In this research, these two models were adopted to compare and analyze location of Mapo-Gu Office. The results of this research indicated that the locational evaluation of urban public service facilities discovered the appropriateness of those facilities, and the public facilities was necessary to displace to other site.

  • PDF

Enhanced Spatial Covariance Matrix Estimation for Asynchronous Inter-Cell Interference Mitigation in MIMO-OFDMA System (3GPP LTE MIMO-OFDMA 시스템의 인접 셀 간섭 완화를 위한 개선된 Spatial Covariance Matrix 추정 기법)

  • Moon, Jong-Gun;Jang, Jun-Hee;Han, Jung-Su;Kim, Sung-Soo;Kim, Yong-Serk;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제34권5C호
    • /
    • pp.527-539
    • /
    • 2009
  • In this paper, we propose an asynchonous ICI (Inter-Cell Interference) mitigation techniques for 3GPP LTE MIMO-OFDMA down-link receiver. An increasing in symbol timing misalignments may occur relative to sychronous network as the result of BS (Base Station) timing differences. Such symbol synchronization errors that exceed the guard interval or the cyclic prefix duration may result in MAI (Multiple Access Interference) for other carriers. In particular, at the cell boundary, this MAI becomes a critical factor, leading to degraded channel throughput and severe asynchronous ICI. Hence, many researchers have investigated the interference mitigation method in the presence of asynchronous ICI and it appears that the knowledge of the SCM (Spatial Covariance Matrix) of the asynchronous ICI plus background noise is an important issue. Generally, it is assumed that the SCM estimated by using training symbols. However, it is difficult to measure the interference statistics for a long time and training symbol is also not appropriate for MIMO-OFDMA system such as LTE. Therefore, a noise reduction method is required to improve the estimation accuracy. Although the conventional time-domain low-pass type weighting method can be effective for noise reduction, it causes significant estimation error due to the spectral leakage in practical OFDM system. Therefore, we propose a time-domain sinc type weighing method which can not only reduce the noise effectively minimizing estimation error caused by the spectral leakage but also implement frequency-domain moving average filter easily. By using computer simulation, we show that the proposed method can provide up to 3dB SIR gain compared with the conventional method.

Overlay Multicast Tree Building Algorithm for MDST and MST in Complete Network (완전 연결된 네트워크에서 MDST와 MST 목적을 갖는 오버레이 멀티캐스트 트리구현 알고리즘)

  • Cho, Myeong-Rai
    • 한국벤처창업학회:학술대회논문집
    • /
    • 한국벤처창업학회 2010년도 통합학술대회
    • /
    • pp.71-89
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Operational Design Domain for Testing of Autonomous Shuttle on Arterial Road (도시부 자율주행셔틀 실증을 위한 운행설계영역 분석: 안양시를 중심으로)

  • Kim, Hyungjoo;Lim, Kyungil;Kim, Jaehwan;Son, Woongbee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제19권2호
    • /
    • pp.135-148
    • /
    • 2020
  • The ongoing development of autonomous driving-related technology may cause different kinds of accidents while testing new changes. As a result, more information on ODD suitable for the domestic road environment will be necessary to prevent safety accidents. Besides, implementation of the Autonomous Vehicle Act will increase autonomous driving demonstrations on roads currently in use. This study describes an ODD for demonstrating an autonomous driving shuttle in downtown areas. It addresses a possible scenario of autonomous driving around a downtown road in Anyang. Geometric, operational, and environmental factors are considered while maintaining a domestic road environment and safety. Autonomous driving shuttles are demonstrated in 30 nodes, each identified by node type and signal-communication. Link criteria are an autonomous driving restriction in 42 morning peak (8-9am) hours, 39 non-peak (12-13pm) hours, and 40 afternoon peak (18-19pm) hours. In the future, conclusions may be considered for preliminary safety assessments of roads where autonomous driving tests are performed.

Distance-Based Channel Assignment with Channel Grouping for Multi-Channel Wireless Mesh Networks (멀티채널 무선 메쉬 네트워크에서의 채널 그룹을 이용한 거리 기반 채널 할당)

  • Kim, Sok-Hyong;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제33권12B호
    • /
    • pp.1050-1057
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have recently become a hot issue to support high link capacity in wireless access networks. The IEEE 802. I 1 standard which is mainly used for the network interface technology in WMNs supports up to 3 or 12 multiple channels according to the IEEE 802.11 specification. However, two important problems must be addressed when we design a channel assigmnent algorithm: channel dependency problem and channel scanning delay. The former occurs when the dynamic channel switching of an interface leads to the channel switching of other interfaces to maintain node connectivity. The latter happens per channel switching of the interface, and affects the network performance. Therefore, in this paper, we propose the Distance-Based Channel Assigmnent (DB-CA) scheme for multi-channel WMNs to solve such problems. In DB-CA, nodes just perform channel switching without channel scanning to communicate with neighboring nodes that operate on different channels. Furthermore, DB-CA minimizes the interference of channels being used by nodes near the gateway in WMNs. Our simulation results show that DB-CA achieves improved performance in WMNs.