Lecture

Multi-Hop Networks: Wireless Routing Strategies

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.

In course

COM-405: Mobile networks

This course provides a detailed description of the organization and operating principles of mobile and wireless communication networks, as well as the use of wireless signals for sensing and imaging. ...

Description

This lecture covers the fundamentals of multi-hop wireless networks, including the elements of a wireless network, wireless network taxonomy, and the characteristics of wireless networks. It delves into traditional single path routing, link-state routing, and distance vector routing. The lecture also explores challenges in wireless ad-hoc networks, such as selecting link costs and routing strategies like Dynamic Source Routing (DSR) and Ad hoc On-demand Distance Vector (AODV). Additionally, it discusses the limitations of existing routing protocols and introduces innovative solutions like ExOR, network coding, and MORE to enhance throughput and efficiency in wireless communication.

Instructors (2)

Haitham Al Hassanieh

Teaching & PhD PhD Students Eduard Vlad, Raphael Cannatà, Arman Maghsoudnia, Jiachen Lu, Samah Hussein Youssef, Hailan Zhang Shanbhag, Aoyu Gong Courses Intelligent systems: communications & AI COM-304 The course teaches the development of systems that solve real-world challenges in communications, signal processing, foundation models, and AI. Students will work in teams, construct their ideas, and either program available hardware prototypes or build their hardware or software system.

Jean-Pierre Hubaux

Jean-Pierre Hubaux is a full professor at EPFL and head of the Laboratory for Data Security. Through his research, he contributes to laying the foundations and developing the tools for protecting privacy in today’s hyper-connected world. He has pioneered the areas of privacy and security in mobile/wireless networks and in personalized health. He is the academic director of the Center for Digital Trust (C4DT). He leads the Data Protection in Personalized Health (DPPH) project funded by the ETH Council and is a co-chair of the Data Security Work Stream of the Global Alliance for Genomics and Health (GA4GH). From 2008 to 2019 he was one of the seven commissioners of the Swiss FCC. He is a Fellow of both IEEE (2008) and ACM (2010). Recent awards: two of his papers obtained distinctions at the IEEE Symposium on Security and Privacy in 2015 and 2018. He is among the most cited researchers in privacy protection and in information security. Spoken languages: French, English, German, Italian

Official source

Related concepts (32)

Distance-vector routing protocol

A distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information.

Link-state routing protocol

Link-state routing protocols are one of the two main classes of routing protocols used in packet switching networks for computer communications, the others being distance-vector routing protocols. Examples of link-state routing protocols include Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS). The link-state protocol is performed by every switching node in the network (i.e., nodes that are prepared to forward packets; in the Internet, these are called routers).

Routing

Routing is the process of selecting a path for traffic in a network or between or across multiple networks. Broadly, routing is performed in many types of networks, including circuit-switched networks, such as the public switched telephone network (PSTN), and computer networks, such as the Internet. In packet switching networks, routing is the higher-level decision making that directs network packets from their source toward their destination through intermediate network nodes by specific packet forwarding mechanisms.

Routing Information Protocol

The Routing Information Protocol (RIP) is one of the oldest distance-vector routing protocols which employs the hop count as a routing metric. RIP prevents routing loops by implementing a limit on the number of hops allowed in a path from source to destination. The largest number of hops allowed for RIP is 15, which limits the size of networks that RIP can support. RIP implements the split horizon, route poisoning, and holddown mechanisms to prevent incorrect routing information from being propagated.

Dynamic routing

Dynamic routing, also called adaptive routing, is a process where a router can forward data via a different route for a given destination based on the current conditions of the communication circuits within a system. The term is most commonly associated with data networking to describe the capability of a network to 'route around' damage, such as loss of a node or a connection between nodes, as long as other path choices are available. Dynamic routing allows as many routes as possible to remain valid in response to the change.

Related lectures (47)

IP Addressing and Routing: Basics and Examples

Explains IP addressing, routing, and TCP packet meta-data, along with practical routing table considerations.

Network Coding: Opportunistic Routing and Coding

Explores network coding for efficient data delivery in wireless networks, optimizing packet transmissions through opportunistic routing and coding.

Networks: IP Protocol MOOC: Information, Computation, Communication: Introduction to computational thinking

Explores the Internet Protocol (IP), BFS algorithm, routing tables, and IPv4 addresses.

Search and Routing Protocols

Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.

Cognitive Wireless Networks: Optimization and Energy Efficiency