• Title/Summary/Keyword: Sensor Networks Deployment

Search Result 137, Processing Time 0.023 seconds

A Single Mobile Target Tracking in Voronoi-based Clustered Wireless Sensor Network

  • Chen, Jiehui;Salim, Mariam B.;Matsumoto, Mitsuji
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.17-28
    • /
    • 2011
  • Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.

AN APPROXIMATION SCHEME FOR A GEOMETRICAL NP-HARD PROBLEM

  • Kim, Joon-Mo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.4
    • /
    • pp.1-8
    • /
    • 2007
  • In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its a bstract form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract form. Note that by reducing the numb er of nodes in a sensor network, the amount of data exchange over the net will be far decreased.

  • PDF

Instruction-Level Power Estimator for Sensor Networks

  • Joe, Hyun-Woo;Park, Jae-Bok;Lim, Chae-Deok;Woo, Duk-Kyun;Kim, Hyung-Shin
    • ETRI Journal
    • /
    • v.30 no.1
    • /
    • pp.47-58
    • /
    • 2008
  • In sensor networks, analyzing power consumption before actual deployment is crucial for maximizing service lifetime. This paper proposes an instruction-level power estimator (IPEN) for sensor networks. IPEN is an accurate and fine grain power estimation tool, using an instruction-level simulator. It is independent of the operating system, so many different kinds of sensor node software can be simulated for estimation. We have developed the power model of a Micaz-compatible mote. The power consumption of the ATmega128L microcontroller is modeled with the base energy cost and the instruction overheads. The CC2420 communication component and other peripherals are modeled according to their operation states. The energy consumption estimation module profiles peripheral accesses and function calls while an application is running. IPEN has shown excellent power estimation accuracy, with less than 5% estimation error compared to real sensor network implementation. With IPEN's high precision instruction-level energy prediction, users can accurately estimate a sensor network's energy consumption and achieve fine-grained optimization of their software.

  • PDF

A Cost-Efficient Energy Supply Sources Deployment Scheme in Wireless Sensor Networks (센서 네트워크 바용 절감을 위한 에너지 공급장치 배치 기법)

  • Choi, Yun-Bum;Kim, Yong-Ho;Kim, Jae-Joon;Kim, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.738-743
    • /
    • 2011
  • This paper considers the cost minimization issue for sensor network systems where sensor energy is supplied by remote energy sources wirelessly. Assuming symmetric structures of sensor nodes and energy sources, cost minimization problem is formulated, where the cost of sensor networks is represented as a function of sensor node density and energy source coverage. The optimal solution for the problem is provided and simulation results show that the proposal scheme achieves around 19% cost reduction in comparision to a conventional scheme.

Reader Collision Avoidance Scheme for Mobile RFID-Sensor Integrated Networks

  • Ko, Doo-Hyun;Kim, Song-Min;Lee, Sang-Bin;An, Sun-Shin
    • Journal of IKEEE
    • /
    • v.13 no.2
    • /
    • pp.108-117
    • /
    • 2009
  • In recent years, one of alternatives for constructing RFID networks that provide mobile services is using wireless sensor networks (WSN) to enhance network capacity, utility and scalability. Due to absence of compatible reader anti-collision control and channel capture phenomenon, the medium access control protocols as used in the RFID networks lead to reader collision and starvation problem. In this paper, we develop a MAC protocol which is called Enhanced Collision Avoidance MAC (ECO) to avoid reader to reader collisions in an integrated RFID network. ECO is a CSMA-based MAC protocol, and operates on integrated nodes which consist of a RFID reader and a mote. Performance evaluation shows superior results to pure-CSMA protocols under dense deployment environments, both in number of failures and in throughput.

  • PDF

On Deploying Relays for Connected Indoor Sensor Networks

  • Zhu, Yanmin;Xue, Cuiyao;Cai, Haibin;Yu, Jiadi;Ni, Lei;Li, Minglu;Li, Bo
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.335-343
    • /
    • 2014
  • This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

Constrained Relay Node Deployment using an improved multi-objective Artificial Bee Colony in Wireless Sensor Networks

  • Yu, Wenjie;Li, Xunbo;Li, Xiang;Zeng, Zhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2889-2909
    • /
    • 2017
  • Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

HandButton: Gesture Recognition of Transceiver-free Object by Using Wireless Networks

  • Zhang, Dian;Zheng, Weiling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.787-806
    • /
    • 2016
  • Traditional radio-based gesture recognition approaches usually require the target to carry a device (e.g., an EMG sensor or an accelerometer sensor). However, such requirement cannot be satisfied in many applications. For example, in smart home, users want to control the light on/off by some specific hand gesture, without finding and pressing the button especially in dark area. They will not carry any device in this scenario. To overcome this drawback, in this paper, we propose three algorithms able to recognize the target gesture (mainly the human hand gesture) without carrying any device, based on just Radio Signal Strength Indicator (RSSI). Our platform utilizes only 6 telosB sensor nodes with a very easy deployment. Experiment results show that the successful recognition radio can reach around 80% in our system.

Location Privacy and Authentication for Low-cost Sensor Node Devices Using Varying Identifiers

  • Hamid Abdul;HONG Choong Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.412-414
    • /
    • 2005
  • Because a sensor node must operate on a tiny battery, the goal to eliminate energy inefficiencies leads the current researchers excavating for new techniques to advocate. As sensor networks edge closer towards wide spread deployment, security issues become a central concern. So far much research has focused on making sensor networks feasible and useful, and has not concentrated much on security issues especially computationally inexpensive techniques. In this paper we introduce a simple scheme relying on one-way hash-functions that greatly enhances location privacy by changing traceable identifiers on every read getting by with only a single, unreliable message exchange. Thereby the scheme is safe from many threats like eavesdropping, message interception, spoofing, and replay attacks.

  • PDF

HDF: Hybrid Debugging Framework for Distributed Network Environments

  • Kim, Young-Joo;Song, Sejun;Kim, Daeyoung
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.222-233
    • /
    • 2017
  • Debugging in distributed environments, such as wireless sensor networks (WSNs), which consist of sensor nodes with limited resources, is an iterative and occasionally laborious process for programmers. In sensor networks, it is not easy to find unintended bugs that arise during development and deployment, and that are due to a lack of visibility into the nodes and a dearth of effective debugging tools. Most sensor network debugging tools are not provided with effective facilities such as real-time tracing, remote debugging, or a GUI environment. In this paper, we present a hybrid debugging framework (HDF) that works on WSNs. This framework supports query-based monitoring and real-time tracing on sensor nodes. The monitoring supports commands to manage/control the deployed nodes, and provides new debug commands. To do so, we devised a debugging device called a Docking Debug-Box (D2-Box), and two program agents. In addition, we provide a scalable node monitor to enable all deployed nodes for viewing. To transmit and collect their data or information reliably, all nodes are connected using a scalable node monitor applied through the Internet. Therefore, the suggested framework in theory does not increase the network traffic for debugging on WSNs, and the traffic complexity is nearly O(1).