Ilker Demirkol

MAC protocols for wireless sensor networks: a survey

Wireless sensor networks are appealing to researchers due to their wide range of application potential in areas such as target detection and tracking, environmental monitoring, industrial process monitoring, and tactical systems. However, low sensing ranges result in dense networks and thus it becomes necessary to achieve an efficient medium-access protocol subject to power constraints. Various medium-access control (MAC) protocols with different objectives have been proposed for wireless sensor networks. In this article, we first outline the sensor network properties that are crucial for the design of MAC layer protocols. Then, we describe several MAC protocols proposed for sensor networks, emphasizing their strengths and weaknesses. Finally, we point out open research issues with regard to MAC layer design.

Wake-up receivers for wireless sensor networks: benefits and challenges

For successful data delivery, the destination nodes should be listening to the medium to receive data when the sender node starts data communication. To achieve this synchronization, there are different rendezvous schemes, among which the most energy-efficient is utilizing wakeup receivers. Current hardware technologies of wake-up receivers enable us to evaluate them as a promising solution for wireless sensor networks. In this article the benefits achieved with wake-up receivers are investigated along with the challenges observed. In addition, an overview of state-of-the-art hardware and networking protocol proposals is presented. As wake-up receivers offer new opportunities, new potential application areas are also presented and discussed.

Location area planning in cellular networks using simulated annealing

Location area (LA) planning plays an important role in cellular networks because of the trade-off caused by paging and registration signaling. The upper bound on the size of an LA is the service area of a mobile switching center (MSC). In that extreme case, the cost of paging is at its maximum, but no registration is needed. On the other hand, if each cell is an LA, the paging cost is minimal, but the registration cost is the largest. In general, the most important component of these costs is the load on the signaling resources. Between the extremes lie one or more partitions of the MSC service area that minimize the total cost of paging and registration. In this paper, we try to find an optimal method for determining the location areas. For that purpose, we use the available network information to formulate a realistic optimization problem. We propose an algorithm based on simulated annealing (SA) for the solution of the resulting problem. Then, we investigate the quality of the SA technique by comparing its results to greedy search and random generation methods.

Wireless sensor networks for intrusion detection: packet traffic modeling

Performance evaluation of wireless sensor network (WSN) protocols requires realistic data traffic models since most of the WSNs are application specific. In this letter, a sensor network packet traffic model is derived and analyzed for intrusion detection applications. Presented analytical work is also validated using simulations.

Location area planning and cell-to-switch assignment in cellular networks

Location area (LA) planning plays an important role in cellular networks because of the tradeoff caused by paging and registration signalling. The upper boundary for the size of an LA is the service area of a mobile services switching center (MSC). In that extreme case, the cost of paging is at its maximum but no registration is needed. On the other hand, if each cell is an LA, the paging cost is minimal but the cost of registration is the largest. Between these extremes lie one or more partitions of the MSC service area that minimize the total cost of paging and registration. In this paper, we seek to determine the location areas in an optimum fashion. Cell to switch assignments are also determined to achieve the minimization of the network cost. For that purpose, we use the available network information to formulate a realistic optimization problem, and propose an algorithm based on simulated annealing (SA) for its solution. Then, we investigate the quality of the SA-based technique by comparing it to greedy search, random generation methods, and a heuristic algorithm.

Energy and delay optimized contention for wireless sensor networks

In wireless sensor network (WSN) studies, the main objective is minimizing the energy consumption so that the lifetime is maximized under the limited battery capacity constraints. Additionally, in most event-driven WSN applications, the end-to-end delay, and hence, the medium access delay should be minimized. Majority of the WSN MAC protocols are contention-based wherein contention window size setting involves an important trade-off between the collision probability and idle listening durations in contentions where both are aimed to be lowered for efficient network operation. In this paper, the energy optimizing and the delay optimizing contention window sizes are derived as a function of the number of contending nodes. For this purpose, we present separate analyses for the contention delay and for the energy consumed which are verified with detailed simulations. In order to obtain close to optimal performance values in a distributed manner, we propose a method for estimating the number of contending nodes since the individual wireless sensor nodes do not have this information readily. Simulations of an event-driven WSN application verify that the proposed method successfully improve both delay and energy efficiency of the contention-based medium access. The end-to-end network performance is also investigated by employing a geographical routing protocol. Results show that using the heuristic method proposed that use the optimum contention window size analyses presented, the overall network performance can be improved without incurring any overhead to the system.

Modeling the Maximum Throughput of Bluetooth Low Energy in an Error-Prone Link

We present an analytical model for the maximum throughput of Bluetooth Low Energy (BLE), considering the presence of uncorrelated bit errors and the impact of a key BLE parameter that defines the time between the start of two consecutive connection events. The derived analysis models the generic application of master-to-slave unidirectional data transmission, which also forms an upper bound for bidirectional data transmission throughput. Simulation results show that our model accurately predicts the maximum BLE throughput for all bit error rates and BLE parameter settings evaluated.

Feasibility and Benefits of Passive RFID Wake-Up Radios for Wireless Sensor Networks

Energy efficiency is one of the crucial design criteria for wireless sensor networks. Idle listening constitutes a major part of energy waste, and thus solutions such as duty cycling and the use of wake-up radios have been proposed to reduce idle listening and save energy. Compared to duty cycling, wake-up radios save more energy by reducing unnecessary wake-ups and collisions. In this paper, we investigate the feasibility and potential benefits of using passive RFID as a wake-up radio. We first introduce a physical implementation of sensor nodes with passive RFID wake-up radios and measure their energy cost and wake-up probability. Then, we compare the performance of our RFID wake-up sensor nodes with duty cycling in a Data MULE scenario through simulations with realistic application parameters. The results show that using a passive RFID wake-up radio offers significant energy efficiency benefits at the expense of delay and the additional low-cost RFID hardware, making RFID wake-up radios beneficial for many delay-tolerant sensor network applications.

Improving Packet Delivery Performance of Publish/Subscribe Protocols in Wireless Sensor Networks

MQTT-S and CoAP are two protocols able to use the publish/subscribe model in Wireless Sensor Networks (WSNs). The high scalability provided by the publish/subscribe model may incur a high packet loss and therefore requires an efficient reliability mechanism to cope with this situation. The reliability mechanism of MQTT-S and CoAP employs a method which defines a fixed value for the retransmission timeout (RTO). This article argues that this method is not efficient for deploying publish/subscribe in WSN, because it may be unable to recover a packet, therefore resulting in a lower packet delivery ratio (PDR) at the subscriber nodes. This article proposes and evaluates an adaptive RTO method, which consists in using a Smooth Round-trip Time and multiplying it by a constant parameter (K). Thanks to this method, the reliability mechanism of MQTT-S and CoAP would be able to react properly to packet loss and would also be lightweight in terms of energy, memory and computing for sensor nodes where these resources are critical. We present a detailed evaluation of the effects of the K value on the calculation of the adaptive RTO method. We also establish the setting for obtaining the highest PDR on the subscriber nodes for single-hop and multi-hop scenarios. The results for single-hop scenario show that use of the appropriate K value for the adaptive RTO method increases the PDR up to 76% for MQTT-S and up to 38% for CoAP when compared with the use of fixed RTO method for both protocols, respectively. Meanwhile the same comparison for multi-hop scenario, the adaptive RTO method increases the PDR up to 36% for MQTT-S and up to 14% for CoAP.

Performance evaluation and comparative analysis of SubCarrier Modulation Wake-up radio systems for energy-efficient wireless sensor networks

Energy-efficient communication is one of the main concerns of wireless sensor networks nowadays. A commonly employed approach for achieving energy efficiency has been the use of duty-cycled operation of the radio, where the nodes transceiver is turned off and on regularly, listening to the radio channel for possible incoming communication during its on-state. Nonetheless, such a paradigm performs poorly for scenarios of low or bursty traffic because of unnecessary activations of the radio transceiver. As an alternative technology, Wake-up Radio (WuR) systems present a promising energy-efficient network operation, where target devices are only activated in an on-demand fashion by means of a special radio signal and a WuR receiver. In this paper, we analyze a novel wake-up radio approach that integrates both data communication and wake-up functionalities into one platform, providing a reconfigurable radio operation. Through physical experiments, we characterize the delay, current consumption and overall operational range performance of this approach under different transmit power levels. We also present an actual single-hop WuR application scenario, as well as demonstrate the first true multi-hop capabilities of a WuR platform and simulate its performance in a multi-hop scenario. Finally, by thorough qualitative comparisons to the most relevant WuR proposals in the literature, we state that the proposed WuR system stands out as a strong candidate for any application requiring energy-efficient wireless sensor node communications.