A roadmap to developing energy-efficient MAC protocol in wireless sensor networks: a case of ADP-MAC development and implementation

Over the past two decades, hundreds of protocols have been developed for diversified applications of WSN corresponding to different layers in the communication stack. Among these, Media Access Control (MAC) layer protocols are of great interest due to providing possibility of optimizing performance parameters. Despite availability of a large number of survey articles, there remains a gap for a tutorial that offers guidelines about the development process of MAC protocol. In this paper, we present a detailed tutorial for developing a MAC protocol starting from the stage of research gap identification and ending at the performance evaluation. We described the journey of development and implementation of a novel asynchronous MAC protocol ADP-MAC (Adaptive and Dynamic Polling MAC) as a case study. ADP-MAC was developed by deploying a novel concept of channel polling interval distributions, and was compared against Synchronized Channel Polling- MAC (SCP-MAC) and lightweight Traffic Auto-Adaptation based MAC (T-AAD). Finally, we proposed major milestones of protocol development along with recommendations about publishing the research

Topics in access, storage, and sensor networks

In the first part of this dissertation, Data Over Cable Service Interface Specification (DOCSIS) and IEEE 802.3ah Ethernet Passive Optical Network (ETON), two access networking standards, are studied. We study the impact of two parameters of the DOCSIS protocol and derive the probability of message collision in the 802.3ah device discovery scheme. We survey existing bandwidth allocation schemes for EPONs, derive the average grant size in one such scheme, and study the performance of the shortest-job-first heuristic. In the second part of this dissertation, we study networks of mobile sensors. We make progress towards an architecture for disconnected collections of mobile sensors. We propose a new design abstraction called tours which facilitates the combination of mobility and communication into a single design primitive and enables the system of sensors to reorganize into desirable topologies alter failures. We also initiate a study of computation in mobile sensor networks. We study the relationship between two distributed computational models of mobile sensor networks: population protocols and self-similar functions. We define the notion of a self-similar predicate and show when it is computable by a population protocol. Transition graphs of population protocols lead its to the consideration of graph powers. We consider the direct product of graphs and its new variant which we call the lexicographic direct product (or the clique product). We show that invariants concerning transposable walks in direct graph powers and transposable independent sets in graph families generated by the lexicographic direct product are uncomputable. The last part of this dissertation makes contributions to the area of storage systems. We propose a sequential access detect ion and prefetching scheme and a dynamic cache sizing scheme for large storage systems. We evaluate the cache sizing scheme theoretically and through simulations. We compute the expected hit ratio of our and competing schemes and bound the expected size of our dynamic cache sufficient to obtain an optimal hit ratio. We also develop a stand-alone simulator for studying our proposed scheme and integrate it with an empirically validated disk simulator

Information fusion architectures for security and resource management in cyber physical systems

Data acquisition through sensors is very crucial in determining the operability of the observed physical entity. Cyber Physical Systems (CPSs) are an example of distributed systems where sensors embedded into the physical system are used in sensing and data acquisition. CPSs are a collaboration between the physical and the computational cyber components. The control decisions sent back to the actuators on the physical components from the computational cyber components closes the feedback loop of the CPS. Since, this feedback is solely based on the data collected through the embedded sensors, information acquisition from the data plays an extremely vital role in determining the operational stability of the CPS. Data collection process may be hindered by disturbances such as system faults, noise and security attacks. Hence, simple data acquisition techniques will not suffice as accurate system representation cannot be obtained. Therefore, more powerful methods of inferring information from collected data such as Information Fusion have to be used. Information fusion is analogous to the cognitive process used by humans to integrate data continuously from their senses to make inferences about their environment. Data from the sensors is combined using techniques drawn from several disciplines such as Adaptive Filtering, Machine Learning and Pattern Recognition. Decisions made from such combination of data form the crux of information fusion and differentiates it from a flat structured data aggregation. In this dissertation, multi-layered information fusion models are used to develop automated decision making architectures to service security and resource management requirements in Cyber Physical Systems --Abstract, page iv

A Comparative Study of Energy Efficient Medium Access Control Protocols in Wireless Sensor Networks

This project investigates energy usage in three energy-efficient WSN MAC protocols (AS-MAC, SCP-MAC, and Crankshaft) on TelosB wireless sensors. It additionally presents BAS-MAC, an energy-efficient protocol of our own design. Our evaluations show that in single-hop networks with large send intervals and staggered sending, AS-MAC is best in the local gossip and convergecast scenarios, while SCP-MAC is best overall in the broadcast scenario. We conjecture that Crankshaft would perform best in extremely dense hybrid (unicast and broadcast) network topologies, especially those which broadcast frequently. Finally, BAS-MAC would be optimal in networks which utilize hybrid traffic with infrequent broadcasts, and where broadcasting is performed by motes that do not have an unlimited power source

Packet level measurement over wireless access

PhDPerformance Measurement of the IP packet networks mainly comprise of monitoring the network performance in terms of packet losses and delays. If used appropriately, these network parameters (i.e. delay, loss and bandwidth etc) can indicate the performance status of the network and they can be used in fault and performance monitoring, network provisioning, and traffic engineering. Globally, there is a growing need for accurate network measurement to support the commercial use of IP networks. In wireless networks, transmission losses and communication delays strongly affect the performance of the network. Compared to wired networks, wireless networks experience higher levels of data dropouts, and corruption due to issues of channel fading, noise, interference and mobility. Performance monitoring is a vital element in the commercial future of broadband packet networking and the ability to guarantee quality of service in such networks is implicit in Service Level Agreements. Active measurements are performed by injecting probes, and this is widely used to determine the end to end performance. End to end delay in wired networks has been extensively investigated, and in this thesis we report on the accuracy achieved by probing for end to end delay over a wireless scenario. We have compared two probing techniques i.e. Periodic and Poisson probing, and estimated the absolute error for both. The simulations have been performed for single hop and multi- hop wireless networks. In addition to end to end latency, Active measurements have also been performed for packet loss rate. The simulation based analysis has been tried under different traffic scenarios using Poisson Traffic Models. We have sampled the user traffic using Periodic probing at different rates for single hop and multiple hop wireless scenarios. 5 Active probing becomes critical at higher values of load forcing the network to saturation much earlier. We have evaluated the impact of monitoring overheads on the user traffic, and show that even small amount of probing overhead in a wireless medium can cause large degradation in network performance. Although probing at high rate provides a good estimation of delay distribution of user traffic with large variance yet there is a critical tradeoff between the accuracy of measurement and the packet probing overhead. Our results suggest that active probing is highly affected by probe size, rate, pattern, traffic load, and nature of shared medium, available bandwidth and the burstiness of the traffic

A Comprehensive Survey of the Tactile Internet: State of the art and Research Directions

The Internet has made several giant leaps over the years, from a fixed to a mobile Internet, then to the Internet of Things, and now to a Tactile Internet. The Tactile Internet goes far beyond data, audio and video delivery over fixed and mobile networks, and even beyond allowing communication and collaboration among things. It is expected to enable haptic communication and allow skill set delivery over networks. Some examples of potential applications are tele-surgery, vehicle fleets, augmented reality and industrial process automation. Several papers already cover many of the Tactile Internet-related concepts and technologies, such as haptic codecs, applications, and supporting technologies. However, none of them offers a comprehensive survey of the Tactile Internet, including its architectures and algorithms. Furthermore, none of them provides a systematic and critical review of the existing solutions. To address these lacunae, we provide a comprehensive survey of the architectures and algorithms proposed to date for the Tactile Internet. In addition, we critically review them using a well-defined set of requirements and discuss some of the lessons learned as well as the most promising research directions

Energy efficient medium access control for wireless sensor networks

A wireless sensor network designates a system composed of numerous sensor nodes distributed over an area in order to collect information. The sensor nodes communicate wirelessly with each other in order to self-organize into a multi-hop network, collaborate in the sensing activity and forward the acquired information towards one or more users of the information. Applications of sensor networks are numerous, ranging from environmental monitoring, home and building automation to industrial control. Since sensor nodes are expected to be deployed in large numbers, they must be inexpensive. Communication between sensor nodes should be wireless in order to minimize the deployment cost. The lifetime of sensor nodes must be long for minimal maintenance cost. The most important consequence of the low cost and long lifetime requirements is the need for low power consumption. With today's technology, wireless communication hardware consumes so much power that it is not acceptable to keep the wireless communication interface constantly in operation. As a result, it is required to use a communication protocol with which sensor nodes are able to communicate keeping the communication interface turned-off most of the time. The subject of this dissertation is the design of medium access control protocols permitting to reach a very low power consumption when communicating at a low average throughput in multi-hop wireless sensor networks. In a first part, the performance of a scheduled protocol (time division multiple access, TDMA) is compared to the one of a contention protocol (non-persistent carrier sensing multiple access with preamble sampling, NP-CSMA-PS). The preamble sampling technique is a scheme that avoids constant listening to an idle medium. This thesis presents a low power contention protocol obtained through the combination of preamble sampling with non-persistent carrier sensing multiple access. The analysis of the strengths and weaknesses of TDMA and NP-CSMA-PS led us to propose a solution that exploits TDMA for the transport of frequent periodic data traffic and NP-CSMA-PS for the transport of sporadic signalling traffic required to setup the TDMA schedule. The second part of this thesis describes the WiseMAC protocol. This protocol is a further enhancement of CSMA with preamble sampling that proved to provide both a low power consumption in low traffic conditions and a high energy efficiency in high traffic conditions. It is shown that this protocol can provide either a power consumption or a latency several times lower that what is provided by previously proposed protocols. The WiseMAC protocol was initially designed for multi-hop wireless sensor networks. A comparison with power saving protocols designed specifically for the downlink of infrastructure wireless networks shows that it is also of interest in such cases. An implementation of the WiseMAC protocol has permitted to validate experimentally the proposed concepts and the presented analysis

Cascading Tournament Algorithm: Low Power, High Capacity Medium Sharing for Wireless Sensor Networks

Existing Medium Access Control protocols for Wireless Sensor Networks reduce the radio activity to improve network lifetime, at the expense of a reduced network capacity. Those protocols are ill-suited for energy constrained sensor networks that must support spatially and temporally heterogeneous traffic loads. This paper proposes a novel multi-ressource allocation algorithm and describes its implementation as a medium access control protocol for Wireless Sensor Networks. The algorithm, named Cascading Tournament (CT), is a localized, dynamic, joint contention/allocation algorithm. It relies on cascading iterations of tournaments to allocate a multiplicity of ressources to a multiplicity of winners. CT-MAC is an implementation of CT as a medium access protocol. By allocating multiple logicals channels allocation at each competition, CT-MAC improves the network capacity at a given duty-cycle or decreases the energy expenditure of the MAC layer at a given network capacity. Extensive simulations highlight the benefits of CT-MAC in both single-hop and multiple-hop scenarios through the computation of relevant performance metrics: power consumption, network capacity, delay and retransmissions. CT-MAC offers an unprecedented trade-off between network capacity, energy efficiency and delay and stands out as a solid candidate for energy constrained sensor networks that must support heterogeneous traffic loads. Our simulations show that CT-MAC significantly outperforms the state-of-the-art SCP-MAC protocol.Les protocoles d'accès au medium radio existants pour réseaux de capteurs sans-fil réduisent l'activité de la radio afin d'améliorer la durée de vie du réseau, et ce, au prix d'une diminution de la capacité du réseau. Ces protocoles sont peu adaptés pour les réseaux de capteurs contraints en énergie qui doivent supporter des trafics spatialement et temporellement hétérogènes. Ce rapport propose un algorithme d'allocation multi-ressources et décrit son implémentation sous forme de protocole de contrôle d'accès (MAC) au canal radio pour réseaux de capteurs. L'algorithme, appelé Cascading Tour- nament (CT), est un algorithme combiné de gestion de la contention/allocation localisé, dynamique et localisé. Il se repose sur des itérations de tournois en cascade pour allouer une pluralité de ressources à une pluralité de vainqueurs. CT-MAC est une implémentation de CT en tant que protocole MAC. En al- louant plusieurs canaux logiques à chaque compétition, CT-MAC améliore la capacité du réseau pour un cycle d'endormissement donné ou diminue la con- sommation énergétique de la couche MAC pour une capacité du réseau donnée. Une étude complète par simulation montre l'intérêt de CT-MAC dans des scé- narios de voisinage unique et multi-sauts. Ces simulations ont permis le calcul de métriques de performances pertinentes: consommation énergétique, capacité du réseau, délai et retransmissions. CT-MAC offre un compromis entre capacité du réseau et efficacité énergétique qui n'a pas de précédent. Il se présente donc comme un candidat sérieux pour les réseaux de capteurs contraints en énergie qui doivent supporter des trafics hétérogènes. Nos simulations ont montré que CT-MAC surpasse le protocole de l'état de l'art SCP-MAC