[
    {
        "id": "authors:7tm6y-8ht67",
        "collection": "authors",
        "collection_id": "7tm6y-8ht67",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210510-080403337",
        "type": "monograph",
        "title": "Smoothed Least-Laxity-First Algorithm for EV Charging",
        "author": [
            {
                "family_name": "Chen",
                "given_name": "Niangjun",
                "orcid": "0000-0002-2289-9737",
                "clpid": "Chen-Niangjun"
            },
            {
                "family_name": "Kurniawan",
                "given_name": "Christian",
                "clpid": "Kurniawan-Christian"
            },
            {
                "family_name": "Nakahira",
                "given_name": "Yorie",
                "orcid": "0000-0003-3324-4602",
                "clpid": "Nakahira-Yorie"
            },
            {
                "family_name": "Chen",
                "given_name": "Lijun",
                "orcid": "0000-0001-6694-4299",
                "clpid": "Chen-Lijun"
            },
            {
                "family_name": "Low",
                "given_name": "Steven H.",
                "orcid": "0000-0001-6476-3048",
                "clpid": "Low-S-H"
            }
        ],
        "abstract": "Adaptive charging can charge electric vehicles (EVs) at scale cost effectively, despite the uncertainty in EV arrivals. We formulate adaptive EV charging as a feasibility problem that meets all EVs' energy demands before their deadlines while satisfying constraints in charging rate and total charging power. We propose an online algorithm, smoothed least-laxity-first (sLLF), that decides the current charging rates without the knowledge of future arrivals and demands. We characterize the performance of the sLLF algorithm analytically and numerically. Numerical experiments with real-world data show that it has a significantly higher rate of feasible EV charging than several other existing EV charging algorithms. Resource augmentation framework is employed to assess the feasibility condition of the algorithm. The assessment shows that the sLLF algorithm achieves perfect feasibility with only a 0.07 increase in resources.",
        "doi": "10.48550/arXiv.2102.08610",
        "publisher": "arXiv",
        "publication_date": "2021-02-17"
    },
    {
        "id": "authors:dd849-24158",
        "collection": "authors",
        "collection_id": "dd849-24158",
        "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:2007.003",
        "type": "monograph",
        "title": "Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks",
        "author": [
            {
                "family_name": "Cui",
                "given_name": "Tao",
                "clpid": "Cui-Tao"
            },
            {
                "family_name": "Chen",
                "given_name": "Lijun",
                "clpid": "Chen-Lijun"
            },
            {
                "family_name": "Ho",
                "given_name": "Tracey",
                "clpid": "Ho-Tracey"
            },
            {
                "family_name": "Low",
                "given_name": "Steven H.",
                "orcid": "0000-0001-6476-3048",
                "clpid": "Low-S-H"
            }
        ],
        "abstract": "We propose a jointly opportunistic source\ncoding and opportunistic routing (OSCOR) protocol for\ncorrelated data gathering in wireless sensor networks.\nOSCOR improves data gathering efficiency by exploiting\nopportunistic data compression and cooperative diversity\nassociated with wireless broadcast advantage. The design\nof OSCOR involves several challenging issues across different\nnetwork protocol layers. At MAC layer, sensor nodes\nneed to coordinate wireless transmission and packet forwarding\nto exploit multiuser diversity in packet reception.\nAt network layer, in order to achieve high diversity and\ncompression gains, routing must be based on a metric that\nis dependent on not only link-quality but also compression\nopportunities. At application layer, sensor nodes need a distributed\nsource coding algorithm that has low coordination\noverhead and does not require the source distributions to\nbe known. OSCOR provides practical solutions to these\nchallenges incorporating a slightly modified 802.11 MAC,\na distributed source coding scheme based on Lempel-Ziv\ncode and network coding, and a node compression ratio\ndependent metric combined with a modified Dijkstra\"s\nalgorithm for path selection. We evaluate the performance\nof OSCOR through simulations, and show that OSCOR\nreduces the number of transmissions by nearly 25%\ncompared with existing greedy scheme in small networks.",
        "doi": "10.7907/Z9G73BP6",
        "publisher": "California Institute of Technology",
        "publication_date": "2007-04-16"
    },
    {
        "id": "authors:3r82h-7hj05",
        "collection": "authors",
        "collection_id": "3r82h-7hj05",
        "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:2007.002",
        "type": "monograph",
        "title": "Distributed Optimization in Wireless Networks Using Broadcast Advantage",
        "author": [
            {
                "family_name": "Cui",
                "given_name": "Tao",
                "clpid": "Cui-Tao"
            },
            {
                "family_name": "Chen",
                "given_name": "Lijun",
                "clpid": "Chen-Lijun"
            },
            {
                "family_name": "Ho",
                "given_name": "Tracey",
                "clpid": "Ho-Tracey"
            }
        ],
        "abstract": "In this paper, we study cross-layer design for multicasting\nin wireless networks by exploiting broadcast advantage.\nWith network coding, a distributed subgradient algorithm for joint congestion control, session scheduling, and network coding is proposed, which requires a centralized scheduling algorithm in general. Under the primary interference model, we find that\nany valid link schedule corresponds to a hypergraph matching. To solve the scheduling problem distributedly, local greedy, randomized, and hybrid algorithms are proposed. We also modify the randomized algorithm into a constant-time algorithm. With random network coding, we obtain a fully distributed cross-layer design. Our experimental results show promising\nthroughput gain by using our proposed framework, in some cases with less complexity than cross-layer\ndesign without broadcast advantage.  Lastly, we also extend\nour framework to the case without network coding.",
        "doi": "10.7907/Z9BK19BR",
        "publisher": "California Institute of Technology",
        "publication_date": "2007-03-09"
    },
    {
        "id": "authors:9rz0z-ect67",
        "collection": "authors",
        "collection_id": "9rz0z-ect67",
        "cite_using_url": "https://resolver.caltech.edu/CaltechCDSTR:2006.004",
        "type": "monograph",
        "title": "Rate Control for Multicast with Network Coding",
        "author": [
            {
                "family_name": "Chen",
                "given_name": "Lijun",
                "clpid": "Chen-Lijun"
            },
            {
                "family_name": "Ho",
                "given_name": "Tracey",
                "clpid": "Ho-Tracey"
            },
            {
                "family_name": "Low",
                "given_name": "Steven",
                "orcid": "0000-0001-6476-3048",
                "clpid": "Low-S-H"
            },
            {
                "family_name": "Chiang",
                "given_name": "Mung",
                "clpid": "Chiang-Mung"
            },
            {
                "family_name": "Doyle",
                "given_name": "John",
                "orcid": "0000-0002-1828-2486",
                "clpid": "Doyle-J-C"
            }
        ],
        "abstract": "Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, we address the problem of rate control at end-systems for network coding based multicast flows. We develop two adaptive rate control algorithms for the networks with given coding subgraphs and without given coding subgraphs, respectively. With random network coding, both algorithms can be implemented in a distributed manner, and work at transport layer to adjust source rates and at network layer to carry out network coding. We prove that the proposed algorithms converge to the globally optimal solutions. Some related issues are discussed, and numerical examples are provided to complement our theoretical analysis.",
        "publisher": "California Institute of Technology",
        "publication_date": "2006-09-22"
    }
]