skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Medley: A Novel Distributed Failure Detector for IoT Networks
Efficient and correct operation of an IoT network requires the presence of a failure detector and membership protocol amongst the IoT nodes. This paper presents a new failure de- tector for IoT settings where nodes are connected via a wire- less ad-hoc network. This failure detector, which we name Medley, is fully decentralized, allows IoT nodes to maintain a local membership list of other alive nodes, detects failures quickly (and updates the membership list), and incurs low communication overhead in the underlying ad-hoc network. In order to minimize detection time and communication, we adapt a failure detector originally proposed for datacenters (SWIM), for the IoT environment. In Medley each node picks a medley of ping targets in a randomized and skewed manner, preferring nearer nodes. Via analysis and NS-3 simulation we show the right mix of pinging probabilities that simulta- neously optimize detection time and communication traffic. We have also implemented Medley for Raspberry Pis, and present deployment results.  more » « less
Award ID(s):
1908888
PAR ID:
10175828
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Middleware '19: Proceedings of the 20th International Middleware Conference
Page Range / eLocation ID:
319 to 331
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, 2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC))
    A Mobile Ad-hoc Network (MANET) is a collection of nodes that communicate with each other wirelessly without any central support or conventional structure. The transmission of data packets over wireless channels in MANETs helps to maintain communication. Ad-hoc On-Demand Distance Vector Routing is a reactive routing protocol associated with MANET which creates a route to destination by broadcasting route request packets through the entire network. A link failure in this type of protocol causes the source to flood the network with these Route Request packets that leads to congestion in the network and performance degradation. This paper proposes an Efficient Multipath AODV routing algorithm that determines if a node in a network is relaying or is silent in the process of route discovery to send data packets from the source to destination. Simulation results show the proposed routing algorithm controls congestion and enhances performance in the network as not all network nodes have to participate in the route discovery for a particular source-destination pair. 
    more » « less
  2. ; ; ; (, SPIE Proceedings Volume 12528, Real-Time Image Processing and Deep Learning 2023)
    Kehtarnavaz, Nasser; Shirvaikar, Mukul V. (Ed.)
    Internet of Things (IoT) uses cloud-enabled data sharing to connect physical objects to sensors, processing software, and other technologies via the Internet. IoT allows a vast network of communication amongst these physical objects and their corresponding data. This study investigates the use of an IoT development board for real-time sensor data communication and processing, specifically images from a camera. The IoT development board and camera are programmed to capture images for object detection and analysis. Data processing is performed on board which includes the microcontroller and wireless communication with the sensor. The IoT connectivity and simulated test results to verify real-time signal communication and processing will be presented. 
    more » « less
  3. (, Proceedings 43rd IEEE International Conference on Distributed Computing Systems)
    Classical leader election protocols typically assume complete and correct knowledge of underlying membership lists at all participating nodes. Yet many edge and IoT settings are dynamic, with nodes joining, leaving, and failing continuously—a phenomenon called churn. This implies that in any membership protocol, a given node’s membership list may have entries that are missing (e.g., false positive detections, or newly joined nodes whose information has not spread yet) or stale (e.g., failed nodes that are undetected)—these would render classical election protocols incorrect. We present a family of four leader election protocols that are churn-tolerant (or c-tolerant). The key ideas are to: i) involve the minimum number of nodes necessary to achieve safety; ii) use optimism so that decisions are made faster when churn is low; iii) incorporate a preference for electing healthier nodes as leaders. We prove the correctness and safety of our c-tolerant protocols and show their message complexity is optimal. We present experimental results from both a trace- driven simulation as well as our implementation atop Raspberry Pi devices, including a comparison against Zookeeper. 
    more » « less
  4. (, IEEE WiOPT RAWNET Workshop)
    This paper proposes a framework to explore the op- timization of applications where a distributed set of nodes/sensors, e.g., automated vehicles, collaboratively exchange information over a network to achieve real-time situational-awareness. To that end we propose a reasonable proxy for the usefulness of possibly delayed sensor updates and their sensitivity to the network re- sources devoted to such exchanges. This enables us to study the joint optimization of (1) the application-level update rates, i.e., how often and when sensors update other nodes, and (2), the transmission resources allocated to, and resulting delays associated with, exchanging updates. We first consider a network scenario where nodes share a single resource, e.g., an ad hoc wireless setting where a cluster of nodes, e.g., platoon of vehicles, share information by broadcasting on a single collision domain. In this setting we provide an explicit solution characterizing the interplay between network congestion and situational awareness amongst heterogeneous nodes. We then extend this to a setting where such clusters can also exchange information via a base station. In this setting we characterize the optimal solution and develop a natural distributed algorithm based on exchanging congestion prices associated with sensor nodes’ update rates and associated network transmission rates. Preliminary numerical evaluation provides initial insights on the trade-offs associated with optimizing situational awareness and the proposed algorithm’s convergence. 
    more » « less
  5. (, 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
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email