• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.558-564
• /
• 2018

In distributed estimation where each node can collect only partial information on the parameter of interest without communication between nodes and quantize it before transmission to a fusion node which conducts estimation of the parameter, we consider a novel quantization technique employed at local nodes. It should be noted that the performance can be greatly improved if each node can transmit its measurement to one designated node (namely, head node) which can quantize its estimate using the total rate available in the system. For this case, the best strategy at the head node would be simply to partition the parameter space using the generalized Lloyd algorithm, producing the global codewords, one of which is closest to the estimate is transmitted to a fusion node. In this paper, we propose an iterative design algorithm that seeks to efficiently assign the codewords into each of quantization partitions at nodes so as to achieve the performance close to that of the system with the head node. We show through extensive experiments that the proposed algorithm offers a performance improvement in rate-distortion perspective as compared with previous novel techniques.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.41-42
• /
• 2007

DMAC is an energy efficiency and low latency protocol designed for data gathering tree structures. However, it causes the funneling effect which is many-to-one traffic patterns in tree structures, consequently, results in packet collisions, losses, and energy consumptions in low depth nodes. In this paper, we present an energy efficient MAC protocol with fairness-based scheduling to avoid the funneling effect of DMAC protocol. By using traffic information from children nodes, our protocol dynamically adjusts duty cycles of last-depth nodes to mitigate overloaded packets in the vicinity of the sink node. Therefore, we expect our protocol to save more energy and achieve better packet delivery ratio, compared to DMAC protocol.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2004.03a
• /
• pp.15-25
• /
• 2004

This paper outlines a new convergence acceleration de-signed to solve scramjet flowfields with zones of re-circulation. Named the “marching-window”, the algorithm consists of performing pseudo-time iterations on a minimal width subdomain composed of a sequence of cross-stream planes of nodes. The upstream boundary of the subdomain is positioned such that all nodes upstream exhibit a residual smaller than the user-specified convergence threshold. The advancement of the downstream boundary follows the advancement of the upstream boundary, except in zones of significant streamwise ellipticity where a streamwise ellipticity sensor ensures its continuous progress. Compared to the standard pseudo-time marching approach, the march-ing-window is here seen to decrease the work required for convergence by up to 24 times for supersonic flows with little streamwise ellipticity and by up to 8 times for supersonic flows with large streamwise separated regions. The memory requirements are observed to be reduced sixfold by not allocating memory to the nodes not included in the computational subdomain. The marching-window satisfies the same convergence criterion as the standard pseudo-time stepping methods, hence resulting in the same converged solution within the tolerance of the user-specified convergence threshold. The extension of the marching-window to the weakly-ionized Navier-Stokes equations is also discussed.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.105-113
• /
• 2009

The previous key management methods are not appropriate for secure data communication in cluster-based routing scheme. Because cluster heads are elected in every round and communicate with the member nodes for authentication and share-key establishment phase in the cluster. In addition, there are not considered to mobility of nodes in previous key management mechanisms. In this paper, we propose the secure and effective key management mechanisim in the cluster-based routing scheme that if there are no share keys between cluster head and its nodes, we create the cluster key using authentication with base station or trust autentication and exchange the their information for a round.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.414-426
• /
• 2021

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1849-1876
• /
• 2022

Wireless Sensor Network (WSN) is considered as an integral part of the Internet of Things (IoT) for collecting real-time data from the site having many applications in industry 4.0 and smart cities. The task of nodes is to sense the environment and send the relevant information over the internet. Though this task seems very straightforward but it is vulnerable to certain issues like energy consumption, delay, throughput, etc. To efficiently address these issues, this work develops a cross-layer model for the optimization between MAC and the Network layer of the OSI model for WSN. A high value of duty cycle for nodes is selected to control the delay and further enhances data transmission reliability. A node measurement prediction system based on the Kalman filter has been introduced, which uses the constraint based on covariance value to decide the scheduling scheme of the nodes. The concept of duty cycle for node scheduling is employed with a greedy data forwarding scheme. The proposed Duty Cycle-based Greedy Routing (DCGR) scheme aims to minimize the hop count, thereby mitigating the energy consumption rate. The proposed algorithm is tested using a real-world wastewater treatment dataset. The proposed method marks an 87.5% increase in the energy efficiency and reduction in the network latency by 61% when validated with other similar pre-existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3003-3029
• /
• 2023

The rapid evolution of the IoT has paved the way for new opportunities in smart city domains, including e-health, smart homes, and precision agriculture. However, this proliferation of services demands effective SLAs between customers and service providers, especially for critical services. Difficulties arise in maintaining the integrity of such agreements, especially in vulnerable wireless environments. This study proposes a novel SLA management model that uses an SDN-Enabled WSN consisting of wireless nodes to interact with smart contracts in a straightforward manner. The proposed model ensures the persistence of network metrics and SLA provisions through smart contracts, eliminating the need for intermediaries to audit payment and compensation procedures. The reliability and verifiability of the data prevents doubts from the contracting parties. To meet the high-performance requirements of the blockchain in the proposed model, low-cost algorithms have been developed for implementing blockchain technology in wireless sensor networks with low-energy and low-capacity nodes. Furthermore, a cryptographic signature control code is generated by wireless nodes using the in-memory private key and the dynamic random key from the smart contract at runtime to prevent tampering with data transmitted over the network. This control code enables the verification of end-to-end data signatures. The efficient generation of dynamic keys at runtime is ensured by the flexible and high-performance infrastructure of the SDN architecture.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.397-400
• /
• 2007

Indoor air-conditioning system(IAS) using wireless sensor network serves to reduce the amount of pollution entering the room from outside and also the pollution that is generated indoor. Small-size and lower power wireless sensor node and sensor interface board was designed for indoor air-conditioning system in buildings of offices and industrial establishments. Many sensor nodes forms Ad-hoc network topology using simple forwarding routing to transmit polluting gas concentration data from different rooms to the indoor air-conditioning system. Sensor node analyzes pollution concentration in the each room and air-conditioning system performs to air-distribution and air-inhalation according to room's pollution by regulating the fan of indoor air-conditioning system. To reduce power consumption electrochemical gas sensor was used in the design. Thus the designed system can optimize state of indoor environment. Graphic user interface displays node sate, gas concentration and temperature of each room.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.695-700
• /
• 2005

In the sensor network, a lot of sensor nodes are scattered sparsely and organizes a united communication network between each node. After that, environmental information around each sensor node are gathered and analyzed. Because each node operates under resource constraint, the efficiency and hardware specification of a node should be maximized. There exist technical constraints until now but recent technical progress in IC fabrication and wireless network enables to construct a tiny embedded system, which has the properties of low cost, low power consumption, multi functions. Wireless sensor network becomes a modern research field with technical improvements, is studied in numerous laboratories, and is called as diverse different project names - Wireless Integrated Network Sensors (WINS), Mobile Ad hoc NETwork (MANET), Ubiquitous Sensor Network (USN). TinyOS is one of leading project and is widely used. In this paper, we suggest a sensor network, which uses TinyOS platforms and aims for context awareness in a home environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.40-48
• /
• 2007

MANET constructs a network that is free and independent between sensor nodes without infrastructure. Also, there are a lot of difficulties to manage data process, control etc.. back efficiently from change of topology by transfer of sensor node that compose network. Especially, because each sensor node must consider mobility certainly, problem about energy use happens. To solve these problem, mechanisms that compose cluster of cluster header and hierarchic structure between member were suggested. However, accompanies inefficient energy consumption because sensing power level of sensor node is fixed and brings energy imbalance of sensor network and shortening of survival time. In this paper, I suggested intelligent clustering mechanism for efficient energy management to solve these problem of existent Clustering mechanism. Proposed mechanism corresponds fast in network topology change by transfer of sensor node, and compares in existent mechanism in circumstance that require serial sensing and brings elevation survival time of sensor node.Please put the abstract of paper here.