• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.048 seconds

Development of a Real-Time Position Tracking System for a Manufacturing Process Based on a UWB Sensor Using a Kalman Filter (칼만필터를 적용한 UWB 센서기반 제조업 조립공정작업의 실시간 위치추적 시스템 개발)

  • Jeong, Seung-Hyun;Choi, Deuk-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.2
    • /
    • pp.627-633
    • /
    • 2020
  • Assembly process data can be gathered in real time in a manufacturing execution system (MES) server using proximity sensors, barcodes, RFID, ZigBee, Bluetooth, wireless sensor networks, etc. Although this is suitable for identifying process flow and checking production progress, it is difficult to trace the location of individual workers in real time for missing work or trajectories within the work area. To overcome this, the location and trajectory of the working tool can be analyzed in real time through a position tracking system of an operator's working tool. It can instruct the operator to perform a consistent working process. Productivity and quality improvement can be achieved by an alarming or blocking operator with possible assembly defects during the assembly process in real time. To this end, we developed a real-time tool position-tracking sensor system based on Ultra Wide Band (UWB) trilateration using a Kalman filter to eliminate mechanical vibration and radio communication noise.

The Analysis Methods Based on Patent Citation Networks for the Convergence Technologies Development Planning : A Case of Smart Factory's ICT Technologies (융합기술 개발전략 기획을 위한 특허 인용 네트워크 기반의 분석 방법론 : 스마트공장 ICT 기술을 중심으로)

  • Lee, Hyun-Min;Kim, Sun-Jae;Kim, Hong-Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.1
    • /
    • pp.34-47
    • /
    • 2018
  • As interest in advanced countries regarding the convergence technology development increases, a methodology for identifying the core convergence technology that has a large spill-over effect on the technology and industry is required for the nation's competitiveness enhancement in the convergence technology field. Based on patent citation network analysis using 1,124 USPTO patents in the ICT convergence technology field of the smart factory, this study examined the proposed heterogeneous technology convergence index as a tool for measuring the convergence characteristics of the spillovers compared to other indexes (i.e. other sector ratio index and homogeneous technology convergence index). The proposed heterogeneous technology convergence index was used to investigate core technology sectors among ICT technology sectors of smart factory identified by government ministries. Results found 6 core ICT convergence technology sectors including the manufacturing execution analysis application sector. Also, this study conducted blockmodeling analysis using the IPC codes of patents in the manufacturing execution analysis application sector, and identified that the blocks representing the electronic communication and electric digital data processing technology sectors (Block 3 & 4) are related technology sectors which can be converged with core technology. Based on the findings, the implications for the convergence technology development planning of the smart factory field are discussed.

Localization Algorithm in Wireless Sensor Networks using the Acceleration sensor (가속도 센서를 이용한 무선 센서 네트워크하에서의 위치 인식 알고리즘)

  • Hong, Sung-Hwa;Jung, Suk-Yong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.4
    • /
    • pp.1294-1300
    • /
    • 2010
  • In an environment where all nodes move, the sensor node receives anchor node's position information within communication radius and modifies the received anchor node's position information by one's traveled distance and direction in saving in one's memory, where if there at least 3, one's position is determined by performing localization through trilateration. The proposed localization mechanisms have been simulated in the Matlab. In an environment where certain distance is maintained and nodes move towards the same direction, the probability for the sensor node to meet at least 3 anchor nodes with absolute coordinates within 1 hub range is remote. Even if the sensor node has estimated its position with at least 3 beacon information, the angle ${\theta}$ error of accelerator and digital compass will continuously apply by the passage of time in enlarging the error tolerance and its estimated position not being relied. Dead reckoning technology is used as a supplementary position tracking navigation technology in places where GPS doesn't operate, where one's position can be estimated by knowing the distance and direction the node has traveled with acceleration sensor and digital compass. The localization algorithm to be explained is a localization technique that uses Dead reckoning where all nodes are loaded with omnidirectional antenna, and assumes that one's traveling distance and direction can be known with accelerator and digital compass. The simulation results show that our scheme performed better than other mechanisms (e.g. MCL, DV-distance).

Simulation of YUV-Aware Instructions for High-Performance, Low-Power Embedded Video Processors (고성능, 저전력 임베디드 비디오 프로세서를 위한 YUV 인식 명령어의 시뮬레이션)

  • Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.5
    • /
    • pp.252-259
    • /
    • 2007
  • With the rapid development of multimedia applications and wireless communication networks, consumer demand for video-over-wireless capability on mobile computing systems is growing rapidly. In this regard, this paper introduces YUV-aware instructions that enhance the performance and efficiency in the processing of color image and video. Traditional multimedia extensions (e.g., MMX, SSE, VIS, and AltiVec) depend solely on generic subword parallelism whereas the proposed YUV-aware instructions support parallel operations on two-packed 16-bit YUV (6-bit Y, 5-bits U, V) values in a 32-bit datapath architecture, providing greater concurrency and efficiency for color image and video processing. Moreover, the ability to reduce data format size reduces system cost. Experiment results on a representative dynamically scheduled embedded superscalar processor show that YUV-aware instructions achieve an average speedup of 3.9x over the baseline superscalar performance. This is in contrast to MMX (a representative Intel#s multimedia extension), which achieves a speedup of only 2.1x over the same baseline superscalar processor. In addition, YUV-aware instructions outperform MMX instructions in energy reduction (75.8% reduction with YUV-aware instructions, but only 54.8% reduction with MMX instructions over the baseline).

Art and Collectivity (미술과 집단성)

  • Kwok, Kian-Chow
    • The Journal of Art Theory & Practice
    • /
    • no.4
    • /
    • pp.181-202
    • /
    • 2006
  • "When it comes to art, nationalism is a goodticket to ride with", says the title of a report in the Indian Express (Mumbai, 29 Oct 2000). The newspaper report goes on to say that since Indian art was kept "ethnic" by colonialism, national liberation meant opening up to the world on India's own terms. Advocacy, at the tail end of the 20th century, would contrast dramatically with the call by Rabindranath Tagore, the founder of the academy at Santiniketan in 1901, to guard against the fetish of nationalism. "The colourless vagueness of cosmopolitanism," Tagore pronounced, "nor thefierce self-idolatry of nation-worship, is the goal of human history" (Nationalism, 1917). This contrast is significant on two counts. First is the positive aspect of "nation" as a frame in art production or circulation, at the current point of globalization when massive expansion of cultural consumers may be realized through prevailing communication networks and technology. The organization of the information market, most vividly demonstrated through the recent FIFA World Cup when one out of every five living human beings on earth watched the finals, is predicated on nations as categories. An extension of the Indian Express argument would be that tagging of artworks along the category of nation would help ensure greatest reception, and would in turn open up the reified category of "art," so as to consider new impetus from aesthetic traditions from all parts of the world many of which hereto fore regarded as "ethnic," so as to liberate art from any hegemony of "international standards." Secondly, the critique of nationalism points to a transnational civic sphere, be it Tagore's notion of people-not-nation, or the much mo re recent "transnational constellation" of Jurgen Habermas (2001), a vision for the European Union w here civil sphere beyond confines of nation opens up new possibilities, and may serve as a model for a liberated sphere on global scale. There are other levels of collectivity which art may address, for instance the Indonesian example of local communities headed by Ketua Rukun Tetangga, the neighbourhood headmen, in which community matters of culture and the arts are organically woven into the communal fabric. Art and collectivity at the national-transnational level yield a contrasting situation of, on the idealized end, the dual inputs of local culture and tradition through "nation" as necessary frame, and the concurrent development of a transnational, culturally and aesthetically vibrant civic sphere that will ensure a cosmopolitanism that is not a "colourless vagueness." In art historical studies, this is seen, for instance, in the recent discussion on "cosmopolitan modernisms." Conversely, we may see a dual tyranny of a nationalism that is a closure (sometimes stated as "ethno-nationalism" which is disputable), and an internationalism that is evolved through restrictive understanding of historical development within privileged expressions. In art historical terms, where there is a lack of investigation into the reality of multiple modernisms, the possibility of a democratic cosmopolitanism in art is severely curtailed. The advocacy of a liberal cosmopolitanism without a democratic foundation returns art to dominance of historical privileged category. A local community with lack of transnational inputs may sometimes place emphasis on neo-traditionalism which is also a double edged sword, as re kindling with traditions is both liberating and restrictive, which in turn interplays with the push and pull of the collective matrix.

  • PDF

Pre-Planned Tree Reconfiguration Mechanism for QoS Multicast Routing (QoS 멀티캐스트 라우팅을 위한 계획된 트리 재구성 방법)

  • Han, Seung-Jae;Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.2
    • /
    • pp.120-133
    • /
    • 2007
  • A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.

Target Advertisement based on a TV Viewer's Profile Inference and TV Anytime Metadata (시청자 프로파일 추론과 TV Anytime 메타데이타를 이용한 표적 광고)

  • Kim, Mun-Jo;Lee, Bum-Sik;Lim, Jeong-Yon;Kim, Mun-Churl;Lee, Hee-Kyung;Lee, Han-Gyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.709-721
    • /
    • 2006
  • The traditional broadcasting services over terrestrial, satellite and cable media have been unidirectional mass media regardless of TV viewer's preferences. Recently ich media streaming has become possible via the broadb and networks. Furthermore, since bidirectional communication is possible, personalcasting such as personalized streaming services has been emerging by taking into account the user's preference on content genres, viewing times and actors/actresses etc. Accordingly, personal media becomes an important means for content provision service in addition to the traditional broadcasting service as mass media. In this paper, we introduce a user profile reasoning method for target advertisement which is considered an important application in personalcasting service. The proposed user profile reasoning method predicts an unknown TV viewer's gender and ages by analyzing TV Viewing history data. Based on the estimated user's gender and ages, a target advertisement is provided with TV Anytime metadata. A proposed target advertisement system is developed based on the user profile reasoning and the target advertisement selection method. To show the effectiveness of our proposed methods, we present a plenty of experimental results by using realistic TV viewing history data.

Data Weight based Scheduling Scheme for Fair data collection in Sensor Networks with Mobile Sink (모바일 싱크 기반 무선 센서 네트워크에서 균등한 데이타 수집을 위한 데이타 가중치 기반 스케줄링 기법)

  • Jo, Young-Tae;Park, Chong-Myung;Lee, Joa-Hyoung;Jung, In-Bum
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.21-33
    • /
    • 2008
  • The wireless sensor nodes near to the fixed sink node suffer from the quickly exhausted battery energy. To address this problem, the mobile sink node has been applied to distribute the energy consumption into all wireless sensor nodes. However, since the mobile sink node moves, the data collection scheduling scheme is necessary for the sink node to receive the data from all sensor nodes as fair as possible. The application fields of wireless sensor network need the real-time processing. If the uneven data collection occurs in the wireless sensor network, the real-time processing for the urgent events can not be satisfied. In this paper, a new method is proposed to support the lair data collection between all sensor nodes. The proposed method performs the scheduling algorithm based on the resident time of the sink node staying in a radius of communication range and the amount of data transferred already. In this paper, the proposed method and existing data collection scheduling schemes are evaluated in wireless sensor network with the mobile sink node. The result shows that the proposed method provides the best fairness among all data collection schemes.

Analysis on the characteristics for upper bound of [1,2]-domination in trees (트리의 [1,2]-지배 수 상계에 대한 특성 분석)

  • Lee, Hoon;Sohn, Moo Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2243-2251
    • /
    • 2016
  • In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

3D Node Deployment and Network Configuration Methods for Improvement of Node Coverage and Network Connectivity (커버리지와 네트워크 연결성 향상을 위한 3차원 공간 노드 배치 및 망 구성 방법)

  • Kim, Yong-Hyun;Kim, Lee-Hyeong;Ahn, Mirim;Chung, Kwangsue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.778-786
    • /
    • 2012
  • Sensors that are used on wireless sensor networks can be divided into two types: directional sensors, such as PIR, image, and electromagnetic sensors; and non-directional sensors, such as seismic, acoustic and magnetic sensors. In order to guarantee the line-of-sight of a directional sensor, the installation location of the sensor must be higher than ground level. Among non-directional sensors, seismic sensors should be installed on the ground in order to ensure the maximal performance. As a result, seismic sensors may have network connectivity problems due to communication failure. In this paper, we propose a 3D node deployment method to maximize the coverage and the network connectivity considering the sensor-specific properties. The proposed method is for non-directional sensors to be placed on the ground, while the directional sensor is installed above the ground, using trees or poles, to maximize the coverage. As a result, through the topology that the detection data from non-directional sensors are transmitted to the directional sensor, we can maximize the network connectivity. Simulation results show that our strategy improves sensor coverage and network connectivity.