![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Ad Hoc Networks, Volume 115
Volume 115, April 2021
- Kaumudi Singh, Vasanth Kumar T., T. V. Prabhakar, Joy Kuri
:
Quick and efficient network access schemes for IoT devices. 102435 - Sreetama Mukherjee
, Sasthi C. Ghosh:
Scalable and fair resource sharing among 5G D2D users and legacy 4G users: A game theoretic approach. 102436 - Anuradha Ravi, Archan Misra
:
Practical server-side WiFi-based indoor localization: Addressing cardinality & outlier challenges for improved occupancy estimation. 102443 - Osama Ahmed Khashan
, Rami Ahmad, Nour Mahmoud Khafajah:
An automated lightweight encryption scheme for secure and energy-efficient communication in wireless sensor networks. 102448 - Marija Stojanova, Thomas Begin, Anthony Busson:
A Markov model for performance evaluation of channel bonding in IEEE 802.11. 102449 - Manoj Tolani
, Sunny
, Rajat Kumar Singh:
A Markov model for IEEE 802.15.4 MAC protocol with energy-efficient GTS utilization under saturated and unsaturated traffic conditions. 102452 - Zhiyang Zhao, Baoju Zhang, Bo Zhang, Cuiping Zhang, Man Wang, Wenrui Yan, Fengjuan Wang:
A novel optimization method for WSN based on mixed matrix decomposition of NMF and 2-SVD-QR. 102454 - Shivam Tiwari
, Sourish Gunesh Dhekane, Krishnam Vajra, Dip Sankar Banerjee
:
Semi-supervised subject recognition in low-modal sensor data. 102472
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.