Sensing Throughput Optimization in Fading Cognitive Multiple Access Channels With Energy Harvesting Secondary Transmitters

The paper investigates the problem of maximizing expected sum throughput in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing. We formulate the problem as maximization of sum-capacity of the cognitive multiple access network over a finite time horizon subject to a time averaged interference constraint at the primary user (PU) and almost sure energy causality constraints at the SUs. The problem is a mixed integer non-linear program with respect to two decision variables namely spectrum access decision and spectrum sensing decision, and the continuous variables sensing time and transmission power. In general, this problem is known to be NP hard. For optimization over these two decision variables, we use an exhaustive search policy when the length of the time horizon is small, and a heuristic policy for longer horizons. For given values of the decision variables, the problem simplifies into a joint optimization on SU \textit{transmission power} and \textit{sensing time}, which is non-convex in nature. We solve the resulting optimization problem as an alternating convex optimization problem for both non-causal and causal channel state information and harvested energy information patterns at the SU base station (SBS) or fusion center (FC). We present an analytic solution for the non-causal scenario with infinite battery capacity for a general finite horizon problem.We formulate the problem with causal information and finite battery capacity as a stochastic control problem and solve it using the technique of dynamic programming. Numerical results are presented to illustrate the performance of the various algorithms

Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward relaying. Deployment is done along the straight line joining a source node and a sink node at an unknown distance from the source. The problem is for a deployment agent to walk from the source to the sink, deploying relays as he walks, given that the distance to the sink is exponentially distributed with known mean. As a precursor, we apply the multi-relay channel achievable rate formula to obtain the optimal power allocation to relays placed along a line, at fixed locations. This permits us to obtain the optimal placement of a given number of nodes when the distance between the source and sink is given. Numerical work suggests that, at low attenuation, the relays are mostly clustered near the source in order to be able to cooperate, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that the effect of path-loss can be entirely mitigated if a large enough number of relays are placed uniformly between the source and the sink. The structure of the optimal power allocation for a given placement of the nodes, then motivates us to formulate the problem of as-you-go placement of relays along a line of exponentially distributed length, and with the exponential path-loss model, so as to minimize a cost function that is additive over hops. The hop cost trades off a capacity limiting term, motivated from the optimal power allocation solution, against the cost of adding a relay node. We formulate the problem as a total cost Markov decision process, establish results for the value function, and provide insights into the placement policy and the performance of the deployed network via numerical exploration.Comment: 21 pages. arXiv admin note: substantial text overlap with arXiv:1204.432

Optimal maintenance of multi-component systems: a review

In this article we give an overview of the literature on multi-component maintenance optimization. We focus on work appearing since the 1991 survey "A survey of maintenance models for multi-unit systems" by Cho and Parlar. This paper builds forth on the review article by Dekker et al. (1996), which focusses on economic dependence, and the survey of maintenance policies by Wang (2002), in which some group maintenance and some opportunistic maintenance policies are considered. Our classification scheme is primarily based on the dependence between components (stochastic, structural or economic). Next, we also classify the papers on the basis of the planning aspect (short-term vs long-term), the grouping of maintenance activities (either grouping preventive or corrective maintenance, or opportunistic grouping) and the optimization approach used (heuristic, policy classes or exact algorithms). Finally, we pay attention to the applications of the models

A SYSTEMATIC SURVEY OF THE MAINTENANCE MODELS

A systematic survey of the maintenance models has been carried out, which may help the maintenance engineer to have a total picture on maintenance policies. Maintenance policies dis- cussed in the literature have been studied, inter-related and classified into three groups viz. (I) Re- placement/repair at failure, (II) Planned maintenance (repair/replacement) at pre-determined intervals based on number of failures or otherwise and (Ill) Condition based maintenance. The above number of groups are necessary and sufficient for the purpose of methodical surveying of the publications on the topic

A review of multi-component maintenance models with economic dependence

In this paper we review the literature on multi-component maintenance models with economic dependence. The emphasis is on papers that appeared after 1991, but there is an overlap with Section 2 of the most recent review paper by Cho and Parlar (1991). We distinguish between stationary models, where a long-term stable situation is assumed, and dynamic models, which can take information into account that becomes available only on the short term. Within the stationary models we choose a classification scheme that is primarily based on the various options of grouping maintenance activities: grouping either corrective or preventive maintenance, or combining preventive-maintenance actions with corrective actions. As such, this classification links up with the possibilities for grouped maintenance activities that exist in practice

Application of the Truncated Skew Laplace Probability Distribution in Maintenance System

A random variable X is said to have the skew-Laplace probability distribution if its pdf is given by f(x) = 2g(x)G(λx), where g (.) and G (.), respectively, denote the pdf and the cdf of the Laplace distribution. When the skew Laplace distribution is truncated on the left at 0 it is called it the truncated skew Laplace (TSL) distribution. This article provides a comparison of TSL distribution with twoparameter gamma model and the hypoexponential model, and an application of the subject model in maintenance system is studied

Report : review of the literature : maintenance and rehabilitation costs for roads (Risk-based Analysis)

Realistic estimates of short- and long-term (strategic) budgets for maintenance and rehabilitation of road assessment management should consider the stochastic characteristics of asset conditions of the road networks so that the overall variability of road asset data conditions is taken into account. The probability theory has been used for assessing life-cycle costs for bridge infrastructures by Kong and Frangopol (2003), Zayed et.al. (2002), Kong and Frangopol (2003), Liu and Frangopol (2004), Noortwijk and Frangopol (2004), Novick (1993). Salem 2003 cited the importance of the collection and analysis of existing data on total costs for all life-cycle phases of existing infrastructure, including bridges, road etc., and the use of realistic methods for calculating the probable useful life of these infrastructures (Salem et. al. 2003). Zayed et. al. (2002) reported conflicting results in life-cycle cost analysis using deterministic and stochastic methods. Frangopol et. al. 2001 suggested that additional research was required to develop better life-cycle models and tools to quantify risks, and benefits associated with infrastructures. It is evident from the review of the literature that there is very limited information on the methodology that uses the stochastic characteristics of asset condition data for assessing budgets/costs for road maintenance and rehabilitation (Abaza 2002, Salem et. al. 2003, Zhao, et. al. 2004). Due to this limited information in the research literature, this report will describe and summarise the methodologies presented by each publication and also suggest a methodology for the current research project funded under the Cooperative Research Centre for Construction Innovation CRC CI project no 2003-029-C

A study of postponed replacement in a delay time model

We develop a delay time model for a one component system with postponed replacement to analyze situations in which maintenance might not be executed immediately upon discovery of a defect in the system. Reasons for postponement are numerous: to avoid production disruption or unnecessary or ineffective replacement; to prepare for replacement; to extend component life; to wait for an opportunity. This paper explores conditions that make postponement cost-effective. We are interested in modelling the reality in which a maintainer either prioritizes functional continuity or is not confident of the inspection test indicating a defective state. In some cases more frequent inspection and a longer time limit for postponement are recommended to take advantage of maintenance opportunities, characterized by their low cost, arising after a positive inspection. However, when the cost of failure increases, a significant reduction in the time limit of postponement interval is observed. The examples reveal that both the time to defect arrival and delay time have a significant effect upon the cost-effectiveness of maintenance at the limit of postponement. Also, more simply, we find that opportunities must occur frequently enough and inspection should be a high quality procedure to risk postponement