• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.197-203
• /
• 2010

The problem of location awareness in wireless sensor networks where nodes use GPS (Global Positioning System), remains challenging problem, when considering the required large energy consumption during the localization phase. In this paper we designed hardware for GPS based localization and propose a framework, called ELS, to consume low cost energy. In the ELS framework, sensor nodes are equipped with GPS. Because GPS spends large energy for position awareness, conventional localization algorithms cannot use GPS-device. We try to find a solution for efficient energy expenditure of GPS. Finally, we derive optimal transmission power of GPS data and a scheme of localization through experiment and simulation.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.466-469
• /
• 2008

The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.602-606
• /
• 2011

It is necessary for developing specific application protocol for mobile sensor end nodes and data collection devices that have constrained resources and computing powers. Because of these needs, IETF WG developed CoAP protocol and Internet draft was released, and processing to international standardization of this protocol. Because sensor nodes and information collection devices have restricted resources and computing powers, there are some limitations for applying to this proposed protocol directly. Thus in this paper we shows the implementation of full CoAP protocol for server, works on Linux and CoAP-Lite over telos which works on TinyOS for information collection devices. In this implementation we verified the main activities of CoAP protocol over USN by modifying some hardware with dependent algorithm.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.229-236
• /
• 2009

Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.2
• /
• pp.142-147
• /
• 2008

In wireless sensor networks, one of the most important issue is improvement of network lifetime with an efficient energy consumption. we repose effective multi-hop routing algorithm which increases the number of nodes alive at any time. In our algorithm we use the dynamic selection of cluster head and short distance transmission method. We simulated the proposed algorithm by using Network Simulator 2 and compared its performance with LEACH. The experimental result shows that the number of the nodes alive is increased up to 39.71[%] during the simulation time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.559-573
• /
• 2016

In this paper, we investigate the problem of achieving proportional fairness in hierarchical wireless sensor networks. Combining clustering formulation and scheduling, we maximize total bandwidth utility for proportional fairness while controlling the power consumption to a minimum value. This problem is decomposed into two sub-problems and solved in two stages, which are Clustering Formulation Stage and Scheduling Stage, respectively. The above algorithm, called CSPF_PC, runs in a network formulation sequence. In the Clustering Formulation Stage, we let the sensor nodes join to the cluster head nodes by adjusting transmit power in a greedy strategy; in the Scheduling Stage, the proportional fairness is achieved by scheduling the time-slot resource. Simulation results verify the superior performance of our algorithm over the compared algorithms on fairness index.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.445-448
• /
• 2008

The key establishment between nodes is one of the most important issues to secure the communication in wireless sensor networks. Some researcher used the probabilistic key sharing scheme with a pre-shared key pool to reduce the number of keys and the key disclosure possibility. However, there is a potential possibility that some nodes do not have a common share in the key pool. The purpose of this paper is to devise a peer to peer key sharing protocol (PPKP) based on Quorum system and Diffie-Hellman key exchange scheme (DHS). The PPKP establishes a session key by creating a shared key using the DHS and then scrambles it based on Quorum system to secure that. The protocol reduces the number of necessary keys than the previous schemes and could solve the non-common key sharing possibility problem in the probabilistic schemes.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.43-46
• /
• 2008

Centrality has been actively studied in network analysis field. In this paper we show a calculation method of closeness centrality for WSN. Since nodes in a sensor network are very scarce in energy and computation capability the calculation of the closeness is done in two tiers by dividing network into clusters. In first step closeness centrality for cluster heads is calculated. In the second step closeness of member nodes of the chosen cluster is computed in respect to that cluster itself.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.55-62
• /
• 2017

In this paper, we proposes a multi-ring based mobile sink location scheme for solar-powered wireless sensor network (WSN). The proposed scheme maintains the multi-rings in which nodes keep the current location of sink node. With the help of nodes in multi-rings, each node can locate the sink node efficiently with low-overhead. Moreover, because our scheme utilizes only surplus energy of a node, it can maintain multiple rings without degrading any performance of each node. Experimental results show that the proposed scheme shows much better latency and scalability with lower energy-consumption than the existing single-ring based scheme.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.97-98
• /
• 2006

Fusion of decisions from multiple distributed sensor nodes is studied in this work. Based on the canonical parallel fusion model, we derive the optimal likelihood ratio based fusion rule with the assumptions of the generalized Gaussian noise model and the arbitrary fading channel. This optimal fusion rule, however, requires the complete knowledge of the channels and the detection performance of local sensor nodes. To mitigate these requirements and to provide near optimum performance, we derive suboptimum fusion rules by using high and low signal-to-noise ratio (SNR) approximations to the optimal fusion rule. Performance evaluation is conducted through simulations.