712 research outputs found

    Overlapping Multi-hop Clustering for Wireless Sensor Networks

    Full text link
    Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multi-hop clusters. Overlapping clusters are useful in many sensor network applications, including inter-cluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multi-hop clustering algorithm (KOCA) for solving the overlapping clustering problem. KOCA aims at generating connected overlapping clusters that cover the entire sensor network with a specific average overlapping degree. Through analysis and simulation experiments we show how to select the different values of the parameters to achieve the clustering process objectives. Moreover, the results show that KOCA produces approximately equal-sized clusters, which allows distributing the load evenly over different clusters. In addition, KOCA is scalable; the clustering formation terminates in a constant time regardless of the network size

    Lightweight mobile and wireless systems: technologies, architectures, and services

    Get PDF
    1Department of Information and Communication Systems Engineering (ICSE), University of the Aegean, 81100 Mytilene, Greece 2Department of Information Engineering and Computer Science (DISI), University of Trento, 38123 Trento, Italy 3Department of Informatics, Alexander Technological Educational Institute of Thessaloniki, Thessaloniki, 574 00 Macedonia, Greece 4Centre Tecnologic de Telecomunicacions de Catalunya (CTTC), 08860 Barcelona, Spain 5North Carolina State University (NCSU), Raleigh, NC 27695, US

    DynaMO—Dynamic Multisuperframe Tuning for Adaptive IEEE 802.15.4e DSME Networks

    Get PDF
    Recent advancements in the IoT domain have been pushing for stronger demands of Qualityof-Service (QoS) and in particular for improved determinism for time-critical wireless communications under power constraints. The IEEE 802.15.4e standard protocol introduced several new MAC behaviors that provide enhanced time-critical and reliable communications. The Deterministic Synchronous Multichannel Extension (DSME) is one of its prominent MAC behaviors that combines contention-based and contentionfree communication, guaranteeing bounded delays and improved reliability and scalability by leveraging multi-channel access and CAP reduction. However, DSME has a multi-superframe structure, which is statically defined at the beginning of the network. As the network evolves dynamically by changing its traffic characteristics, these static settings can affect the overall throughput and increase the network delay because of improper allocation of bandwidth. In this paper, we address this problem, and we present a dynamic multi-superframe tuning technique that dynamically adapts the multi-superframe structure based on the size of the network. This technique improves the QoS by providing 15-30% increase in throughput and 15-35% decrease in delay when compared to static DSME networksinfo:eu-repo/semantics/publishedVersio
    corecore