More Like this

1. NCMDSDV: A Neighbor Coverage Multipsth DSDV Routing Protocol for MANETs

   Nan Wang, Rishika Datla (June 2019, 2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN 2019))

   A mobile ad-hoc network is a set of mobile nodes in which data is transmitted wirelessly amongst all nodes. Due to the mobility of wireless nodes, network topology changes frequently. Consequently, routing protocols used in mobile ad-hoc networks must be adaptive. The routing protocols enabling data transfer within MANETs are classified into reactive, proactive, and hybrid protocols. Proactive routing protocols, such as the Destination Sequenced Distance Vector, are table-driven protocols that use stale paths in case of broken links which causes loss of data in the network. This research study will explore A Neighbor Coverage Multipath DSDV as a potential solution for data loss by finding alternate routes to the destination when a link is broken. Simulations have been carried out for the three routing protocols: DSDV, FSR, and the proposed NCMDSDV. Results showed that the proposed routing protocol has better efficiency compared to DSDV and FSR routing protocols. 

   more » « less
2. Performance Evaluation and Analysis of Proactive and Reactive MANET Protocols at Varied Speeds

   https://doi.org/10.1109/CCWC47524.2020.9031233  

   Skaggs-Schellenberg, Russell; Wang, Nan; Wright, Daniel (January 2020, 2020 10th Annual Computing and Communication Workshop and Conference (CCWC))

   A Mobile Ad Hoc Network (MANET) is a decentralized wireless network that does not rely on pre-existing infrastructure. Instead, it is each node's responsibility to forward data according to its specified routing protocol. Although these protocols perform the same task, their performance in a variety of scenarios differ. This paper simulates four different routing protocols in NS-3 at a variety of movement speeds and area sizes, comparing their Packet Delivery Ratio (PDR) and Average End-To-End Delay (AETED). The performance results reflect what would be expected if a system would be implemented in a similar environment. Therefore, it is crucial selecting a protocol to best suit a system. 

   more » « less
3. Hop-constrained oblivious routing

   https://doi.org/10.1145/3406325.3451098  

   Ghaffari, Mohsen; Haeupler, Bernhard; Zuzic, Goran (June 2021, Symposium on Theory of Computing (STOC))

   null (Ed.)

   We prove the existence of an oblivious routing scheme that is poly(logn)-competitive in terms of (congestion + dilation), thus resolving a well-known question in oblivious routing. Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize (congestion + dilation), defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme obliviously and randomly selects a path for each packet independent of (the existence of) the other packets. Despite this obliviousness, the selected paths have (congestion + dilation) within a poly(logn) factor of the best possible value. More precisely, for any integer hop-bound h, this oblivious routing scheme selects paths of length at most h · poly(logn) and is poly(logn)-competitive in terms of congestion in comparison to the best possible congestion achievable via paths of length at most h hops. These paths can be sampled in polynomial time. This result can be viewed as an analogue of the celebrated oblivious routing results of R'acke [FOCS 2002, STOC 2008], which are O(logn)-competitive in terms of congestion, but are not competitive in terms of dilation. 

   more » « less
4. 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
5. Optimized Compression Policy for Flying Ad hoc Networks

   https://doi.org/10.1109/CCNC.2019.8651761  

   Rovira-Sugranes, Arnau; Afghah, Fatemeh; Razi, Abolfazl (February 2019, 16th IEEE Annual Consumer Communications & Networking Conference (CCNC))

   Managing energy consumption for computation and communication is a key requirement for flying ad hoc networks (FANET) to prolong the network lifetime. In many applications, the main role of drones is to collect imagery information and relay them to a ground station for further processing and decision making. In this paper, we present a predictive compression policy to maximize the end-to-end image quality penalized by communication and computation costs. The idea is to predict the number of remaining links to the destination for a given routing algorithm and use it to re-compress image frames at intermediate nodes such that the overall energy consumption is minimized. Numerical results confirm that the performance of this method is within 4% of the global optima and higher than the current fixed-rate policies with a significant margin. 

   more » « less