• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.371-372
• /
• 2008

In this paper, we consider wireless sensor networks with hard energy constraint, where each node is powered by a small battery. Under this hard constraint, reducing energy consumption is the most important design consideration for wireless sensor networks. Energy saving and control is an important issue, involved in the design of most sensor nodes. In this context, we focus on physical layer design where energy constraint problem can be modeled as an optimization of transmission modulation scheme[1]. Specifically, our analyses are based on energy control schemes that are relative to physical layer design on upper bound SEP MPSK in AWGN channels.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.345-352
• /
• 2017

Traffic management is a highly beneficial mechanism for satisfying quality-of-service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end-to-end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi-Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.2
• /
• pp.79-86
• /
• 2016

In wireless sensor networks, increasing the sensing rate of each node to improve the data accuracy usually incurs a decrease of network lifetime. In this study, an energy-adaptive data compression scheme is proposed to efficiently control the sensing rate in an energy-harvesting wireless sensor network (WSN). In the proposed scheme, by utilizing the surplus energy effectively for the data compression, each node can increase the sensing rate without any rise of blackout time. Simulation result verifies that the proposed scheme gathers more amount of sensory data per unit time with lower number of blackout nodes than the other compression schemes for WSN.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.10 no.6
• /
• pp.381-390
• /
• 2015

The efficient design of a transport protocol contributes to energy conservation as well as performance improvement in wireless sensor networks (WSNs). In this paper, a node-density-aware transport protocol (NDTP) for intra-cluster transmissions in WSNs for monitoring physical attributes is proposed, which takes node density into account to mitigate congestion in intra-cluster transmissions. In the proposed NDTP, the maximum active time and queue length of cluster heads are restricted to reduce energy consumption. This is mainly because cluster heads do more works and consume more energy than normal sensor nodes. According to the performance evaluation results, the proposed NDTP outperforms the conventional protocol remarkably in terms of network lifetime, congestion frequency, and packet error rate.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.2
• /
• pp.75-80
• /
• 2014

Energy consumption of sensor nodes is minimized because it has limited energy generator in wireless sensor network. Electronic shelf label system is one of application fields using wireless sensor networks. Battery size of small apparatus for displaying price is restricted. Therefore its current consumption have to be minimized. Furthermore the method for minimization of peak current would be considered because life cycle of coin battery used to display or RF is vulnerable to intensity of drain current. In this paper, we analyze current consumption pattern of low-power electronic shelf label system. Then we propose the method for minimization of current consumption by modification of software and hardware. Current consumption of the system using proposed method are approximately 15 to 20 percent lower than existing system and the life cycle of the system is approximately 10 percent higher than existing system.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.254-260
• /
• 2017

Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.477-488
• /
• 2013

Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

• Annual Conference of KIPS
• /
• 2016.10a
• /
• pp.199-201
• /
• 2016

Wireless sensor networks offer an attractive solution to several environments, security, and process monitoring problems. However, one barrier for their full adoption is the need to provide electrical power over extended periods of time without the need of dedicated wiring. Energy harvesting offers good solutions to this problem in several applications. This paper surveys the energy requirements of typical sensor network nodes and summarizes the future research work in the field of energy harvesting resource allocation in wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.457-465
• /
• 2010

When a sensor network is used for monitoring environments in large area or transmitting information in a u-City the number of nodes becomes very large. One of the problems with this application is the increased time delay, especially in reverse direction. In this paper, we propose a new algorithm that can minimize the latency of reverse packet in large sensor network. Analysis shows that the proposed scheme can reduce the latency by more than 90% when compared to Zigbee, while the energy consumption is maintained.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.