• Title/Summary/Keyword: Source node

Search Result 599, Processing Time 0.026 seconds

An Adaptive Incentive/Topology Control Scheme for Stimulating Real time Data Forwarding in VANET Environment (VANET 환경에서 실시간 데이터 포워딩 진작을 위한 적응형 인센티브/토폴로지 제어 기법)

  • Bae, Seo-Yun;Kim, Nak-Myeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.7
    • /
    • pp.1-8
    • /
    • 2011
  • Vehicular Ad-hoc Network (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles without communications infrastructure. Some characteristics in VANET environment such as high mobility, dynamic topology and selfishness of nodes can cause degradation of network quality. In this paper, we propose an adaptive incentive/topology control scheme to improve network quality in VANET by stimulating real time data forwarding and reporting changes of network topology. In the proposed scheme, an incentive suggested by the source node is updated in real time simultaneously with data transmission to stimulate real time data forwarding. In addition, when the order of the nodes in the path is changed, nodes which report the changes of network topology will get an additional incentive. By computer simulation, it is shown that the proposed incentive/topology control scheme outperforms the conventional schemes with respect to data delivery time and data delivery ratio.

Application of Equivalent Walking Loads for Vibration Analysis of Building Floor Subjected to Footstep Loadings (보행하중을 받는 건축물 바닥판의 진동해석을 위한 등가 보행하중의 적용)

  • 김기철;이동근
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.5 no.5
    • /
    • pp.35-45
    • /
    • 2001
  • Recently, the floor systems those require large open space may have low inherent damping due to the decline of the use of curtain walls. Furthermore, the use of the high strength materials has resulted in more flexible and longer spanning in floor systems. The long span structures such as shopping malls, offices and large assembly rooms may lead to significant dynamic response due to human activities. Excessive vibrations make the occupants uncomfortable and deteriorate the serviceability of buildings. It is now proved that footfall loading is the major source of floor vibrations. The common method of application of walking loads for the vibration analysis of structures subjected to walking loads is to inflict measured walking loads and periodic function at a node. But this method could not account for the moving effect of walking. In this study, natural frequency and damping ratio of example structure are evaluated by heel drop tests. And the application of equivalent walking loads is used for on efficient vibration analysis of the plate structures subjected to walking loads.

  • PDF

Automatic Compiler Generator for Visual Languages using Semantic Actions based on Classes (클래스 기반의 의미수행코드 명세를 이용한 시각언어 컴파일러 자동 생성)

  • 김경아
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.6
    • /
    • pp.1088-1099
    • /
    • 2003
  • The syntax-directed translation using semantic actions is frequently used in construction of compiler for text programming languages. it is very useful for the language designers to develop compiler back-end using a syntax structure of a source programming language. Due to the lack of the integrated representation method for a parse tree node and modeling method of syntax structures, it is very hard to construct compiler using syntax-directed translation in visual languages. In this Paper, we propose a visual language compiler generation method for constructing a visual languages compiler automatically, using syntax-directed translation. Our method uses the Picture Layout Grammar as a underlying grammar formalism. This grammar allows our approach to generate parser efficiently u sing And-Or-Waiting Graph and encapsulating syntax definition as one unit. Unlike other systems, we suggest separating the specification and the generation of semantic actions. Because of this, it provides a very efficient method for modification.

  • PDF

A Routing Protocol with Fast-Recovery of Failures Using Backup Paths on MANETs (MANET에서 백업경로를 이용한 빠른 경로복구 능력을 가진 라우팅 프로토콜)

  • Thai, Ahn Tran;Kim, Myung-Kyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1541-1548
    • /
    • 2012
  • This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

Ad-hoc Security Authentication Technique based on Verifier (검증자 기반 Ad-hoc 보안 인증기법)

  • Lee, Cheol-Seung;Hong, Seong-Pyo;Lee, Ho-Young;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.713-716
    • /
    • 2007
  • This paper suggests One-time Password key exchange authentication technique for a strong authentication based on Ad-hoc Networks and through identify wireless environment security vulnerabilities, analyzes current authentication techniques. The suggested authentication technique consists of 3 steps: Routing, Registration, and Running. The Routing step sets a safe route using AODV protocol. The Registration and Running step apply the One-time password S/key and the DH-EKE based on the password, for source node authentication. In setting the Session key for safe packet transmission and data encryption, the suggested authentication technique encrypts message as H(pwd) verifiers, performs key exchange and utilizes One time password for the password possession verification and the efficiency enhancement. EKE sets end to end session key using the DH-EKE in which it expounds the identifier to hash function with the modula exponent. A safe session key exchange is possible through encryption of the H(pwd) verifier.

  • PDF

An Energy-efficient Data Dissemination Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 데이타 전달 프로토콜)

  • Yi, Seung-Hee;Lee, Sung-Ryoul;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.165-174
    • /
    • 2006
  • Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

Microarray Data Retrieval Using Fuzzy Signature Sets (퍼지 시그너쳐 집합을 이용한 마이크로어레이 데이터 검색)

  • Lee, Sun-A;Lee, Keon-Myung;Ryu, Keun-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.4
    • /
    • pp.545-549
    • /
    • 2009
  • Microarray data sets could contain thousands of gene expression levels and have been considered as an important source from which meaningful patterns could be extracted for further analysis in biological studies. It is sometimes necessary to retrieve out specific genes or samples of analyst's interest in an effective way. This paper is concerned with a method to make use of fuzzy signature set in order to filter out genes or samples which satisfy complicated constraints as well as simple ones. Fuzzy signatures are an extension of vector valued fuzzy sets, in which elements of the vector are allowed to have a vector. Fuzzy signature sets are similar to fuzzy signatures except that their leaf elements are fuzzy sets defined on the interval [0,1]. This paper introduces an extension of fuzzy signature sets which specifies aggregation operators at each internal node and comparison operators for aggregation. It also shows how to use the extended fuzzy signature sets in microarray data retrieval and some examples of its usage.

Optimal Relay Selection and Power Allocation in an Improved Low-Order-Bit Quantize-and-Forward Scheme

  • Bao, Jianrong;He, Dan;Xu, Xiaorong;Jiang, Bin;Sun, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5381-5399
    • /
    • 2016
  • Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

Routing Based on Ad Hoc Link Reliability (애드 혹 링크 신뢰도(Reliability) 기반 라우팅 기법)

  • Shin, Kwon-Seung;Chung, Min-Young;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.175-183
    • /
    • 2006
  • An ad-hoc network is a group of mobile nodes acting as routers. The of hoc node has a precondition of mobility, allowing path to be easily disconnected when transmitting data, thereby increasing network overhead. However, most of hoc routing protocols set up the path based only on the number of hops without considering other practical factors. Here we consider a path with the least substantial number of transmission (SNT) from source to destination based on reliabilities of links. This includes retransmissions due to unreliable links. In this paper, an efficient ad-hoc link reliability based routing (PU) protocol suitable for mobile ah-hoc network in terms of SNT, is proposed. The network overhead and data transmission delay ore reduced, by considering both ad-hoc link reliability and the number of hops. Our empirical performance evaluation comparing to AODV (8) shows that the enhancement is up to about 31% for SNT depending upon the mobility of nodes.

  • PDF

Smart Grid Cooperative Communication with Smart Relay

  • Ahmed, Mohammad Helal Uddin;Alam, Md. Golam Rabiul;Kamal, Rossi;Hong, Choong Seon;Lee, Sungwon
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.640-652
    • /
    • 2012
  • Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.