Lecture

Foundations of Wireless Communication for IoT

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the integration of various wireless communication technologies in IoT systems, including established interfaces like Bluetooth and Wi-Fi, as well as low power schemes for specific data types. It explores the development of new communication standards for low power wireless area networks, focusing on LoRa and SigFox, and emphasizes the unlicensed nature of these standards. The lecture also discusses the need for multiple communication standards in IoT devices to cater to diverse applications and environments.

In MOOC

IoT Systems and Industrial Applications with Design Thinking

Internet of Things (IoT) and smart connected devices have radically changed the way our world works and how companies operate and create new businesses. Do you want to learn about IoT fundamentals? This is a course for you! In this course we provide an overview of the underlaying IoT technologies and its business applications. This course is an introduction to IoT and explains why it is a continuously evolving concept with many industrial applications. You will learn the fundamental building blocks of IoT

Official source

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (32)

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Primitive data type

In computer science, primitive data types are a set of basic data types from which all other data types are constructed. Specifically it often refers to the limited set of data representations in use by a particular processor, which all compiled programs must use. Most processors support a similar set of primitive data types, although the specific representations vary. More generally, "primitive data types" may refer to the standard data types built into a programming language (built-in types).

Communication

Communication is usually defined as the transmission of information. The term can also refer to the message itself, or the field of inquiry studying these transmissions, also known as communication studies. The precise definition of communication is disputed. Controversial issues are whether unintentional or failed transmissions are included and whether communication does not just transmit meaning but also create it. Models of communication aim to provide a simplified overview of its main components and their interaction.

Algebraic data type

In computer programming, especially functional programming and type theory, an algebraic data type (ADT) is a kind of composite type, i.e., a type formed by combining other types. Two common classes of algebraic types are product types (i.e., tuples and records) and sum types (i.e., tagged or disjoint unions, coproduct types or variant types). The values of a product type typically contain several values, called fields. All values of that type have the same combination of field types.

Recursive data type

In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs. An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.

Related lectures (64)

Protocols in Akka Typed

Explores protocols in Akka Typed, typing actors to restrict message types and modeling protocols with algebraic data types.

Programming Fundamentals: Recap and Modular Approach

Covers fundamental programming concepts and highlights the importance of modular code design.

Advanced C Data Types

Covers advanced data types and memory management in C programming, emphasizing type consistency and dynamic array allocation.

Introduction to UNIX and C Programming Concepts

Covers UNIX fundamentals and introduces C programming concepts, including variables, data types, and basic operations.

Introduction to C Programming