Fifty Years of Noise Modeling and Mitigation in Power-Line Communications.

Building on the ubiquity of electric power infrastructure, power line communications (PLC) has been successfully used in diverse application scenarios, including the smart grid and in-home broadband communications systems as well as industrial and home automation. However, the power line channel exhibits deleterious properties, one of which is its hostile noise environment. This article aims for providing a review of noise modeling and mitigation techniques in PLC. Specifically, a comprehensive review of representative noise models developed over the past fifty years is presented, including both the empirical models based on measurement campaigns and simplified mathematical models. Following this, we provide an extensive survey of the suite of noise mitigation schemes, categorizing them into mitigation at the transmitter as well as parametric and non-parametric techniques employed at the receiver. Furthermore, since the accuracy of channel estimation in PLC is affected by noise, we review the literature of joint noise mitigation and channel estimation solutions. Finally, a number of directions are outlined for future research on both noise modeling and mitigation in PLC

Network Science for IoT

The research work presented in this thesis is based on the concept and defintion of network that can spread in several and different real world contexts. Indeed, we can refer to a network in a telecommunications sense considering a collection of transmitters, receivers, and communication channels that send or are used to send information to one another. However, as a matter of fact, in nature there are other several examples of networks: the human brain is one of them. The relationship between the actors in Hollywood can be studied in terms of network as well, a generic social community can be compared to a network, eco-systems are networks of species. The recent Network Science aims at studying all these systems using a set of common mathematical methods. In the following of the thesis, we will focus on some of well known telecommunications networks issues using standard telecommunications procedures to address them, with relevant reference to video flow transmissions and management of electric vehicles networks. At the same time, different models aiming at reach the same goals in contexts that may differ from a telecommunications setup can be used. In more details, we will evaluate queueing systems, jamming problems, groups recognition in networks, and mobile computing using game theoretic approaches. It is worth noting that this aspect can be also seen in a reverse order. Indeed, we will discuss how standard telecommunications analysis can be used to investigate on problems not directly related to a telecommunications background. In particular, one of our future purposes is to investigate on the brain connectivity that is raising significant interest in the recent scientific society

Smart Wireless Sensor Networks

The recent development of communication and sensor technology results in the growth of a new attractive and challenging area - wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodes� resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of network's operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks

Adaptive Communication for Mobile Multi-Robot Systems

Mobile multi-robot systems can be immensely powerful, serving as force multipliers for human operators in search-and-rescue operations, urban reconnaissance missions, and more. Key to fulfilling this potential is robust communication, which allows robots to share sensor data or inform others of their intentions. However, wireless communication is often unreliable for mobile multi-robot systems, exhibiting losses, delays, and outages as robots move through their environment. Furthermore, the wireless communication spectrum is a shared resource, and multi-robot systems must determine how to use its limited bandwidth in accomplishing their missions. This dissertation addresses the challenges of inter-robot communication in two thrusts. In the first thrust, we improve the reliability of such communication through the application of a technique we call Adaptive Erasure Coding (AEC). Erasure codes enable recovery from packet loss through the use of redundancy. Conditions in a mobile robotic network are continually changing, so AEC varies the amount of redundancy applied to achieve a probabilistic delivery guarantee. In the second thrust, we describe a mechanism by which robots can make communication decisions by considering the expected effect of a proposed communication action on team performance. We call this algorithm Optimizing Communication under Bandwidth Constraints (OCBC). Given a finite amount of available bandwidth, OCBC optimizes the contents of a message to respect the bandwidth constraint.PHDComputer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/149815/1/ryanjmar_1.pd

EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS

This thesis presents a study about the problem of data gathering in the inhospitable underwater environment. Besides long propagation delays and high error probability, continuous node movement also makes it difficult to manage the routing information during the process of data forwarding. In order to overcome the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, yet continuous node movements still need attention. Considering the node mobility as a challenging task, a distributed routing scheme called Hop-by-Hop Dynamic Addressing Based (H2- DAB) routing protocol is proposed where every node in the network will be assigned a routable address quickly and efficiently without any explicit configuration or any dimensional location information. According to our best knowledge, H2-DAB is first addressing based routing approach for underwater wireless sensor networks (UWSNs) and not only has it helped to choose the routing path faster but also efficiently enables a recovery procedure in case of smooth forwarding failure. The proposed scheme provides an option where nodes is able to communicate without any centralized infrastructure, and a mechanism furthermore is available where nodes can come and leave the network without having any serious effect on the rest of the network. Moreover, another serious issue in UWSNs is that acoustic links are subject to high transmission power with high channel impairments that result in higher error rates and temporary path losses, which accordingly restrict the efficiency of these networks. The limited resources have made it difficult to design a protocol which is capable of maximizing the reliability of these networks. For this purpose, a Two-Hop Acknowledgement (2H-ACK) reliability model where two copies of the same data packet are maintained in the network without extra burden on the available resources is proposed. Simulation results show that H2-DAB can easily manage during the quick routing changes where node movements are very frequent yet it requires little or no overhead to efficiently complete its tasks