Works (45)
Updated: July 5th, 2023 16:04
2015 journal article
ACMI: FM-Based Indoor Localization via Autonomous Fingerprinting
IEEE TRANSACTIONS ON MOBILE COMPUTING, 15(6), 1318–1332.
author keywords: Indoor localization; FM signal; signal fingerprint; pattern matching
TL;DR:
ACMI constructs the fingerprint database based on pure estimation of indoor received signal strength (RSS) distribution, where only the signals transmitted from commercial FM radio stations are used.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science; OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2015 conference paper
An unobtrusive interaction interface for multiple co-located mobile devices
Ieee international conference on wireless and mobile computing, 683–690.
TL;DR:
It is found that highly time-correlated Wi-Fi signal measures experience less variation in their received signal strength (RSS), which alleviates the impediment of the RSS-based solution.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2015 journal article
DRWA: A receiver-centric solution to bufferbloat in cellular networks
IEEE Transactions on Mobile Computing, 15(11), 2719–2734.
TL;DR:
Detailed measurement of the 3G/4G networks of the four major U.S. carriers and the largest carrier in Korea revealed the severity of bufferbloat in current cellular networks and discovered some ad-hoc tricks adopted by smart phone vendors, which mitigate the impact ofbufferbloat but result in performance degradation under various practical scenarios.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: NC State University Libraries
Added: August 6, 2018
2015 journal article
Platys: From Position to Place-Oriented Mobile Computing
AI MAGAZINE, 36(2), 50–62.
Contributors: n, T. Finin *, L. Zavala*, A. Joshi *, N. Poosamani n, P. Murukannaiah n, M. Singh n
TL;DR:
The Platys project focuses on developing a high-level, semantic notion of location called place that enables the construction of a large variety of applications that take advantage of place to render relevant content and functionality and thus, improve user experience.
(via Semantic Scholar)
open access via aaai.org (publisher PDF)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2015 conference paper
Towards a practical indoor location matching system using 4G LTE PHY layer information
2015 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM workshops), 284–287.
TL;DR:
Physical (PHY) layer information from 4G cellular network signals such as Reference Signal Received Power (RSRP) and Reference Signal received Quality (RSRQ) are used to logically predict user location to show promise for improvements in current indoor localization systems using cellular signals.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018
2014 journal article
Max Contribution: An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks
IEEE TRANSACTIONS ON MOBILE COMPUTING, 14(3), 592–605.
author keywords: Resource allocation; routing; scheduling; optimality; delay tolerant network; mobile ad hoc network
TL;DR:
A new notion of approximation to the optimality for DTNs, called snapshot approximation where nodes are not clairvoyant, i.e., not looking ahead into future events, and thus decisions are made using only contemporarily available knowledges is defined.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2014 journal article
N-body: A social mobility model with support for larger populations
AD HOC NETWORKS, 25, 185–196.
author keywords: Mobility model; Network generation; Ad hoc networks
TL;DR:
Through simulation, the N-body model is shown to be capable of synthesizing the group forming behavior similar to that observed from sample traces, and to be able to capture real world mobility features from traces of a small number of nodes and synthesize traces that have similar features.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities
(OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2013 journal article
An improved hop-by-hop interest shaper for congestion control in named data networking
Computer Communication Review, 43(4).
TL;DR:
This paper points out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm, and formulates it as an optimization problem to obtain the optimal shaping rate.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2013 journal article
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks
COMPUTER NETWORKS, 59, 184–196.
author keywords: Delay Tolerant Networks; Opportunistic forwarding; Routing
TL;DR:
This paper proposes a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes and shows that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2013 conference paper
QuickSense: Fast and energy-efficient channel sensing for dynamic spectrum access networks
2013 proceedings ieee infocom, 2247–2255.
TL;DR:
An analog-filter based spectrum sensing technique, which is much faster than sequential scan and much cheaper than using a wideband radio, is proposed and it is proved that the algorithm has the same asymptotic complexity as compressed sensing.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018
2012 journal article
Mobile Data Offloading: How Much Can WiFi Deliver?
IEEE-ACM TRANSACTIONS ON NETWORKING, 21(2), 536–550.
author keywords: Delayed transmission; experimental networks; mobile data offloading; mobility
TL;DR:
A trace-driven simulation using the acquired whole-day traces indicates that WiFi already offloads about 65% of the total mobile data traffic and saves 55% of battery power without using any delayed transmission.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2012 journal article
On the Critical Delays of Mobile Networks Under Levy Walks and Levy Flights
IEEE-ACM TRANSACTIONS ON NETWORKING, 21(5), 1621–1635.
author keywords: Critical delay; delay-capacity tradeoff; human mobility; Levy mobility; network performance scaling
TL;DR:
Analytically derives an important point in the delay-capacity tradeoff for Lévy mobility, known as the critical delay, by analyzing the joint spatio-temporal probability density function of a time-varying location of a node for Le⩽vy flight and characterizing an embedded Markov process in Lêvy walk, which is a semi-Markov process.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2012 conference paper
Reducing redundant cross-ISP traffic in peer-to-peer systems via explicit coordination
2012 ieee consumer communications and networking conference (ccnc), 603–607.
TL;DR:
This paper proposes a fine-grained mechanism called Swarm-over-Swarm (SOS), which is much more effective in reducing redundant cross-ISP traffic than existing schemes and implemented in both NS-2 and a real BitTorrent client.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2011 conference paper
Contrabass: Concurrent transmissions without coordination for ad hoc networks
2011 proceedings ieee infocom, 1134–1142.
TL;DR:
Contrabass is the first-to-date open-loop based concurrent transmission protocol which implements simultaneous channel training for concurrently transmitting links without any control message exchange and maximizes the number of successful concurrent transmissions.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2011 conference paper
Delay-capacity tradeoffs for mobile networks with levy walks and levy flights
2011 proceedings ieee infocom, 3128–3136.
TL;DR:
The asymptotic characterization of the joint spatio-temporal probability density functions of Lévy models, the order of critical delay, the minimum delay required to achieve more throughput than Θ(1/√n) where n is the number of nodes in the network, is obtained.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2011 journal article
On the Levy-Walk Nature of Human Mobility
IEEE-ACM TRANSACTIONS ON NETWORKING, 19(3), 630–643.
author keywords: Delay-tolerant network (DTN); human mobility; Levy walk; mobile ad hoc network (MANET); mobile network; mobility model
TL;DR:
It is shown that many statistical features of human walks follow truncated power-law, showing evidence of scale-freedom and do not conform to the central limit theorem.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2011 journal article
SLAW: Self-Similar Least-Action Human Walk
IEEE-ACM TRANSACTIONS ON NETWORKING, 20(2), 515–529.
author keywords: Delay-tolerant network; human mobility; Levy walk; mobile ad hoc network; mobile network; mobility model
TL;DR:
The main contribution of this paper is to present a mobility model called Self-similar Least-Action Walk (SLAW) that can produce synthetic mobility traces containing all the five statistical features in various mobility settings including user-created virtual ones for which no empirical information is available.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2011 journal article
Taming the elephants: New TCP slow start
COMPUTER NETWORKS, 55(9), 2092–2110.
author keywords: Slow start; Congestion control; Linux slow start; SACK processing; High-speed TCP protocols
TL;DR:
A new slow start algorithm, called Hybrid Start (HyStart), is proposed, that finds a ''safe'' exit point for slow start at which it can terminate and safely advance to the congestion avoidance phase without causing heavy packet loss.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2010 journal article
Implementation and experimental evaluation of multi-channel MAC protocols for 802.11 networks
AD HOC NETWORKS, 8(6), 626–639.
author keywords: CSMA/CA; IEEE 802.11; Multi-channel MAC; Experimentation; Performance evaluation
Source: Web Of Science
Added: August 6, 2018
2010 conference paper
Mobile data offloading: How much can WiFi deliver?
Computer Communication Review, 40(4), 425–426.
Source: NC State University Libraries
Added: August 6, 2018
2009 journal article
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
IEEE TRANSACTIONS ON MOBILE COMPUTING, 8(10), 1384–1396.
author keywords: Wireless ad hoc networks; medium access control; network performance
Source: Web Of Science
Added: August 6, 2018
2009 article
DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, pp. 262–270.
TL;DR:
This work is the first that implements in real off-shelf radios, a differential backlog based MAC scheduling and router-assisted backpressure congestion control for multi-hop wireless networks, called DiffQ, which is implemented between transport and IP and supports legacy TCP and UDP applications.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2009 article
Multicast Scheduling in Cellular Data Networks
Won, H., Cai, H., Eun, D. Y., Guo, K., Netravali, A., Rhee, I., & Sabnani, K. (2009, September). IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, Vol. 8, pp. 4540–4549.
author keywords: Multicast scheduling; 3G; downlink schedule; optimization; proportional fair; cellular data networks
TL;DR:
It is proved that IPF and MPF achieve proportional fairness among groups and among all users in a group inside a cell respectively and that these algorithms achieve good balance between throughput and fairness among users and groups.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2008 article
Dual-resource TCP/AQM for processing-constrained networks
Shin, M., Chong, S., & Rhee, I. (2008, April). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 16, pp. 435–449.
author keywords: CPU capacity; efficiency; fairness; proportional fairness; TCP-AQM; transmission link capacity
TL;DR:
A notion of dual-resource proportional fairness is established and an AQM scheme is proposed, called Dual-Resource Queue (DRQ), that can closely approximate proportional fairness for TCP Reno sources with in-network processing requirements.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2008 conference paper
On the Levy-walk nature of human mobility
27th IEEE Conference on Computer Communications (Infocom), vols 1-5, 1597–1605.
Source: NC State University Libraries
Added: August 6, 2018
2008 journal article
Stochastic convex ordering for multiplicative decrease internet congestion control
COMPUTER NETWORKS, 53(3), 365–381.
author keywords: High-speed TCP; Convex ordering; Window growth function
TL;DR:
A new stochastic tool, called convex ordering, is presented that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2008 journal article
Z-MAC: A hybrid MAC for wireless sensor networks
IEEE-ACM TRANSACTIONS ON NETWORKING, 16(3), 511–524.
author keywords: CSMA; MAC; TDMA; wireless sensor networks
TL;DR:
Z-MAC is a hybrid MAC protocol for wireless sensor networks that combines the strengths of TDMA and CSMA while offsetting their weaknesses and achieves high channel utilization under high contention and reduces collision among two-hop neighbors at a low cost.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2007 journal article
How much energy saving does topology control offer for wireless sensor networks? - A practical study
COMPUTER COMMUNICATIONS, 30(14-15), 2867–2879.
author keywords: topology control; wireless sensor networks; cluster
TL;DR:
This paper proposes a new topology control protocol simple enough to permit a straightforward stochastic analysis and also a real implementation in Mica2, and reveals thatTopology control can achieve a power gain proportional to network density divided by a factor of eight to ten.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2007 article
Limitations of equation-based congestion control
Rhee, I., & Xu, L. (2007, August). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 15, pp. 852–865.
author keywords: congestion control; equation-based rate control
TL;DR:
It is found that the loss event rate difference due to the differing sending rates greatly amplifies the initial throughput difference; in some extreme cases, TFRC uses around 20 times more, or sometimes 10 times less, bandwidth than TCP.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2007 patent
Methods and systems for rate-based flow control between a sender and a receiver
Washington, DC: U.S. Patent and Trademark Office.
Source: NC State University Libraries
Added: August 6, 2018
2006 journal article
Impact of background traffic on performance of high-speed TCP variant protocols
Computer Networks (Amsterdam, Netherlands : 1999), 51(7), 1748–1762.
TL;DR:
The stability, link utilization, convergence speed and fairness of the protocols are clearly affected by the variability of flow sizes and round-trip times (RTTs), and the amount of background flows competing with high-speed flows in a bottleneck router.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: NC State University Libraries
Added: August 6, 2018
2005 article
Limitations of equation-based congestion control
Rhee, I., & Xu, L. S. (2005, October). ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, Vol. 35, pp. 49–60.
author keywords: congestion control; equation-based rate control
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2003 journal article
Delay-based congestion avoidance for TCP
IEEE-ACM TRANSACTIONS ON NETWORKING, 11(3), 356–369.
author keywords: TCP congestion control; delay-based congestion avoidance (DCA); TCP/Vegas; loss and round-trip time (RTT) correlation patterns
TL;DR:
This research focuses on delay-based congestion avoidance algorithms (DCA), like TCP/Vegas, which attempt to utilize the congestion information contained in packet round-trip time (RTT) samples, and shows evidence suggesting that a single deployment of DCA is not a viable enhancement to TCP over high-speed paths.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2003 journal article
The impact of timing knowledge on the session problem
SIAM JOURNAL ON COMPUTING, 32(4), 1007–1039.
author keywords: session problem; partially synchronous models; timing information; distributed computing; upper bounds; lower bounds
TL;DR:
A modular proof technique for obtaining asymptotically tight bounds on the time complexity of the session problem for the four shared memory models and the 16 message passing models is presented.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2002 journal article
MTCP: scalable TCP-like congestion control for reliable multicast
COMPUTER NETWORKS, 38(5), 553–575.
Contributors: N. Balaguru n, n & G. Rouskas n
author keywords: reliable multicast; congestion control
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2001 journal article
Multicast with cache (Mcache): An adaptive zero-delay video-on-demand service
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 11(3), 440–456.
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2000 journal article
Error recovery for interactive video transmission over the Internet
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 18(6), 1033–1049.
author keywords: computer network protocols; error propagation; forward error correction; interactive video transmission; packet loss recovery; retransmission
TL;DR:
The study indicates that RESCU is effective in alleviating the error spread problem and can sustain much better video quality with less bit overhead than existing video error recovery techniques under various network environments.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2000 patent
Method and systems for dynamic hybrid packet loss recovery for video transmission over lossy packet-based network
Washington, DC: U.S. Patent and Trademark Office.
Source: NC State University Libraries
Added: August 6, 2018
2000 patent
Methods and systems for forward error correction based loss recovery for interactive video transmission
Washington, DC: U.S. Patent and Trademark Office.
Source: NC State University Libraries
Added: August 6, 2018
2000 journal article
Quadtree-structured variable-size block-matching motion estimation with minimal error
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 10(1), 42–50.
author keywords: dynamic programming; motion estimation; quadtree; variable-size block matching; video compression
TL;DR:
Two efficient quadtree-based algorithms for variable-size block matching (VSBM) motion estimation that employ an efficient dynamic programming technique utilizing the special structure of a quadtree and a heuristic way to select variable-sized square blocks are reported.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2000 patent
System and method of error control for interactive low-bit rate video transmission
Washington, DC: U.S. Patent and Trademark Office.
Source: NC State University Libraries
Added: August 6, 2018
1999 journal article
Collaboration - Internet-style
IEEE Internet Computing, 3(2), 30–32.
Source: NC State University Libraries
Added: August 6, 2018
1999 journal article
Middleware support for distributed multimedia and collaborative computing
Software, Practice & Experience, 29(14), 1285–1312.
Source: NC State University Libraries
Added: August 6, 2018
1998 journal article
A modular algorithm for resource allocation
DISTRIBUTED COMPUTING, 11(3), 157–168.
author keywords: dining philosophers; resource allocation; modular construction; concurrency; message passing distributed systems
TL;DR:
An efficient modular resource allocation algorithms is presented that uses any arbitrary resource allocation algorithm as a subroutine that improves the performance of the subr routine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
1997 journal article
Time bounds on synchronization in a periodic distributed system
INFORMATION PROCESSING LETTERS, 64(2), 87–93.
author keywords: distributed computing; time bounds; session problem; periodic model
TL;DR:
Nearly matching upper and lower bounds are shown on the time complexity of the session problem in the periodic model, indicating the inherent cost of synchronizing periodic processes in shared memory distributed systems, and the existence of time complexity gaps among the synchronous, periodic, and asynchronous timing models.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.