default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAneek Adhya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Tushar Bose
, Nilesh Chatur, Mithun Mukherjee, Sandeep Verma, Aneek Adhya:
Traffic-Aware Optimal Multi-Beam Resource Allocation in 5G Networks Impaired by Rain and Foliage. IEEE Commun. Lett. 28(3): 612-616 (2024)- [j11]Nilesh Chatur, Tushar Bose, Aneek Adhya:
Planning Cost-Efficient FiWi Access Network With Joint Deployment of FWA and FTTH. IEEE Trans. Commun. 72(9): 5688-5703 (2024) - [j10]Tushar Bose, Nilesh Chatur, Sonil Baberwal, Aneek Adhya:
Caching and Computing Resource Allocation in Cooperative Heterogeneous 5G Edge Networks Using Deep Reinforcement Learning. IEEE Trans. Netw. Serv. Manag. 21(4): 4161-4178 (2024) - [c13]Gowtham Reddy N, Chandrima Debnath, Debashree Guha, Aneek Adhya, Manjunatha Mahadevappa:
Epileptic EEG Signals Classification Based on Multi-Criteria Decision Aid Classifier Ensemble Approach. NCC 2024: 1-6 - 2023
- [j9]Pramit Biswas, Md Shahbaz Akhtar, Sriparna Saha, Sudhan Majhi, Aneek Adhya:
Q-Learning-Based Energy-Efficient Network Planning in IP-Over-EON. IEEE Trans. Netw. Serv. Manag. 20(1): 3-13 (2023) - [c12]Sandeep Verma, Satnam Kaur, Aneek Adhya, Georges Kaddoum, Bouziane Brik:
CROP: Cluster-Based Routing Using Optimized Framework for IoT-Based Precision Agriculture. ICC 2023: 4725-4730 - [c11]Sandeep Verma, Aneek Adhya:
DAAPEO: Detect and Avoid Path Planning for UAV-Assisted 5G Enabled Energy-Optimized IoT. INFOCOM Workshops 2023: 1-6 - 2022
- [j8]Nilesh Chatur, Aneek Adhya:
TDM-PON and LTE-A Based Cost-Efficient FiWi Access Network Deployment. IEEE Commun. Lett. 26(11): 2685-2689 (2022) - [c10]Harsimran Singh, Sandeep Verma, Aneek Adhya:
A Brief Review on Position-based Routing Protocols in Flying Ad-hoc Networks. IC3I 2022: 1423-1428 - [c9]Sandeep Verma, Md Shahbaz Akhtar, Aneek Adhya, Varun G. Menon:
Towards energy-efficient UAV-assisted 5G internet of underwater things. DroneCom@MobiCom 2022: 1-6 - 2021
- [j7]Jitendra Gupta, Md Shahbaz Akhtar, Aneek Adhya, Sudhan Majhi:
Optimal planning and design of SRLG-aware survivable LR-PON for wireless and FTTx networks. Comput. Networks 194: 108142 (2021) - [j6]Pramit Biswas, Aneek Adhya:
Energy-efficient, EDFA lifetime-aware network planning along with virtualized elastic regenerator placement for IP-over-EON. Photonic Netw. Commun. 41(2): 119-135 (2021) - [i1]Pramit Biswas, Md Shahbaz Akhtar, Aneek Adhya, Sriparna Saha, Sudhan Majhi:
Q-Learning Based Energy-Efficient Network Planning in IP-over-EON. CoRR abs/2111.10658 (2021) - 2020
- [c8]Md Shahbaz Akhtar, Pramit Biswas, Aneek Adhya, Sudhan Majhi:
Cost-efficient Mobile Backhaul Network Design over TWDM-PON. IEEE ANTS 2020: 1-6
2010 – 2019
- 2019
- [c7]Pramit Biswas, Aneek Adhya, Shabaz Akhtar, Jitendra Gupta, Sudhan Majhi:
EDFA Active-sleep Transition Frequency and EDFA Occupancy Aware Dynamic Traffic Provisioning for Energy-efficient IP-over-EON. ICSPCS 2019: 1-7 - [c6]Jitendra Gupta, Aneek Adhya:
A Novel Design of Cost-Efficient Long-Reach Survivable Wireless-Optical Broadband Access Network. VTC Fall 2019: 1-7 - 2018
- [c5]Jitendra Gupta, Aneek Adhya:
A Novel Fiber-Constrained Protection Scheme for Passive Optical Networks. ICACCI 2018: 1358-1361 - [c4]Jitendra Gupta, Aneek Adhya:
Novel Architectures to Enhance QoS in Long-Reach Passive Optical Networks. ICACCI 2018: 1362-1365 - 2016
- [j5]Suman Kr. Dey, Aneek Adhya:
Delay-Aware Green Service Migration Schemes for Data Center Traffic. JOCN 8(12): 962-976 (2016) - [j4]Jitendra Gupta, Aneek Adhya:
Clustering-based multi-hop protection scheme for long-reach passive optical network against single shared-risk link group failure. Photonic Netw. Commun. 32(3): 372-385 (2016) - [c3]Pramit Biswas, Suman Kr. Dey, Aneek Adhya:
Auxiliary graph based energy-efficient dynamic connection grooming for elastic optical networks. ANTS 2016: 1-3 - 2015
- [j3]Suman Kr. Dey, Aneek Adhya:
IP-Over-WDM Network Design Methodology to Improve Efficiency in Overall Expenditure Due to Cost and Energy Consumption. JOCN 7(6): 563-577 (2015) - [c2]Jitendra Gupta, Aneek Adhya:
A cost-efficient protection scheme for service recovery against single shared-risk link group failure in long-reach passive optical network. IEEE ANTS 2015: 1-6 - 2014
- [c1]Suman Kr. Dey, Aneek Adhya:
Design of CapEx-efficient IP-over-WDM network using auxiliary matrix based heuristic. IEEE ANTS 2014: 1-6 - 2012
- [j2]Aneek Adhya, Debasish Datta:
Lightpath Topology Design for Wavelength-Routed Optical Networks in the Presence of Four-Wave Mixing. JOCN 4(4): 314-325 (2012)
2000 – 2009
- 2009
- [j1]Aneek Adhya, Debasish Datta:
Design methodology for WDM backbone networks using FWM-aware heuristic algorithm. Opt. Switch. Netw. 6(1): 10-19 (2009)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
