On reliable communication in transmit-only networks for home automation. (1st January 2018)

• Record Type: Journal Article
• Authors: Parsch, Philip; Masrur, Alejandro
• Is Part Of: Journal of network and computer applications. Volume 101(2018)
• Page Start: 96
• Page End: 110
• Publication Date: 2018-01-01
• Subjects: 00-01 -- 99-00; Home automation -- Reliability -- Cost efficiency -- Sensor/actuator networks -- Unidirectional/transmit-only nodes; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2017.10.023
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: Home-automation applications such as intelligent illumination, heating, and ventilation allow reducing the overall energy consumption and improve comfort in our everyday lives. To implement such applications, multiple sensors and actuators often need to be connected into networks typically communicating over radio signals, i.e., wireless sensor networks (WSNs). Many available technologies are based on bidirectional devices with the capability of acknowledging packets and performing retransmissions if necessary. However, home-automation devices mostly report data to a sink for which they do not need any feedback channel or external control, thus, unidirectional devices can be used instead reducing costs and energy consumption. On the other hand, since unidirectional nodes are unable to perform carrier sensing or acknowledge packets, the resulting networks are often unreliable. To overcome this problem, we propose a medium access control (MAC) that consists in making each transmit-only node send a sequence of redundant packets. The proposed method guarantees reliability, i.e., at least one packet of each sequence reaches its destination within a specified deadline by carefully selecting inter-packet times. In contrast to similar approaches from the literature, our MAC is based on a more general model that allows describing arbitrary deadlines and packet sizes for each node in the network and can accommodate considerably more nodes into a reliable network as the ratio between the longest and the shortest deadline increases. We illustrate these and other benefits of the proposed MAC by means of extensive simulations based on the OMNeT++ framework.