![](https://dblp.uni-trier.de./img/logo.320x120.png)
![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
Computer Communications, Volume 124
Volume 124, June 2018
- Nesrine Khernane, Jean-François Couchot
, Ahmed Mostefaoui:
Maximum network lifetime with optimal power/rate and routing trade-off for Wireless Multimedia Sensor Networks. 1-16 - Cong Pu
, Sunho Lim, Byungkwan Jung, Jinseok Chae
:
EYES: Mitigating forwarding misbehavior in energy harvesting motivated networks. 17-30 - Hoang-Sy Nguyen
, Thanh-Sang Nguyen, Viet-Tri Vo, Miroslav Voznák
:
Hybrid full-duplex/half-duplex relay selection scheme with optimal power under individual power constraints and energy harvesting. 31-44 - Asya Mitseva, Andriy Panchenko, Thomas Engel:
The state of affairs in BGP security: A survey of attacks and defenses. 45-60 - Ahmed M. Khedr
, Walid Osamy
, Ahmed Salim
:
Distributed coverage hole detection and recovery scheme for heterogeneous wireless sensor networks. 61-75 - Gaofei Huang, Wanqing Tu
:
Joint power splitting and power allocation for two-way OFDM relay networks with SWIPT. 76-86 - A. Justin Gopinath, Nithya Balasubramanian:
Mathematical and simulation analysis of contention resolution mechanism for IEEE 802.11ah networks. 87-100 - Takanori Kudo, Tomotaka Kimura
, Yoshiaki Inoue, Hirohisa Aman
, Kouji Hirata:
Stochastic modeling of self-evolving botnets with vulnerability discovery. 101-110 - Vinod Kumar Verma
, Klimis S. Ntalianis, Surinder Singh, N. P. Pathak:
Data proliferation based estimations over distribution factor in heterogeneous wireless sensor networks. 111-118
![](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.