ARTÍCULO
TITULO

ACTIVE, PROGRAMMABLE, AND MOBILE CODE NETWORKING - ACTIVE ROUTING FOR AD HOC NETWORKS - Ad hoc networks are wireless multihop networks whose highly volatile topology makes the design and operation of a standard routing protocol hard. With an active networ

Tschudin    
Christian    
Lundgren    
Henrik    
Gulbrandsen    
Henrik    

Resumen

No disponible

 Artículos similares

       
 
Kiki Kananda, Dean Corio, Hafif Restu K., Hilmi Aziz, Topan Wira B., Diah A.     Pág. 100 - 106
Hydropower plants are increasingly being heard nowadays, but the growth is still very lacking, especially for residents living in rural and coastal areas. At present several efforts have been made by the government, including the existence of a system of... ver más

 
Ruihang Zhang, Jiayan Yang, Mu Jia, Tingting Zhang and Yachuan Bao    
Wireless localization and target sensing both rely on precise extraction of parameters such as signal amplitude, propagation delay, and Doppler shift from the received signals. Due to the high multi-path resolution and strong penetration, both localizati... ver más
Revista: Applied Sciences

 
Yiheng Zhou, Kainan Ma, Qian Sun, Zhaoyuxuan Wang and Ming Liu    
Over the past several decades, deep neural networks have been extensively applied to medical image segmentation tasks, achieving significant success. However, the effectiveness of traditional deep segmentation networks is substantially limited by the sma... ver más
Revista: Information

 
Laura Guimarães, António Paulo Carvalho, Pedro Ribeiro, Cláudia Teixeira, Nuno Silva, André Pereira, João Amorim and Luís Oliva-Teles    
Triops longicaudatus is a crustacean typically inhabiting temporary freshwater bodies in regions with a Mediterranean climate. These crustaceans are easily maintained in the laboratory and show a set of biological features that make them good candidates ... ver más
Revista: Water

 
Sanaz Gheibi, Tania Banerjee, Sanjay Ranka and Sartaj Sahni    
This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges... ver más
Revista: Algorithms