Adaptation of LEACH routing protocol to cognitive radio sensor networks

One of the drawbacks of LEACH protocol is the uncontrolled selection of cluster heads which, in some rounds, leads to the concentration of them in a limited area due to the randomness of the selection procedure. LEACH-C is a variant of LEACH that uses a centralized clustering algorithm and forms good clusters through sink control. According to experimental results, the IEEE 802.15.4 packets are damaged by WLAN interferences in ISM band. It seems that, sensor nodes equipped with cognitive radio capabilities can overcome this problem. In cognitive radio sensor networks (CRSN), routing must be accompanied by channel allocation. This requires spectrum management which can be devolved to cluster heads. For this networks, new duty cycle mechanisms must be designed that jointly consider neighbor discovery, and spectrum sensing/allocation. Cluster-based network architecture is a good choice for effective dynamic spectrum management. In such architecture, cluster heads have a proper spatial distribution and are optimally located all over the network. In this paper, using the physical layer information and preserving the feature of random cluster head selection in LEACH, it has been tried to both move the position of cluster heads to appropriate locations and make their quantity optimal. The simulation results show that the transferal of cluster heads to appropriate locations increases the network lifetime significantly though this comes at the price of early instability appearance. By considering the energy level in cluster head election algorithm, one can overcome the network stability issues too. However, this will move the cluster heads away from their appropriate locations. © 2012 IEEE.

An analytical model for optimal spectrum leasing under constraints of quality of service in CRNs

Cognitive radio improves spectrum efficiency and mitigates spectrum scarcity by allowing cognitive users to opportunistically access idle chunks of the spectrum owned by licensed users. In long-term spectrum leasing markets, secondary network operators make a decision about how much spectrum is optimal to fulfill their users' data transmission requirements. We study this optimization problem in multiple channel scenarios. Under the constrains of expected user admission rate and quality of service, we model the secondary network into a dynamic data transportation system. In this system, the spectrum accesses of both primary users and secondary users are in accordance with stochastic processes, respectively. The main metrics of quality of service we are concerned with include user admission rate, average transmission delay and stability of the delay. To quantify the relationship between spectrum provisioning and quality of service, we propose an approximate analytical model. We use the model to estimate the lower and upper bounds of the optimal amount of the spectrum. The distance between the bounds is relatively narrow. In addition, we design a simple algorithm to compute the optimum by using the bounds. We conduct numerical simulations on a slotted multiple channel dynamic spectrum access network model. Simulation results demonstrate the preciseness of the proposed model. Our work sheds light on the design of game and auction based dynamic spectrum sharing mechanisms in cognitive radio networks.

Networks of Meaning: Learning How Native Speakers Think and Use Language

This article discusses the way in whic language learners master meaning, particularly of on-literal language. This issue is discussed in the context of the learner's cognitive framework with specific reference to Indonesian and English.

Changes in injury-related hospital emergency department presentations associated with the imposition of regulatory versus voluntary licensing conditions on licensed venues in two cities

Introduction and Aims
Regulatory and collaborative intervention strategies have been developed to reduce the harms associated with alcohol consumption on licensed venues around the world, but there remains little research evidence regarding their comparative effectiveness. This paper describes concurrent changes in the number of night-time injury-related hospital emergency department presentations in two cities that implemented either a collaborative voluntary approach to reducing harms associated with licensed premises (Geelong) or a regulatory approach (Newcastle).

Design and Methods
This paper reports findings from Dealing with Alcohol-Related problems in the Night-Time Economy project. Data were drawn from injury-specific International Classification of Disease, 10th Revision codes for injuries (S and T codes) presenting during high-alcohol risk times (midnight—5.59 am, Saturday and Sunday mornings) at the emergency departments in Geelong Hospital and Newcastle (John Hunter Hospital and the Calvary Mater Hospital), before and after the introduction of licensing conditions between the years of 2005 and 2011. Time-series, seasonal autoregressive integrated moving average analyses were conducted on the data obtained from patients' medical records.

Results
Significant reductions in injury-related presentations during high-alcohol risk times were found for Newcastle since the imposition of regulatory licensing conditions (344 attendances per year, P < 0.001). None of the interventions deployed in Geelong (e.g. identification scanners, police operations, radio networks or closed-circuit television) were associated with reductions in emergency department presentations.

Discussion and Conclusions
The data suggest that mandatory interventions based on trading hours restrictions were associated with reduced emergency department injury presentations in high-alcohol hours than voluntary interventions. [Miller P, Curtis A, Palmer D, Busija L, Tindall J, Droste N, Gillham K, Coomber K, Wiggers J. Changes in injury-related hospital emergency department presentations associated with the imposition of regulatory versus voluntary licensing conditions on licensed venues in two cities. Drug Alcohol Rev 2014]*

Node localization using mobile robots in delay-tolerant sensor networks

We present a novel scheme for node localization in a Delay-Tolerant Sensor Network (DTN). In a DTN, sensor devices are often organized in network clusters that may be mutually disconnected. Some mobile robots may be used to collect data from the network clusters. The key idea in our scheme is to use this robot to perform location estimation for the sensor nodes it passes based on the signal strength of the radio messages received from them. Thus, we eliminate the processing constraints of static sensor nodes and the need for static reference beacons. Our mathematical contribution is the use of a Robust Extended Kalman Filter (REKF)-based state estimator to solve the localization. Compared to the standard extended Kalman filter, REKF is computationally efficient and also more robust. Finally, we have implemented our localization scheme on a hybrid sensor network test bed and show that it can achieve node localization accuracy within 1m in a large indoor setting.

Robust extended kalman filter applied to location tracking and trajectory prediction for PCS networks

Provisioning of real-time multimedia sessions over wireless cellular network poses unique challenges due to frequent handoff and rerouting of a connection. For this reason, the wireless networks with cellular architecture require efficient user mobility estimation and prediction. This paper proposes using robust extended Kalman filter (REKF) as a location heading altitude estimator of mobile user for next cell prediction in order to improve the connection reliability and bandwidth efficiency of the underlying system. Through analysis we demonstrate that our algorithm reduces the system complexity (compared to existing approach using pattern matching and Kalman filter) as it requires only two base station measurements or only the measurement from the closest base station. Further, the technique is robust against system uncertainties due to inherent deterministic nature in the mobility model and more effective in comparison with the standard Kalman filter.

On the effect of path loss rates on the optimal receiver position in sensor networks

In this paper we examine the problem of finding an optimal position for a receiver node in a single-hop sensor network. The basic idea is to minimize the network energy consumption according to a particular network cost function. Our contribution is to simply show the effect of signal path loss rates and sensor weighting on the optimal receiver position.

Geographic routing with cooperative relaying and leapfrogging in wireless sensor networks

A novel geographic routing protocol for multi-hop wireless sensor networks is presented. It exploits the broadcast nature of the wireless channel to enable on-demand cooperative relaying and leapfrogging for circumventing weak radio links. In order to achieve energy efficiency, a metric is introduced for next-hop selection that takes into account information on the residual battery energy, the geographical position of the sensor nodes, and the channel quality of the involved radio links when available. Performance results show that the completely decentralized protocol offers significant benefits by reducing the number of (re)transmissions required to reach the destination. This translates into network-wide energy savings that extend the network lifetime.

An adaptive policy-based vertical handoff algorithm for heterogeneous wireless networks

The next generation of wireless networks is envisioned as convergence of heterogeneous radio access networks. Since technologies are becoming more collaborative, a possible integration between IEEE 802.16 based network and previous generation of telecommunication systems (2G, ..., 3G) must be considered. A novel quality function based vertical handoff (VHO) algorithm, based on proposed velocity and average receive power estimation algorithms is discussed in this paper. The short-time Fourier analysis of received signal strength (RSS) is employed to obtain mobile speed and average received power estimates. Performance of quality function based VHO algorithm is evaluated by means of measure of quality of service (QoS). Simulation results show that proposed quality function, brings significant gains in QoS and more efficient use of resources can be achieved.

Evaluation of Bayesian belief networks for diagnosis of psychotic disorders

The thesis examined the inter-rater reliability and procedural validity of four computerised Bayesian belief networks (BBNs) which were developed to assist with the diagnosis of psychotic disorders. The results of this research indicated that BBNs can significantly improve diagnostic reliability and may represent an important advance over current diagnostic methods. The professional portfolio investigated, through the presentation of case studies and review of literature relevant to each case study, how comorbidity and context of depression may impact on cognitive behavioural therapy treatment.

Beliefs, values, and action : the judgment model of cognitive distortions in sexual offenders

In this paper, we present the Judgment Model of Cognitive Distortions (JMCD), a new model of cognitive distortions that spans multiple levels of analysis and contains different types of judgments. This model proposes that cognitive distortions tend to cluster together in what we have termed Thematic Networks (TN): judgments about beliefs, values, and actions. We argue that the three sets of judgments cover all types of cognitive distortions apparent in sexual offenders including those revolving around content (i.e., asserting characteristics to people, the offender, the world) and cognitive operations (i.e., denial, minimization, rationalizations). Following a description of the JMCD, we demonstrate how it can account for the cognitive schemata identified in sexual offenders by researchers and clinicians. The paper concludes with a brief discussion of the clinical and research implications of the JMCD.

Models, services and security in modern online social networks

Modern online social networks have revolutionized the world the same way the radio and the plane did, crossing geographical and time boundaries, not without problems, more can be learned, they can still change our world and that their true worth is still a question for the future.

A cross-layer key establishment scheme in wireless mesh networks

Cryptographic keys are necessary to secure communications among mesh clients in wireless mesh networks. Traditional key establishment schemes are implemented at higher layers, and the security of most such designs relies on the complexity of computational problems. Extracting cryptographic keys at the physical layer is a promising approach with information-theoretical security. But due to the nature of communications at the physical layer, none of the existing designs supports key establishment if communicating parties are out of each other's radio range, and all schemes are insecure against man-in-the-middle attacks. This paper presents a cross-layer key establishment scheme where the established key is determined by two partial keys: one extracted at the physical layer and the other generated at higher layers. The analysis shows that the proposed cross-layer key establishment scheme not only eliminates the aforementioned shortcomings of key establishment at each layer but also provides a flexible solution to the key generation rate problem. © 2014 Springer International Publishing Switzerland.