More Like this

1. Using Quantization to Deploy Heterogeneous Nodes in Two-Tier Wireless Sensor Networks

   Karimi-Bidhendi, S.; Guo, J.; Jafarkhani, H. (July 2019, IEEE International Symposium on Information Theory (ISIT-19))

   We study a heterogeneous two-tier wireless sensor network in which N heterogeneous access points (APs) collect sensing data from densely distributed sensors and then forward the data to M heterogeneous fusion centers (FCs). This heterogeneous node deployment problem is modeled as a quantization problem with distortion defined as the total power consumption of the network. The necessary conditions of the optimal AP and FC node deployment are explored in this paper. We provide a variation of Voronoi diagrams as the optimal cell partition for this network, and show that each AP should be placed between its connected FC and the geometric center of its cell partition. In addition, we propose a heterogeneous two-tier Lloyd-like algorithm to optimize the node deployment. Simulation results show that our proposed algorithm outperforms the existing methods like Minimum Energy Routing, Agglomerative Clustering, and Divisive Clustering, on average. 

   more » « less
2. LS-AODV: An Energy Balancing Routing Algorithm For Mobile Ad Hoc Networks

   https://doi.org/10.1109/IEMCON53756.2021.9623217  

   Lane, Cameron; Smith, Calvin Jarrod; Wang, Nan (October 2021, IEEE IEMCON 2021)

   Battery-powered computing solutions have grown in importance and utility across a wide range of applications in the technology industry, including both consumer and industrial uses. Devices that are not attached to a stable and constant power source must ensure that all power consumption is minimized while necessary computation and communications are performed. WiFi networking is ubiquitous in modern devices, and thus the power consumption necessary to transmit data is of utmost concern for these battery powered devices. The Ad hoc OnDemand Distance Vector (AODV) routing algorithm is a widely adopted and adapted routing system for path finding in wireless networks. AODV’s original implementation did not include power consumption as a consideration for route determinations. The Energy Aware AODV (EA-AODV) algorithm was an attempt to account for energy conservation by varying broadcast power and choosing paths with distance between nodes as a consideration in routing. Lightning Strike AODV (LS-AODV) described in this paper is a proposed routing algorithm that further accounts for energy consumption in wireless networking by balancing energy in a network. Quality of service is maintained while energy levels are increased through networks using the LS-AODV algorithm. 

   more » « less
3. Optimal Cache Allocation under Network-Wide Capacity Constraint

   https://doi.org/10.1109/ICCNC.2019.8685587  

   Mai, Van Sy; Ioannidis, Stratis; Pesavento, Davide; Benmohamed, Lotfi (April 2019, 2019 International Conference on Computing, Networking and Communications (ICNC))

   Network cache allocation and management are important aspects of an Information-Centric Network (ICN) design, such as one based on Named Data Networking (NDN). We address the problem of optimal cache size allocation and content placement in an ICN in order to maximize the caching gain resulting from routing cost savings. While prior art assumes a given cache size at each network node and focuses on content placement, we study the problem when a global, network-wide cache storage budget is given and we solve for the optimal per-node cache allocation. This problem arises in cloud-based network settings where each network node is virtualized and housed within a cloud data center node with associated dynamic storage resources acquired from the cloud node as needed. As the offline centralized version of the optimal cache allocation problem is NP-hard, we develop a distributed adaptive algorithm that provides an approximate solution within a constant factor from the optimal. Performance evaluation of the algorithm is carried out through extensive simulations over multiple network topologies, demonstrating that our proposal significantly outperforms existing cache allocation algorithms. 

   more » « less
4. Optimizing Sectorized Wireless Networks: Model, Analysis, and Algorithm

   Promponas, Panagiotis; Chen, Tingjun; Tassiulas, Leandros (October 2023, ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc’23))

   Future wireless networks need to support the increasing demands for high data rates and improved coverage. One promising solution is sectorization, where an infrastructure node (e.g., a base station) is equipped with multiple sectors employing directional communication. Although the concept of sectorization is not new, it is critical to fully understand the potential of sectorized networks, such as the rate gain achieved when multiple sectors can be simultaneously activated. In this paper, we focus on sectorized wireless networks, where sectorized infrastructure nodes with beam-steering capabilities form a multi-hop mesh network for data forwarding and routing. We present a sectorized node model and characterize the capacity region of these sectorized networks. We define the flow extension ratio and the corresponding sectorization gain, which quantitatively measure the performance gain introduced by node sectorization as a function of the network flow. Our objective is to find the optimal sectorization of each node that achieves the maximum flow extension ratio, and thus the sectorization gain. Towards this goal, we formulate the corresponding optimization problem and develop an efficient distributed algorithm that obtains the node sectorization under a given network flow with an approximation ratio of 2/3. Through extensive simulations, we evaluate the sectorization gain and the performance of the proposed algorithm in various network scenarios with varying network flows. The simulation results show that the approximate sectorization gain increases sublinearly as a function of the number of sectors per node. 

   more » « less
5. Networkless Wireless Sensing for Bridge Structural Health Monitor

   Afonso, B.; Liu, H.; Yu, Z. (September 2022, IEEE/MIT Undergraduate Research Technology Conference (URTC))

   The recent report by American Society of Civil Engineers gave the nation's bridges an unimpressive C grade. Across the country, more than 617,000 highway bridges: 46,154 structurally deficient and 42% 50+ years old. Continuous bridge assessment is essential to protect public safety. Federal Highway Administration requires all highway bridges inspected once every 24 months. However, any drastic change on bridges within 24 months will be left undetected. Nonetheless, bridge inspection is time-consuming and labor-intensive. Civil engineers have been using bridge health monitoring (BHM) systems with wired and/or wireless sensors to measure structural response (e.g., displacement, strain, acceleration) of a bridge. The response measurements are then converted to the information related to structural health for assessment. State-of-the-art BHM technology deploys sensor networks to facilitate data connection. Installing cables is expensive and subject to extreme weather. Wireless solutions face challenges such as energy consumption. Sensors are battery-powered. Another not well-publicized problem is security threats inherited in wireless networks. Our approach to wireless BHM is to utilize sensors networkless by collecting data with a drone. Similar to a mail carrier who goes around and picks up the mail, a drone collects data from sensors throughout the bridge. A drone eliminates restrictions for civil engineers on node placement since the drone replaces sink nodes. Networkless makes BHM less prone to attacks such as Jamming and DoS. To secure access, we deploy a Needham-Schroeder authentication protocol for the drone to collect data from sensor nodes securely. Networkless sensing for BHM benefits energy efficiency. It saves battery life as the sensor nodes remain asleep until scheduled transmission or woken up by a drone. It reduces design complexity and operation energy. The system also assures security since there is no vulnerable network to be attacked. 

   more » « less