• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.151-157
• /
• 2010

Rapid technological advances in the area of micro electro-mechanical systems (MEMS) have spurred the development of small inexpensive sensors capable of intelligent sensing. A significant amount of research has been done in the area of connecting large numbers of these sensors to create robust and scalable Wireless Sensor Networks (WSNs). The resource scarcity, ad-hoc deployment, and immense scale of WSNs make secure communication a particularly challenging problem. Since the primary consideration for sensor networks is energy efficiency, security schemes must balance their security features against the communication and computational overhead required to implement them. In this paper, we combine location information and probability to create a new security aware multipath geographic routing protocol. The implemented result in network simulator (ns-2) showed that our protocol has a better performance under attacks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.377-380
• /
• 2010

MANET(Mobile Ad-hoc Network) has been proposed as a infrastructure-less network using distributed algorithm for remote environment monitoring and control. The mobility of MANET would make the topology change frequently compared with a static network and a node is resource-constrained. Hence, to improve the routing protocol in MANET, energy efficient routing protocol is required as well as considering the mobility would be needed. In this paper, we extend RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure by a modifying the level of cluster. We call this network protocol CACH-RODMRP. Our contribution consists estimating the optimal level of clustering depth with considering node position and reducing the network residual energy. The simulation results of proposal algorithm show that the energy is significantly reduced compared with the previous clustering based routing algorithm for the MANET.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1929-1950
• /
• 2020

Reliable and secure data transmission in the application environment assisted by the wireless sensor network is one of the major challenges. Problem like blind forwarding and data inaccessibility affect the efficiency of overall infrastructure performance. This paper proposes routing protocol for forwarding and error recovery during packet loss. The same is achieved by energy and hops distance-based formulation of the routing mechanism. The reachability of the intermediate node to the source node is the major factor that helps in improving the lifetime of the network. On the other hand, intelligent hop selection increases the reliability over continuous data transmission. The number of hop count is factor of hop weight and available energy of the node. The comparison over the previous state of the art using QualNet-7.4 network simulator shows the effectiveness of proposed work in terms of overall energy conservation of network and reliable data delivery. The simulation results also show the elimination of blind forwarding and data inaccessibility.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.141-150
• /
• 2005

Wireless Sensor Networks have been rapidly developed due to the advances of sensor technology and are expected to be applied to various applications in many fields. In Wireless Sensor Networks, schemes for managing the network energy-efficiently are most important. For this purpose, there have been a variety of researches to suggest routing protocols. However, existing researches have ideal assumption that all sensor nodes have sensing data to transmit. In this paper, we designed and implemented a sensing-aware cluster selection algorithm based on LEACH-C for the sensor network in which part of sensors have sensing data. We also simulated proposed algorithm on several network situation and analyzed which situation is suitable for the algorithm. By the simulation result, selecting cluster head among the sensing nodes is most energy-efficient and the result shows application of sensing-awareness in cluster head selection when not all sensors have sensing data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2800-2807
• /
• 2012

An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5744-5764
• /
• 2018

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.657-658
• /
• 2015

In an wireless sensor network, energy efficient routing protocol is important for multi-hop transmission because senor nodes are powered by battery. In multi-hop transmission, specifice nodes are used and the battery power becomes low, it induce the asymetric remaining power among the nodes and makes the network lifetime reduced. In this paper, we propose a power-aware routing protocol which determines the routing path considering the remaining power of the nodes. Simulation results shows that the proposed routing scheme minimize the transmission delay and increase the network lifetime.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.122-130
• /
• 2008

In many applications of wireless sensor networks, sensed data can be classified either normal or urgent data according to its time criticalness. Normal data such as periodic monitoring is loss and delay tolerant, but urgent data such as fire alarm is time critical and should be transferred to a sink with reliable. In this paper, by exploiting these data characteristics, we propose a novel energy-efficient data-aware routing protocol for wireless sensor networks, which provides a high reliability for urgent data and energy efficiency for normal data. In the proposed scheme, in order to enhance network survivability and reliability for urgent data, each sensor node forwards only urgent data when its residual battery level is below than a threshold. Also, the proposed scheme uses different data delivery mechanisms depending on the data type. The normal data is delivered to the sink using a single-path-based data forwarding mechanism to improve the energy-efficiency. Meanwhile, the urgent data is transmitted to the sink using a directional flooding mechanism to guarantee high reliability. Simulation results demonstrate that the proposed scheme could significantly improve the network lifetime, along with high reliability for urgent data delivery.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.48-62
• /
• 2006

In recent years, wireless sensor networks(WSNs) have emerged as a new fast-growing application domain for wireless distributed computing and embedded systems. Recent Progress in computer and communication technology has made it possible to organize wireless sensor networks composed tiny sensor nodes. Furthermore, ad-hoc network protocols do not consider the characteristics of wireless sensor nodes, making existing ad-hoc network protocols unsuitable for the wireless sensor networks. First, we propose power-aware routing protocols based on energy-centered routing metrics. Second, we describe power management techniques for wireless sensor nodes using the spatial locality of sensed data. Many nodes can go into a power-down mode without sacrificing the accuracy of sensed data. Finally, combining the proposed techniques, we describe an overall energy-efficient protocol for data collection. Experimental results show that the proposed routing protocol can extend the routing path lifetime more than twice. The average energy consumption per sensing period is reduced by up to 30%.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.