Terry Koziniec

Global communications without reliance on an engineered communications network make the ionosphere an attractive medium for wireless sensors in remote deployments. However, ionospheric circuits’ temporary availability is a challenge in scheduling transmissions for a sensor with limited power, communications and computational capacity, particularly where cost and antenna constraints limit operation to a single frequency. We describe a technique for scheduling transmissions based on precomputed propagation models. The models predict the time-varying Signal to Noise Ratio (SNR) at the receiver. We describe methods to determine threshold SNR values, using the Weak Signal Propagation Reporter (WSPR) database to determine if a time slot is suitable for transmission.Two techniques are investigated to quantify the failed receptions: the Inverse Square Law method uses a statistical approach and a sampling measurement technique called Goldilocks. The two approaches yielded threshold SNR values of −21 dB and −19 dB, respectively, for a time slot with a 90% successful reception goal. Applying these thresholds to the modelled SNR, we generate a precomputed hourly transmission schedule. With the schedule determined monthly, a 12-month plan requires 36 bytes of wireless sensor storage. A six-day experiment, using a 1677 km path, found that the schedule resulted in an 83% reception rate when used with a power level of 200 mW.

Smart Space (SS) communications has rapidly emerged as an exciting new paradigm that includes ubiquitous, grid, and pervasive computing to provide intelligence, insight, and vision for the emerging world of intelligent environments, products, services and human interaction. Dependable networking of a smart space environment can be ensured through reliable routing, efficient selection of error free links, rapid recovery from broken links and the avoidance of congested gateways. Since link failure and packet loss are inevitable in smart space wireless sensor networks, we have developed an efficient scheme to achieve a reliable data collection for smart spaces composed of low capacity wireless sensor nodes. Wireless Sensor Networks (WSNs) must tolerate a certain lack of reliability without a significant effect on packet delivery performance, data aggregation accuracy or energy consumption. In this paper we present an effective hybrid scheme that adaptively reduces control traffic with a metric that measures the reception success ratio of representative data packets. Based on this approach, our proposed routing scheme can achieve reduced energy consumption while ensuring minimal packet loss in environments featuring high link failure rates. The performance of our proposed routing scheme is experimentally investigated using both simulations and a test bed of TelosB motes. It is shown to be more robust and energy efficient than the network layer provided by TinyOS2.x. Our results show that the scheme is able to maintain better than 95% connectivity in an interference-prone medium while achieving a 35% energy saving.

The networks speed has been advancing rapidly in providing higher transmission rate 10 Gbps and over. These improvements based on the demand of enhancing the network services, improving their bandwidth and integrating advanced technology. As the speed of networks exceeds 10 Gbps, the design and implementation of high-performance Network Interfaces (NI) for the current and the Next Generation Network (NGN) server applications that employ TCP/IP and UDP/IP as the communication protocol of choice is becoming very challenging. Using the General Purpose Processor (GPP) as a main core processor in the NI to offload the TCP/IP or UDP/IP functions, can deliver some important features to NI such as scalability and short developing time. However, it is not clear that using GPP can support the new speed line over the 10 Gbps. Furthermore, it is necessary to find out the clock rate Hz limit of these GPP in supporting the processing of NIs. In this research, we have proposed a new programmable Ethernet NI (ENI) model design to support the high speed transmission. This model supports the Large Segment Offload (LSO) for sending side and a novel algorithm for receiving side called Receiving Side Amalgamating Algorithm (RSAA). As a result, a 240 MHz RISC core can be used in this Ethernet NI card for a wide range of the transmission line speeds up to 100 Gbps when a jumbo packet assigned as a default size for a network.

Homogeneous wireless sensor networks (WSNs) are organized using identical sensor nodes, but the nature of WSNs operations results in an imbalanced workload on gateway sensor nodes which may lead to a hot-spot or routing hole problem. The routing hole problem can be considered as a natural result of the tree-based routing schemes that are widely used in WSNs, where all nodes construct a multi-hop routing tree to a centralized root, e.g., a gateway or base station. For example, sensor nodes on the routing path and closer to the base station deplete their own energy faster than other nodes, or sensor nodes with the best link state to the base station are overloaded with traffic from the rest of the network and experience a faster energy depletion rate than their peers. Routing protocols for WSNs are reliability-oriented and their use of reliability metric to avoid unreliable links makes the routing scheme worse. However, none of these reliability oriented routing protocols explicitly uses load balancing in their routing schemes. Since improving network lifetime is a fundamental challenge of WSNs, we present, in this chapter, a novel, energy-wise, load balancing routing (LBR) algorithm that addresses load balancing in an energy efficient manner by maintaining a reliable set of parent nodes. This allows sensor nodes to quickly find a new parent upon parent loss due to the existing of node failure or energy hole. The proposed routing algorithm is tested using simulations and the results demonstrate that it outperforms the MultiHopLQI reliability based routing algorithm.

Homogeneous wireless sensor networks (WSNs) are organized using identical sensor nodes, but the nature of WSNs operations results in an imbalanced workload on gateway sensor nodes which may lead to a hot-spot or routing hole problem. The routing hole problem can be considered as a natural result of the tree-based routing schemes that are widely used in WSNs, where all nodes construct a multi-hop routing tree to a centralized root, e.g., a gateway or base station. For example, sensor nodes on the routing path and closer to the base station deplete their own energy faster than other nodes, or sensor nodes with the best link state to the base station are overloaded with traffic from the rest of the network and experience a faster energy depletion rate than their peers. Routing protocols for WSNs are reliability-oriented and their use of a reliability metric to avoid unreliable links makes the routing scheme worse. however, none of these reliability oriented routing protocols explicitly uses load balancing in their routing schemes. In this paper, we present a novel, energy-wise, load balancing routing (LBR) algorithm that addresses load balancing in an energy efficient manner by maintaining a reliable set of parent nodes. This allows sensor nodes to quickly find a new parent upon parent loss due to the existing of node failure or energy hole. The proposed routing algorithm is tested using simulations and the results demonstrate that it outperforms the MultiHopLQI reliability based routing algorithm.