Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks

The theme of the thesis is centred around one important aspect of wireless sensor networks; the energy-efficiency.The limited energy source of the sensor nodes calls for design of energy-efficient routing protocols. The schemes for protocol design should try to minimize the number of communications among the nodes to save energy. Cluster based techniques were found energy-efficient. In this method clusters are formed and data from different nodes are collected under a cluster head belonging to each clusters and then forwarded it to the base station.Appropriate cluster head selection process and generation of desirable distribution of the clusters can reduce energy consumption of the network and prolong the network lifetime. In this work two such schemes were developed for static wireless sensor networks.In the first scheme, the energy wastage due to cluster rebuilding incorporating all the nodes were addressed. A tree based scheme is presented to alleviate this problem by rebuilding only sub clusters of the network. An analytical model of energy consumption of proposed scheme is developed and the scheme is compared with existing cluster based scheme. The simulation study proved the energy savings observed.The second scheme concentrated to build load-balanced energy efficient clusters to prolong the lifetime of the network. A voting based approach to utilise the neighbor node information in the cluster head selection process is proposed. The number of nodes joining a cluster is restricted to have equal sized optimum clusters. Multi-hop communication among the cluster heads is also introduced to reduce the energy consumption. The simulation study has shown that the scheme results in balanced clusters and the network achieves reduction in energy consumption.The main conclusion from the study was the routing scheme should pay attention on successful data delivery from node to base station in addition to the energy-efficiency. The cluster based protocols are extended from static scenario to mobile scenario by various authors. None of the proposals addresses cluster head election appropriately in view of mobility. An elegant scheme for electing cluster heads is presented to meet the challenge of handling cluster durability when all the nodes in the network are moving. The scheme has been simulated and compared with a similar approach.The proliferation of sensor networks enables users with large set of sensor information to utilise them in various applications. The sensor network programming is inherently difficult due to various reasons. There must be an elegant way to collect the data gathered by sensor networks with out worrying about the underlying structure of the network. The final work presented addresses a way to collect data from a sensor network and present it to the users in a flexible way.A service oriented architecture based application is built and data collection task is presented as a web service. This will enable composition of sensor data from different sensor networks to build interesting applications. The main objective of the thesis was to design energy-efficient routing schemes for both static as well as mobile sensor networks. A progressive approach was followed to achieve this goal.

Studies on some generalizations of line graph and the power domination problem in graphs

Department of Mathematics, Cochin University of Science and Technology

Convex extendable trees

The concept of convex extendability is introduced to answer the problem of finding the smallest distance convex simple graph containing a given tree. A problem of similar type with respect to minimal path convexity is also discussed.

Spanning avalanches in the three-dimensional Gaussian random-field Ising model with metastable dynamics: Field dependence and geometrical properties

Spanning avalanches in the 3D Gaussian Random Field Ising Model (3D-GRFIM) with metastable dynamics at T=0 have been studied. Statistical analysis of the field values for which avalanches occur has enabled a Finite-Size Scaling (FSS) study of the avalanche density to be performed. Furthermore, a direct measurement of the geometrical properties of the avalanches has confirmed an earlier hypothesis that several types of spanning avalanches with two different fractal dimensions coexist at the critical point. We finally compare the phase diagram of the 3D-GRFIM with metastable dynamics with the same model in equilibrium at T=0.

Studies on seed pathology and seedling diseases of some important indigenous tree species of kerala

In forestry, availability of healthy seeds is an important factor in raising planting stock. Initial seed health and storage conditions are the major factors governing the germinability of seeds. Like seeds of agricultural and horticultural crops, forest tree seeds are also liable to be affected by micro-organisms during storage, which affects the germination, and reduces the viability. Further introduction of seed-borne diseases into newly sown crops/areas on account of using unhealthy seeds is also not ruled out. Availability of healthy stock of seedlings is intrinsic for raising plantations and to meet this requirement elimination of nursery diseases by appropriate chemicals is of prime imortance. As exotic tree species may become susceptible to various native pathogens, it is generally considered better to select indigenous tree species for large scale plantations as they are well adapted to local environment. However, before taking up large scale afforestation progranme involving any indigenous tree species, it is essential to have knowledge about seed disorders and seedling diseases and their management. with a View to select appropriate tree species with fewer seed disorders and seedling disease problems for use in further plantation programme, four indigenous tree species such as Albizia odoratissima (L.f) Benth., Lagerstroemia microcazpa Wt., Pterocazpus marsupiwn Roxb. and Xylia xylocarpa (Roxb.) Taub. were evaluated to meet the above parameters

Pionic branches in neutron matter and the problem of pion condensation

The pion spectrum for charged and neutral pions is investigated in pure neutron matter, by letting the pions interact with a neutron Fermi sea in a self-consistent scheme that renormalizes simultaneously the mesons, considered the source of the interaction, and the nucleons. The possibility of obtaining different kinds of pion condensates is investigated with the result that they cannot be reached even for values of the spin-spin correlation parameter, g', far below the range commonly accepted.

The Fishing Industry in Kerala - Problem and Potentials

importance of fishing and other allied industries in the economy was realised only very recently. Consequently only very few studies are available on the subject. Here an attempt is made to survey the available literature on the subject.

A Novel Decision Tree Algorithm for Numeric Datasets - C 4.5*Stat

Decision trees are very powerful tools for classification in data mining tasks that involves different types of attributes. When coming to handling numeric data sets, usually they are converted first to categorical types and then classified using information gain concepts. Information gain is a very popular and useful concept which tells you, whether any benefit occurs after splitting with a given attribute as far as information content is concerned. But this process is computationally intensive for large data sets. Also popular decision tree algorithms like ID3 cannot handle numeric data sets. This paper proposes statistical variance as an alternative to information gain as well as statistical mean to split attributes in completely numerical data sets. The new algorithm has been proved to be competent with respect to its information gain counterpart C4.5 and competent with many existing decision tree algorithms against the standard UCI benchmarking datasets using the ANOVA test in statistics. The specific advantages of this proposed new algorithm are that it avoids the computational overhead of information gain computation for large data sets with many attributes, as well as it avoids the conversion to categorical data from huge numeric data sets which also is a time consuming task. So as a summary, huge numeric datasets can be directly submitted to this algorithm without any attribute mappings or information gain computations. It also blends the two closely related fields statistics and data mining

Prediction of Learning Disabilities in School Age Children using SVM and Decision Tree

This paper highlights the prediction of Learning Disabilities (LD) in school-age children using two classification methods, Support Vector Machine (SVM) and Decision Tree (DT), with an emphasis on applications of data mining. About 10% of children enrolled in school have a learning disability. Learning disability prediction in school age children is a very complicated task because it tends to be identified in elementary school where there is no one sign to be identified. By using any of the two classification methods, SVM and DT, we can easily and accurately predict LD in any child. Also, we can determine the merits and demerits of these two classifiers and the best one can be selected for the use in the relevant field. In this study, Sequential Minimal Optimization (SMO) algorithm is used in performing SVM and J48 algorithm is used in constructing decision trees.

On the generalized obnoxious center problem: antimedian subsets

The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered.

Reinforcement Learning approaches to Economic Dispatch problem

This paper presents Reinforcement Learning (RL) approaches to Economic Dispatch problem. In this paper, formulation of Economic Dispatch as a multi stage decision making problem is carried out, then two variants of RL algorithms are presented. A third algorithm which takes into consideration the transmission losses is also explained. Efficiency and flexibility of the proposed algorithms are demonstrated through different representative systems: a three generator system with given generation cost table, IEEE 30 bus system with quadratic cost functions, 10 generator system having piecewise quadratic cost functions and a 20 generator system considering transmission losses. A comparison of the computation times of different algorithms is also carried out.

Reinforcement Learning Solution for Unit Commitment Problem Considering Minimum Start Up and Shut Down Times

Unit Commitment Problem (UCP) in power system refers to the problem of determining the on/ off status of generating units that minimize the operating cost during a given time horizon. Since various system and generation constraints are to be satisfied while finding the optimum schedule, UCP turns to be a constrained optimization problem in power system scheduling. Numerical solutions developed are limited for small systems and heuristic methodologies find difficulty in handling stochastic cost functions associated with practical systems. This paper models Unit Commitment as a multi stage decision making task and an efficient Reinforcement Learning solution is formulated considering minimum up time /down time constraints. The correctness and efficiency of the developed solutions are verified for standard test systems

Reinforcement Learning solution for Unit Commitment Problem through pursuit method

Unit commitment is an optimization task in electric power generation control sector. It involves scheduling the ON/OFF status of the generating units to meet the load demand with minimum generation cost satisfying the different constraints existing in the system. Numerical solutions developed are limited for small systems and heuristic methodologies find difficulty in handling stochastic cost functions associated with practical systems. This paper models Unit Commitment as a multi stage decision task and Reinforcement Learning solution is formulated through one efficient exploration strategy: Pursuit method. The correctness and efficiency of the developed solutions are verified for standard test systems

Testing Isotropy and a related Random Walk problem

One comes across directions as the observations in a number of situations. The first inferential question that one should answer when dealing with such data is, “Are they isotropic or uniformly distributed?” The answer to this question goes back in history which we shall retrace a bit and provide an exact and approximate solution to this so-called “Pearson’s Random Walk” problem.

Employment Realm in Technical Education in Kerala-A Study on the Problem of Unemployment among Engineers

The The The The growing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demand for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of the the the the publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system of education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goods emphasized emphasized emphasized emphasized emphasized emphasized emphasized emphasized emphasized emphasized on large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds for promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting education. Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to the rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of India, Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect primarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the earlierarlierarlierarlierarlierarlier political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social compulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions of the state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The presumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of assured assured assured assured assured assured assured assured and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed employment in employment in employment in employment in employment in employment in employment in employment in employment in employment in employment in employment in the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other countries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased further the scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher education in KeralaKeralaKeralaKeralaKeralaKerala, particularparticularparticularparticularparticularparticularparticularparticularparticularparticularly the technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe