Transition metal complexes derived from ketone based N(4)-substituted thiosemicarbazones: Crystal structures and spectral studies

Thiosemicarbazones have recently attracted considerable attention due to their ability to form tridentate chelates with transition metal ions through either two nitrogen and sulfur atoms, N–N–S or oxygen, nitrogen and sulfur atoms, O–N–S. Considerable interest in thiosemicarbazones and their transition metal complexes has also grown in the areas of biology and chemistry due to biological activities such as antitumoral, fungicidal, bactericidal, antiviral and nonlinear optical properties. They have been used for metal analyses, for device applications related to telecommunications, optical computing, storage and information processing.The versatile applications of metal complexes of thiosemicarbazones in various fields prompted us to synthesize the tridentate NNS-donor thiosemicarbazones and their metal complexes. As a part of our studies on transition metal complexes with these ligands, the researcher undertook the current work with the following objectives. 1. To synthesize and physico-chemically characterize the following thiosemicarbazone ligands: a. Di-2-pyridyl ketone-N(4)-methyl thiosemicarbazone (HDpyMeTsc) b. Di-2-pyridyl ketone-N(4)-ethyl thiosemicarbazone (HDpyETsc) 2. To synthesize oxovanadium(IV), manganese(II), nickel(II), copper(II), zinc(II) and cadmium(II) complexes using the synthesized thiosemicarbazones as principal ligands and some anionic coligands. 3. To study the coordination modes of the ligands in metal complexes by using different physicochemical methods like partial elemental analysis, thermogravimetry and by different spectroscopic techniques. 4. To establish the structure of compounds by single crystal XRD studies

PEER TO PEER CACHE RESOLUTION MECHANISM FOR MOBILE AD HOC NETWORKS

In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our vision cache resolution should satisfy the following requirements: (i) it should result in low message overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission range. The proposed approach reduces the number of messages flooded in to the network to find the requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The experimental results gives a promising result based on the metrics of studies.