• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.799-802
• /
• 2005

In this paper, we analyses of Key Management Protocol for Wireless Sensor Networks in Wireless Sensor Networks. Wireless sensor networks have a wide spectrum of civil military application that call for security, target surveillance in hostile environments. Typical sensors possess limited computation, energy, and memory resources; therefore the use of vastly resource consuming security mechanism is not possible. In this paper, we propose a cryptography key management protocol, which is based on identity based symmetric keying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.241-269
• /
• 2012

Wireless networks composed of multimedia-enabled resource-constrained sensor nodes have enriched a large set of monitoring sensing applications. In such communication scenario, however, new challenges in data transmission and energy-efficiency have arisen due to the stringent requirements of those sensor networks. Generally, congested nodes may deplete the energy of the active congested paths toward the sink and incur in undesired communication delay and packet dropping, while bit errors during transmission may negatively impact the end-to-end quality of the received data. Many approaches have been proposed to face congestion and provide reliable communications in wireless sensor networks, usually employing some transport protocol that address one or both of these issues. Nevertheless, due to the unique characteristics of multimedia-based wireless sensor networks, notably minimum bandwidth demand, bounded delay and reduced energy consumption requirement, communication protocols from traditional scalar wireless sensor networks are not suitable for multimedia sensor networks. In the last decade, such requirements have fostered research in adapting existing protocols or proposing new protocols from scratch. We survey the state of the art of transport protocols for wireless multimedia sensor networks, addressing the recent developments and proposed strategies for congestion control and loss recovery. Future research directions are also discussed, outlining the remaining challenges and promising investigation areas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.105-116
• /
• 2019

Recently, there has been an increase in research on wireless sensor networks (WSNs) because they are easy to deploy in applications such as internet-of-things (IoT) and body area networks. However, WSNs have constraints in terms of power, quality-of-service (QoS), computation, and others. To overcome the power constraint issues, wireless energy harvesting has been introduced into WSNs, the application of which has been the focus of many studies. Additionally, to improve system performance in terms of achievable rate, cooperative networks are also being explored in WSNs. We present a review on current research in the area of energy harvesting in WSNs, specifically on the application of simultaneous wireless information and power transfer (SWIPT) in a cooperative sensor network. In addition, we discuss possible future extensions of SWIPT and cooperative networks in WSNs.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.322-330
• /
• 2007

Recent advances in wireless networks and low-cost, low-power design have led to active research in large-scale networks of small, wireless, low power sensors and actuators, In large-scale networks, lots of timing-synchronization protocols already exist (such as NTP, GPS), In ad-hoc networks, especially wireless sensor networks, it is hard to synchronize all nodes in networks because it has no infrastructure. In addition, sensor nodes have low-power CPU (it cannot perform the complex computation), low batteries, and even they have to have active and inactive section by periods. Therefore, new approach to time synchronization is needed for wireless sensor networks, In this paper, I propose Energy-Efficient Time Synchronization (EETS) protocol providing network-wide time synchronization in wireless sensor networks, The algorithm is organized two phase, In first phase, I make a hierarchical tree with sensor nodes by broadcasting "Level Discovery" packet. In second phase, I synchronize them by exchanging time stamp packets, And I also consider send time, access time and propagation time. I have shown the performance of EETS comparing Timing-sync Protocol for Sensor Networks (TPSN) and Reference Broadcast Synchronization (RBS) about energy efficiency and time synchronization accuracy using NESLsim.

• 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.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.53-69
• /
• 2010

This paper proposes an ant-based routing algorithm, Ant System-Routing in wireless Senor Networks(AS-RSN), for wireless sensor networks. Using a transition rule in Ant System, sensors can spread data traffic over the whole network to achieve energy balance, and consequently, maximize the lifetime of sensor networks. The transition rule advances one of the original Ant System by re-defining link cost which is a metric devised to consider energy-sufficiency as well as energy-efficiency. This metric gives rise to the design of the AS-RSN algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. Therefore, AS-RSN is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: Direct Communication Approach, Minimum Transmission Energy, and Self-Organized Routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.597-611
• /
• 2009

With the advent of ubiquitous computing society, many advanced technologies have enabled wireless sensor networks which consist of small sensor nodes. However, the sensor nodes have limited computing resources such as small size memory, low battery life, short transmission range, and low computational capabilities. Thus, decreasing energy consumption is one of the most significant issues in wireless sensor networks. In addition, numerous applications for wireless sensor networks are recently spreading to various fields (health-care, surveillance, location tracking, unmanned monitoring, nuclear reactor control, crop harvesting control, u-city, building automation etc.). For many of them, supporting security functionalities is an indispensable feature. Especially in case wireless sensor networks should provide a sufficient variety of security functions, sensor nodes are required to have more powerful performance and more energy demanding features. In other words, simultaneously providing security features and saving energy faces a trade-off problem. This paper presents a novel energy-efficient security architecture in an IEEE 802.15.4-based wireless sensor network called the Hybrid Adaptive Security (HAS) framework in order to resolve the trade off issue between security and energy. Moreover, we present a performance analysis based on the experimental results and a real implementation model in order to verify the proposed approach.