A provably tight delay-driven concurrently congestion mitigating global routing algorithm

Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of O(n(2) log n) complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity O(n(4)) and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed. (C) 2014 Elsevier Inc. All rights reserved.

QoS Performance Analysis of Routing Protocols in Vehicular Ad-hoc Networks

Vehicular Ad-hoc Networks (VANET), is a type of wireless ad-hoc network that aims to provide communication among vehicles. A key characteristic of VANETs is the very high mobility of nodes that result in a frequently changing topology along with the frequent breakage and linkage of the paths among the nodes involved. These characteristics make the Quality of Service (QoS) requirements in VANET a challenging issue. In this paper we characterize the performance available to applications in infrastructureless VANETs in terms of path holding time, path breakage probability and per session throughput as a function of various vehicle densities on road, data traffic rate and number of connections formed among vehicles by making use of table-driven and on-demand routing algorithms. Several QoS constraints in the applications of infrastructureless VANETs are observed in the results obtained.

Secure Routing with an Integrated Localized Key Management Protocol in MANETs

A routing protocol in a mobile ad hoc network (MANET) should be secure against both the outside attackers which do not hold valid security credentials and the inside attackers which are the compromised nodes in the network. The outside attackers can be prevented with the help of an efficient key management protocol and cryptography. However, to prevent inside attackers, it should be accompanied with an intrusion detection system (IDS). In this paper, we propose a novel secure routing with an integrated localized key management (SR-LKM) protocol, which is aimed to prevent both inside and outside attackers. The localized key management mechanism is not dependent on any routing protocol. Thus, unlike many other existing schemes, the protocol does not suffer from the key management - secure routing interdependency problem. The key management mechanism is lightweight as it optimizes the use of public key cryptography with the help of a novel neighbor based handshaking and Least Common Multiple (LCM) based broadcast key distribution mechanism. The protocol is storage scalable and its efficiency is confirmed by the results obtained from simulation experiments.

Emergent Intelligence Based QoS Routing in MANET

Mobile Ad hoc Networks (MANETs) are self-organized, infrastructureless, decentralized wireless networks consist of a group of heterogeneous mobile devices. Due to the inherent characteristics of MANE -Ts, such as frequent change of topology, nodes mobility, resource scarcity, lack of central control, etc., makes QoS routing is the hardest task. QoS routing is the task of routing data packets from source to destination depending upon the QoS resource constraints, such as bandwidth, delay, packet loss rate, cost, etc. In this paper, we proposed a novel scheme of providing QoS routing in MANETs by using Emergent Intelligence (El). The El is a group intelligence, which is derived from the periodical interaction among a group of agents and nodes. We logically divide MANET into clusters by centrally located static agent, and in each cluster a mobile agent is deployed. The mobile agent interacts with the nodes, neighboring mobile agents and static agent for collection of QoS resource information, negotiations, finding secure and reliable nodes and finding an optimal QoS path from source to destination. Simulation and analytical results show that the effectiveness of the scheme. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.ore/licenscs/by-nc-nd/4.0/). Peer-review under responsibility of the Conference Program Chairs

Neoarchean arc magmatism followed by high-temperature, high-pressure metamorphism in the Nilgiri Block, southern India

The Nilgiri Block, southern India is an exhumed lower crust formed through arc magmatic processes in the Neoarchean. The main lithologies in this terrane include charnockites, gneisses, volcanic tuff, metasediments, banded iron formation and mafic-ultramafic bodies. Mafic-ultramafic rocks are present towards the northern and central part of the Nilgiri Block. We examine the evolution of these mafic granulites/metagabbros by phase diagram modeling and U-Pb sensitive high resolution ion microprobe (SHRIMP) dating. They consist of a garnet-clinopyroxene-plagioclase-hornblende-ilmenite +/- orthopyroxene +/- rutile assemblage. Garnet and clinopyroxene form major constituents with labradorite and orthopyroxene as the main mineral inclusions. Labradorite, identified using Raman analysis, shows typical peaks at 508 cm(-1), 479 cm(-1), 287 cm(-1) and 177 cm(-1). It is stable along with orthopyroxene towards the low-pressure high-temperature region of the granulite fades (M1 stage). Subsequently, orthopyroxene reacted with plagioclase to form the peak garnet + clinopyroxene + rutile assemblage (M2 stage). The final stage is represented by amphibolite facies-hornblende and plagioclase-rim around the garnet-clinopyroxene assemblage (M3 stage). Phase diagram modeling shows that these mafic granulites followed an anticlockwise P-T-t path during their evolution. The initial high-temperature metamorphism (M1 stage) was at 850-900 degrees C and similar to 9 kbar followed by high-pressure granulite fades metamorphism (M2 stage) at 850-900 degrees C and 14-15 kbar. U-Pb isotope studies of zircons using SHRIMP revealed late Neoarchean to early paleoproterozoic ages of crystallization and metamorphism respectively. The age data shows that these mafic granulites have undergone arc magmatism at ca. 25392 +/- 3 Ma and high-temperature, high-pressure metamorphism at ca. 2458.9 +/- 8.6 Ma. Thus our results suggests a late Neoarchean arc magmatism followed by early paleoproterozoic high-temperature, high-pressure granulite facies metamorphism due to the crustal thickening and suturing of the Nilgiri Block onto the Dharwar Craton. (C) 2015 Elsevier B.V. All rights reserved.

RPRDC: Reliable Proliferation Routing with low Duty-Cycle in Wireless Sensor Networks

Ensuring reliable energy efficient data communication in resource constrained Wireless Sensor Networks (WSNs) is of primary concern. Traditionally, two types of re-transmission have been proposed for the data-loss, namely, End-to-End loss recovery (E2E) and per hop. In these mechanisms, lost packets are re-transmitted from a source node or an intermediate node with a low success rate. The proliferation routing(1) for QoS provisioning in WSNs low End-to-End reliability, not energy efficient and works only for transmissions from sensors to sink. This paper proposes a Reliable Proliferation Routing with low Duty Cycle RPRDC] in WSNs that integrates three core concepts namely, (i) reliable path finder, (ii) a randomized dispersity, and (iii) forwarding. Simulation results demonstrates that packet successful delivery rate can be maintained upto 93% in RPRDC and outperform Proliferation Routing(1). (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).