• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.036 seconds

Localization of Multiple Mobile Nodes based on Node Centric Method in Sensor Network (센서네트워크에서 노드중심의 다중 이동 노드 위치 인식 기법)

  • Lee, Joa-Hyoung;Lim, Hwa-Jung;Tscha, Yeong-hwan
    • Annual Conference of KIPS
    • /
    • 2007.11a
    • /
    • pp.1050-1053
    • /
    • 2007
  • 여러 이동노드들이 한 지역에서 동시에 위치인식 작업을 수행하는 경우에 비콘 노드들이 발생시키는 비콘이나 초음파 등이 충돌을 일으킬 수 있다. 본 논문에서는 이동 노드들이 위치확인 작업을 수행하고자 하는 경우에 RTS메시지와 CTS메시지를 이용하여 충돌을 회피하도록 하는 MNC기법을 제안한다. MNC에서는 다른 노드가 위치확인 작업을 수행하는 경우에는 NTS를 전송하여 노드 간에 작업이 충돌되지 않도록 한다. 이동노드가 비콘노드들에 작업순서를 결정하여 STS메시지로 통보하여 비콘노드간에 충돌을 방지한다.

An Energy Efficient Unequal Clustering Algorithm for Wireless Sensor Networks (무선 센서 네트워크에서의 에너지 효율적인 불균형 클러스터링 알고리즘)

  • Lee, Sung-Ju;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.783-790
    • /
    • 2009
  • The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.

An Improved Vehicle Tracking Scheme Combining Range-based and Range-free Localization in Intersection Environment (교차로 환경에서 Range-based와 Range-free 위치측정기법을 혼합한 개선된 차량위치추적기법)

  • Park, Jae-Bok;Koh, Kwang-Shin;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.106-116
    • /
    • 2011
  • USN(Ubiquitous Sensor Network) environment permits us to access whatever information we want, whenever we want. The technologies to provide a basement to these environments premise an accurate location establishment. Especially, ITS(Intelligent Transportation Systems) is easily constructed by applying USN technology. Localization can be categorized as either Range-based or Range-free. Range-based is known to be not suitable for the localization based on sensor network, because of the irregularity of radio propagation and the additional device requirement. The other side, Range-free is much appropriated for the resource constrained sensor network because it can actively locate by means of the communication radio. But, generally the location accuracy of Range-free is low. Especially, it is very low in a low-density environment. So, these two methods have both merits and demerits. Therefore, it requires a new method to be able to improve tracking accuracy by combining the two methods. This paper proposes the tracking scheme based on range-hybrid, which can markedly enhance tracking accuracy by effectively using the information of surrounding nodes and the RSSI(Received Signal Strength Indication) that does not require additional hardware. Additionally, we present a method, which can improve the accuracy of vehicle tracking by adopting the prediction mechanism. Simulation results show that our method outperforms other methods in the transportation simulation environment.

A Multi-objective Ant Colony Optimization Algorithm for Real Time Intrusion Detection Routing in Sensor Network (센서 네트워크에서 실시간 침입탐지 라우팅을 위한 다목적 개미 군집 최적화 알고리즘)

  • Kang, Seung-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.5
    • /
    • pp.191-198
    • /
    • 2013
  • It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

Disjointed Multipath Routing for Real-time Multimedia Data Transmission in Wireless Sensor Networks (무선 센서 네트워크 환경에서 실시간 멀티미디어 데이터 전송을 위한 비-중첩 다중 경로 라우팅)

  • Jo, Mi-Rim;Seong, Dong-Ook;Park, Jun-Ho;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.78-87
    • /
    • 2011
  • A variety of intelligent application using the sensor network system is being studied. In general, the sensor network consists of nodes which equipped with a variety of sensing module and is utilized to collect environment information. Recently, the demands of multimedia data are increasing due to the demands of more detailed environmental monitoring or high-quality data. In this paper, we overcome the limitations of low bandwidth in Zigbee-based sensor networks and propose a routing algorithm for real-time multimedia data transmission. In the previously proposed algorithm for multimedia data transmission occurs delay time of routing setup phase and has a low data transmission speed due to bandwidth limitations of Zigbee. In this paper, we propose the hybrid routing algorithm that consist of Zigbee and Bluetooth and solve the bandwidth problem of existing algorithm. We also propose the disjointed multipath setup algorithm based on competition that overcome delay time of routing setup phase in existing algorithm. To evaluate the superiority of the proposed algorithm, we compare it with the existing algorithm. Our experimental results show that the latency was reduced by approximately 78% and the communication speed is increased by approximately 6.9-fold.

A Bottom up Filtering Tuple Selection Method for Continuous Skyline Query Processing in Sensor Networks (센서 네트워크에서 연속 스카이라인 질의 처리를 위한 상향식 필터링 투플 선정 방법)

  • Sun, Jin-Ho;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.280-291
    • /
    • 2009
  • Skyline Query processing is important to wireless sensor applications in order to process multi-dimensional data efficiently. Most skyline researches about sensor network focus on minimizing the energy consumption due to the battery powered constraints. In order to reduce energy consumption, Filtering Method is proposed. Most existing researches have assumed a snapshot skyline query processing and do not consider continuous queries and use data generated in ancestor node. In this paper, we propose an energy efficient method called Bottom up filtering tuple selection for continuous skyline query processing. Past skyline data generated in child nodes are stored in each sensor node and is used when choosing filtering tuple. We also extend the algorithms, called Support filtering tuple(SFT) that is used when we choose the additional filtering tuple. There is a temporal correlation between previous sensing data and recent sensing data. Thus, Based on past data, we estimate current data. By considering this point, we reduce the unnecessary communication cost. The experimental results show that our method outperforms the existing methods in terms of both data reduction rate(DRR) and total communication cost.

An Efficient Data Centric Storage Scheme with Non-uniformed Density of Wireless Sensor Networks (센서의 불균일한 배포밀도를 고려한 효율적인 데이터 중심 저장기법)

  • Seong, dong-ook;Lee, seok-jae;Song, seok-il;Yoo, jae-soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.135-139
    • /
    • 2007
  • Recently Data Centric Storage (DCS) schemes are variously studied for several applications (e.g. natural environment investigation, military application systems and environmental changes monitoring). In DCS scheme, data is stored at nodes within the network by name. There are several drawbacks in the existing schemes. The first is the inefficiency of the range query processing on not considered the locality of store point. the second is the non-homogeneity of store load of each sensors in case of the sensor distribution density is non-uniformed. In this paper, we propose a novel data centric storage scheme with the sensor distribution density which satisfied with the locality of data store location. This scheme divides whole sensor network area using grid and distributes the density bit map witch consist of the sensor density information of each cell. sensors use the density bit map for storing and searching the data. We evaluate our scheme with existing schemes. As a result, we show improved load balancing and more efficient range query processing than existing schemes in environment which sensors are distributed non-uniform.

  • PDF

Design and Performance Analysis of a new MAC Protocol for Providing Real-time Traffic Information using USN (USN 기반 실시간 주행 상황 정보 제공을 위한 MAC 설계 및 성능 분석)

  • Park, Man-Kyu;So, Sang-Ho;Lee, Jae-Yong;Lim, Jae-Han;Son, Myung-Hee;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.5
    • /
    • pp.38-48
    • /
    • 2007
  • In ubiquitous environment, sensor networks that sense and transmit surrounding data without human intervention will become more important. If sensors are installed for detecting vehicles and measuring their speed in the road and that real-time information is given to drivers, it will be very effective for enhancing safety and controlling traffic in the road. In this paper, we proposed a new reliable and real-time sensor MAC protocol between AP and sensor nodes in order to provide real-time traffic flow information based on ubiquitous sensor networks. The proposed MAC allocates one TDMA slot for each sensor node on the IEEE 802.15.4 based channel structure, introduces relayed communication for distant sensors, and adopts a frame structure that supports retransmission for the case of errors. In addition, the proposed MAC synchronizes with AP by using beacon and adopts a hybrid tracking mode that supports economic power consumption according to various traffic situations, We implemented a simulator for the proposed MAC by using sim++ and evaluated various performances. The simulation results show that the proposed MAC reduces the power consumption and reveals excellent performance in real-time application systems.

A Study on the Permeability through Concrete using RF Wireless Module for Reinforced Concrete Structure (철근콘크리트 구조물에 내제된 RF 무선송수신 모듈의 콘크리트 투과성 실험 연구)

  • Jo, Byung-Wan;Park, Jung-Hoon;Yoon, Kwang-Won;Kim, Heoun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.2D
    • /
    • pp.295-302
    • /
    • 2011
  • Ubiquitous is an information communication environment which peoples could connect on network without being conscious of the network and computer condition at anytime and anywhere. Presently, advanced technology, digital cities and eco-friendly cities using Ubiquitous technology are being focused through out the world. As recent information industry and communication technology have developed remarkably, studies on intelligent structures and structural maintenance methods by combining a general idea of connecting all objects on network by interpolating computers which is called Ubiquitous Computing, and USN(Ubiquitous Sensor Network) are being attempted. In this paper, a basic experiment on penetration of RF(Radio Frequency) sensor nodes using an experimental sample setting concrete and reinforcing bar as variables is studied to estimate the possibility of applying wireless sensor networks in structures. The spring of reinforcing bars, concrete thickness, intensity of radio frequency were set up as variables, transmitting and receiving distance were checked vertically and horizontally. Moreover, Spectrum Analyzer was used for checking the magnitude of the frequency used in order to measure the reduction of radio wave exactly. The radio wave reduction was numerically analyzed, and the influence of the wavelength was analysed as well. As a result, the penetration depth in concrete without reinforcing bars was 45cm, and in reinforced concretes which reinforcing bars placed at spacing of 5cm and 15cm, the penetration depth were 37cm and 45cm each. No influence on radio wave penetration depth were found when the spacing of reinforcing bars in the reinforced concrete structures becomes over 15cm.

Analysis of Block FEC Symbol Size's Effect On Transmission Efficiency and Energy Consumption over Wireless Sensor Networks (무선 센서 네트워크에서 전송 효율과 에너지 소비에 대한 블록 FEC 심볼 크기 영향 분석)

  • Ahn, Jong-Suk;Yoon, Jong-Hyuk;Lee, Young-Su
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.803-812
    • /
    • 2006
  • This paper analytically evaluates the FEC(Forward Error Correction) symbol size's effect on the performance and energy consumption of 802.11 protocol with the block FEC algorithm over WSN(Wireless Sensor Network). Since the basic recovery unit of block FEC algorithms is symbols not bits, the FEC symbol size affects the packet correction rate even with the same amount of FEC check bits over a given WSN channel. Precisely, when the same amount of FEC check bits are allocated, the small-size symbols are effective over channels with frequent short bursts of propagation errors while the large ones are good at remedying the long rare bursts. To estimate the effect of the FEC symbol site, the paper at first models the WSN channel with Gilbert model based on real packet traces collected over TIP50CM sensor nodes and measures the energy consumed for encoding and decoding the RS (Reed-Solomon) code with various symbol sizes. Based on the WSN channel model and each RS code's energy expenditure, it analytically calculates the transmission efficiency and power consumption of 802.11 equipped with RS code. The computational analysis combined with real experimental data shows that the RS symbol size makes a difference of up to 4.2% in the transmission efficiency and 35% in energy consumption even with the same amount of FEC check bits.