default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVineeth Bala Sukumaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Debabrata Dalai
, Sarath Babu, Vineeth Bala Sukumaran, B. S. Manoj:
A Novel Space-Based Hosting Approach for Ultra Low Latency Web Services. IEEE Access 12: 142838-142862 (2024)- [j9]Minha Mubarak, Vineeth Bala Sukumaran:
On the Average and Distribution of Age of Information for Frameless ALOHA. IEEE Commun. Lett. 28(10): 2268-2272 (2024) - 2023
- [j8]K. Elangovan, Vineeth Bala Sukumaran, Anoop Chandrika Sreekantan:
Geometric Programming Assisted Conversion Time Reduction Technique Applied to a Multiregime-Based Digitizer for Wide Span Resistive Sensors. IEEE Trans. Instrum. Meas. 72: 1-4 (2023) - [c10]Thomaskutty Mathew, Simhadri Nani, Anoop C. S., Vineeth Bala Sukumaran:
Studies on Linearizing Direct-Digital Converter Schemes for Thermistors. I2MTC 2023: 1-6 - [c9]Simhadri Nani, Vineeth Bala Sukumaran, Anoop Chandrika Sreekantan:
Resistance Network Synthesis for Analog Thermistor-Linearizer Circuits using Differential Evolution and Graph Laplacian. ICST 2023: 1-6 - [c8]Sudarsanan A. K, Vineeth Bala Sukumaran, Chandra R. Murthy:
On the Optimal Tradeoff of Age of Information and Transmission Power for Point-to-Point Links. NCC 2023: 1-6 - [i5]Sudarsanan A. K, Vineeth Bala Sukumaran, Chandra R. Murthy:
Tradeoff of age-of-information and power under reliability constraint for short-packet communication with block-length adaptation. CoRR abs/2312.01364 (2023) - 2022
- [j7]Subham Saha, Harkirat Singh Makkar, Vineeth Bala Sukumaran, Chandra R. Murthy:
On the Relationship Between Mean Absolute Error and Age of Incorrect Information in the Estimation of a Piecewise Linear Signal Over Noisy Channels. IEEE Commun. Lett. 26(11): 2576-2580 (2022) - [j6]Vineeth Bala Sukumaran, Reuben Chacko Thomas:
On the Average Age-of-Information for Hybrid Multiple Access Protocols. IEEE Netw. Lett. 4(2): 87-91 (2022) - [j5]Vineeth Bala Sukumaran, Chandramani Singh:
Stability and average delay in delay tolerant networks with Poisson packet arrivals and buffered relay nodes. Perform. Evaluation 157-158: 102319 (2022) - [c7]Pratik Kar, Vineeth Bala Sukumaran, S. Sumitra:
On safe sequential optimization using posterior sampling. SPCOM 2022: 1-5 - [i4]Haritha K, Vineeth Bala Sukumaran, Chandramani Singh:
Slotted ALOHA and CSMA Protocols for FMCW Radar Networks. CoRR abs/2201.09030 (2022) - 2021
- [j4]Subham Saha, Vineeth Bala Sukumaran, Chandra R. Murthy:
On the Minimum Average Age of Information in IRSA for Grant-Free mMTC. IEEE J. Sel. Areas Commun. 39(5): 1441-1455 (2021) - [c6]Harshavardhana Togaleri Gowda, Pragya Shah, Vineeth Bala Sukumaran:
Design of Joint Relay Placement and Scheduling Algorithms for Time-Slotted Networks with Half-Duplex Constraints. COMSNETS 2021: 605-613
2010 – 2019
- 2018
- [j3]Amit Kumar, Vineeth Bala Sukumaran:
Scheduling Policies for Wireless Downlink With Correlated Random Connectivity and Multislot Reconfiguration Delay. IEEE Commun. Lett. 22(2): 384-387 (2018) - [c5]Vineeth Bala Sukumaran, Chandramani Singh:
Stability properties of delay tolerant networks with buffered relay nodes. WiOpt 2018: 1-6 - 2017
- [c4]Sarath Yasodharan, Vineeth Bala Sukumaran, Chandramani Singh:
Stability and delay analysis of delay tolerant networks with random message arrivals. COMSNETS 2017: 367-374 - 2016
- [j2]Vineeth Bala Sukumaran:
Bayesian Quickest Change Detection for Active Sensors. IEEE Commun. Lett. 20(11): 2229-2232 (2016) - 2015
- [j1]Vineeth Bala Sukumaran, Utpal Mukherji:
Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length. IEEE Trans. Inf. Theory 61(11): 6145-6167 (2015) - [c3]Vineeth Bala Sukumaran, Jobin Wilson, Prateek Kapadia:
On power-law decay exponents and Barabasi models for subscriber usage behaviour in mobile networks. NCC 2015: 1-6 - [i3]Vineeth Bala Sukumaran:
On the tradeoff of average delay, average service cost, and average utility for single server queues with monotone policies. CoRR abs/1503.06382 (2015) - 2013
- [i2]Vineeth Bala Sukumaran, Utpal Mukherji:
On the tradeoff of average delay and average power for fading point-to-point links with monotone policies. CoRR abs/1309.5686 (2013) - [i1]Vineeth Bala Sukumaran, Utpal Mukherji:
On the optimal tradeoff of average service cost rate, average utility rate, and average delay for the state dependent M/M/1 queue. CoRR abs/1311.0486 (2013) - 2011
- [c2]Vineeth Bala Sukumaran, Utpal Mukherji:
Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes. ISIT 2011: 1811-1815
2000 – 2009
- 2009
- [c1]Vineeth Bala Sukumaran, Utpal Mukherji:
Average-delay optimal policies for the point-to-point channel. WiOpt 2009: 1-10
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 2024-10-25 21:17 CEST 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:
