https://www.cs.montana.edu/courses/csci566/Ref/WMSN-Survey.pdf

A survey on wireless multimedia sensor networks

This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistencies. The second is adaptive beaconing: extending the Trickle algorithm to routing control traffic reduces route repair latency and sends fewer beacons.We evaluate datapath validation and adaptive beaconing in CTP Noe, a sensor network tree collection protocol. We use 12 different testbeds ranging in size from 20--310 nodes, comprising seven platforms, and six different link layers, on both interference-free and interference-prone channels. In all cases, CTP Noe delivers > 90% of packets. Many experiments achieve 99.9%. Compared to standard beaconing, CTP Noe sends 73% fewer beacons while reducing topology repair latency by 99.8%. Finally, when using low-power link layers, CTP Noe has duty cycles of 3% while supporting aggregate loads of 30 packets/minute.

/pdf/collection-tree-protocol-selhhlblmq.pdf

Collection tree protocol

Chapter 1. Introduction and Overview of Wireless Sensor Networks. Chapter 2. Commercial and Scientific Applications of Wireless Sensor Networks. Chapter 3. Basic Wireless Sensor Technology. Chapter 4. Wireless Sensors Networks Protocols: Physical Layer. Chapter 5. Medium Access Control Protocols for Wireless Sensor Networks. Chapter 6. Sensors Network Protocols: Routing Protocols. Chapter 7. Transport Control Protocols for Wireless Sensors Networks. Chapter 8. Middleware for Sensor Networks. Chapter 9. Network Management for Wireless Sensor Networks. Chapter 10. Operating Systems for Sensor Networks. Chapter 11. Performance and Traffic Management Issues. Appendix A: Analysis. Appendix B: Discussions. Index.

/pdf/wireless-sensor-networks-technology-protocols-and-dh5el2590j.pdf

Wireless Sensor Networks: Technology, Protocols, and Applications

Cognitive radio (CR) is the enabling technology for supporting dynamic spectrum access: the policy that addresses the spectrum scarcity problem that is encountered in many countries. Thus, CR is widely regarded as one of the most promising technologies for future wireless communications. To make radios and wireless networks truly cognitive, however, is by no means a simple task, and it requires collaborative effort from various research communities, including communications theory, networking engineering, signal processing, game theory, software-hardware joint design, and reconfigurable antenna and radio-frequency design. In this paper, we provide a systematic overview on CR networking and communications by looking at the key functions of the physical (PHY), medium access control (MAC), and network layers involved in a CR design and how these layers are crossly related. In particular, for the PHY layer, we will address signal processing techniques for spectrum sensing, cooperative spectrum sensing, and transceiver design for cognitive spectrum access. For the MAC layer, we review sensing scheduling schemes, sensing-access tradeoff design, spectrum-aware access MAC, and CR MAC protocols. In the network layer, cognitive radio network (CRN) tomography, spectrum-aware routing, and quality-of-service (QoS) control will be addressed. Emerging CRNs that are actively developed by various standardization committees and spectrum-sharing economics will also be reviewed. Finally, we point out several open questions and challenges that are related to the CRN design.

Cognitive radio networking and communications: an overview

In this article we provide a comprehensive review of the existing literature on techniques and protocols for in-network aggregation in wireless sensor networks. We first define suitable criteria to classify existing solutions, and then describe them by separately addressing the different layers of the protocol stack while highlighting the role of a cross-layer design approach, which is likely to be needed for optimal performance. Throughout the article we identify and discuss open issues, and propose directions for future research in the area

/pdf/in-network-aggregation-techniques-for-wireless-sensor-3worsvl5sb.pdf

In-network aggregation techniques for wireless sensor networks: a survey

Sensor networks exhibit a unique funneling effect which is a product of the distinctive many-to-one, hop-by-hop traffic pattern found in sensor networks, and results in a significant increase in transit traffic intensity, collision, congestion, packet loss, and energy drain as events move closer toward the sink While network (eg, congestion control) and application techniques (eg, aggregation) can help counter this problem they cannot fully alleviate it We take a different but complementary approach to solving this problem than found in the literature and present the design, implementation, and evaluation of a localized, sink-oriented, funneling-MAC capable of mitigating the funneling effect and boosting application fidelity in sensor networks The funneling-MAC is based on a CSMA/CA being implemented network-wide, with a localized TDMA algorithm overlaid in the funneling region (ie, within a small number of hops from the sink) In this sense, the funneling-MAC represents a hybrid MAC approach but does not have the scalability problems associated with the network-wide deployment of TDMA The funneling-MAC is 'sink-oriented' because the burden of managing the TDMA scheduling of sensor events in the funneling region falls on the sink node, and not on resource limited sensor nodes; and it is 'localized' because TDMA only operates locally in the funneling region close to the sink and not across the complete sensor field We show through experimental results from a 45 mica-2 testbed that the funneling-MAC mitigates the funneling effect, improves throughput, loss, and energy efficiency, and importantly, significantly outperforms other representative protocols such as B-MAC, and more recent hybrid TDMA/CSMA MAC protocols such as Z-MAC

/pdf/funneling-mac-a-localized-sink-oriented-mac-for-boosting-1lmx23ot7f.pdf

Funneling-MAC: a localized, sink-oriented MAC for boosting fidelity in sensor networks

Cognitive radio networks (CRNs) are composed of cognitive, spectrum-agile devices capable of changing their configurations on the fly based on the spectral environment. This capability opens up the possibility of designing flexible and dynamic spectrum access strategies with the purpose of opportunistically reusing portions of the spectrum temporarily vacated by licensed primary users. On the other hand, the flexibility in the spectrum access phase comes with an increased complexity in the design of communication protocols at different layers. This work focuses on the problem of designing effective routing solutions for multi-hop CRNs, which is a focal issue to fully unleash the potentials of the cognitive networking paradigm. We provide an extensive overview of the research in the field of routing for CRNs, clearly differentiating two main categories: approaches based on a full spectrum knowledge, and approaches that consider only local spectrum knowledge obtained via distributed procedures and protocols. In each category we describe and comment on proposed design methodologies, routing metrics and practical implementation issues. Finally, possible future research directions are also proposed.

/pdf/routing-in-cognitive-radio-networks-challenges-and-solutions-14fduvbyiu.pdf

Routing in cognitive radio networks: Challenges and solutions

Ultra-wideband (UWB) radio is becoming a promising field for new generation's digital communication systems. This technique, based mainly on the impulse radio paradigm, offers great flexibility and shows enormous potential in view of a future broadband wireless access. We present the main principles to design a multiaccess scheme based on UWB. The potential of UWB is exploited within a distributed ad hoc wireless system, where we describe the principles for the definition of a medium-access control (MAC) for mobile computing applications and we analyze the main performance results derived from simulations. A general framework for radio resource sharing is outlined for classes of traffic requiring both elastic-dynamic and guaranteed-reserved bandwidth. Then, we discuss the issue of supporting the proposed radio resource sharing scheme by means of a distributed MAC protocol.

/pdf/radio-resource-sharing-for-ad-hoc-networking-with-uwb-12o3uloyih.pdf

Radio resource sharing for ad hoc networking with UWB

LoRaWAN is emerging as an attractive network infrastructure for ultra low power Internet of Thing devices. Albeit the technology itself is quite mature and specified, how to effectively allocate wireless resources so as to support a large amount of devices in a same terrestrial area is an open challenge. This paper contributes by proposing two algorithms (of incremental complexity) which are shown to outperform the basic Adaptive Rate Strategy (ADR) so far considered. A first approach, named EXPLoRa-SF, shows the benefits of a simple strategy which does not limit to use (as per ADR) distance/RSSI measurements, but also selects Spreading Factors (SF) based on the total number of connected devices. The advantages attained with EXPLoRa-SF further lead us to propose a more sophisticated algorithm, named EXPLoRa-AT, which employs an innovative “ordered waterfilling” approach which attempts to allocate the spreading factors so as to equalize the Time on Air of the packets transmitted by the system's end devices in each spreading factor's group. Simulation results show that the proposed algorithms significantly outperform the basic ADR strategy, and particularly the EXPLoRa-AT algorithm appears very robust to different operating conditions and consistently guarantees high bit rates in the case of high traffic loads.

EXPLoRa: Extending the performance of LoRa by suitable spreading factor allocations

The topology of a cognitive radio Ad Hoc network is highly influenced by the behavior of both licensed (primary) and unlicensed (secondary) users. In fact, the network connectivity could be impaired by the activity of primary users. This aspect has a significant impact on the design of routing protocols. We design a routing scheme for cognitive radio Ad Hoc networks, named Gymkhana, which is aware of the degree of connectivity of possible paths towards the destination. Gymkhana routes the information across paths that avoid network zones that do not guarantee stable and high connectivity. To this aim we use a mathematical framework, based on the Laplacian spectrum of graphs, that allows a comprehensive evaluation of the different routing paths of the cognitive radio network. Laplacian matrixes are used to compute the connectivity of the different network paths. Gymkhana uses a distributed protocol to collect some key parameters related to candidate paths from an origin to a destination. The parameters are fed into a basic mathematical structure which is used to compute efficient routing paths. Besides the basic idea of Gymkhana, the use of Laplacian matrixes to derive a closed formula to measure the path connectivity is another contribution of ours.

Francesca Cuomo

Papers

Funneling-MAC: a localized, sink-oriented MAC for boosting fidelity in sensor networks

Routing in cognitive radio networks: Challenges and solutions

Radio resource sharing for ad hoc networking with UWB

EXPLoRa: Extending the performance of LoRa by suitable spreading factor allocations

Gymkhana: A Connectivity-Based Routing Scheme for Cognitive Radio Ad Hoc Networks