Stop the war!
Остановите войну!
for scientists:
default search action
Ad Hoc Networks, Volume 50
Volume 50, November 2016
- Chandramani Kishore Singh, Santosh Ramachandran, S. V. R. Anand, Malati Hegde, Anurag Kumar, Rajesh Sundaresan:
Neighbor oblivious and finite-state algorithms for circumventing local minima in geographic forwarding. 1-12 - Bertrand Ducourthial, Ahmed Mouhamadou Wade:
Dynamic p-graphs for capturing the dynamics of distributed systems. 13-22 - Carmen Delgado, José Ramón Gállego, María Canales, Jorge Ortín, Sonda Bousnina, Matteo Cesana:
On optimal resource allocation in virtual sensor networks. 23-40 - Stefano Rinaldi, Davide Della Giustina, Paolo Ferrari, Alessandra Flammini, Emiliano Sisinni:
Time synchronization over heterogeneous network for smart grid application: Design and characterization of a real case. 41-57 - Tassos Dimitriou, Mohamad Khattar Awad:
Secure and scalable aggregation in the smart grid resilient against malicious entities. 58-67 - Saeid Pourroostaei Ardakani, Julian A. Padget, Marina De Vos:
CBA: A cluster-based client/server data aggregation routing protocol. 68-87 - Mahmood Salehi, Azzedine Boukerche, Amir Darehshoorzadeh:
Modeling and performance evaluation of security attacks on opportunistic routing protocols for multihop wireless networks. 88-101 - Sourabh Bharti, Kiran Kumar Pattanaik:
Task requirement aware pre-processing and Scheduling for IoT sensory environments. 102-114 - Nicola Roberto Zema, Enrico Natalizio, Giuseppe Ruggeri, Michael Poss, Antonella Molinaro:
MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic. 115-127 - Thomas P. Hayes, Falah H. Ali:
Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks. 128-144
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.