• Title/Summary/Keyword: sensor network simulator

Search Result 117, Processing Time 0.026 seconds

An Uniform Routing Mechanism with Low Energy Consumption over Wireless Sensor Network (유비쿼터스 센서네트워크에서 균일한 에너지 소모를 유도하는 경로설정기법)

  • Yoon Mi-Youn;Lee Kwang-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.80-90
    • /
    • 2006
  • WSN(Wireless Sensor Network) performs to detect and collect environmental information for one purpose. As examples, WSN is applicable for home network, patient management of a hospital, logistics management, status detection during the war and so on. The WSN is composed of a sink node and several sensor nodes and has a constraint in an aspect of energy consumption caused by limited battery resource. So many required mechanisms in WSN should consider the remained energy condition. A routing mechanism is requested to deliver the collected information to a sink considering energy efficiency in WSN. There have been many researches to establish (a) route(s) for data delivery to the sink. In this paper, we propose establishment of efficient routes. We proposed a uniform routing mechanism together with considering energy efficiency. For the routing, we define energy probability as routing metrics information and Performs suppression of exchange of control messages. In addition, we derive to uniformly consume the energy of the sensor node when establishing the routes. Also, we evaluate and analyze the energy efficiency for proposed mechanisms through NS-2 simulator.

A Mechanism for Handling Selfish Nodes using Credit in Sensor Networks (센서 네트워크에서 크레딧을 이용한 이기적인 노드 처리 방안)

  • Choe, Jong-Won;Yoo, Dong-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.2
    • /
    • pp.120-129
    • /
    • 2008
  • The purpose of sensor network is gathering the information from sensor nodes. If there are selfish node that deliberately avoid packet forwarding to save their own energy, the sensor network has trouble to collect information smoothly. To solve this problem we suggest a mechanism which uses credit payment schema according to the amount of forwarding packets. Sensor nodes use credits to send their own message and they forward packets of other sensor nodes to get credits. To offer authenticity we combined the roles of sink node and server, also we used piggybacking not to send additional report message. The packet trace route is almost fixed because sensor node doesn't have mobility. In this case, it happens that some sensor nodes which don't receive forwarding packets therefore they can't get credit. So, we suggested the way to give more credits to these sensor nodes. Finally, we simulated the suggested mechanism to evaluate performance with ns2(network simulator). As a result, packet transmission rate was kept on a high rate and the number of arrival packets to sink node was increased. Also, we could verify that more sensor nodes live longer due to deceasing the energy consumption of sensor nodes.

A Comprehensive Analysis of the End-to-End Delay for Wireless Multimedia Sensor Networks

  • Abbas, Nasim;Yu, Fengqi
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2456-2467
    • /
    • 2018
  • Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.

Development of Commercial Game Engine-based Low Cost Driving Simulator for Researches on Autonomous Driving Artificial Intelligent Algorithms (자율주행 인공지능 알고리즘 연구를 위한 상용 게임 엔진 기반 초저가 드라이빙 시뮬레이터 개발)

  • Im, Ji Ung;Kang, Min Su;Park, Dong Hyuk;Won, Jong hoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.20 no.6
    • /
    • pp.242-263
    • /
    • 2021
  • This paper presents a method to implement a low-cost driving simulator for developing autonomous driving algorithms. This is implemented by using GTA V, a physical engine-based commercial game software, containing a function to emulate output and data of various sensors for autonomous driving. For this, NF of Script Hook V is incorporated to acquire GT data by accessing internal data of the software engine, and then, various sensor data for autonomous driving are generated. We present an overall function of the developed driving simulator and perform a verification of individual functions. We explain the process of acquiring GT data via direct access to the internal memory of the game engine to build up an autonomous driving algorithm development environment. And, finally, an example applicable to artificial neural network training and performance evaluation by processing the emulated sensor output is included.

Enhanced OLSR Routing Protocol Using Link-Break Prediction Mechanism for WSN

  • Jaggi, Sukhleen;Wasson, Er. Vikas
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.3
    • /
    • pp.259-267
    • /
    • 2016
  • In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

A Software Framework for Verifying Sensor Network Operations and Sensing Algorithms (센서네트워크 동작 및 센싱 알고리즘 검증을 위한 소프트웨어 프레임워크)

  • Yoo, Seong-Eun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.1
    • /
    • pp.63-71
    • /
    • 2012
  • Most of sensor networks are difficult to be debugged, verified, and upgraded once they are deployed in the fields, for they are usually deployed in real world and large scale. Therefore, before deploying the sensor networks, we should test and verify them sufficiently in realistic testbeds. However, since we need to control physical environments which interact with sensor networks, it takes much of time and cost to test and verify sensor networks at the level of resource-constrained sensor nodes in such environments. This paper proposes an efficient software framework for evaluating and verifying sensor networks in the view points of network and application operations (i.e., accuracy of sensing algorithms). Applying the proposed software framework to the development of a simulator for a smart parking application based on wireless sensor network, this paper verifies the feasibility of the proposed framework.

MCRO-ECP: Mutation Chemical Reaction Optimization based Energy Efficient Clustering Protocol for Wireless Sensor Networks

  • Daniel, Ravuri;Rao, Kuda Nageswara
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3494-3510
    • /
    • 2019
  • Wireless sensor networks encounter energy saving as a major issue as the sensor nodes having no rechargeable batteries and also the resources are limited. Clustering of sensors play a pivotal role in energy saving of the deployed sensor nodes. However, in the cluster based wireless sensor network, the cluster heads tend to consume more energy for additional functions such as reception of data, aggregation and transmission of the received data to the base station. So, careful selection of cluster head and formation of cluster plays vital role in energy conservation and enhancement of lifetime of the wireless sensor networks. This study proposes a new mutation chemical reaction optimization (MCRO) which is an algorithm based energy efficient clustering protocol termed as MCRO-ECP, for wireless sensor networks. The proposed protocol is extensively developed with effective methods such as potential energy function and molecular structure encoding for cluster head selection and cluster formation. While developing potential functions for energy conservation, the following parameters are taken into account: neighbor node distance, base station distance, ratio of energy, intra-cluster distance, and CH node degree to make the MCRO-ECP protocol to be potential energy conserver. The proposed protocol is studied extensively and tested elaborately on NS2.35 Simulator under various senarios like varying the number of sensor nodes and CHs. A comparative study between the simulation results derived from the proposed MCRO-ECP protocol and the results of the already existing protocol, shows that MCRO-ECP protocol produces significantly better results in energy conservation, increase network life time, packets received by the BS and the convergence rate.

The Method of Reducing the Delay Latency to Improve the Efficiency of Power Consumption in Wireless Sensor Networks

  • Ho, Jang;Son, Jeong-Bong
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.199-204
    • /
    • 2008
  • Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

  • PDF

Channel Selection Method of Wireless Sensor Network Nodes for avoiding Interference in 2.4Ghz ISM(Industrial, Scientific, Medical) Band (2.4Ghz ISM(Industrial Scientific Medical) 밴드에서 간섭을 회피하기 위한 무선 센서 노드의 채널 선택 방법)

  • Kim, Su Min;Kuem, Dong Hyun;Kim, Kyung Hoon;Oh, Il;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.4
    • /
    • pp.109-116
    • /
    • 2014
  • In recent, ISM (Industrial Scientific Medical) band that is 2.4GHz band authorized free of charge is being widely used for smart phone, notebook computer, printer and portable multimedia devices. Accordingly, studies have been continuously conducted on the possibility of coexistence among nodes using ISM band. In particular, the interference of IEEE 802.11b based Wi-Fi device using overlapping channel during communication among IEEE 802.15.4 based wireless sensor nodes suitable for low-power, low-speed communication using ISM band causes serious network performance deterioration of wireless sensor networks. This paper examined a method of identifying channel status to avoid interference among wireless communication devices using IEEE 802.11b (Wi-Fi) and other ISM bands during communication among IEEE 802.15.4 based wireless sensor network nodes in ISM band. To identify channels occupied by Wi-Fi traffic, various studies are being conducted that use the RSSI (Received Signal Strength Indicator) value of interference signal obtained through ED (Energy Detection) feature that is one of IEEE 802.15.4 transmitter characteristics. This paper examines an algorithm that identifies the possibility of using more accurate channel by mixing utilization of interference signal and RSSI mean value of interference signal by wireless sensor network nodes. In addition, it verifies such algorithm by using OPNET Network verification simulator.

An Energy Efficient Cluster Formation Algorithm for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 구성 알고리즘)

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.185-190
    • /
    • 2007
  • The efficient node energy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing each energy consumption of the sensor node in the network. In this paper, we proposed a cluster formation algorithm to extend the lifetime of the networks and to maintain a balanced energy consumption of nodes. To obtain it, we add a tiny slot in a round frame, which enables to exchange the residual energy messages between the base station (BS). cluster heads, and nodes. The performance of the proposed protocol has been examined and evaluated with the NS 2 simulator. As a result of simulation, we have confirmed that our proposed algorithm show the better performance in terms of lifetime than LEACH. Consequently, our proposed protocol can effectively extend the network lifetime without other critical overhead and performance degradation.