A general geomorphological recession flow model for river basins

Recession flows in a basin are controlled by the temporal evolution of its active drainage network (ADN). The geomorphological recession flow model (GRFM) assumes that both the rate of flow generation per unit ADN length (q) and the speed at which ADN heads move downstream (c) remain constant during a recession event. Thereby, it connects the power law exponent of -dQ/dt versus Q (discharge at the outlet at time t) curve, , with the structure of the drainage network, a fixed entity. In this study, we first reformulate the GRFM for Horton-Strahler networks and show that the geomorphic ((g)) is equal to D/(D-1), where D is the fractal dimension of the drainage network. We then propose a more general recession flow model by expressing both q and c as functions of Horton-Strahler stream order. We show that it is possible to have = (g) for a recession event even when q and c do not remain constant. The modified GRFM suggests that is controlled by the spatial distribution of subsurface storage within the basin. By analyzing streamflow data from 39 U.S. Geological Survey basins, we show that is having a power law relationship with recession curve peak, which indicates that the spatial distribution of subsurface storage varies across recession events. Key Points The GRFM is reformulated for Horton-Strahler networks. The GRFM is modified by allowing its parameters to vary along streams. Sub-surface storage distribution controls recession flow characteristics.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.