Driving forces in substitution reactions of octahedral complexes: The influence of the competitive effect

The reaction of cis-[RuCl(2)(P-P)(N-N)] type complexes (P-P = 1,4-bis(diphenylphosphino)butane or (1,1`-diphenylphosphino)ferrocene; N-N = 2,2`-bipyridine or 1,10-phenantroline) with monodentate ligands (L), such as 4-methylpyridine, 4-phenylpyridine and benzonitrile forms [RuCl(L)(P-P)(N-N)](+) species Upon characterization of the isolated compounds by elemental analysis, (31)P{(1)H} NMR and X-ray crystallography it was found out that the type of the L ligand determines its position in relation to the phosphorus atom. While pyridine derivatives like 4-methylpyridine and 4-phenylpyridine coordinate trans to the phosphorus atom, the benzonitrile ligand (bzCN), a good pi acceptor, coordinates trans to the nitrogen atom. A (31)P{(1)H} NMR experiment following the reaction of the precursor cis-[RuCl(2)(dppb)(phen)] with the benzonitrile ligand shows that the final position of the entering ligand in the complex is better defined as a consequence of the competitive effect between the phosphorus atom and the cyano-group from the benzonitrile moiety and not by the trans effect. In this case, the benzonitrile group is stabilized trans to one of the nitrogen atoms of the N-N ligand. A differential pulse voltammetry experiment confirms this statement. In both experiments the [RuCl(bzCN)(dppb)(phen)]PF(6) species with the bzCN ligand positioned trans to a phosphorus atom of the dppb ligand was detected as an intermediate complex. (c) 2009 Elsevier Ltd. All rights reserved.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.