Connectivity-aware Routing in Sensor Networks

Sensor network applications such as environmental monitoring demand that the data collection process be carried out for the longest possible time. Our paper addresses this problem by presenting a routing scheme that ensures that the monitoring network remains connected and hence the live sensor nodes deliver data for a longer duration. We analyze the role of relay nodes (neighbours of the base-station) in maintaining network connectivity and present a routing strategy that, for a particular class of networks, approaches the optimal as the set of relay nodes becomes larger. We then use these findings to develop an appropriate distributed routing protocol using potential-based routing. The basic idea of potential-based routing is to define a (scalar) potential value at each node in the network and forward data to the neighbor with the highest potential. We propose a potential function and evaluate its performance through simulations. The results show that our approach performs better than the well known lifetime maximization policy proposed by Chang and Tassiulas (2004), as well as AODV [Adhoc on demand distance vector routing] proposed by Perkins (1997).

STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH in UMTS Networks

In Universal Mobile Telecommunication Systems (UMTS), the Downlink Shared Channel (DSCH) can be used for providing streaming services. The traffic model for streaming services is different from the commonly used continuously- backlogged model. Each connection specifies a required service rate over an interval of time, k, called the "control horizon". In this paper, our objective is to determine how k DSCH frames should be shared among a set of I connections. We need a scheduler that is efficient and fair and introduce the notion of discrepancy to balance the conflicting requirements of aggregate throughput and fairness. Our motive is to schedule the mobiles in such a way that the schedule minimizes the discrepancy over the k frames. We propose an optimal and computationally efficient algorithm, called STEM+. The proof of the optimality of STEM+, when applied to the UMTS rate sets is the major contribution of this paper. We also show that STEM+ performs better in terms of both fairness and aggregate throughput compared to other scheduling algorithms. Thus, STEM+ achieves both fairness and efficiency and is therefore an appealing algorithm for scheduling streaming connections.

Packet Reordering in Network Processors

Network processors today consist of multiple parallel processors (micro engines) with support for multiple threads to exploit packet level parallelism inherent in network workloads. With such concurrency, packet ordering at the output of the network processor cannot be guaranteed. This paper studies the effect of concurrency in network processors on packet ordering. We use a validated Petri net model of a commercial network processor, Intel IXP 2400, to determine the extent of packet reordering for IPv4 forwarding application. Our study indicates that in addition to the parallel processing in the network processor, the allocation scheme for the transmit buffer also adversely impacts packet ordering. In particular, our results reveal that these packet reordering results in a packet retransmission rate of up to 61%. We explore different transmit buffer allocation schemes namely, contiguous, strided, local, and global which reduces the packet retransmission to 24%. We propose an alternative scheme, packet sort, which guarantees complete packet ordering while achieving a throughput of 2.5 Gbps. Further, packet sort outperforms the in-built packet ordering schemes in the IXP processor by up to 35%.

An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in the work of Ling and Znati (2005) and Li et al. (2005), we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme both in terms of resilience against node capture as well as in energy consumption for pairwise key establishment, making our scheme more feasible.

AC Breakdown Characteristics of Epoxy Nanocomposites

Experiments were conducted to measure the ac breakdown strength of epoxy alumina nanocomposites with different filler loadings of 0.1, 1 and 5 wt%. The experiments were performed as per the ASTM D 149 standard on samples of thickness 0.5 mm, 1 mm and 3 mm in order to study the effect of thickness on the ac breakdown strength of epoxy nanocomposites. In the case of epoxy alumina nanocomposites it was observed that the ac breakdown strength was marginally lower for 0.1 wt% and 1 wt% filler loadings and then increased at 5 wt% filler loading as compared to the unfilled epoxy. The Weibull shape parameter (beta) increased with the addition of nanoparticles to epoxy as well as with the increasing sample thickness for all the filler loadings considered. DSC analysis was done to study the material properties at the filler resin interface in order to understand the effect of the filler loading and thereby the influence of the interface on the ac breakdown strength of epoxy nanocomposites. It was also observed that the decrease in ac electric breakdown strength with an increase in sample thickness follows an inverse power-law dependence. In addition, the ac breakdown strength of epoxy silica nanocomposites have also been studied in order to understand the influence of the filler type on the breakdown strength.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Transient electric field distribution within the working volume of an NEMP simulator

Nuclear electro-magnetic pulse (NEMP) simulators which are used in the simulation of transient electromagnetic fields due to a high altitude nuclear detonation are generally excited with a double exponential high voltage pulse. This results in a current distribution on the wires of the simulator and hence a transient electric field in the working volume of the simulator where the test object is kept. It is found that for the simulator under study, the current distribution is non-uniform and so is the field distribution along the width of the simulator in the working volume. To make the current distribution uniform, several methods have been suggested and the results of these methods are analyzed and suitable conclusions are arrived at from those results.

The phenomenon of notch in an NEMP simulator and its reduction

The effect of variation in the switching instant of the output switch of the pulser circuit used in energizing an NEMP simulator on the voltage fed to the simulator and hence the electric field within the working volume of the simulator has been studied. Depending upon the instant at which the output switch closes, the amplitude and the wave shape of the voltage that is fed to the illuminator varies. This wave shape of the output voltage from the pulser circuit determines the shape and characteristics of the electric field within the working volume of the simulator. To study the effect of variation in the switching instant on the vertical electric field within the working volume, the vertical electric field has been computed in time and frequency domains. For certain switching instants, the electric field shows a sharp reduction in its amplitude after the peak which is called the notch. The presence of notch results in the test object not getting illuminated with all the frequencies of interest. The notch has been successfully reduced by suitably modifying the pulser circuit.

Lightning Induced Voltages on a Rocket and its Exhaust Plume

A preliminary attempt has been made to study the time domain characteristics of the induced voltage and current on the rocket and its exhaust plume (ionized trail) when it is coupled with the transient electromagnetic field generated by a nearby lightning discharge. For the computation, finite difference time domain (FDTD) technique has been used where the object is assumed to be a finite vertical nonuniform transmission line above a perfectly conducting ground. It is seen that the amplitude of the first peak of the induced voltage and current at the mid point of the object is 23.5 kV and 4.9 kA respectively.