• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.121-136
• /
• 2023

Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

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

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.820-823
• /
• 2011

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. In this paper, we propose a self-configuration routing protocol for WSN, which consists of step-wise ripple routing algorithm for initial deployment, effective joining of sensor nodes. RRA is search node in RF-coverage of each node, which result in fast network connection, reducing overall power consumption, and extending the lifetime of network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.856-859
• /
• 2010

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in Mobile-WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative Mobile-WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a self-configuration routing protocol for Mobile-WSN, which consists of step-wise novel protocols for initial deployment, effective joining and removal of sensor nodes, which result in reducing overall power consumption, and extending the lifetime of network.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.329-342
• /
• 2008

The Sensor Networks have limitations in utilizing energies, developing energy-efficient routing protocol and secure routing protocol are important issues in Sensor Network. In the field of data management, Tributaries and Deltas(TD) which incorporates tree topology and multi-path topology effectively have been suggested to provide efficiency and robustness in data aggregation. And our research rendered hierarchical property to TD and proposed Clustering-based Tributaries-Deltas. Through this new structure, we integrated efficiency and robustness of TD structure and advantages of hierarchical Sensor Network. Clustering-based Tributaries-Deltas was proven to perform better than TD in two situations through our research. The first is when a Base Station (BS) notices received information as wrong and requests the network's sensing data retransmission and aggregation. And the second is when the BS is mobile agent with mobility. In addition, we proposed key establishment mechanism proper for the newly proposed structure which resulted in new Sensor Network structure with improved security and energy efficiency as well. We demonstrated that the new mechanism is more energy-efficient than previous one by analyzing consumed amount of energy, and realized the mechanism on TmoteSKY sensor board using TinyOS 2.0. Through this we proved that the new mechanism could be actually utilized in network design.