In Ad hoc Network of Nanosensors for Wastage detection, clustering assist in nodal communication and in organization of the data fetched by the nanosensors in the network. The attempt of traditional cluster formation techniques degraded the formation of cluster in a precise manner. The data from the nanosensors which act as the nodes of the network have to be distinctively added into the clusters. The dynamic path selection cluster would achieve this distinct addition by dynamically creating a path to the data as an initial process and then redirecting the data to their appropriate cluster based to the readied scheme.

1. Novel Methodology of Data Management in Ad
Hoc Network Formulated using Nanosensors for
Detection of Industrial Pollutants
S.Gowri1, J. Jabez*2
1,2Faculty of Computer Science and Engineering, Sathyabama University,
Chennai, 600119, India
gowri.it@sathyabamauniversity.ac.in
ABSTRACT
In Ad hoc Network of Nanosensors for Wastage detection, clustering assist in nodal communication
and in organization of the data fetched by the nanosensors in the network. The attempt of traditional
cluster formation techniques degraded the formation of cluster in a precise manner. The data from the
nanosensors which act as the nodes of the network have to be distinctively added into the clusters. The
dynamic path selection cluster would achieve this distinct addition by dynamically creating a path to the
data as an initial process and then redirecting the data to their appropriate cluster based to the readied
scheme. The formation of clusters is evaluated on the bases of the time taken in formation of cluster and
the relevance in information clustering. In this paper the dynamic path selection clustering algorithm is
deployed to the cluster formation in data from sensor set for the detection of wastage from industries.
Based on the data accumulated from the nanosensors the assignment of fetched information is clustered
appropriately. The analyses of the resultant obtain on evaluation process shows the cluster formation
life time and relevancy in cluster formation has been more feasible than that of the existing approaches.
Index Terms— Ad Hoc Network of Nanosensors, Industrial Pollutants, Dynamic Path Selection
Clustering, Data Management.
I. INTRODUCTION
The pollution less atmosphere is the most significant concern for the existence of human life on earth.
Data management over industrial pollutants would help in the management of the pollutants released
from the industries. For this innovation wireless innovation help the pollutant management centers to

2. access the data from nanosensors which are set to predict the pollutants release. The nanosensors
functionality is as that of the ordinary sensors except that the size of the sensor’s is 10-9. The Industries
are basically equipped with ordinary sensors already which are presently functional. All the nanosensors
are connected in a network on the bases of wireless transmission system, for which an Ad Hoc Network
(Jinila and Komathy, 2015) is designed. The water quality parameters measured using the nanosensors
incorporate pH, dissolved oxygen (DO), oxidation-reduction potential (ORP), conductivity (saltiness),
turbidity, temperature and disintegrated particles.
Water sullying, by the arrival of waste water from modern and business squander (intentionally or
through spills) into surface waters; arrivals of untreated private sewage, and compound poisons, for
instance, chlorine, from treated sewage; release of waste and contaminations into surface flood gushing
to surface waters (checking urban spillover and cultivating overflow, which may contain
concoction/engineered manures and pesticides); squander transfer and filtering into groundwater;
eutrophication and littering.
The rest of the paper is organized as follows. Section II talks about the related works. Section III talks
about on the proposed procedure which incorporates the Overall Framework and Flow Diagram.
Section V talks about the re-enactment display results and investigations the execution of the proposed
framework. Section VI finishes up and proposes the future work that can be done.
II. RELATED WORKS
Enormous proposals have been carried out for the purpose of detection of pollutants. Khedo et al.
(2010) proposed a Wireless sensor framework Air Pollution Monitoring System (WAPMS), which
contained a sequence of sensor hubs and a communication structure which allows the information to be
sent to a server. Were in the sensor hubs assemble information autonomously and through the data
network the information is pass information to one or more base stations, which forward it to a sensor
system server. The framework send summons to the hubs in order to fetch the data, and also allowing
the hubs to send data out autonomously.
As the innovation expand, the level of mechanization (minimizing the labour) in the all parts are

3. eventually increased. Wireless Sensor Networks (WSN) are picking up the ground in all sectors of life;
from homes to industrial plants, from traffic control to nature observing. The air contamination
monitoring framework contains sensors to screen the intrigued contamination parameter in
environment. Raju et al. (2013) recreated the three air toxins gasses which includes carbon monoxide,
carbon dioxide and sulphur dioxide in air because these gasses choose the level of contamination. They
stated that it can likewise apply the methodology in different applications like cooking gas leakage, to
caution the labourers in oil and gas industry to identify the spillage and etc. This simulation makes the
awareness in individuals in urban communities.
K-Means being a well know clustering algorithm was stated as in to have a drawback, as it requires a
user input on the number of clusters. For which a genetic algorithm was idealized by Md Anisur
Rahman and Md Zahidul Islam. As they say that it is extremely difficult for a user to precisely guess the
number of clusters in a data set. The genetic algorithm formulated by them determines the number of
clusters automatically. The algorithm formulated by them is stated to be proficient of automatically
discovering the accurate number of clusters and recognizing the correct genetic factor through a new
initial inhabitant selection method.
Portion Methods are calculations that, by supplanting the inside item with a suitable positive
unequivocal capacity, verifiably play out a nonlinear mapping of the information into a high-
dimensional element space. In this paper, we show a portion strategy for grouping roused by the
traditional K-Means calculation in which every bunch is iteratively refined utilizing a one-class Support
Vector Machine. Our strategy, which can be effectively executed, contrasts positively and regard to
famous grouping calculations, similar to K-Means, Neural Gas, and Self-Organizing Maps, on an
engineered information set and three UCI genuine information benchmarks (IRIS information,
Wisconsin bosom tumor database, Spam database).
Remote sensor systems (WSNs) experiences the problem area issue where the sensor hubs nearest to
the base station are have to hand-off more parcel than the hubs more distant far from the base station. In
this manner, lifetime of tangible system relies on upon these nearest hubs. Bunching strategies are
utilized to expand the lifetime of a remote sensor organize. Be that as it may, current grouping

4. calculations for the most part use two strategies; selecting bunch heads with more remaining vitality,
and turning group makes a beeline for disperse the vitality utilization among hubs in every bunch and
extend the system lifetime. The vast majority of the calculations utilize irregular determination for
selecting the group heads. Here, we propose a novel direction bunching method for selecting the group
heads in WSNs. Our calculation chooses the group heads in light of movement and turns occasionally.
It gives the main direction based bunching strategy for selecting the group goes to palliate the problem
area issue by delaying the system lifetime.
While K-means is a standout amongst the most surely understood techniques to parcel information set
into groups, despite everything it has an issue when bunches are of various size and diverse thickness.
K-implies focalizes to one of numerous nearby minima. Numerous techniques have been proposed to
defeat these restrictions of K-means, yet the majority of these strategies don't conquer the constraint of
both distinctive thickness and size in a similar time. The past strategies accomplishment to beat one of
them while fizzles with the others. In this paper we propose a novel calculation of bunching utilizing K-
implies (CUK). Our proposed calculation utilizes K-intends to bunch information protests by utilizing
one extra centroid, a few partionining and combining procedure are utilized. Consolidating choice relies
on upon the normal mean separation where normal separation between every bunch mean and every
information protest is resolved, since the minimum and storage room groups in normal mean separation
are converged in one bunch, this procedure proceeds until we get the last required bunches in an exact
and proficient way. By contrasting the outcomes and K-implies, it was found that the outcomes got by
the proposed calculation CUK are more compelling and precise.
III. PROPOSED METHODOLOGY
The Proposed framework has "N" number of sensors from which information is been gathered and put
away in a database this put away information. The proposed calculation is utilized to arrange the
dubiousness in the limit area. The Clustering to the information from the sensors is done as appeared in
Fig. 1 by considering the worth quality. Every information point is contrasted with the estimation of the
neighbouring information point. Every information point figures the separation amongst itself and its

5. neighbours and registers a separation network. From the lattice, all the qualities beginning from the
most extreme worth is contrasted and the predefined separation. In the event that the separation
processed is not exactly a predetermined separation, the concerned vehicle is thought to be in the lower
guess of the bunch. Else, if the separation registered is more prominent than the predefined separation, it
is thought to be in the upper estimation of a group.
Fig. 1: Overall Framework

6. Fig. 2: System Flow Diagram

7. Fig. 3. Simulation Model for Proposed System
Algorithm:
Initialize Agent:
Computation (starting_mail, agent[x]) {
agent[x].energy ← Max_point;
agent[x].DSize ← MAX_BUFFER;
agent[x].frontier ← eof(starting_mail);
insert(agent[x], population);
while (visited < MAX_PAGES) {

8. foreach parallel agent (population) {
Action (agent[x])
agent[x].energy ← agent[x].energy + newenergy;
if (agent[x].frontier > agent[x].fsize) {
dequeue_words(agent[x].frontier, word_count(D[x]));
}
Energy (agent[x])
}
}
}
Agent’s action:
Action (agent[x])
{
foreach active agent:
D[x] ← Create_new_document()
Pick_keywordsFilepath(agent[x])
E(agent[x]) ← E(agent[x]) – cost(D) + relevancy(D)
Energy (agent[x])
}

9. Pick_keywordsFilepath(agent[x])
{
word := pick_and_dequeue(agent[x].frontier);
D[x] := fetch(words);
}
Agent’s energy E loop:
Energy (agent[x], population){
foreach alive agent:
get_process (mail[..], agent[x])
Action (agent[x]) // fetch_words and find_path
update_energy_environment_state (agent[x])
if(E(agent[x]) > Max_point)
child_agents ← create.newagents(agent[i], agent[i+1])
insert(child_agents, population);
elseif (E(agent[x])< 0)
delete(agent[x])
replenish environmental resources
}
IV. DATASET DESCRIPTION
This Directive should apply to ignition plants, the rated thermal input of which is equivalent to or

10. more than 50 MW, independent of the type of fuel utilized (solid, liquid or gas). Its motivation is to
restrict the outflows of sulphur dioxide, nitrogen oxides and dust discharged from these plants.
New reporting commitments concerning the outflow inventories apply following 2004 as set out in
Annex VIII(B) of the Directive.
THE ATTRIBUTES OF THE DATASET
Total suspended particles NOx SO2
mass/year mass/time mass/time
V. RESULTS AND DISCUSSION
A. Scenario Characteristics
The Matlab simulator is used to generate the network sensor as a simulation and for further processes
simulation as well. From the simulated network the input to the proposed clustering algorithm is
generated. The simulated scenario includes multiple nanosensor networks with 10 to 200 nodes. The
cluster formation is taken a 9*10-3 Sec. The minimum time consumed is fixed to 3*10-3 Sec and the
maximum time consumed is varied from 3*10-3 to 8*10-3. The Ad Hoc network is created with
‘n’nanosensors. The radio model used in the simulation is LAN 802.11p which provides a transmission
rate of 2 Mbps and a transmission range of 1000 m.
B. Evaluation Criteria
The performance of the proposed clustering algorithm is analysed based on two significant metrics
and the comparisons are made with the existing Fuzzy C-Means, Hierarchical and K–Means clustering
methods.
C. Time Consumption
The mean time by which the cluster formation takes place by the algorithm shows the performance of
the Algorithm. Longer the duration of the cluster formation, more is the degradability of the algorithm.
Equation (1) is used to compute the average cluster formation lifetime. Figure 2 shows the time
consumed by the various clustering algorithm when the number of node is varied from 10 nodes to 200

11. nodes and the number of clusters to be formed is fixed to 4 for all the algorithms. In (1), L represents
the cluster formation time; V represents the value of the nodes in the data, Fe represents the final node
of the cluster and La represents the average time of the node to fit into the cluster.
L=V- Fe
La
The average time in the processing unit of the sensor is limited and should be used effectively to
increase the performance of the system. In the case of fuzzy c-means clustering, membership values are
computed for all the vehicles and stored in the database along with the other attributes.
TABLE 1: TIME CONSUMPTION PER ‘N’ NO. OF NODES
No. of Nodes/Algorithms Proposed Algorithm Fuzzy C-Means K-Means Hierarchical
10 3.42 4.7 6 7.21
30 3.84 5.07 6.29 7.32
50 4.69 4.98 6.5 7.45
70 4.35 5.22 6.42 7.5
90 4.5 4.93 6.11 7.33
110 4.59 4.73 6.64 7.55
130 4.67 4.75 6.36 7.64
150 4.7 4.78 6.45 7.01
170 4.53 4.9 6.31 7.2
190 4.42 4.83 6.22 7.33

12. Figure 4.1: Time Consumption Graph
Figure 4.1 shows the comparison of time consumed by Fuzzy C-Means, Hierarchical and K–Means
clustering approaches. Analysis shows that proposed method of clustering devour minimum time as
compared to the other clustering methods. Since K–Means approach requires a lot comparison like
linear search, the time consumed is maximum.
D. Memory Consumption
The mean memory by which the cluster formation takes place by the algorithm shows the
performance of the Algorithm. Higher the memory consumed for the cluster formation, more is the
degradability of the algorithm. Equation (2) was used to compute the average memory allocated for the
formation of clusters. Figure 2 shows the memory consumed by the various clustering algorithm when
the number of node is varied from 10 nodes to 200 nodes and by fixing the number of clusters to be

13. formed 4 for all the algorithms. In (2), M represents the memory consumed for the cluster formation; V
represents the value of the nodes in the data, Fe represents the final node of the cluster and Ma
represents the average time of the node to fit into the cluster.
M=V- Fe
Ma
The average time in the processing unit of the sensor is limited and should be used effectively to
increase the performance of the system. In the case of fuzzy c-means clustering, membership values are
computed for all the vehicles and stored in the database along with the other attributes.
TABLE 2: MEMORY CONSUMPTION PER ‘N’ NO. OF NODES
No. of Nodes/Algorithms Proposed Algorithm Fuzzy C-Means K-Means Hierarchical
10 1.62 2.7 3.34 4.83
30 1.34 2.07 3.3 4.88
50 1.59 2.98 3.65 5.06
70 1.9 2.22 3.58 4.75
90 1.35 2.93 3.19 4.85
110 1.53 2.73 3.08 4.98
130 1.37 2.75 3.43 4.64
150 1.56 2.78 4.63 4.76
170 1.23 1.9 4.73 4.64
190 1.2 1.83 4.55 4.54

14. Figure 4.2: Memory Consumption Graph
Figure 4.2 shows the comparison of time consumed by Fuzzy C-Means, Hierarchical and K–Means
clustering approaches. Analysis shows that proposed method of clustering incurs less memory when
compared to other three clustering methods. Since in proposed method do not require any additional
memory space such as temporary variable of reference variable, the size of memory occupied is less
when compared to the existing approaches.

15. Fig. 5: Cluster Formation by proposed clustering algorithm
VI. CONCLUSION
In this paper, the proposed grouping calculation is embraced for bunch arrangement. To the best of
our insight, this plan performs exact grouping along these lines bringing about better normal bunch
arrangement time and memory utilization when contrasted with the current Fuzzy C-Mean, K-Mean and
Hierarchical grouping approaches. This model backings stable bunch development. In future, this
procedure is been implanted over different frameworks which would help in enhancing the
advancement for alternate frameworks also.
VII. REFERENCES
[1] Kavi K. Khedo, Rajiv Perseedoss and Avinash Mungur, “Wireless Sensor Network Air Pollution
Monitoring System”, International Journal of Wireless & Mobile Networks (IJWMN), Vol. 2, No. 2,
May 2010.

16. [2] P.Vijnatha Raju, R.V.R.S.Aravind and B Sangeeth Kumar, "Pollution Monitoring System using
Wireless Sensor Network in Visakhapatnam", International Journal of Engineering Trends and
Technology (IJETT), Vol. 4, No.4, April 2013.
[3] Md Anisur Rahman and Md Zahidul Islam, "A hybrid clustering technique combining a novel
genetic algorithm with K-Means", Knowledge-Based Systems, 2014.
[4] Francesco Camastra and Alessandro Verri, "A Novel Kernel Method for Clustering", IEEE
Transactions on Pattern Analysis And Machine Intelligence, Vol. 27, No. 5, May 2005.
[5] Hazarath Munaga, J.V.R. Murthy, and N.B.Venkateswarlu, "A Novel Trajectory Clustering
technique for selecting cluster heads in Wireless Sensor Networks", International Journal of Recent
Trends in Engineering, Vol. 1, No. 1, May 2009.
[6] Pradipta Maji and Sankar K. Pal, “RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy
Sets”, Fundamenta Informaticae 80, pp. 475–496, 2007.
[7] Levent Bolelli, Seyda Ertekin, Ding Zhou and C. Lee Giles, “K-SVMeans: A Hybrid Clustering
Algorithm for Multi-Type Interrelated Datasets”, International Conference on Web Intelligence, pp.
198-204, 2007.
[8] Jan W. Owsiński and Mariusz Tomasz Mejza, “A Hybrid Clustering Method for General Purpose
and Pattern Recognition” Proceedings of the International Multiconference on Computer Science
and Information Technology, pp. 121 – 126, 2007.
[9] Ravindra Jain, “A Hybrid Clustering Algorithm for Data Mining”, CCSEA, SEA, CLOUD, DKMP,
CS & IT 05, pp. 387-393, 2012.
[10] Gurjit Singh and Navjot Kaur “Hybrid Clustering Algorithm with Modifications Enhanced K-
Means and Hierarchal Clustering”, International Journal of Advanced Research in Computer
Science and Software Engineering, Volume 3, No. 5, pp. 166-170, May 2013
[11] Bevish Jinila and Komathy, “Rough Set Based Fuzzy Scheme for Clustering and Cluster Head
Selection in VANET”, Elektronika Ir Elektrotechnika, Vol. 21, No. 1, 2015.
[12] ftp://ftp.ncbi.nlm.nih.gov/pubchem/Bioassay/CSV/