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

검색결과 81건 처리시간 0.023초

분산 재전송 시스템에서 제한된 정보를 이용한 전력제어 성능 분석 (Power Control with Limited Information in Distributed ARQ Retransmission Schem)

  • 김해수
    • 한국멀티미디어학회논문지
    • /
    • 제20권12호
    • /
    • pp.1849-1855
    • /
    • 2017
  • The main purpose of cooperative communications is improvement of communication quality and efficient use of transmission power. In this paper, a cooperative retransmission method is proposed, where neighbor nodes that receive messages correctly between transmit and receive nodes will participate in retransmission of the erroneous packet of the direct link. When the proposed retransmission method is used, the performance of the PER can be greatly improved. In case that the limited information is included in the NACK message, the transmit power of the retransmission packet can be reduced using the proper power control method.

Performance Enhancement of IEEE 802.15.3 MAC for Simultaneously Operating Piconets

  • 설붕;공붕;김덕경
    • 한국통신학회논문지
    • /
    • 제32권1A호
    • /
    • pp.34-43
    • /
    • 2007
  • In the IEEE 802.15.3 Medium Access Control (MAC) protocol, Simultaneously Operating Piconets (SOPs) are linked by the parent/child (P/C) or parent/neighbor (P/N) configuration, which work on a Time Division Multiple Access (TDMA) basis. This provides interference mitigation but the overall throughput is limited because the SOPs share the channel time exclusively. The protocol is not efficient for SOPs if we focus on the combination of interference mitigation and high throughput maintenance. In this paper Public Channel Time Allocation (Public CTA) is proposed, which is able to greatly reduce the inter-piconet interference (IPI) and achieve greater throughput without much loss of link success probability (LSP) in the SOPs. The simulation results based on the SOPs of Direct Sequence Ultra Wideband (DS-UWB) system demonstrate that the proposed scheme effectively supports the coexistence of SOPs, and it can not only significantly improve the overall throughput of SOPs but also maintain high LSP.

무선 랜에서 우선순위를 할당한 다중 버퍼 사용에 따른 성능 향상에 관한 연구 (The Study for Improvement Performance on Priority Multi-Buffer Scheme in Wireless LAN)

  • 김동옥
    • 정보통신설비학회논문지
    • /
    • 제3권2호
    • /
    • pp.42-50
    • /
    • 2004
  • This paper describes a new approach to Internet host mobility. We argue that local mobility, the performance of existing mobile host protocol can be significantly improved. It proposes Fast Moving Detection schemethat based on neighbor AP channel information and moving detection table. And, it composes Local Area Clustering Path (LACP) domain that collected in AP's channel information and MN interface information. It stored the roaming table to include channel information and moving detection. Those which use the proposal scheme will need to put LACP information into the beacon or probe frame. Each AP uses scheme to inform available channel information to MN. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of theburst blocking probability and the link utilization.

  • PDF

URL Filtering by Using Machine Learning

  • Saqib, Malik Najmus
    • International Journal of Computer Science & Network Security
    • /
    • 제22권8호
    • /
    • pp.275-279
    • /
    • 2022
  • The growth of technology nowadays has made many things easy for humans. These things are from everyday small task to more complex tasks. Such growth also comes with the illegal activities that are perform by using technology. These illegal activities can simple as displaying annoying message to big frauds. The easiest way for the attacker to perform such activities is to convenience user to click on the malicious link. It has been a great concern since a decay to classify URLs as malicious or benign. The blacklist has been used initially for that purpose and is it being used nowadays. It is efficient but has a drawback to update blacklist automatically. So, this method is replace by classification of URLs based on machine learning algorithms. In this paper we have use four machine learning classification algorithms to classify URLs as malicious or benign. These algorithms are support vector machine, random forest, n-nearest neighbor, and decision tree. The dataset that is used in this research has 36694 instances. A comparison of precision accuracy and recall values are shown for dataset with and without preprocessing.

HeNB-Aided Virtual-Handover for Range Expansion in LTE Femtocell Networks

  • Tang, Hao;Hong, Peilin;Xue, Kaiping
    • Journal of Communications and Networks
    • /
    • 제15권3호
    • /
    • pp.312-320
    • /
    • 2013
  • Home evolved Node-B (HeNB), also called a femtocell or a femto base station, is introduced to provide high data rate to indoor users. However, two main problems arise in femtocell networks: (1) Small coverage area of HeNB, which results in limited cell-splitting gain and ping-pong handover (HO) problems and (2) high inter-femtocell interference because HeNBs may be densely deployed in a small region. In this study, an efficient cooperation mechanism called an HeNB-aided virtual-HO (HaVHO) scheme is proposed to expand the coverage area of femtocells and to reduce inter-femtocell interference. The cooperation among neighbor HeNBs is exploited in HaVHO by enabling an HeNB to relay the data of its neighbor HeNB without an HO. The HaVHO procedure is compatible with the existing long term evolution specification, and the information exchange overhead in HaVHO is relatively low. To estimate the signal to interference plus noise ratio improvement, the area average channel state metric is proposed, and the amount of user throughput enhancement by HaVHO is derived. System-level simulation shows that HaVHO has a better performance than the other four schemes, such as lesser radio link failure, lesser ping-pong handover, lesser short-stay handover, and higher user throughput.

장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법 (A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces)

  • 임동현;김창화
    • 한국멀티미디어학회논문지
    • /
    • 제25권10호
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

무선 메쉬 네트워크에서 최소 간섭과 최적의 주파수 대역폭을 이용한 CDS 구성 (A Distributed Bandwidth-Interference aware CDS (BI CDS) Construction Scheme in Wireless Mesh Network)

  • 양준모;김보남;김흥준
    • 한국정보통신학회논문지
    • /
    • 제13권1호
    • /
    • pp.53-59
    • /
    • 2009
  • 무선 애드록 네트워크의 특수한 형태인 무선 메쉬 네트워크는 최근 새로운 연구과제의 초석으로 주목받고 있다. WMN의 제한적인 동작 환경으로 인하여 효과적인 연결 Dominating set 구성은 브로드캐스팅, 라우팅, 혹은 가상 백본을 구성을 위한 방법 중 하나로 중요한 관심 대상이다. 본 논문에서 분산적인 방법을 토대로 네트워크에서 최소지연과 효율적인 대역폭 사용을 통하여 성능 향상을 시키기 위하여 Interference와 Bandwidth을 Dominating set 구성 파라미터로 사용한 연결 Dominating set 구성 알고리즘을 제안한다. 시뮬레이션을 통하여 제안된 알고리즘은 최대의 주파수 대역폭을 가진 링크와 연결된 최소의 연결 Dominating set이 구성됨으로써 네트워크 전체 성능이 향상됨을 보여준다.

노드 이동성 및 분포를 고려한 향상된 다중 점 릴레이 선택 알고리즘 (Enhanced Multi-Point Relay Selection Algorithm for Mobility and Distribution of Nodes)

  • 박종호;오창영;안지형;김정식;정성헌;이태진
    • 한국통신학회논문지
    • /
    • 제37B권12호
    • /
    • pp.1128-1137
    • /
    • 2012
  • 본 논문에서는 노드의 이동성이 크고 노드의 밀도가 균일 하지 않은 애드혹 네트워크에서 라우팅 성능을 개선하기 위해 노드의 이동성과 밀도를 고려하여 OLSR(Optimized Link State Routing) 의 MPR(Multi-Point Relay) 선택방법을 개선할 수 있는 방법을 제안한다. OLSR의 MPR 선택 방법은 노드의 이동성과 밀도에 무관하게 2홉 이웃 노드를 많이 포함하는 노드를 위주로 선택한다. 하지만 노드가 이동성을 갖는 경우에 이동성이 큰 노드를 MPR로 선택할 경우 성능이 저하될 수 있다. 또한 노드의 밀도가 균일 하지 않은 경우에는 밀도가 높은 지역의 노드들이 우선적으로 MPR로 선택되면 네트워크 전체의 성능을 향상시킬 수 있다. 따라서 본 논문에서는 노드의 이동성과 밀도를 Hello 메시지 교환을 통해 측정하고 노드의 이동성과 밀도를 반영하여 MPR 선택에 우선순위를 부여하는 방법을 제안한다. 본 논문에서 제안한 MPR 선택 방법의 성능을 알아보기 위해 OPNET을 활용하여 시뮬레이션을 수행하고 제안 방법의 성능이 가장 우수함을 보인다.

다중 셀 환경에서 단말 간 직접 통신을 위한 자원 할당 방식 (Resource Allocation Scheme for D2D Communications in Multi-Cell Environments)

  • 오성민;이창희;윤미영;신재승;박애순
    • 한국통신학회논문지
    • /
    • 제39A권10호
    • /
    • pp.601-609
    • /
    • 2014
  • 본 논문에서는 다중 셀 환경에서 단말 간 직접 통신 (D2D: Device-to-Device)에 적합한 자원 할당 방식을 제안한다. 제안한 방식은 셀 간 간섭을 해결하기 위해 D2D 통신을 위한 자원 그룹을 할당하고, 이러한 자원 정보를 이웃 셀과 공유하는 절차를 수행한다. 또한, 셀 간 간섭을 감소시키기 위해 D2D 통신 링크 간 파워 조절 기법을 제안한다. 시뮬레이션 결과에 의하면, 셀 간 협력 자원 할당 방식은 셀룰러 상향링크와 D2D 통신 링크의 평균 SINR (Signal-to-Noise Ratio)을 10 dB 이상 유지시킬 수 있는 반면, 셀 간 비협력 자원 할당 방식은 D2D 통신링크의 평균 SINR이 0 dB 까지 저하되었다. 또한, 제안한 방식은 셀 간 비협력 자원 할당 방식보다 셀 처리율을 8 % 향상시킬 수 있었다.

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권11호
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.