Publication

A probabilistic power-aware routing algorithm for wireless ad-hoc networks

Ali H. Sayed
2004
Conference paper

Abstract

We propose a probabilistic routing algorithm for wireless ad-hoc networks. The focus is on applications that can tolerate end-to-end delays and those for which the final destination for the packets is a small region. The nodes are assumed stationary and establish connections with a master node according to a priority scheme that relates to their distances from the master node. Simulation results illustrate the performance of the proposed algorithm.

Official source

https://infoscience.epfl.ch/record/233197?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

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.

A probabilistic power-aware routing algorithm for wireless ad-hoc networks

Graph Chatbot

Chat with Graph Search

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Space, people, networks

Flexible Spectrum Assignment for Local Wireless Networks

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Flexible Spectrum Assignment for Local Wireless Networks

Space, people, networks