• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.942-948
• /
• 2016

WSN based on wireless sensor nodes, Sensor nodes can not be reassigned and recharged if they once placed. Each sensor node comes into being involved to a communication network with its limited energy. But the existing proposed clustering techniques, being applied to WSN environment with irregular dispersion of sensor nodes, have the network reliability issues which bring about a communication interruption with the local node feature of unbalanced distribution in WSN. Therefore, the communications participation of the sensor nodes in the suggested algorithm is extended by 25% as the sensor field divided in the light of the non-uniformed distribution of sensor nodes and a static or a dynamic clustering algorithm adopted according to its partition of sensor node density in WSN. And the entire network life cycle was extended by 14% to ensure the reliability of the network.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2017

Communications for mobile sink groups such as rescue teams or platoons bring about a new challenging issue for handling mobility in wireless sensor networks. To do this, many studies have been proposed to support mobile sink groups. When closely looking at mobile sink groups, they can be divided into (multiple) small groups according to the property of applications. For example, a platoon can be divided into multiple squads to carry out its mission in the battle field. However, the previous studies cannot efficiently support the division of mobile sink groups because they do not address three challenging issues engendered by the mobile sink group division. The first issue is to select a leader sink for a new small mobile sink group. The efficient data delivery from a source to small mobile sink groups is the second issue. Last, the third issue is to share data between leader sinks of small mobile sink groups. Thus, this paper proposes a routing protocol to efficiently support the division of mobile sink groups by solving the three challenging issues. For the first issue, the proposed protocol selects a leader sink of a new small mobile sink group which provide a minimum summation of the distance between the new leader sink and the previous leader sink and the distance from the new leader sink to all of its member sinks. For the efficient data delivery from a source to small mobile sink groups in the second issue, the proposed protocol determines the path to minimize the data dissemination distance from source to small mobile sink group by calculating with the location information of both the source and the leader sinks. With regard to the third issue, the proposed protocol exploits member sinks located among leader sinks to provide efficient data sharing among leaders sinks by considering the location information of member sinks. Simulation results verified that the proposed protocol is superior to the previous protocol in terms of the energy consumption.