• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.131-140
• /
• 2008

In this paper, we present a data dissemination protocol that guarantees energy-efficient data transmission and maximizes network lifetime. SPMS that outperforms the well-known protocol SPIN uses the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path, maximizing the network lifetime is impossible. In this paper, we propose a protocol for data dissemination called the protocol Considering Between Energy and Distance (ConBED). It solves the network lifetime problem using the residual energy and the distance between nodes to determine a path for data dissemination. The simulation results show that ConBED guarantees energy-efficient transmission and increases the network lifetime by approximately 69% than that of SPMS.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.270-277
• /
• 2003

In two dimensional mechanical design analysis, quadrilateral element mesh is preferred because it provides more accurate result than triangular element mesh. However, automation of quadrilateral element mesh generation is much more complex because of its geometrical complexities. In this study, an automatic quadrilateral element mesh generation algorithm based on the boundary normal offsetting method and the boundary decomposition method is developed. In so doing, nodes are automatically placed using the boundary normal offsetting method and the decomposition method is applied to decompose the designed domain into a set of convex subdomains. The generated elements are improved by relocation of the existing nodes based on the four criteria - uniformity, aspect ratio, skewness and taper degree. The developed algorithm requires minimal user inputs such as boundary data and the distance between nodes.

• Journal of information and communication convergence engineering
• /
• v.14 no.4
• /
• pp.215-221
• /
• 2016

We consider a design of a combined quantizer and estimator for distributed systems wherein each node quantizes its measurement without any communication among the nodes and transmits it to a fusion node for estimation. Noting that the quantization partitions minimizing the estimation error are not independently encoded at nodes, we focus on the parameter regions created by the partitions and propose a cluster-based quantization algorithm that iteratively finds a given number of clusters of parameter regions with each region being closer to the corresponding codeword than to the other codewords. We introduce a new metric to determine the distance between codewords and parameter regions. We also discuss that the fusion node can perform an efficient estimation by finding the intersection of the clusters sent from the nodes. We demonstrate through experiments that the proposed design achieves a significant performance gain with a low complexity as compared to the previous designs.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.51-60
• /
• 2016

This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.4
• /
• pp.451-460
• /
• 2007

The surface of 3D shell structure is created by using NURBS and nodes for generating finite element mesh on the surface are created by using external node offset method. In so doing the shortest distance between nodes on the top and bottom surface is searched and then the coordinates of nodes are determined by calculating the mid point of them in the middle of top and bottom surface. Triangular elements are formed on mid surface, and the average aspect ratio of the generated triangular elements are over 0.9.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.3
• /
• pp.333-343
• /
• 2009

Tactical Information Communication Network(TICN) is a concept-type integrated Military Communication system that enables precise command control and decision making by unifying the diversified military communication network and conveying diverse range of battle field information on real-time, at right place at right time. TICN is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network is consist of mobile nodes and nodes in the network depends on the cooperation of other nodes for forwarding of packets. In this context, some non-cooperating nodes may delay forwarding of packets or drop the packets. This may hamper the network as a whole and disrupt communication between the cooperating nodes. To solve this problem, we present a solution with a Node Weight Management Server(NWMS), which manages each node's weight according to its behavior in local area. When the NWMS detects misbehaving node, it increases the node's weight. If the node's weight exceeds a predefined threshold then the NWMS broadcasts the node's information into network to isolate the misbehaving node from the network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

• 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 Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.23-30
• /
• 2011

In the wireless sensor network(WSN), the detection of precise location of sensor nodes is essential for efficiently utilizing the sensing data acquired from sensor nodes. Among various location methods, the received signal strength (RSS) based localization scheme is mostly preferable in many applications since it can be easily implemented without any additional hardware cost. Since the RSS localization method is mainly effected by radio channel between two nodes, outlier data can be included in the received signal strength measurement specially when some obstacles move around the link between nodes. The outlier data can have bad effect on estimating the distance between two nodes such that it can cause location errors. In this paper, we propose a RSS-based localization method using Robust Statistic and Gaussian filter algorithm for enhancing the accuracy of RSS-based localization. In the proposed algorithm, the outlier data can be eliminated from samples by using the Robust Statistics as well as the Gaussian filter such that the accuracy of localization can be achieved. Through simulation, it is shown that the proposed algorithm can increase the accuracy of localization and is more robust to non gaussian noise channels.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.508-516
• /
• 2016

When GPS signals are not available, a relative localization can be alternatively used to represent the topological relationship between mobile nodes. A relative location map of a network can be constructed by using the distance information between all the pairs of nodes in the network. If a network is large, a number of small local maps are individually constructed and are merged to obtain the whole map. However, this approach may result in a high computation and communication overhead. In this paper, we propose a reference-node selection scheme for relative localization map construction, which chooses a subset of nodes as a reference node that is supposed to construct local maps. The scheme is a greedy algorithm that iteratively chooses nodes with high degree as a reference node until the chosen local maps are successfully merged with a sufficient number of common nodes between nearby local maps. The simulation results indicate that the proposed scheme achieves higher localization accuracy with a reduced computational overhead.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.187-192
• /
• 2007

Since wireless sensor networks (WSN) have relatively narrow bandwidth and have limited memory space. Mosaic by inlaying images transmitted by adjacent sensors can provide wider field of view and smaller storage memory. Most WSN are used for surveillance purpose, image acquisition period should be sufficiently short, so that mosaic algorithm has to be run in real time. Proposed algorithm is derived by using the fact that position of sensor nodes are fixed and known. Transformation matrix can be calculated by using distance between sensor nodes and distance between sensor nodes and predefined object. Simulation result shows that proposed algorithm provides very short processing time whereas it preserves image quality.