arXiv subjects

Mikael Gidlund

Publications and source records attributed to Mikael Gidlund.

40 records · Page 3Linked to original sources

arXiv2017

Cross-Layer Optimization of Wireless Links under Reliability and Energy Constraints

The vision of connecting billions of battery operated devices to be used for diverse emerging applications calls for a wireless communication system that can support stringent reliability and latency requirements. Both reliability and energy efficiency are critical for many of these applications that involve communication with short packets which undermine the coding gain achievable from large packets. In this paper, we study a cross-layer approach to optimize the performance of low-power wireless links. At first, we derive a simple and accurate packet error rate (PER) expression for uncoded schemes in block fading channels based on a new proposition that shows that the waterfall threshold in the PER upper bound in Nakagami-m fading channels is tightly approximated by the m-th moment of an asymptotic distribution of PER in AWGN channel. The proposed PER approximation establishes an explicit connection between the physical and link layers parameters, and the packet error rate. We exploit this connection for cross-layer design and optimization of communication links. To this end, we propose a semi-analytic framework to jointly optimize signal-to-noise ratio (SNR) and modulation order at physical layer, and the packet length and number of retransmissions at link layer with respect to distance under the prescribed delay and reliability constraints.

cs.IT↗

arXiv2017

Renewal-Theoretic Packet Collision Modeling under Long-Tailed Heterogeneous Traffic

Internet-of-things (IoT), with the vision of billions of connected devices, is bringing a massively heterogeneous character to wireless connectivity in unlicensed bands. The heterogeneity in medium access parameters, transmit power and activity levels among the coexisting networks leads to detrimental cross-technology interference. The stochastic traffic distributions, shaped under CSMA/CA rules, of an interfering network and channel fading makes it challenging to model and analyze the performance of an interfered network. In this paper, to study the temporal interaction between the traffic distributions of two coexisting networks, we develop a renewal-theoretic packet collision model and derive a generic collision-time distribution (CTD) function of an interfered system. The CTD function holds for any busy- and idle-time distributions of the coexisting traffic. As the earlier studies suggest a long-tailed idle-time statistics in real environments, the developed model only requires the Laplace transform of long-tailed distributions to find the CTD. Furthermore, we present a packet error rate (PER) model under the proposed CTD and multipath fading of the interfering signals. Using this model, a computationally efficient PER approximation for interference-limited case is developed to analyze the performance of an interfered link.

cs.IT↗

arXiv2016

Employee Trust Based Industrial Device Deployment and Initial Key Establishment

An efficient key management system is required to support cryptography. Most key management systems use either pre-installed shared keys or install initial security parameters using out-of-band channels. These methods create an additional burden for engineers who manage the devices in industrial plants. Hence, device deployment in industrial plants becomes a challenging task in order to achieve security. In this work, we present a device deployment framework that can support key management using the existing trust towards employees in a plant. This approach reduces the access to initial security parameters by employees, rather it helps to bind the trust of the employee with device commissioning. Thus, this approach presents a unique solution to the device deployment problem. Further, through a proof-of-concept implementation and security analysis using the AVISPA tool, we present that our framework is feasible to implement and satisfies our security objectives.

cs.CR↗

arXiv2014

End-to-End Reliability-aware Scheduling for Wireless Sensor Networks

Wireless Sensor Networks (WSN) are gaining popularity as a flexible and economical alternative to field-bus installations for monitoring and control applications. For mission-critical applications, communication networks must provide end-to-end reliability guarantees, posing substantial challenges for WSN. Reliability can be improved by redundancy, and is often addressed on the MAC layer by re-submission of lost packets, usually applying slotted scheduling. Recently, researchers have proposed a strategy to optimally improve the reliability of a given schedule by repeating the most rewarding slots in a schedule incrementally until a deadline. This Incrementer can be used with most scheduling algorithms but has scalability issues which narrows its usability to offline calculations of schedules, for networks that are rather static. In this paper, we introduce SchedEx, a generic heuristic scheduling algorithm extension which guarantees a user-defined end-to-end reliability. SchedEx produces competitive schedules to the existing approach, and it does that consistently more than an order of magnitude faster. The harsher the end-to-end reliability demand of the network, the better SchedEx performs compared to the Incrementer. We further show that SchedEx has a more evenly distributed improvement impact on the scheduling algorithms, whereas the Incrementer favors schedules created by certain scheduling algorithms.

cs.NI↗