• Title/Summary/Keyword: wsn

Search Result 891, Processing Time 0.031 seconds

A Distributed address allocation scheme based on three-dimensional coordinate for efficient routing in WBAN (WBAN 환경에서 효율적인 라우팅을 위한 3차원 좌표 주소할당 기법의 적용)

  • Lee, Jun-Hyuk
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.663-673
    • /
    • 2014
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

A RSS-Based Localization for Multiple Modes using Bayesian Compressive Sensing with Path-Loss Estimation (전력 손실 지수 추정 기법과 베이지안 압축 센싱을 이용하는 수신신호 세기 기반의 위치 추정 기법)

  • Ahn, Tae-Joon;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.29-36
    • /
    • 2012
  • In Wireless Sensor Network(WSN)s, the detection of precise location of each node is essential for utilizing sensing data acquired from sensor nodes effectively. Among various location methods, the received signal strength(RSS) based localization scheme is mostly preferable in many applications because it can be easily implemented without any additional hardware cost. Since a RSS-based localization scheme is mainly affected by radio channel or obstacles such as building and mountain between two nodes, the localization error can be inevitable. To enhance the accuracy of localization in RSS-based localization scheme, a number of RSS measurements are needed, which results in the energy consumption. In this paper, a RSS based localization using Bayesian Compressive Sensing(BSS) with path-loss exponent estimation is proposed to improve the accuracy of localization in the energy-efficient way. In the propose scheme, we can increase the adaptative, reliability and accuracy of localization by estimating the path-loss exponents between nodes, and further we can enhance the energy efficiency by the compressive sensing. Through the simulation, it is shown that the proposed scheme can enhance the location accuracy of multiple unknown nodes with fewer RSS measurements and is robust against the channel variation.

Performance Evaluation of Traffic Adaptive Sleep based MAC in Clustered Wireless Sensor Networks (클러스터 기반 무선 센서 망에서 트래픽 적응적 수면시간 기반 MAC 프로토콜 성능 분석)

  • Xiong, Hongyu;So, Won-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.5
    • /
    • pp.107-116
    • /
    • 2011
  • In this paper, a traffic adaptive sleep based medium access control (TAS-MAC) protocol for wireless sensor networks (WSNs) is proposed. The protocol aims for WSNs which consist of clustered sensor nodes and is based on TDMA-like schema. It is a typical schedule based mechanism which is adopted in previous protocols such as LEACH and Bit-Map Assisted MAC. The proposed MAC, however, considers unexpected long silent period in which sensor nodes have no data input and events do not happen in monitoring environment. With the simple traffic measurement, the TAS-MAC eliminates scheduling phases consuming energy in previous centralized approaches. A frame structure of the protocol includes three periods, investigation (I), transmission (T), and sleep-period (S). Through the I-period, TAS-MAC aggregates current traffic information from each end node and dynamically decide the length of sleep period to avoid energy waste in long silent period. In spite of the energy efficiency of this approach, the delay of data might increase. Thus, we propose an advanced version of TAS-MAC as well, each node in cluster sends one or more data packets to cluster head during the T-period of a frame. Through simulation, the performance in terms of energy consumption and transmission delay is evaluated. By comparing to BMA-MAC, the results indicate the proposed protocol is more energy efficient with tolerable expense in latency, especially in variable traffic situation.

Multi-Channel Pipelining for Energy Efficiency and Delay Reduction in Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율성과 지연 감소를 위한 다중 채널 파리프라인 기법)

  • Lee, Yoh-Han;Kim, Daeyoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.11
    • /
    • pp.11-18
    • /
    • 2014
  • Most of the energy efficient MAC protocols for wireless sensor networks (WSNs) are based on duty cycling in a single channel and show competitive performances in a small number of traffic flows; however, under concurrent multiple flows, they result in significant performance degradation due to contention and collision. We propose a multi-channel pipelining (MCP) method for convergecast WSN in order to address these problems. In MCP, a staggered dynamic phase shift (SDPS) algorithms devised to minimize end-to-end latency by dynamically staggering wake-up schedule of nodes on a multi-hop path. Also, a phase-locking identification (PLI) algorithm is proposed to optimize energy efficiency. Based on these algorithms, multiple flows can be dynamically pipelined in one of multiple channels and successively handled by sink switched to each channel. We present an analytical model to compute the duty cycle and the latency of MCP and validate the model by simulation. Simulation evaluation shows that our proposal is superior to existing protocols: X-MAC and DPS-MAC in terms of duty cycle, end-to-end latency, delivery ratio, and aggregate throughput.

Flexible Intelligent Exit Sign Management of Cloud-Connected Buildings

  • Lee, Minwoo;Mariappan, Vinayagam;Lee, Junghoon;Cho, Juphil;Cha, Jaesang
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.58-63
    • /
    • 2017
  • Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.

Beacon Node Based Localization Algorithm Using Received Signal Strength(RSS) and Path Loss Calibration for Wireless Sensor Networks (무선 센서 네트워크에서 수신신호세기와 전력손실지수 추정을 활용하는 비콘 노드 기반의 위치 추정 기법)

  • Kang, Hyung-Seo;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.15-21
    • /
    • 2011
  • In the range-based localization, the localization accuracy will be high dependent on the accuracy of distance measurement between two nodes. The received signal strength(RSS) is one of the simplest methods of distance measurement, and can be easily implemented in a ranging-based method. However, a RSS-based localization scheme has few problems. One problem is that the signal in the communication channel is affected by many factors such as fading, shadowing, obstacle, and etc, which makes the error of distance measurement occur and the localization accuracy of sensor node be low. The other problem is that the sensor node estimates its location for itself in most cases of the RSS-based localization schemes, which makes the sensor network life time be reduced due to the battery limit of sensor nodes. Since beacon nodes usually have more resources than sensor nodes in terms of computation ability and battery, the beacon node based localization scheme can expand the life time of the sensor network. In this paper, therefore we propose a beacon node based localization algorithm using received signal strength(RSS) and path loss calibration in order to overcome the aforementioned problems. Through simulations, we prove the efficiency of the proposed scheme.

A Study on The Management of A Building by Applying RFID/USN (RFID/USN의 적용을 통한 건축물 관리 방안)

  • Ju, Hyun-Tae;Kim, Kyung-Hwan;Lee, Yoon-Sun;Kim, Jae-Jun
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2007.11a
    • /
    • pp.331-336
    • /
    • 2007
  • The importance of a building management is embossed at construction industry and the concernment about a lengthening longevity and a efficient management of construction project is concentrated. At present, a study about maintenance management of existing building is progressed and normal papers concentrate in partial construction project for showing management method. This paper proposes Management method that make use of RFID/USN at the whole course of construction project that is composed plan, design, supply, construction, operation, maintenance management and so on. First of all, this paper analyzes process and applicable scope of RFID/USN at construction project. At each step, use scope, location, method and so on are decided at plan, design step and equipment, human power, materials and so on are established at supply step. real time progress, human power, safety, material, equipment management and so on put in operation at construction step and building is managemented real time by established sensor tag and wireless sensor network. This paper want to helps efficient project progress and management and presents convenience of maintenance management.

  • PDF

A Design of Delta-Average Queue Management Method for Supporting QoS in Wireless Sensor Networks (무선 센서 네트워크에서 QoS 제공을 위한 Delta-Average 큐 관리 기법 설계)

  • Yu Tae-Young;Kum Hyun-Tae;Jee Suk-Kun;Ra In-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.446-450
    • /
    • 2006
  • Recently, the advances on sensor technology increases the study on data processing oriented middleware. Usually, most of middleware uses the naive and delta method for queue management to process data effectively. But such a queue management method it is difficult to support guaranteeing of the requested quality of services because it simply discards the data in a queue when the overflow is occurred. To handle this problem, some methods for minimizing data volumes in a wireless sensor network have been studied, but most of them cause another problem that needs the huge processing time additionally with higher complexity of the proposed algorithm. In this paper, we propose a new method of delta-average queue management by applying the mean value to the exiting delta queue management method using the data differences to handle the problem of queue overflow. The proposed method has lower complexity than the others and increases the QoS of a WSN application by using mean value instead of using data discarding policy. In addition, it is designed to manage a queue effectively by controlling the range of data differences adaptively to the target sensor network environment.

  • PDF

Localization Scheme with Weighted Multiple Rings in Wireless Sensor Networks (무선 센서 네트워크에서 가중 다중 링을 이용한 측위 기법)

  • Ahn, Hong-Beom;Hong, Jin-Pyo
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.409-414
    • /
    • 2010
  • The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).

A Cluster Based Energy Efficient Tree Routing Protocol in Wireless Sensor Networks (광역 WSN 을 위한 클러스팅 트리 라우팅 프로토콜)

  • Nurhayati, Nurhayati;Choi, Sung-Hee;Lee, Kyung-Oh
    • Annual Conference of KIPS
    • /
    • 2011.04a
    • /
    • pp.576-579
    • /
    • 2011
  • Wireless sensor network are widely all over different fields. Because of its distinguished characteristics, we must take account of the factor of energy consumed when designing routing protocol. Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors sends data from the CH (Cluster Head) and then to the BS (Base Station). BCDCP works well in a smallscale network however is not preferred in a large scale network since it uses much energy for long distance wireless communication. TBRP can be used for large scale network, but it weakness lies on the fact that the nodedry out of energy easily since it uses multi-hops transmission data to the Base Station. Here, we proposed a routing protocol. A Cluster Based Energy Efficient Tree Routing Protocol (CETRP) in Wireless Sensor Networks (WSNs) to prolong network life time through the balanced energy consumption. CETRP selects Cluster Head of cluster tree shape and uses maximum two hops data transmission to the Cluster Head in every level. We show CETRP outperforms BCDCP and TBRP with several experiments.