Coded diversity for cooperative MISO based wireless sensor networks

Motivated by the recent works on cooperative MIMO, this letter presents a coded diversity based cooperative protocol for wireless sensor networks. In densely deployed sensor networks, nearby nodes form a cluster of virtual antenna array to provide independent fading paths. The source node encodes the information bits with any channel code and forwards a portion of the codeword towards the cooperating nodes. The source and the cooperating nodes transmit different portion of the codeword to achieve a coded diversity at destination. Analysis and simulation show that our proposal can achieve full diversity when code rate is below a certain threshold.     

Virtual MIMO-based cooperative communication for energy-constrained wireless sensor networks

An energy-efficient virtual multiple-input multiple-output (MIMO)-based communication architecture is proposed for distributed and cooperative wireless sensor networks. Assuming a space-time block coding (STBC) based MIMO system, the energy and delay efficiencies of the proposed scheme are derived using semi-analytic techniques. The dependence of these efficiency values on physical channel propagation parameters, fading coherence time and the amount of required training is also investigated. The results show that with judicious choice of design parameters the virtual MIMO technique can be made to provide significant energy and delay efficiencies, even after allowing for additional training overheads.     

Impacts of user-selfishness on cooperative content caching in social wireless networks

Cooperative caching can be an effective mechanism for reducing electronic content provisioning cost in Social Wireless Networks (SWNETs). These networks are formed by a collection of mobile data enabled devices physically gathering in settings such as university campus, malls, airport and other public places. In this paper, we first propose an optimal collaborative object caching policy in order to minimize the object provisioning cost in SWNETs with homogenous user requests and a peer-rebate model for promoting collaboration. Then using an analytical model we study the impacts of user selfishness on the provisioning cost and the earned rebate when certain nodes in an SWNET selfishly deviate from the optimal policy. User selfishness is motivated in order to either increase individually earned rebate or to reduce content provisioning cost. The analytical model is validated by experimental results from simulated SWNETs using the network simulator ns2.     

Asymptotically optimal cooperative wireless networks with reduced signaling complexity

This paper considers an orthogonal amplify-and-forward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays are permitted to linearly transform the received signal and where the source and relays transmit for equal time durations. The diversity-multiplexing gain (D-MG) tradeoff of the equivalent space-time channel associated to this protocol is determined and a cyclic-division-algebra-based D-MG optimal code constructed. The transmission or signaling alphabet of this code is the union of the QAM constellation and a rotated version of QAM. The size of this signaling alphabet is small in comparison with prior D-MG optimal constructions in the literature and is independent of the number of participating nodes in the network     

Systematic energy-balanced cooperative transmission scheme in wireless sensor networks

Energy efficiency is a critical issue in wireless sensor networks(WSNs).In order to minimize energy consumption and balance energy dissipation throughout the whole network,a systematic energy-balanced cooperative transmission scheme in WSNs is proposed in this paper.This scheme studies energy efficiency in systematic view.For three main steps,namely nodes clustering,data aggregation and cooperative transmission,corresponding measures are put forward to save energy.These measures are well designed and tightly coupled to achieve optimal performance.A half-controlled dynamic clustering method is proposed to avoid concentrated distribution of cluster heads caused by selecting cluster heads randomly and to get high spatial correlation between cluster nodes.Based on clusters built,data aggregation,with the adoption of dynamic data compression,is performed by cluster heads to get better use of data correlation.Cooperative multiple input multiple output(CMIMO) with an energy-balanced cooperative cluster heads selection method is proposed to transmit data to sink node.System model of this scheme is also given in this paper.And simulation results show that,compared with other traditional schemes,the proposed scheme can efficiently distribute the energy dissipation evenly throughout the network and achieve higher energy efficiency,which leads to longer network lifetime span.By adopting orthogonal space time block code(STBC),the optimal number of the cooperative transmission nodes varying with the percentage of cluster heads is also concluded,which can help to improve energy efficiency by choosing the optimal number of cooperative nodes and making the most use of CMIMO.     

Locomotion trajectory with cooperative metrics in wireless sensor networks

Detection coverage control is one of the most important topics in the intrusion detection problem of wireless sensor networks (WSN). However, its converse, i.e., to design an object locomotion trajectory in WSN, has not received enough attention. This article proposes a heuristic algorithm, namely, the security & speed (SS) algorithm, to depict such a trajectory that takes into consideration both security and speed. The merit of the SS algorithm is its topology independency. When compared with traditional algorithms, the SS algorithm approaches the optimal trajectory better, and enjoys considerably lower computational load, and a better and adjustable tradeoff between trajectory security and speed.     

一种用于无线传感器网的协作接收方案

无线传感器网中,能量效率是系统设计首要考虑的因素.基于提高无线传感器网能量效率的目的,本文提出了一种简单的协作接收方案并分析了其能量效率,理论分析及仿真结果表明,当通信距离大于某一门限值时采用该接收方案可以有效提高无线传感器网的能量效率.     

无线传感器网络中一种基于OSTBC的高效协作传输技术

针对发端能量受限的无线传感器网络提出了一种基于OSTBC的高效虚拟MIMO协作传输策略.在无线传感器网络的每个簇内采用一种全速率的分布式OSTBC传输方案,同时对调制方式的星座大小进行优化,创建了一种更高效的无线传感器网络和MIMO通信相结合的模型.针对该模型在接收端进行迭代译码,并推导出该系统的总能耗函数和网络时延算式.通过仿真显示,该模型不仅能够极大的降低发端能耗,对任意协作节点数目均能够实现全速率传输,解决了传统分布式空时码用于无线传感器网络时发端的数据积压问题,减小了网络时延.因此本协作传输模型从能量消耗和网络时延两方面对无线传感网的性能进行了提升,能够为无线传感网的应用提供有意义的参考.     

Locating the nodes: cooperative localization in wireless sensor networks

Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. In cooperative localization, sensors work together in a peer-to-peer manner to make measurements and then forms a map of the network. Various application requirements influence the design of sensor localization systems. In this article, the authors describe the measurement-based statistical models useful to describe time-of-arrival (TOA), angle-of-arrival (AOA), and received-signal-strength (RSS) measurements in wireless sensor networks. Wideband and ultra-wideband (UWB) measurements, and RF and acoustic media are also discussed. Using the models, the authors have shown the calculation of a Cramer-Rao bound (CRB) on the location estimation precision possible for a given set of measurements. The article briefly surveys a large and growing body of sensor localization algorithms. This article is intended to emphasize the basic statistical signal processing background necessary to understand the state-of-the-art and to make progress in the new and largely open areas of sensor network localization research.     

Supporting cooperative caching in ad hoc networks

Most researches in ad hoc networks focus on routing and not much work has been done on data access. A common technique used to improve the performance of data access is caching. Cooperative caching, which allows the sharing and coordination of cached data among multiple nodes, can further explore the potential of the caching techniques. Due to mobility and resource constraints of ad hoc networks, cooperative caching techniques designed for wired networks may not be applicable to ad hoc networks. In this paper, we design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: CacheData, which caches the data, and CachePath, which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (HybridCache), which can further improve the performance by taking advantage of CacheData and CachePath while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.     

Application modeling for performance evaluation on event-triggered wireless sensor networks

This paper presents an approach for event-triggered wireless sensor network (WSN) application modeling, aiming to evaluate the performance of WSN configurations with regards to metrics that are meaningful to specific application domains and respective end-users. It combines application, environment-generated workload and computing/communication infrastructure within a high-level modeling simulation framework, and includes modeling primitives to represent different kind of events based on different probabilities distributions. Such primitives help end-users to characterize their application workload to capture realistic scenarios. This characterization allows the performance evaluation of specific WSN configurations, including dynamic management techniques as load balancing. Extensive experimental work shows that the proposed approach is effective in verifying whether a given WSN configuration can fulfill non-functional application requirements, such as identifying the application behavior that can lead a WSN to a break point after which it cannot further maintain these requirements. Furthermore, through these experiments, we discuss the impact of different distribution probabilities to model temporal and spatial aspects of the workload on WSNs performance, considering the adoption of dynamic and decentralized load balancing approaches.     

Improving wireless sensor networks performance through epidemic model

Wireless sensor networks (WSNs) encounter a critical challenge of ‘Network Security’ due to extreme operational constraints. The origin of the challenge begins with the entry of worms in the wireless network. Just one infected node is enough to spread the worms across the entire network. The infected node rapidly infects the neighbouring nodes in an unstoppable manner. In this paper, a mathematical model is proposed based on epidemic theory. It is an improvement of the Susceptible-Infectious-Recovered-Susceptible (SIRS) and Susceptible-Exposed-Infectious-Susceptible (SEIS) model. We propose Susceptible-Exposed-Infectious-Recovered-Susceptible (SEIRS) model that overcomes the drawbacks of existing models. The proposed ameliorated model includes a finite communication radius and the associated node density. We obtain basic reproduction number which determines the local and global propagation dynamics of worm in the WSNs. Also, we deduce expression for threshold for node density and communication radius. We investigated the control mechanism against worm propagation. We compare the proposed model with various existing models and evaluate its performance on the basis of various performance metrics. The study confirms melioration in the vital aspects (security, network reliability, transmission efficiency, energy efficiency) for WSNs. The proposed SEIRS model provides an improved technique to restraint worms’ transmission in comparison to the existing models.     

Active caching: a transmission method to guarantee desired communication reliability in wireless sensor networks

Due to the high packet loss rate during multi-hop transmissions in wireless sensor networks, more reliable endto- end data transmission is desirable. Because wireless sensor network applications require various levels of communication reliability (CR), the end-to-end data transmission should satisfy the desired CR of the applications. In this letter, we propose a flexible loss recovery mechanism for sensor network applications with various CRs. The proposed scheme caches data packets at intermediate nodes over routing paths computed by CR to retransmit lost packets during multi-hop transmissions. Because the proposed scheme presents a tradeoff between end-to-end delays and memory requirements dependent on CR, it can be used flexibly in various sensor network applications.     

Neighbor caching in multi-hop wireless ad hoc networks

We propose a neighbor caching strategy to overcome the overhead of multi-hop wireless communications. Neighbor caching makes a node able to expand its caching storage instantaneously by storing its data in the storage of idle neighbors. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The ranking based prediction is an adaptive algorithm that adjusts the frequency of neighbor caching and makes neighbor caching flexible according to the idleness of nodes.     

DEC-MAC: delay- and energy-aware cooperative medium access control protocol for wireless sensor networks

This paper deals with two critical issues in wireless sensor networks: reducing the end-to-end packet delivery delay and increasing the network lifetime through the use of cooperative communications. Here, we propose a delay- and energy-aware cooperative medium access control (DEC-MAC) protocol, which trades off between the packet delivery delay and a node’s energy consumption while selecting a cooperative relay node. DEC-MAC attempts to balance the energy consumption of the sensor nodes by taking into account a node’s residual energy as part of the relay selection metric, thus increasing the network’s lifetime. The relay selection algorithm exploits the process of elimination and the complementary cumulative distribution function for determining the most optimal relay within the shortest time period. Our numerical analysis demonstrates that the DEC-MAC protocol is able to determine the optimal relay in no more than three mini slots. Our simulation results show that the DEC-MAC protocol improves the end-to-end packet delivery latency and the network lifetime significantly compared to the state-of-the-art protocols, LC-MAC and CoopMAC.     

Game-theory-based lifetime maximization of multi-channel cooperative spectrum sensing in wireless sensor networks

Wireless Networks - Accurate and efficient detection of the radio-frequency spectrum is a challenging issue in wireless sensor networks (WSNs), which are used for multi-channel cooperative spectrum...     

Distributed cooperative MAC for multihop wireless networks

This article investigates distributed cooperative medium access control protocol design for multihop wireless networks. Cooperative communication has been proposed recently as an effective way to mitigate channel impairments. With cooperation, single-antenna mobile terminals in a multi-user environment share antennas from other mobiles to generate a virtual multipleantenna system that achieves more reliable communication with a higher diversity gain. However, more mobiles conscribed for one communication inevitably induces complex medium access interactions, especially in multihop wireless ad hoc networks. To improve the network throughput and diversity gain simultaneously, we investigate the issues and challenges in designing an efficient MAC scheme for such networks. Furthermore, based on the IEEE 802.11 DCF, a cross-layer designed cooperative MAC protocol is proposed. The MAC scheme adapts to the channel condition and payload length.     

Localization systems for wireless sensor networks

Monitoring applications define an important class of applications used in wireless sensor networks. In these applications the network perceives the environment and searches for event occurrences (phenomena) by sensing different physical properties, such as temperature, humidity, pressure, ambient light, movement, and presence (for target tracking). In such cases the location information of both phenomena and nodes is usually required for tracking and correlation purposes. In this work we summarize most of the concepts related to localization systems for WSNs as well as how to localize the nodes in these networks (which allows the localization of phenomena). By dividing the localization systems into three distinct components -distance/angle estimation, position computation, and localization algorithm - besides providing a didactic viewpoint, we show that these components can be seen as subareas of the localization problem that need to be analyzed and studied separately.     

Energy-efficient DSPs for wireless sensor networks

There are many new challenges to be faced in implementing signal processing algorithms and designing energy-efficient DSPs for microsensor networks. We study system partitioning of computation to improve the energy efficiency of a wireless sensor networking application. We explore system partitioning between the sensor cluster and the base station, employing computation-communication tradeoffs to reduce energy dissipation. Also we show that system partitioning of computation within the cluster can also improve the energy efficiency by using dynamic voltage scaling (DVS)     

Information coverage for wireless sensor networks

Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor. In this paper we argue that this is a conservative definition of coverage. This definition implicitly assumes that each sensor makes a decision independent of other sensors in the field. However, sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We then propose a new notion of information coverage and investigate its implications for sensor deployment. Numerical and simulation results show that significant savings in terms of sensor density for complete coverage can be achieved by using our definition of information coverage compared to that by using the existing definition.