9,299 research outputs found
A cluster-head selection and update algorithm for ad hoc networks
A novel cluster-head selection and update algorithm “Type-based Cluster-forming Algorithm (TCA)” is proposed, which outperforms both the lowest node ID (LID) and the Weighted Clustering Algorithm (WCA) in the ad hoc network scenario considered. The system’s performance is investigated in a scenario, when the 50 communicating nodes belong to three different groups, for example, a group of rescue workers, fire-fighters and paramedics. It is demonstrated that the carefully designed protocol is capable of outperforming the above-mentioned benchmarkers both in terms of a reduced number of cluster-head updates and cluster-change events. Hence its quality-of-service may be deemed higher
Improved Fair-Zone technique using Mobility Prediction in WSN
The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has
led them to be the most popular choice in ubiquitous computing. Clustering
sensor nodes organizing them hierarchically have proven to be an effective
method to provide better data aggregation and scalability for the sensor
network while conserving limited energy. It has some limitation in energy and
mobility of nodes. In this paper we propose a mobility prediction technique
which tries overcoming above mentioned problems and improves the life time of
the network. The technique used here is Exponential Moving Average for online
updates of nodal contact probability in cluster based network.Comment: 10 pages, 7 figures, Published in International Journal Of Advanced
Smart Sensor Network Systems (IJASSN
- …