• Smart Media Journal
• /
• v.6 no.4
• /
• pp.24-31
• /
• 2017

In wireless sensor networks, sensor nodes are deployed in a remote, harsh environment. When the power of the sensor node is consumed in such a network, the sensor nodes become useless together with the deterioration of the quality and performance of the sensor network which may save human life. Although many clustering protocols have been proposed to improve the energy consumption and extend the life of the sensor network, most of the previous studies have shown that the overhead of the cluster head is quite large. It is important to design a routing protocol that minimizes the energy consumption of each node and maximizes the network lifetime because of the power limitations of the sensor nodes and the overhead of the cluster heads. Therefore, in this paper, we propose an efficient clustering scheme that reduces the burden of cluster heads, minimizes energy consumption, and uses algorithms that maximize network lifetime. Simulation results show that the proposed clustering scheme improves the energy balance and prolongs the network life when compared with similar techniques.

• Convergence Security Journal
• /
• v.20 no.3
• /
• pp.13-20
• /
• 2020

Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services that require continuous monitoring or services to specific areas where accesses are limited, has gradually increased due to their expansion of application areas and the improvement of the efficiency. Especially, in the defense field, researches on the latest IT technologies including sensor network areas are actively conducted as an alternative to avoid the risk factors that can be occurred when personnel are put in, such as boundary and surveillance reconnaissance and to utilize personnel efficiently. In this paper, we analyze the conditions for increasing the life span of sensing nodes that make up sensor network by applying clustering and location-based techniques and derived the factors for extending the life span of them. The derived factors include CH(Cluster Head) election scheme and optimal path selection from CH to BS(Base Station). We proposed final scheme using derived factors and verified it through simulation experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.124-130
• /
• 2023

In this paper, we intend to improve the network lifetime by improving the energy efficiency of sensor nodes in a wireless sensor network by utilizing machine learning using K-means clustering algorithm. A wireless sensor network is a wireless network composed of physical devices including batteries as physical sensors. Due to the characteristics of sensor nodes, all resources must be efficiently used to minimize energy consumption to maximize network lifetime. A cluster based approach is used to manage groups of relatively large numbers of nodes. In the proposed protocol, by improving the existing LEACH algorithm, we propose a clustering algorithm that selects a cluster head using a cluster based approach and a location based approach. The performance results to be improved were measured using Matlab simulation. Through the experimental results, K-means clustering was applied to the energy efficiency part. By utilizing K-means, it is confirmed that energy efficiency is improved and the lifetime of the entire network is extended.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1722-1727
• /
• 2011

The Korea Army are developing the TICN(Tactical Information Communication Network) which is the next army tactical communication system. The TICN tactical backbone's ability is very important. So analysis of the standard protocol for the data transmission guarantee are obliged. For the TICN tactical backbone, previous paper analysed routing protocol efficiency index and compared to superiority of the OSPF and IS-IS protocols in the tactical environment and conclusively IS-IS protocol was more suitable for TICN backbone routing protocol. And We got the result that It could improve the performance of IS-IS protocol as a TICN tactical backbone protocol under the tactical environments by adjusting some time parameters of IS-IS protocol. This paper modified and designed the IS-IS protocol in order to support the QoS strategies of TICN and analyzed it's adaptability through simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1224-1228
• /
• 2010

The existing cluster-based routing protocols have some problems. Firstly, because of selecting cluster head at random, they occur a node concentration problem. Secondly, they have a low reliability for data communication due to the less consideration of node communication range. Finally, data communication overhead is greatly increased because of sending all sensor node information to sink node for constructing clusters. To solve these problems, we in this paper, propose a cluster-based routing protocol using message reception success rate. Firstly, to solve the node concentration problem, we design a cluster head selection algorithm based on node connectivity and devise cluster spliting/merging algorithms. Secondly, to guarantee data communication reliability, we use message reception success rate. Finally, to reduce data communication overhead, we use only neighbor nodes information at both cluster construction and cluster head selection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1034-1042
• /
• 2008

It is very hard, but important to sustain path stability for a reliable communication in mobile ad hoc networks. We propose a novel source routing protocol that establishes a group path with virtual multiple paths to enable a robust communication. The entire mobile nodes form a disjoint set of clusters: Each has its clusterhead as a cluster leader and a unique cluster label to identify itself from other clusters. A group path is a sequence of cluster labels instead of nodes and the nodes with the same label collaborate to deliver packets to a node with next label on the group path. We prove by resorting to simulation that our proposed protocol outperforms the existing key routing protocols, even for a network with a high node mobility and a high traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1173-1181
• /
• 2007

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.25-34
• /
• 2011

In this paper, In this paper, we propose a Cooperative Routing Protocol (CooRP) for supporting network convergence and transmission services efficiently in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the routing routes are decided on route stability based on entropy concepts using mobility of nodes within the direction guided line region to increase the operational lifetime of routes as well as reduce control overhead for route construction. Second, a cooperative data transmission strategy based on the constructed stable routing route is used to increase packet delivery ratio with advanced SNR. Third, a theoretical analysis for cooperative data transmission of the proposed CooRP with outage probability is presented. The performance evaluation of the proposed CooRP is performed via simulation using OPNET and analysis. The results of performance evaluation show that the proposed CooRP by using stable routing routes and cooperative transmission can increase packet delivery ratio efficiently.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.296-311
• /
• 2007

Mobile multi-robot teams are useful in many critical applications such as search and rescue. Explicit communication among robots in such mobile multi-robot teams is useful for the coordination of such teams as well as exchanging data. Since many applications for mobile robots involve scenarios in which communication infrastructure may be damaged or unavailable, mobile robot teams frequently need to communicate with each other via ad hoc networking. In such scenarios, low-overhead and energy-efficient routing protocols for delivering messages among robots are a key requirement. Two important primitives for communication are essential for enabling a wide variety of mobile robot applications. First, unicast communication (between two robots) needs to be provided to enable coordination and data exchange. Second, in many applications, group communication is required for flexible control, organization, and management of the mobile robots. Multicast provides a bandwidth-efficient communication method between a source and a group of robots. In this paper, we first propose and evaluate two unicast routing protocols tailored for use in ad hoc networks formed by mobile multi-robot teams: Mobile robot distance vector (MRDV) and mobile robot source routing (MRSR). Both protocols exploit the unique mobility characteristics of mobile robot networks to perform efficient routing. Our simulation study show that both MRDV and MRSR incur lower overhead while operating in mobile robot networks when compared to traditional mobile ad hoc network routing protocols such as DSR and AODV. We then propose and evaluate an efficient multicast protocol mobile robot mesh multicast (MRMM) for deployment in mobile robot networks. MRMM exploits the fact that mobile robots know what velocity they are instructed to move at and for what distance in building a long lifetime sparse mesh for group communication that is more efficient. Our results show that MRMM provides an efficient group communication mechanism that can potentially be used in many mobile robot application scenarios.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.189-196
• /
• 2007

In this paper, we proposed a mobile ad hoc routing protocol based on AODV(Ad hoc On demand Distance Vector) with QoS(Quality of Service) support and evaluated the performance through simulation. The waste of communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node. For performance evaluation, we analyzed the average data reception rate, considering the node mobility and the number of best effort/QoS data flows. We found that in the mobile Ad Hoc networks the QoS service for some specific data flows increased the average data reception rate for the QoS data flows.