https://minerva-access.unimelb.edu.au/bitstream/handle/11343/197439/1207.0203v1.pdf

Internet of Things (IoT): A vision, architectural elements, and future directions

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state-of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas.

/pdf/routing-techniques-in-wireless-sensor-networks-a-survey-4qmdam1hkl.pdf

Routing techniques in wireless sensor networks: a survey

Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.

/pdf/epidemic-routing-for-partially-connected-ad-hoc-networks-s5rslcaiip.pdf

Epidemic routing for partially-connected ad hoc networks

https://www.commed.vcu.edu/Chronic_Disease/2012/cochranrvwrschbias.pdf

The Cochrane Collaboration's tool for assessing risk of bias in randomised trials

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

A survey on wireless multimedia sensor networks

A fundamental challenge in the design of wireless sensor networks (WSNs) is to maximize their lifetimes. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes, and hence minimizing the overall power consumption in the network. We study optimal data aggregation in WSNs. Data aggregation is affected by several factors, such as the placement of aggregation points, the aggregation function, and the density of sensors in the network. The determination of an optimal selection of aggregation points is thus extremely important. We present exact and approximate algorithms to find the minimum number of aggregation points in order to maximize the network lifetime. Our algorithms use a fixed virtual wireless backbone that is built on top of the physical topology. We also study the tradeoffs between energy savings and the potential delay involved in the data aggregation process. Numerical results show that our approach provides substantial energy savings.

Data aggregation in wireless sensor networks - exact and approximate algorithms

https://isiarticles.com/bundles/Article/pre/pdf/8006.pdf

Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms

p-Cycles have been proposed for preprovisioned 1 + N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the rerouting of traffic can be a time consuming operation. Another survivable mode of operation is the 1 + 1 protection mode, in which a signal is transmitted to the destination on two link disjoint circuits, hence recovery from failures is expeditious. However, this requires a large number of protection circuits. In this paper, we introduce a new concept in protection: 1 + N protection, in which a p-Cycle, similar to FIPP p-cycles, can be used to protect a number of bidirectional connections, which are mutually link disjoint, and also link disjoint from all links of the p-Cycle. However, data units from different circuits are combined using network coding, which can be implemented in a number of technologies, such as Next Generation SONET (NGS), MPLS/GMPLS, or IP-over-WDM. The maximum outage time under this protection scheme can be limited to no more than the p-Cycle propagation delay. It is also shown how to implement a hybrid 1 + N and 1 + N protection scheme, in which on-cycle links are protected using 1 + N protection, while straddling links, or paths, are protected using 1 + N protection. Extensions of this technique to protect multipoint connections are also introduced. A performance study based on optimal formulations of the 1 + 1, 1 + N and the hybrid scheme is introduced. Although 1 + N speed of recovery is comparable to that of 1 + N protection, numerical results for small networks indicate that 1 + N is about 30% more efficient than 1 + 1 protection, in terms of the amount of protection resources, especially as the network graph density increases.

http://home.engineering.iastate.edu/~kamal/Docs/k09.pdf

$1+{\rm N}$ Network Protection for Mesh Networks: Network Coding-Based Protection Using p-Cycles

In this paper we consider the optimal design and provisioning of WDM networks for the grooming of multicast subwavelength traffic. We develop a unified framework for the optimal provisioning of different practical scenarios of multicast traffic grooming. We also introduce heuristic solutions. Optimal solutions are designed by exploiting the specifies of the problems to formulate Mixed Integer Linear Programs (MILPs). Specifically, we solve the generic multicast problem in which, given a set of multicast sessions and all destination nodes of a multicast session requiring the same amount of traffic, all demands need to be accommodated. The objective is to minimize the network cost by minimizing the number of higher layer electronic equipment and, simultaneously, minimizing the total number of wavelengths used. We also solve two interesting and practical variants of the traditional multicast problem, namely, multicasting with partial destination set reachability and multicasting with traffic thinning. For both variants, we also provide optimal as well as heuristic solutions. Also, the paper presents a number of examples based on the exact and heuristic approaches

Ahmed E. Kamal

Papers

Routing techniques in wireless sensor networks: a survey

Data aggregation in wireless sensor networks - exact and approximate algorithms

Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms

$1+{\rm N}$ Network Protection for Mesh Networks: Network Coding-Based Protection Using p-Cycles

Design and provisioning of WDM networks with multicast traffic grooming