default search action
Clement Kam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c34]Clement Kam, Joseph P. Macker, Caleb Bowers, Sastry Kompella:
The Throughput and Detectability Tradeoff in a Wireless Ad Hoc Network. ICC 2024: 1727-1732 - [c33]Michael V. Lipski
, Clement Kam
Age of Channel State Information for Collaborative Beamforming. MobiHoc 2024: 392-397 - [i5]Siqi Fan, Yuxin Zhong, I-Hong Hou, Clement Kai-Ming Kam:
Optimizing Age of Information in Random Access Networks: A Second-Order Approach for Active/Passive Users. CoRR abs/2406.00491 (2024) - [i4]Daojing Guo, Khaled Nakhleh, I-Hong Hou, Sastry Kompella, Clement Kam:
AoI, Timely-Throughput, and Beyond: A Theory of Second-Order Wireless Network Optimization. CoRR abs/2407.15983 (2024) - 2023
- [c32]Siqi Fan, Yuxin Zhong, I-Hong Hou, Clement Kam:
Minimizing Moments of AoI for Both Active and Passive Users through Second-Order Analysis. ISIT 2023: 951-956 - [c31]Tasmeen Zaman Ornee, Md Kamran Chowdhury Shisher
Context-aware Status Updating: Wireless Scheduling for Maximizing Situational Awareness in Safety-critical Systems. MILCOM 2023: 194-200 - [i3]Siqi Fan, Yuxin Zhong, I-Hong Hou, Clement Kam:
Minimizing Moments of AoI for Both Active and Passive Users through Second-Order Analysis. CoRR abs/2305.05137 (2023) - [i2]Tasmeen Zaman Ornee, Md Kamran Chowdhury Shisher, Clement Kam, Yin Sun:
Context-aware Status Updating: Wireless Scheduling for Maximizing Situational Awareness in Safety-critical Systems. CoRR abs/2310.06224 (2023) - 2022
- [c30]Daojing Guo, Khaled Nakhleh, I-Hong Hou, Sastry Kompella, Clement Kam:
A Theory of Second-Order Wireless Network Optimization and Its Application on AoI. INFOCOM 2022: 999-1008 - [c29]Clement Kam, Sastry Kompella, Anthony Ephremides:
The Impact of Network State AoI on Throughput in a Wireless SDN. WiOpt 2022: 49-56 - [i1]Daojing Guo, Khaled Nakhleh, I-Hong Hou, Sastry Kompella, Clement Kam:
A Theory of Second-Order Wireless Network Optimization and Its Application on AoI. CoRR abs/2201.06486 (2022) - 2021
- [c28]Joseph P. Macker, Caleb Bowers, Sastry Kompella
Wireless Network Topology Control: Adjustable Resiliency and Network Traffic Delivery. MILCOM 2021: 1-6 - [c27]Clement Kam, Sastry Kompella
The Role of AoI in a Cognitive Radio Network: Lyapunov Optimization and Tradeoffs. MILCOM 2021: 303-308 - [c26]Clement Kam, Joseph P. Macker, Caleb Bowers, Sastry Kompella
Ad Hoc Networking Under Limitations on Sum Power Interference to an External Node. MILCOM 2021: 830-835 - [c25]Clement Kai-Ming Kam, Sastry Kompella
Age of Sensed Information in a Cognitive Radio Network. WiOpt 2021: 161-168 - 2020
- [c24]Clement Kam, Sastry Kompella
Age of Incorrect Information for Remote Estimation of a Binary Markov Source. INFOCOM Workshops 2020: 1-6
2010 – 2019
- 2019
- [j9]Gam D. Nguyen, Sastry Kompella
Information freshness over a Markov channel: The effect of channel state information. Ad Hoc Networks 86: 63-71 (2019) - [j8]Sastry Kompella
Special issue on age of information. J. Commun. Networks 21(3): 201-203 (2019) - [c23]Clement Kam, Sastry Kompella
Learning to Sample a Signal through an Unknown System for Minimum AoI. INFOCOM Workshops 2019: 177-182 - 2018
- [j7]Gam D. Nguyen
Impact of Hostile Interference on Wireless Link Connectivity. IEEE Trans. Control. Netw. Syst. 5(3): 1445-1456 (2018) - [j6]Clement Kam
On the Age of Information With Packet Deadlines. IEEE Trans. Inf. Theory 64(9): 6419-6428 (2018) - [c22]Clement Kam, Sastry Kompella
Towards an effective age of information: Remote estimation of a Markov source. INFOCOM Workshops 2018: 367-372 - [c21]Gam D. Nguyen, Sastry Kompella
Information Freshness Over an Interference Channel: A Game Theoretic View. INFOCOM 2018: 908-916 - [c20]Clement Kam, Joseph P. Molnar
Age of Information for Queues in Tandem. MILCOM 2018: 1-6 - [c19]Clement Kam, Sastry Kompella
Towards an "Effective Age" Concept. SPAWC 2018: 1-5 - 2017
- [c18]Clement Kam, Sastry Kompella
Information freshness and popularity in mobile caching. ISIT 2017: 136-140 - [c17]Clement Kam, Sastry Kompella
Modeling the age of information in emulated ad hoc networks. MILCOM 2017: 436-441 - [c16]Gam D. Nguyen, Sastry Kompella
Impact of hostile interference on information freshness: A game approach. WiOpt 2017: 1-7 - 2016
- [j5]Clement Kam, Sastry Kompella
Effect of Message Transmission Path Diversity on Status Age. IEEE Trans. Inf. Theory 62(3): 1360-1374 (2016) - [c15]Clement Kam, Sastry Kompella
Age of information with a packet deadline. ISIT 2016: 2564-2568 - [c14]Clement Kam, Sastry Kompella
Controlling the age of information: Buffer size, deadline, and packet replacement. MILCOM 2016: 301-306 - [c13]Gam D. Nguyen, Sastry Kompella
Wireless link connectivity under hostile interference: Nash and stackelberg equilibria. WiOpt 2016: 290-297 - 2015
- [c12]Clement Kam, Sastry Kompella
SINR-based scheduling for minimum latency broadcast. ICC 2015: 6252-6257 - [c11]Clement Kam, Sastry Kompella
Experimental evaluation of the age of information via emulation. MILCOM 2015: 1070-1075 - [c10]Gam D. Nguyen, Sastry Kompella
Minimum-energy link scheduling for emptying wireless networks. WiOpt 2015: 207-212 - 2014
- [j4]Clement Kam, Sastry Kompella
Cognitive Cooperative Random Access for Multicast: Stability and Throughput Analysis. IEEE Trans. Control. Netw. Syst. 1(2): 135-144 (2014) - [j3]Sastry Kompella
Cooperation in Cognitive Underlay Networks: Stable Throughput Tradeoffs. IEEE/ACM Trans. Netw. 22(6): 1756-1768 (2014) - [j2]Gam D. Nguyen, Sastry Kompella
Achievable Throughput under BER Constraints via Transmission Scheduling and Multiuser Detection. IEEE Trans. Wirel. Commun. 13(1): 124-131 (2014) - [c9]Clement Kam, Sastry Kompella
Effect of message transmission diversity on status age. ISIT 2014: 2411-2415 - [c8]Gam D. Nguyen, Sastry Kompella
Impact of channel state information on energy efficient transmission in interference channels. WiOpt 2014: 474-481 - 2013
- [c7]Clement Kam, Sastry Kompella
Multicast throughput stability analysis for cognitive cooperative random access. INFOCOM 2013: 170-174 - [c6]Clement Kam, Sastry Kompella
Age of information under random updates. ISIT 2013: 66-70 - [c5]Clement Kam, Sastry Kompella
On Optimal Wireless Scheduling with Propagation Delays. MILCOM 2013: 406-411 - 2012
- [c4]Clement Kam, Sastry Kompella
Optimal frequency selection for energy efficient underwater acoustic networks. ICC 2012: 387-391 - [c3]Clement Kam, Sastry Kompella
Wireless multicast with cooperative relaying. MILCOM 2012: 1-6 - 2011
- [j1]Clement Kam, Curt Schurgers:
ConverSS: A Hybrid MAC/Routing Solution for Small-Scale, Convergecast Wireless Networks. IEEE Trans. Mob. Comput. 10(9): 1227-1236 (2011) - [c2]Clement Kam, Sastry Kompella
Impact of relay placement on energy efficiency in Underwater Acoustic Networks. MILCOM 2011: 424-429 - 2010
- [b1]Clement Kam:
Energy efficient strategies for wireless sensor networks with varying connectivity properties. University of California, San Diego, USA, 2010
2000 – 2009
- 2009
- [c1]Clement Kam, Curt Schurgers:
TreeDMA: a hybrid MAC/routing solution for small-scale wireless networks. MobiQuitous 2009: 1-8
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-23 20:32 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: