• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.300-304
• /
• 2007

Wireless sensor networks represent a new and exciting communication paradigm which could have multiple applications in future wireless communication. Therefore, performance analysis of such a wireless sensor network paradigm is needed in complex wireless channel. Wireless networks could be an important means of providing ubiquitous communication in the future. In this paper, the BER performance of uniform distributed wireless sensor networks is evaluated in non-Gaussian noise channel. Using an analytical approach, the impact of Av. BER performance relating the coherent BPSK system at the end of a multi-hop route versus the spatial density of sensor nodes and impulsive noise parameters A and $\Gamma$ is evaluated.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.646-648
• /
• 2010

A Sensor Node in Wireless Sensor Network has very limited resources such as processing capability, memory capacity, battery power, and communication capability. When the communication between any two sensor nodes are required to be secured, the symmetric key cryptography technique is used for its advantage over public key cryptography in terms of requirement of less resources. Keys are pre-distributed to each sensor node from a set of keys called key pool before deployment of sensors nodes. Combinatorial design helps in a great way to determine the way keys are drawn from the key pool for distributing to individual sensor nodes. We study various deterministic key predistribution techniques that are based on combinatorial design.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1162-1167
• /
• 2003

This paper presents a simple sensor network consists of a group of sensors, RF components, and microprocessors, to perform a distributed sensing and information transmission using wireless links. In the proposed sensor network, though each sensor node has a limited capability and a simple signal-processing engine, a group of sensor nodes can perform a various tasks through coordinated information sharing and wireless communication in a large working area. Using the capability of self-localization and tracking, we show the sensor network can be applied to localization and navigation of mobile robot in which the robot has to be coordinated effectively to perform given task in real time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.362-369
• /
• 2012

Recently, a target detection based on a distributed sensor network has been much studied in active sonar. Zhou et al. proposed a target localization method using line fitting based on a distributed sensor network which consists of low complexity sensors that only report binary detection results. This method has three advantages relative to ML estimator. First, there is no need to estimate propagation model parameters. Second, the computation is simple. Third, it only use sensors with "detection", which implies less data to be collected by data processing center. However, this method has larger target localization error than the ML estimator. In this paper, a target localization method which modifies Zhou's method is proposed for reducing the localization error. The modified method shows the performance improvement that the target localization error is reduced by 40.7% to Zhou's method in the point of RMSE.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.133-140
• /
• 2016

In active sonar field, a target detection and localization based on a distributed sensor network has been much studied for the underwater surveillance of the coast. Zhou et al. proposed a target localization method utilizing the positions of target-detected sensors in distributed sensor network which consists of detection-only sensors. In contrast with a conventional method, Zhou's method dose not require to estimate the propagation model parameters of detection signal. Also it needs the lower computational complexity, and to transmit less data between network nodes. However, it has large target localization error. So it has been modified for reducing localization error by Ryu. Modified Zhou's method has better estimation performance than Zhou's method, but still relatively large estimation error. In this paper, a target localization method based on modified Zhou's method is proposed for reducing the localization error. The proposed method utilizes the geometry of the positions of target-detected sensors and a line that represents the bearing of target, a line can be found by modified Zhou's method. This paper shows that the proposed method has better target position estimation performance than Zhou's and modified Zhou's method by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.65-75
• /
• 2009

In Wireless Sensor Network, the sensor node localization is important issue for information tracking, event detection, routing. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning system, then all the other nodes are approximately localized using various algorithms based on a coordinate system of anchor DV-Hop is a localized, distributed, hop by hop positioning algorithm in wireless sensor network where only a limited fraction of nodes have self positioning capability. However, instead of uniformly distributed network, in anisotropic network with possible holes, DV-Hop's performance is very low. To address this issue, we propose Group based DV-Hop (GDV-Hop) algorithm. Best contribution of GDV-Hop is that it performs localization with reduced error compared with DV-Hop in anisotropic network.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.657-659
• /
• 2004

CAN is a serial communication bus for real-time controls and automations in distributed control systems. In distributed control systems, occasionally a sensor module and a controller are not in the same node and physically separated. In order for the signal from a sensor node to reach the controller node, the signal must travel through network. CAN has a certain capabilities to deal with real-time data. However, when many nodes on the networks try to send data on the same network, the arbitration mechanism to solve the data collision problem is necessary. This situation causes the time delay which has detrimental effects on the performance of the control systems. This paper proposes a method to solve the problem due to the time delay in distributed control system using CAN. Time delay is approximated to an element with a rational transfer function using Pade approximation and Mu~synthesis method is applied. Since time delay in the network is not constant, the time delay element is considered to be an uncertainty block with a bound. The proposed method is applied to the experimental system with CAN and proved to be effective.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.5
• /
• pp.291-299
• /
• 2005

An obstacle avoidance algorithm for a network-based autonomous mobile robot is proposed in this paper. The obstacle avoidance algorithm is based on the VFH(Vector Field Histogram) algorithm and two delay compensation methods with the VFH algorithm are proposed for a network-based robot with distributed environmental sensors, mobile actuators, and the VFH controller. Firstly, the environmental sensor information is compensated by prospection with acquired environmental sensor information, measured network delays, and the kinematic model of the robot. The compensated environmental sensor information is used for building polar histogram with the VFH algorithm. Secondly, a sensor fusion algorithm for localization of the robot is proposed to compensate the delay of odometry sensor information and the delay of environmental sensor information. Through some simulation tests, the performance enhancement of the proposed algorithm in the viewpoint of efficient path generation and accurate goal positioning is shown here.