• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.191-198
• /
• 2013

It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.624-629
• /
• 2008

Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.360-369
• /
• 2007

Since wireless sensor networks consist of nodes with the constrained battery, it is important to construct the topology performing energy-efficient routing while maximizing the whole network lifetime. Previous works related to this do not take into consideration the specific communication pattern in wireless sensor networks. In this paper, we propose a novel routing algorithm, called Up-Down Tree(UDT), which first constructs the tree topology based on distance and then adjusts the transmission range determined by the two different phases, tree setup and data gathering, to adapt the specific communication pattern in wireless sensor networks. Therefore, the UDT can improve energy efficiency, maximize the network lifetime, and block network partition Simulation results show that the UDT has the improved energy efficiency by constructing the optimal topology.

• Smart Media Journal
• /
• v.5 no.1
• /
• pp.55-60
• /
• 2016

Mobility of the sensor networks proposed a new way to the efficient design of sensor networks and improvement of network system performance. Mobility results in a number of functional changes in the MAC protocol and routing protocol. Especially, the mobility of the nodes may occur the increase of the overhead of transmission or disconnection of the link. Therefore, the study of the energy efficient transmission is very important in mobile sensor networks. This paper proposed adaptive transmission mechanism on the distance-based power control. The proposed mechanism was analyzed better than conventional method in the average energy consumption and network life by simulation results.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.01a
• /
• pp.41-42
• /
• 2017

무선 센서 네트워크에서 센서 노드의 취약점으로 인해 공격자는 쉽게 훼손된 노드를 만들어 센서 네트워크를 공격한다. DoS 공격에 해당하는 플로딩 공격은 노드의 에너지 손실과 경로 상의 노드의 에너지를 전부 소비시켜 네트워크 수명이 단축된다. 본 논문에서 제안 기법은 노드의 에너지가 적은 지역에서 다중경로 라우팅을 적용해 각 노드의 부하를 줄이고 네트워크 수명을 증가시키는 보안기법을 제안한다.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.13-21
• /
• 2009

The sensor nodes that form a wireless sensor network must perform both routing and sensing roles, since each sensor node always has a regular energy drain. The majority of sensors being used in wireless sensor networks are either unmanned or operated in environments that make them difficult for humans to approach. Furthermore, since many wireless sensor networks contain large numbers of sensors, thus requiring the sensor nodes to be small in size and cheap in price, the amount of power that can be supplied to the nodes and their data processing capacity are both limited. In this paper, we proposes the WSN(Wireless Sensor Network) algorithm which is applied sensor node that has low power consumption and efficiency measurement. Moreover, the efficiency routing protocol is proposed in this paper. The proposed algorithm reduces power consumption of sensor node data communication. It has not researched in LEACH(Low-Energy Adaptive Clustering Hierarchy) routing protocol. As controlling the active/sleep mode based on the measured data by sensor node, the energy consumption is able to be managed. In the event, the data is transferred to the local cluster head already set. The other side, this algorithm send the data as dependent on the information such as initial and present energy, and the number of rounds that are transformed into cluster header and then transferred. In this situation, the assignment of each node to cluster head evenly is very important. We selected cluster head efficiently and uniformly distributed the energy to each cluster node through the proposed algorithm. Consequently, this caused the extension of the WSN life time.

• The Journal of the Korea Contents Association
• /
• v.11 no.7
• /
• pp.70-79
• /
• 2011

The multi-path routing schemes that assigns labels to sensor nodes for the reliability of data transmission and the accuracy of an aggregation query over the sensor networks where data transfer is prone to defect have been proposed. However, the existing schemes have high costs for reassigning labels to nodes when the network topology is changed. In this paper, we propose a novel routing method that avoids duplicated data and reduces the update cost of a sensor node. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the various experiments. Our experimental results show that our proposed method reduces about 95% the amount of the transmitted data for restoration to node failure and about 220% the amount of the transmitted data for query processing over the existing method on average.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.438-450
• /
• 2006

Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.10
• /
• pp.269-276
• /
• 2021

Recently, smart sensors are used in various environments, and the implementation of ad-hoc sensor networks (ASNs) is a hot research topic. Unfortunately, traditional sensor network routing algorithms focus on specific control issues, and they can't be directly applied to the ASN operation. In this paper, we propose a new routing protocol by using the Q-learning technology, Main challenge of proposed approach is to extend the life of ASNs through efficient energy allocation while obtaining the balanced system performance. The proposed method enhances the Q-learning effect by considering various environmental factors. When a transmission fails, node penalty is accumulated to increase the successful communication probability. Especially, each node stores the Q value of the adjacent node in its own Q table. Every time a data transfer is executed, the Q values are updated and accumulated to learn to select the optimal routing route. Simulation results confirm that the proposed method can choose an energy-efficient routing path, and gets an excellent network performance compared with the existing ASN routing protocols.