• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1058-1069
• /
• 2015

In wireless sensor networks, geographic routing is known as an efficient method to transmit the data packet using the location information. Geographic routing relies on two techniques: greedy forwarding and face routing. Face routing helps to recover from greedy routing fail and is based on the planar graph in which does not cross each edge. However, the planarization causes frequently short transmission of data packet because it removes other edges except the shortest one. In other words, since the planarization removes the long edges, face routing could not exploit the efficient removed edges of communication graph. This problem brings about the excessive energy consumption of nodes. In this paper, we propose an energy efficient face routing protocol in wireless sensor networks. This proposed protocol searches the removed edges and transmits them via the edges. Simulation shows that the proposed protocol is more efficient in terms of energy consumption than the previous face routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.23-29
• /
• 2006

In wireless sensor networks(WSNs), it is crucial to maintain network connectivity as long as possible since nodes are battery-powered and unchange-able. We propose a new routing protocol called Energy Aware Source Routing(EASR) which can be efficient in respect of network lifetime and long-term connectivity. Our protocol is multipath source routing, only one path will be selected at the same time and each path has probability to be selected like as Energy Aware Routing(EAR) protocol. The route discovery procedure of EASR protocol is reformed from the route discovery procedure of Split Multipath Routing(SMR) protocol. However, there is the difference between SMR and EASR. In EASR, we define an overhearing ratio in order to reduce energy waste due to overhearing effect among each selected path. Thus, we can establish energy efficient multiple paths by making use of overhearing ratio. The simulation results are also demonstrated that our scheme increases in network lifetimes, and achieves reasonable packet latency time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.600-609
• /
• 2009

The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.23-29
• /
• 2011

In some applications of wireless sensor networks, requirements such as energy efficiency, real-time, and reliable delivery need to be considered. In this paper, we propose a novel routing algorithm for wireless sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In the proposed algorithm, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that the proposed algorithm is suitable for providing energy efficient, real-time, reliable communications.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.121-129
• /
• 2011

In wireless sensor networks, a compromised sensor node can inject false data during data aggregation. Existing solutions of securing data aggregation require high communication cost in securing data aggregation. In this paper, we propose a monitoring-based secure data aggregation protocol that minimizes communication cost of identifying the location of false data injection attacks. The main idea is that when monitoring nodes find an injected false data, their reporting messages along with Message Authentication Codes (MACs) are summarized in a single message before sending it to the Base Station (BS). Then the BS identifies the attacking node. The simulation shows that energy consumption of the proposed protocol with short and normal concatenations of MACs are 45% and 36% lower than that of an existing protocol, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.111-117
• /
• 2011

In this paper, we propose an QoS aware multi-layer MAC(QAML-MAC) protocol in a wireless sensor networks. Since the proposed protocol is based on the sleep-awake architecture, which save node's energy to prolong the entire network lifetime. For this purpose the QAML-MAC first classifies incoming data according to their transmission urgency and then saves them. The protocol also adapts the cross-layer concept to re-arrange the order of transmission with the same destination. So the delay can be decreased, which can not be obtained with the previous related protocols. And high priority data such as real-time multimedia or critical value in the field monitoring applications can be transmitted quickly, Furthermore the proposed protocol has advantage of decreasing transmitted data collisions using multiple layers of idle listening when there is no high-priority data. So energy consumptions of sensor nodes can be saved and the network lifetime can be prolonged.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.95-105
• /
• 2008

In this paper, we propose the DAMMC(Distributed Authentication Model using Multi-level Cluster) for wireless sensor networks. The proposed model is that one cluster header in m-layer has a role of CA(Certificate Authority) but it just authenticates sensor nodes in lower layer for providing an efficient authentication without authenticating overhead among clusters. In here, the m-layer for authentication can be properly predefined by user in consideration of various network environments. And also, the DAMMC uses certificates based on the threshold cryptography scheme for more reliable configuration of WSN. Experimental results show that the cost of generation and reconfiguration certification are decreased but the security performance are increased compared to the existing method.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.17-30
• /
• 2010

Many applications in Wireless Sensor Networks require collecting all data without loss from nodes. End-to-End data retransmission, which is used in the Internet for reliable transport, becomes very inefficient in Wireless Sensor Networks, since wireless communication, and constrained resources pose new challenges. We look at factors affecting reliability, and search for efficient combinations of the possible options. This paper proposes an efficient Overhearing based reliable transfer protocol in Wireless Sensor Networks by introducing Selective and implicit Acknowledgement. Finally, it is clarified that the proposed scheme is efficient for reliable data transfer in WSN.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.9
• /
• pp.953-958
• /
• 2015

Raspberry Pi is a credit card-sized computer with support for a large number of input and output peripherals. This makes it the perfect platform for interaction with many different devices and for usage in a wide range of applications. When combined with Wi-Fi, it can communicate remotely, therefore increasing its suitability for the construction of wireless sensor nodes. In addition, data processing and decision-making can be based on artificial intelligence, what is performed in developed testbed on the example of monitoring and determining the confidence of fire. In this paper, we demonstrated the usage of Raspberry Pi as a sensor web node for fire-safety monitoring in a building. When the UV-flame sensors detect a flame as thin as that of a candle, the Raspberry Pi sends a push-message to notify the assigned smartphone of the on-site situation through the GCM server. A mobile app was developed to provide a real-time video streaming service in order to determine a false alarm. If an emergency occurs, one can immediately call for help.