• Title/Summary/Keyword: Source Node

Search Result 603, Processing Time 0.028 seconds

Analysis of Accelerated Soft Error Rate for Characteristic Parameters on Static RAM (정적 RAM 특성 요소에 의한 소프트 에러율의 해석)

  • Gong, Myeong-Kook;Wang, Jin-Suk;Kim, Do-Woo
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.55 no.4
    • /
    • pp.199-203
    • /
    • 2006
  • This paper presents an ASER (Accelerated Soft Error Rate) integral model. The model is based on the facts that the generated EHP/s(electron hole pairs) are diminished after some residual range of the incident alpha particle, where residual range is a function of the incident angle and the capping layer thickness over the semiconductor junction. The ASER is influenced by the flux of the alpha particles, the junction area ratio, the alpha particle incident angle when the critical charge is same as the collected charge, and the sizes of the alpha source and the chip. The model was examined with 8M static RAM samples. The measured ASER data showed good agreement with the calculated values using the model. The ASER decreased exponentially with respect to the operational voltage. As the capping layer thickness increases up to $16{\mu}m$, the ASER increases, and after that thickness, the ASER decreases. The ASER increased as the depth of BNW increased from $0{\mu}m\;to\;4{\mu}m$. and then saturated. The ASER decreased as the node capacitance increased from 2fF to 5fF.

Non-cooperative interference radio localization with binary proximity sensors

  • Wu, Qihui;Yue, Liang;Wang, Long;Ding, Guoru
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3432-3448
    • /
    • 2015
  • Interference can cause serious problems in our daily life. Traditional ways in localizing a target can't work well when it comes to the source of interference for it may take an uncooperative or even resistant attitude towards localization. To tackle this issue, we take the BPSN (Binary Proximity Sensor Networks) and consider a passive way in this paper. No cooperation is needed and it is based on simple sensor node suitable for large-scale deployment. By dividing the sensing field into different patches, when enough patches are formed, good localization accuracy can be achieved with high resolution. Then we analyze the relationship between sensing radius and localization error, we find that in a finite region where edge effect can't be ignored, the trend between sensing radius and localization error is not always consistent. Through theoretical analysis and simulation, we explore to determine the best sensing radius to achieve high localization accuracy.

Robust Cooperative Relay Beamforming Design for Security

  • Gong, Xiangwu;Dong, Feihong;Li, Hongjun;Shao, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4483-4501
    • /
    • 2015
  • In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper. While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message. The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques. The benefit of the proposed scheme is showed in simulation results.

A Routing Metric to Improve Route Stability in Mobile Wireless Sensor Networks

  • XU, Yi-Han;WU, Yin;SONG, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2245-2266
    • /
    • 2016
  • The hop count routing metric is widely used in routing protocols of Wireless Sensor Networks (WSNs) due to its simplicity and effectiveness. With a lower hop count route, fewer transmissions are required to send a packet from the source to the destination. This can improve the throughput of a network because fewer transmissions results in less channel contention and interference. Despite this, the hop count routing metric may not be ideal for mobile scenarios where the topology of a network changes constantly and rapidly. In this paper, we propose to increase route stability in mobile WSNs by discovering paths that are more stable during route discoveries using routing metrics. Two routing metrics were proposed, the true beauty of these routing metrics lies in the fact that they can even be used even without specialized hardware such as GPS and other sensors. We implemented the proposed routing metrics in the AODV routing protocol and found that they are highly effective and outperform other stability-based routing metrics and the hop count routing metric.

The Impact of Name Ambiguity on Properties of Coauthorship Networks

  • Kim, Jinseok;Kim, Heejun;Diesner, Jana
    • Journal of Information Science Theory and Practice
    • /
    • v.2 no.2
    • /
    • pp.6-15
    • /
    • 2014
  • Initial based disambiguation of author names is a common data pre-processing step in bibliometrics. It is widely accepted that this procedure can introduce errors into network data and any subsequent analytical results. What is not sufficiently understood is the precise impact of this step on the data and findings. We present an empirical answer to this question by comparing the impact of two commonly used initial based disambiguation methods against a reasonable proxy for ground truth data. We use DBLP, a database covering major journals and conferences in computer science and information science, as a source. We find that initial based disambiguation induces strong distortions in network metrics on the graph and node level: Authors become embedded in ties for which there is no empirical support, thus increasing their sphere of influence and diversity of involvement. Consequently, networks generated with initial-based disambiguation are more coherent and interconnected than the actual underlying networks, and individual authors appear to be more productive and more strongly embedded than they actually are.

A Study of Guarantee Technique Using Buffer Node in Ad Hoc Network (Ad Hoc 망에서 버퍼 노드를 이용한 QoS 보장 기법에 관한 연구)

  • 김관중
    • Journal of the Korea Society for Simulation
    • /
    • v.12 no.4
    • /
    • pp.73-81
    • /
    • 2003
  • An Ad Hoc network is a dynamic multi-hop wireless network that is established by a group of mobile hosts on a shared wireless channel by virtue of their proximity to each other. Since wireless transmissions are locally broadcast in the region of the transmitting host, hosts that are in close proximity can hear each other and are said to be neighbors. The transitive closure of the neighborhood of all the hosts in the set of mobile hosts under consideration forms an Ad Hoc network. Thus, each host is potentially a router and it is possible to dynamically establish routes by chaining together a sequence of neighboring hosts from a source to a destination in the Ad Hoc network. In a network, various real-time services require the network to guarantee the Quality of Services provided to the receiver. End-to-end QoS can be provided most efficiently when each layer of the protocol stack translates the requirements of the application into layer classified requirements and satisfies them. In this study, a mechanism to guarantee the QoS in Ad Hoc networks with buffer nodes is proposed. They effectively prevent traffic congestion and yield better transmission rate. In this way QoS is enhanced.

  • PDF

A Model for Seismic Reliability Assessment of Electric Power Transmission Network System (지진 재해에 대한 전력 송전 네트워크 시스템의 신뢰성 평가 모형)

  • 고현무;김영호;박원석
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.7 no.2
    • /
    • pp.93-102
    • /
    • 2003
  • A technique for the seismic reliability evaluation of electric power transmission network system(EPTS) was developed to evaluate reliability indices corresponding to the whole network system and to each node within. A network model with nodes and links for EPTS was established, and a seismic substation fragility curve obtained from seismic fragilities of power system facilities was derived. A point source model, the doubly truncated Gutenberg-Richter relationship, and earthquake intensity attenuation formula was applied to simulate seismic events. Using Monte-Carlo simulation method, the seismic reliability of EPTS was evaluated and, it appeared that seismic effect on EPTS of korea has to be considered.

Estimation of CTD and Peak-to-Peak CDV Allocation to Nodes in Domestic Region (국내영역에서 셀전달지연 추정 및 peak-to-peak CDV 노드별 할당)

  • Park, Chun-Kwan;Han, Jong-Seok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.2
    • /
    • pp.6-12
    • /
    • 2001
  • When CBR source traffics are loaded to ATM switch and broadband network termination, CTD values of ATM switch and broadband network termination are measured and then the values of CTD in the domestic region arc estimated. The estimation values of CTD satisfy the objective of CTD in the domestic region allocated by allocation rules of 1.356. The peak-to-peak CDV allocation method based On Chernoff accumulation method is proposed and applied to the nodes of national portion. From the result of numerical analysis, the proposed method is more accurate than the equal allocation method for peak -to-peak CDV in case that the CDVs at each node and the number of ATM nodes on the path increase.

  • PDF

A Study on the Context-Awareness Rule-Based Clustering technique for MANET (MANET에서 상황인식 규칙기반에 따른 에너지 보존 클러스터링 기법에 관한 연구)

  • Chi, Sam-Hyun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.1041-1047
    • /
    • 2010
  • One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. In this paper proposes a new method for improving the low power distributed MAC. The method is rule-based on the context awareness of the each nodes energy in clustering. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission.

The proposal of the energy efficiency sensor network using directional antennas (방향성 안테나를 이용한 에너지 효율적인 센서 네트워크의 제안)

  • Kim, Kyung-Kuen;Jung, Won-Soo;Oh, Young-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.351-352
    • /
    • 2007
  • The sensor networking technique as the radio network which does not have the base infrastructure network. The sensor nodes oneself automatic compose the network and simultaneously accomplish two roles of the router and data source. The sensor network is kind of Ad-hoc network is a possibility of seeing from point. sensor networking technique is restricted that limit of the memory and the battery back with the resources of the node. The sensor nodes overcomes the restriction of the resources it is in the process of researching the multi-hop routing technique which the sensor network divided cluster routing techniques which are researched. this paper proposed using beamforming antenna which has the directivity of the electric wave. the beamforming antenna from the Ad-hoc network using technique. the proposal is that raises the efficient of data trans mission from the sensor network and extends the lift time of the sensor network.

  • PDF