A Slotted Aloha joint MAC-cum-Routing protocol for data gathering sensor network applications

In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.

Computing TCP Throughput in a UMTS Network

We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separate queues at the base station (node B). Also due to fragmentation of the TCP packets into Protocol Data Units (PDU) and link layer retransmissions of PDUs there can be significant delays at the queue of the node B. In such a scenario the existing models of TCP may not be sufficient. Thus, we provide a new approximate TCP model and also obtain new closed-form expressions of mean window size. Using these we obtain the throughput of a TCP connection which matches with simulations quite well.

Broadcast in Ad hoc Wireless Networks with Selfish Nodes: A Bayesian Incentive Compatibility Approach

We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible Broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoe wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to he bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Electron-electron interaction in percolative network of polymer-amorphous carbon composites

The polymer-amorphous carbon composites show a negative magnetoconductance which varies as B-2 at low fields which changes to B-1/2 at sufficiently high fields. The magnetoconductance gives the evidence of electron-electron interaction in composites whose conductivity follows thermal fluctuation induced tunneling and falls in the critical regime. (c) 2006 Elsevier B.V. All rights reserved.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Electrical switching and thermal studies on Ge22Te78-xIx chalcohalide glasses: The effect of iodine on network-topology

Investigations on the electrical switching behavior and thermal studies using Alternating Differential Scanning Calorimetry have been undertaken on bulk, melt-quenched Ge22Te78-,Is (3 <= x <= 10) chalcohalide glasses. All the glasses studied have been found to exhibit memory-type electrical switching. The threshold voltages of Ge22Te78-I-x(x) glasses have been found to increase with the addition of iodine and the composition dependence of threshold voltages of Ge22Te78-xIx glasses exhibits a cusp at 5 at.% of iodine. Also, the variation with composition of the glass transition temperature (Tg) of Ge22Te78-I-x(x) glasses, exhibits a broad hump around this composition. Based on the present results, the composition x = 5 has been identified as the inverse rigidity percolation threshold at which Ge22Te78-I-x(x) glassy system exhibits a change from a stressed rigid amorphous solid to a flexible polymeric glass. Further, a sharp minimum is seen in the composition dependence of non-reversing enthalpy (Delta H-nr) of Ge22Te78-I-x(x) glasses at x = 5, which is suggestive of a thermally reversing window at this composition. (C) 2007 Elsevier Ltd. All rights reserved.

Enhancing sensor network lifetime using interactive communication

We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message interactive communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message interactive communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.

High pressure studies on the electrical resistivity of As-Te-bond Si glasses and the effect of network topological thresholds

The variation of resistivity in an amorphous As30Te70-xSix system of glasses with high pressure has been studied for pressures up to 8 GPa. It is found that the electrical resistivity and the conduction activation energy decrease continuously with increase in pressure, and samples become metallic in the pressure range 1.0-2.0 GPa. Temperature variation studies carried out at a pressure of 0.92 GPa show that the activation energies lie in the range 0.16-0.18eV. Studies on the composition/average co-ordination number (r) dependence of normalized electrical resistivity at different pressures indicate that rigidity percolation is extended, the onset of the intermediate phase is around (r) = 2.44, and completion at (r) = 2.56, respectively, while the chemical threshold is at (r) = 2.67. These results compare favorably with those obtained from electrical switching and differential scanning calorimetric studies.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.

Network topological thresholds in gallium doped As-Te glasses Electrical and thermal investigations

Electrical switching and differential scanning calorimetric studies are undertaken on bulk As20Te80-xGax glasses, to elucidate the network topological thresholds. It is found that these glasses exhibit a single glass transition (T-g) and two crystallization reactions (T-cl & T-c2) upon heating. It is also found that there is only a marginal change in T-g with the addition of up to about 10% of Ga; around this composition an increase is seen in 7, which culminates in a local maximum around x = 15. The decrease exhibited in T, beyond this composition, leads to a local minimum at x = 17.5. Further, the As20Te80-xGax glasses are found to exhibit memory type electrical switching. The switching voltages (VT) increase with the increase in gallium content and a local maximum is seen in V-tau around x = 15. VT is found to decrease with x thereafter, exhibiting a local minimum around x = 17.5. The composition dependence of T-cl is found to be very similar to that of V-T of As20Te80-xGax glasses. Based on the present results, it is proposed that the composition x = 15 and x = 17.5 correspond to the rigidity percolation and chemical thresholds, respectively, of As20Te80-xGax glasses. (c) 2007 Elsevier B.V. All rights reserved.

Optimizing a piezometric network in the estimation of the groundwater budget: a case study from a crystalline-rock watershed in southern India

An estimate of the groundwater budget at the catchment scale is extremely important for the sustainable management of available water resources. Water resources are generally subjected to over-exploitation for agricultural and domestic purposes in agrarian economies like India. The double water-table fluctuation method is a reliable method for calculating the water budget in semi-arid crystalline rock areas. Extensive measurements of water levels from a dense network before and after the monsoon rainfall were made in a 53 km(2)atershed in southern India and various components of the water balance were then calculated. Later, water level data underwent geostatistical analyses to determine the priority and/or redundancy of each measurement point using a cross-validation method. An optimal network evolved from these analyses. The network was then used in re-calculation of the water-balance components. It was established that such an optimized network provides far fewer measurement points without considerably changing the conclusions regarding groundwater budget. This exercise is helpful in reducing the time and expenditure involved in exhaustive piezometric surveys and also in determining the water budget for large watersheds (watersheds greater than 50 km(2)).