Modeling and predicting mobility in wireless ad hoc networks
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
n source and destination pairs randomly located in an area extending linearly with n want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power attenuation of r^{-alpha} and random phase cha ...
Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...
We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not ...
During the last decade, the number of wireless devices like digital organizers, mobile phones and laptop computers has drastically increased. At the same time, several technologies, like Bluetooth, GPRS, or WiFi have become mature and offer a high-performa ...
The ad hoc networking technology can enable novel civilian and military applications. However, ad hoc networking protocols are vulnerable to a wide range of attacks. The design of defense mechanisms is a challenging problem, especially in comparison to sec ...
We study the scaling of the broadcast capacity for a network with a single source and f(N) cooperative relays where N is the number of destinations and f(.) is an increasing function. We consider random extended networks (the network area goes to infinity ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
Ad hoc network users are resource constrained: Before transmitting data, they have to take into account the energy expenditure involved. Even if a user is, in principle, willing to spend energy to improve network connectivity, his actual decision will be h ...
Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...
Wireless networking technologies allow computing devices to move while keeping them online, but the device mobility poses considerable technical challenges. Network designers, on the one hand, consider mobility to be harmful because it leads to dynamic and ...
This paper describes an on-going research effort to achieve real-time cooperative localization of multiple autonomous underwater vehicles. We describe a series of experiments that utilize autonomous surface craft (ASC), equiped with undersea acoustic modem ...
