• Title/Summary/Keyword: Link-Node

Search Result 624, Processing Time 0.025 seconds

LQI Standard Deviation Routing Algorithm for Energy Loss Reduction in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 손실 감소를 위한 LQI 표준편차 라우팅 알고리즘)

  • Shin, Hyun-Jun;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.6
    • /
    • pp.960-967
    • /
    • 2012
  • Wireless sensor network is used at the environment to obtain nearby information and since such information is transferred through wireless link, it causes unnecessary re-sending and disadvantage of big energy consumption at node. Because of this to select reliable, energy effective link, method of estimating quality on wireless link using RSSI(received signal strength indication), LQI(link quality indication), etc is needed on wireless link. To set up path extending survival time by reducing energy consumption of nodes at the wireless sensor network, the thesis selects with small standard deviation of LQI after obtaining LQI within each path. Additionally, LQI standard deviation routing algorithm is compared based on LQI algorithm such as minimum-LQI, hop-LQI weight and RF output -7dBm. According to the outcome, the algorithm suggested has superior characters such as the number of node, retransmission rate and network life span respectively compared to existing algorithm. Therefore, energy consumption can be efficiently reduced in case that LQI standard deviation routing scheme suggested by this paper is adapted to wireless sensor network.

Analysis of Link Error Effects in MANET Address Autoconfiguration Protocols

  • Kim, Sang-Chul;Chung, Jong-Moon
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.84-93
    • /
    • 2009
  • This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

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

  • Park, Jongho;Oh, Chang-Yeong;Ahn, Ji Hyoung;Kim, Joung-Sik;Jung, Sunghun;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1128-1137
    • /
    • 2012
  • In this paper, we propose an improved MPR selection method considering mobility and density of nodes for ad-hoc networks. In Optimized Link State Routing(OLSR), a node selects 1-hop Multi-Point Relay(MPR) nodes to cover all 2-hop neighbor nodes. In a high population area, many nodes are likely to be selected as MPR nodes by their neighbors. This leads to increase in contention among MPR nodes and may decrease overall performance of the network. In addition, when an MPR node leaves the communication range of its MPR selector node, it can no longer perform as the MPR node and the performance of the network may also decrease. In this paper, we propose an MPR selection method which measures the mobility and density of nodes by exchanging the hello messages and gives the priorities to the nodes for MPR selection. Performance evaluation results using OPNET show that the proposed method is superior to OLSR or the MPR candidate method in terms of connectivity and throughput.

Link Prediction Algorithm for Signed Social Networks Based on Local and Global Tightness

  • Liu, Miao-Miao;Hu, Qing-Cui;Guo, Jing-Feng;Chen, Jing
    • Journal of Information Processing Systems
    • /
    • v.17 no.2
    • /
    • pp.213-226
    • /
    • 2021
  • Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

연결강도분석을 이용한 통합된 부도예측용 신경망모형

  • Lee Woongkyu;Lim Young Ha
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2002.11a
    • /
    • pp.289-312
    • /
    • 2002
  • This study suggests the Link weight analysis approach to choose input variables and an integrated model to make more accurate bankruptcy prediction model. the Link weight analysis approach is a method to choose input variables to analyze each input node's link weight which is the absolute value of link weight between an input nodes and a hidden layer. There are the weak-linked neurons elimination method, the strong-linked neurons selection method in the link weight analysis approach. The Integrated Model is a combined type adapting Bagging method that uses the average value of the four models, the optimal weak-linked-neurons elimination method, optimal strong-linked neurons selection method, decision-making tree model, and MDA. As a result, the methods suggested in this study - the optimal strong-linked neurons selection method, the optimal weak-linked neurons elimination method, and the integrated model - show much higher accuracy than MDA and decision making tree model. Especially the integrated model shows much higher accuracy than MDA and decision making tree model and shows slightly higher accuracy than the optimal weak-linked neurons elimination method and the optimal strong-linked neurons selection method.

  • PDF

Derivation of General Link Finite Element Equation representing Pad Shoe in Bridge under Earthquake (지진시에 교량의 탄성 받침을 표현하는 범용 연결 유한 요소 모델의 유도식)

  • 정대열
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.04a
    • /
    • pp.226-233
    • /
    • 1999
  • When we numerically model the bridge under seismic condition, the full model combining the super-structure and the sub-structure is considered for the more accurate results than the separate model. In this case, the super-structure is connected with the sub-structure by the elastic pad shoe that is difficult to model, because it has the three translational elastic stiffness and the three rotational elastic stiffness. The two-node General Link element is derived in finite element equation representing such a pad shoe, and it is verified by comparing the one General Link element model with the corresponding three legacy spring element model. It is easy to model the pad shoe, if the General Link finite element is used. And the seismic analysis result of the bridge full model structure, which is modeled with the General Link element, has been compared with the one of the separate model structure. The present study gives. more conservative result than that of the separate model, which does not consider the dynamic behaviour of the sub-structure.

  • PDF

Simulation of Power Line Communication Slient Node Problem Using OPNET

  • Huh, Jun-Ho;Seo, Kyungryong
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.3
    • /
    • pp.491-499
    • /
    • 2017
  • The Information & Communication Technology (ICT) and the Internet of Things (IoT) have become the major issues in Republic of Korea recently. While RS-232, Zigbee, and WiFi-related technologies are used in the ICT-based systems, we focus on the Power Line Communication (PLC) in this paper. By carrying out OPNET simulations, we've implemented the PLC Router Node Model, PLC Terminal Node Model, PLC Link Model, and PLC Palette Model and executed the simulations arranging 20 holds within the range of 400m (20m apart). As a result, we confirmed that the slient node problem had occurred at the point of 200m-2000m (as of 2016) distance preventing further communications. However, the control group, by contrast, was able to carry out the communications by installing a router. We expect that this paper will contribute to the development of a foundation technology which will saves costs by performing the simulation prior to building actual large-scale ICT Complex in the future work.

UWB Link-Adaptive Relay Transmission Protocol for WiMedia Distributed MAC Systems (WiMedia Distributed MAC 통신 시스템을 위한 UWB 링크에 적응적인 릴레이 통신 프로토콜)

  • Hur, Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3A
    • /
    • pp.141-150
    • /
    • 2012
  • The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and WPANs. In this paper, firstly, a time slot reservation protocol for relay transmission is proposed. Furthermore, we propose a novel relay node selection algorithm adaptive to current UWB link transmission rate. The proposed relay node selection algorithm has compatibility with current WiMedia D-MAC standard and is executed at each device according to the SoQ as a QoS criterion.

Case Study: Restructuring of the Logistics Network and Calculating of the Distribution Center Size Based on Simulation Method (시뮬레이션을 활용한 신 물류체계 구축과 물류센터 규모 산정에 관한 연구)

  • Lee, Jae-Jun;Park, Young-Jae;Chung, Tae-Won
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.93-99
    • /
    • 2005
  • 물류 네트워크는 거점(Node)과 수배송(Link) 형태로 구성된다. 중장기적인 관점에서 예측된 수요를 고려하여 재고, 수배송, 납기시간을 줄일 수 있는 Node와 Link를 결정하는 것이 물류 네트워크 구축 연구의 목적이다. 건축도료를 생산하는 A사는 3개의 공장과 2개의 물류센터를 보유하고 있으며, 향후 공장 이전과 신규 물류센터를 건립할 계획이다. 이러한 물류 환경 변화 하에서 현재 대고객 서비스 수준은 유지하면서, 최소의 비용으로 적정 재고수준을 보장하는 A사의 신 물류체계를 구축하는 것이 필요하다. 이를 위해 본 연구에서는 시뮬레이션을 활용하여 최적의 물류 네트워크 구축 및 적정의 물류센터 규모를 산정하였다.

  • PDF

A New Technique for Localization Using the Nearest Anchor-Centroid Pair Based on LQI Sphere in WSN

  • Subedi, Sagun;Lee, Sangil
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.1
    • /
    • pp.6-11
    • /
    • 2018
  • It is important to find the random estimation points in wireless sensor network. A link quality indicator (LQI) is part of a network management service that is suitable for a ZigBee network and can be used for localization. The current quality of the received signal is referred as LQI. It is a technique to demodulate the received signal by accumulating the magnitude of the error between ideal constellations and the received signal. This proposed model accepts any number of random estimation point in the network and calculated its nearest anchor centroid node pair. Coordinates of the LQI sphere are calculated from the pair and are added iteratively to the initially estimated point. With the help of the LQI and weighted centroid localization, the proposed system finds the position of target node more accurately than the existing system by solving the problems related to higher error in terms of the distance and the deployment of nodes.