Impromptu Deployment of Wireless Relay Networks: Experiences Along a Forest Trail

We are motivated by the problem of impromptu or as- you-go deployment of wireless sensor networks. As an application example, a person, starting from a sink node, walks along a forest trail, makes link quality measurements (with the previously placed nodes) at equally spaced locations, and deploys relays at some of these locations, so as to connect a sensor placed at some a priori unknown point on the trail with the sink node. In this paper, we report our experimental experiences with some as-you-go deployment algorithms. Two algorithms are based on Markov decision process (MDP) formulations; these require a radio propagation model. We also study purely measurement based strategies: one heuristic that is motivated by our MDP formulations, one asymptotically optimal learning algorithm, and one inspired by a popular heuristic. We extract a statistical model of the propagation along a forest trail from raw measurement data, implement the algorithms experimentally in the forest, and compare them. The results provide useful insights regarding the choice of the deployment algorithm and its parameters, and also demonstrate the necessity of a proper theoretical formulation.Comment: 7 pages, accepted in IEEE MASS 201

A BLE-based multi-gateway network infrastructure with handover support for mobile BLE peripherals

Bluetooth Low Energy (BLE) is a popular technology within the Internet of Things. It allows low-power, star networks to be set up between a BLE gateway and multiple, power-constrained BLE devices. However, these networks tend to be static, not supporting BLE devices that can freely move around in an environment of multiple interconnected BLE gateways and perform handovers whenever necessary. This work proposes two alternative network architectures for mobile BLE peripherals. One leverages on IPv6 over BLE, whereas the other combines default BLE mechanisms with an additional custom controller. On top, we study in detail the handover mechanism that must be present in both architectures and compare the performance of both a passive and active handover approach. The passive handover approach can be set up without any extra implementation, but an active handover approach offers more proactive handover decisions and can provide a much lower handover latency. All proposed solutions have been implemented and validated on real hardware, showing the feasibility of having future infrastructures with support for mobile BLE devices

Dynamic Radio Cooperation for Downlink Cloud-RANs with Computing Resource Sharing

A novel dynamic radio-cooperation strategy is proposed for Cloud Radio Access Networks (C-RANs) consisting of multiple Remote Radio Heads (RRHs) connected to a central Virtual Base Station (VBS) pool. In particular, the key capabilities of C-RANs in computing-resource sharing and real-time communication among the VBSs are leveraged to design a joint dynamic radio clustering and cooperative beamforming scheme that maximizes the downlink weighted sum-rate system utility (WSRSU). Due to the combinatorial nature of the radio clustering process and the non-convexity of the cooperative beamforming design, the underlying optimization problem is NP-hard, and is extremely difficult to solve for a large network. Our approach aims for a suboptimal solution by transforming the original problem into a Mixed-Integer Second-Order Cone Program (MI-SOCP), which can be solved efficiently using a proposed iterative algorithm. Numerical simulation results show that our low-complexity algorithm provides close-to-optimal performance in terms of WSRSU while significantly outperforming conventional radio clustering and beamforming schemes. Additionally, the results also demonstrate the significant improvement in computing-resource utilization of C-RANs over traditional RANs with distributed computing resources.Comment: 9 pages, 6 figures, accepted to IEEE MASS 201

Pushing towards the Limit of Sampling Rate: Adaptive Chasing Sampling

Measurement samples are often taken in various monitoring applications. To reduce the sensing cost, it is desirable to achieve better sensing quality while using fewer samples. Compressive Sensing (CS) technique finds its role when the signal to be sampled meets certain sparsity requirements. In this paper we investigate the possibility and basic techniques that could further reduce the number of samples involved in conventional CS theory by exploiting learning-based non-uniform adaptive sampling. Based on a typical signal sensing application, we illustrate and evaluate the performance of two of our algorithms, Individual Chasing and Centroid Chasing, for signals of different distribution features. Our proposed learning-based adaptive sampling schemes complement existing efforts in CS fields and do not depend on any specific signal reconstruction technique. Compared to conventional sparse sampling methods, the simulation results demonstrate that our algorithms allow $46\%$ less number of samples for accurate signal reconstruction and achieve up to $57\%$ smaller signal reconstruction error under the same noise condition.Comment: 9 pages, IEEE MASS 201

Energy-Efficient selective activation in Femtocell Networks

Provisioning the capacity of wireless networks is difficult when peak load is significantly higher than average load, for example, in public spaces like airports or train stations. Service providers can use femtocells and small cells to increase local capacity, but deploying enough femtocells to serve peak loads requires a large number of femtocells that will remain idle most of the time, which wastes a significant amount of power. To reduce the energy consumption of over-provisioned femtocell networks, we formulate a femtocell selective activation problem, which we formalize as an integer nonlinear optimization problem. Then we introduce GREENFEMTO, a distributed femtocell selective activation algorithm that deactivates idle femtocells to save power and activates them on-the-fly as the number of users increases. We prove that GREENFEMTO converges to a locally Pareto optimal solution and demonstrate its performance using extensive simulations of an LTE wireless system. Overall, we find that GREENFEMTO requires up to 55% fewer femtocells to serve a given user load, relative to an existing femtocell power-saving procedure, and comes within 15% of a globally optimal solution

A Low-Power CoAP for Contiki

Internet of Things devices will by and large be battery-operated, but existing application protocols have typically not been designed with power-efficiency in mind. In low-power wireless systems, power-efficiency is determined by the ability to maintain a low radio duty cycle: keeping the radio off as much as possible. We present an implementation of the IETF Constrained Application Protocol (CoAP) for the Contiki operating system that leverages the ContikiMAC low-power duty cycling mechanism to provide power efficiency. We experimentally evaluate our low-power CoAP, demonstrating that an existing application layer protocol can be made power-efficient through a generic radio duty cycling mechanism. To the best of our knowledge, our CoAP implementation is the first to provide power-efficient operation through radio duty cycling. Our results question the need for specialized low-power mechanisms at the application layer, instead providing low-power operation only at the radio duty cycling layer

Self-Adaptive resource allocation for event monitoring with uncertainty in Sensor Networks

Event monitoring is an important application of sensor networks. Multiple parties, with different surveillance targets, can share the same network, with limited sensing resources, to monitor their events of interest simultaneously. Such a system achieves profit by allocating sensing resources to missions to collect event related information (e.g., videos, photos, electromagnetic signals). We address the problem of dynamically assigning resources to missions so as to achieve maximum profit with uncertainty in event occurrence. We consider timevarying resource demands and profits, and multiple concurrent surveillance missions. We model each mission as a sequence of monitoring attempts, each being allocated with a certain amount of resources, on a specific set of events that occurs as a Markov process. We propose a Self-Adaptive Resource Allocation algorithm (SARA) to adaptively and efficiently allocate resources according to the results of previous observations. By means of simulations we compare SARA to previous solutions and show SARA’s potential in finding higher profit in both static and dynamic scenarios

Hidden Terminal-Aware Contention Resolution with an Optimal Distribution

Achieving low-power operation in wireless sensor networks with high data load or bursty traffic is challenging. The hidden terminal problem is aggravated with increased amounts of data in which traditional backoff-based contention resolution mechanisms fail or induce high latency and energy costs. We analyze and optimize Strawman, a receiver-initiated contention resolution mechanism that copes with hidden terminals. We propose new techniques to boost the performance of Strawman while keeping the resolution overhead small. We finally validate our improved mechanism via experiments

A Feasibility Study of RIP Using 2.4 GHz 802.15.4 Radios

This paper contains a feasibility study of Radio Interferometric Positioning (RIP) implemented on a widely used 2.4 GHz radio (CC2430). RIP is a relatively new localization technique that uses signal strength measurements. Although RIP outperforms other RSS-based localization techniques, it imposes a set of unique requirements on the used radios. Therefore, it is not surprising that all existing RIP implementations use the same radio (CC1000), which operates below the 1 GHz range. This paper analyzes to what extent the CC2430 complies with these requirements. This analysis shows that the CC2430 platform introduces large and dynamic sources of errors. Measurements with a CC2430 test bed in a line-of-sight indoor environment verify this. The measurements indicate that the existing RIP algorithm cannot cope with these types of errors, and will incur a relatively low accuracy of 3.1 meter. Based on these results, we made an initial implementation of a new algorithm, which can cope with these errors, and decreases this positioning error by a factor of two to 1.5 meter accuracy