99. optimal packet aggregation in wireless networks

Department: Computer Science & Engineering
Faculty Advisor(s): Tajana S. Rosing

Primary Student
Name: Mihir Rajan Patankar
Email: mpatanka@ucsd.edu
Phone: 858-729-8245
Grad Year: 2017

Student Collaborators
Alper Sinan Akyurek, aakyurek@eng.ucsd.edu

Abstract
One of the most critical emerging problems for 5G and Internet of Things is the handling of machine-to-machine communication. Wireless sensor networks are deployed every day, resulting in a more distributed infrastructure, where the communication and processing are handled by energy, bandwidth, and processing constrained devices. Aggregation of multiple packets flowing over the same path increases spectral efficiency, energy efficiency, and resource utilization. In this work, we address the problem of determining the optimal waiting time to maximize the utility within the network. We provide a general framework, where the utility function can be user-defined for each individual application stream and packet. This allows the user to optimize for energy, delay or expiration rate in the resolution of individual streams. Our algorithm calculates the optimal time for any given condition on-the-fly and can adapt to changing conditions with low computational complexity. We also provide an optimal multi-hop distributed and scalable under congestion versions of our algorithm. Our simulations in ns3 show that we outperform state-of-the-art policies by 1.55x in terms of information freshness. Our solution reduces average power consumption by more than 60%. Our congestion-aware solution shows constant performance with increasing congestion levels, whereas the state-of-the-art solutions degrade by up to 70% under the same conditions.

Industry Application Area(s)
Energy/Clean technology | Internet, Networking, Systems

« Back to Posters or Search Results