• International Journal of Internet, Broadcasting and Communication
• /
• v.6 no.2
• /
• pp.17-19
• /
• 2014

Now is the applications are using WSN for environmental monitoring and surveillance applications, intelligent transportation systems, monitoring, disaster recovery, and the structure used in the field. Also, the low cost of the communication and control functions can be provided, in particular management of smart grid demand may be used in many applications. In this paper, WSN in smart grid is based on the building blocks of smart grid management system proposed for the fuzzy demand.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3080-3099
• /
• 2016

In this paper, we propose an algorithm for energy efficient cooperative communication in wireless sensor network (WSN). The algorithm computes the appropriate transmission distance corresponding to optimal broadcast bit error probability, while taking the circuit energy consumption and the number of cooperating nodes into consideration. The algorithm guarantees minimum energy consumption by choosing higher value of bit error probability for cooperative phase and lower value of bit error probability for broadcast phase while maintaining the required end-to-end reliability. The simulation results show that the proposed algorithm provides significant energy saving gain when compared with traditional fixed distance schemes and is suitable for applications demanding energy efficiency with high quality of reception.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.553-558
• /
• 2007

In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys' identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.

• Journal of Information Processing Systems
• /
• v.5 no.3
• /
• pp.135-144
• /
• 2009

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.901-920
• /
• 2015

Wireless Sensor Networks (WSNs) are widely used in geographically isolated applications like military border area monitoring, battle field surveillance, forest fire detection systems, etc. Uninterrupted power supply is not possible in isolated locations and hence sensor nodes live on their own battery power. Localization of sensor nodes in isolated locations is important to identify the location of event for further actions. Existing localization algorithms consume more energy at sensor nodes for computation and communication thereby reduce the lifetime of entire WSNs. Existing approaches also suffer with less localization coverage and localization accuracy. The objective of the proposed work is to increase the lifetime of WSNs while increasing the localization coverage and localization accuracy. A novel intelligent unmanned aerial vehicle anchor node (IUAN) is proposed to reduce the communication cost at sensor nodes during localization. Further, the localization computation cost is reduced at each sensor node by the proposed intelligent arc selection (IAS) algorithm. IUANs construct the location-distance messages (LDMs) for sensor nodes deployed in isolated locations and reach the Control Station (CS). Further, the CS aggregates the LDMs from different IUANs and computes the position of sensor nodes using IAS algorithm. The life time of WSN is analyzed in this paper to prove the efficiency of the proposed localization approach. The proposed localization approach considerably extends the lifetime of WSNs, localization coverage and localization accuracy in isolated environments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.125-129
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Heinzelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH(Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.

• Convergence Security Journal
• /
• v.16 no.2
• /
• pp.3-9
• /
• 2016

Recently, a lot of researches have been done to increase the life span of network using the energy efficient sensor node in WSN. In the WSN environment, we must use limited amount of energy and hardware. Therefore, it is necessary to design energy efficient communication protocol and use limited resources. Cluster based routing method such as LEACH and HEED get the energy efficient routing using data communication between cluster head and related member nodes. In this paper, we propose an energy efficient routing algorithm as well as performance result using simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.19-24
• /
• 2006

Wireless sensor networks(WSN) technology has various applications such as surveillance and information gathering in the uncontrollable area of human. One of major issues in WSN is the research for reducing the energy consumption and reliability of data. A system with forward error correction(FEC) can provide an objective reliability while using less transmission power than a system without FEC. In this paper, we propose to use LDPC codes of various code rate(0.53, 0.81, 0.91) for FEC for WSN. Also, we considered node-to-node interference in addition to AWGN channel. The proposed system has not only high reliable data transmission at low SNR, but also reduced transmission power usage.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1145-1152
• /
• 2016

Because the nodes in a wireless sensor network (WSN) are mobile and the network is highly dynamic, monitoring every node at all times is impractical. As a result, an intruder can attack the network easily, thus impairing the system. Hence, detecting anomalies in the network is very essential for handling efficient and safe communication. To overcome these issues, in this paper, we propose a rule-based anomaly detection technique using roaming honeypots. Initially, the honeypots are deployed in such a way that all nodes in the network are covered by at least one honeypot. Honeypots check every new connection by letting the centralized administrator collect the information regarding the new connection by slowing down the communication with the new node. Certain predefined rules are applied on the new node to make a decision regarding the anomality of the node. When the timer value of each honeypot expires, other sensor nodes are appointed as honeypots. Owing to this honeypot rotation, the intruder will not be able to track a honeypot to impair the network. Simulation results show that this technique can efficiently handle the anomaly detection in a WSN.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.1
• /
• pp.15-26
• /
• 2013

IP-based Wireless Sensor Networks (IP-WSNs) are gaining importance for their broad range of applications in health-care, home automation, environmental monitoring, industrial control, vehicle telematics and agricultural monitoring. In all these applications, mobility in the sensor network with special attention to energy efficiency is a major issue to be addressed. Because of the energy inefficiency of networks-based mobility management protocols can be supported in IP-WSN. In this paper we propose a network based mobility supported IP-WSN protocol called Multicasting-based inter-Domain Mobility Management Scheme in Sensor-based Fast Proxy Mobile IPv6 Networks (mSFP). Based on [8,20], We present its network architecture and evaluate its performance by considering the signaling and mobility cost. Our analysis shows that the proposed scheme reduces the signaling cost, total cost, and mobility cost. With respect to the number of IP-WSN nodes, the proposed scheme reduces the signaling cost by 7% and the total cost by 3%. With respect to the number of hops, the proposed scheme reduces the signaling cost by 6.9%, the total cost by 2.5%, and the mobility cost by 1.5%. With respect to the number of IP-WSN nodes, the proposed scheme reduces the mobility cost by 1.6%.