Abstract With the current exponential growth in traffic and service demands, device-to-device (D2D) cooperation is identified as a major mechanism to enable 5G networks to effectively and efficiently augment network resources. The effectiveness of D2D cooperation depends on a wide range of decision making processes that include cluster formation, resource allocation, in addition to connection and mobility management. Irrespective of the D2D cooperation scenario whether in sensor, ad hoc, or cellular networks, the literature normally assumes that devices selected as relays or data sources are reliable; this means that they will maintain the connection till the communication session ends. Yet, this assumption is challenged in practice since devices’ batteries can be depleted (e.g., sensors in an IoT network) and devices can move leading to connection termination (e.g., mobile users in a WiFi network or cars in a vehicular ad hoc network). To this end, we address the problem of reliable D2D cooperation in wireless networks by proposing a novel approach that is proactive by utilizing reliability metrics in the decision making process, and scalable by having low implementation complexity suitable for dense networks. These differentiating factors are shown to enhance the overall network reliability compared to standard techniques and to facilitate dynamic operation which is essential for practical implementation. Performance is evaluated using extensive simulations in addition to test bed experimental demonstration in order to quantify gains and extract insights on a range of existing design tradeoffs.
Reactive techniques aim at either minimizing failures or recovering from failure events in a dynamic fashion after cluster formation. The authors in @cite_3 present an RSSI (received signal strength indicator) based approach for cluster formation in sensor networks whereby cluster head selection takes into account signal strength level and energy budget among neighbor nodes with the option of dynamically replacing cluster heads based on given performance metrics. The authors in @cite_29 present a mechanism for dynamic cluster head re-election by executing an update algorithm on a periodic basis using pre-configured parameters. The authors in @cite_33 address fault tolerance in wireless sensor network scenarios using a distributed real-time recovery algorithm based on periodic protocol exchange messages to identify failures and deal with them. @cite_28 , the authors presented several low complexity reactive algorithms to deal with mobility in content distribution networks with D2D cooperation while taking into account three classes of events: an existing device leaves the network which is highly challenging when the device is a cluster head, an existing device moves locally within the network, and a new incoming device joins the network.
@cite_28 @cite_29 @cite_33 @cite_3
2026968296 2126379392 2158643468 2219395474
Background: We investigate direct use of 802.15.4 radio signal strength indication (RSSI) for human activity recognition when 1) a user carries a wireless node (device-bound) and when 2) a user moves in the wireless sensor net (WSN) without a WSN node (device-free). We investigate recognition feasibility in respect to network topology, subject and room geometry (door open, half, closed). Methods: In a 2 person office room 8 wireless nodes are installed in a 3D topology. Two subjects are outfitted with a sensor node on the hip. Acceleration and RSSI are recorded while subject performs 6 different activities or room is empty. We apply machine learning for analysis and compare our results to acceleration data. Results: 10-fold cross-validation with all nodes gives accuracies of 0.896 (device-bound), 0.894 (device-free) and 0.88 (accelerometer). Topology investigation reveals that similar accuracies may be reached with only 5 (device-bound) or 4 (device-free) selected nodes. Applying trained data from one subject to the other and vice-versa shows higher recognition difference on RSSI than on acceleration. Changing of door state has smaller effect on both systems than subject change; with least impact when door is closed. Conclusion: 802.15.4 RSSI suited for activity recognition. 3D topology is helpful in respect to type of activities. Discrimination of subjects seems possible. Practical systems must adapt no only to long-term environmental dispersion but consider typical geometric changes. Adaptable, robust recognition models must be developed. Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in ad-hoc sensor networks. Based on this approach, we present a protocol, HEED (hybrid energy-efficient distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED does not make any assumptions about the distribution or density of nodes, or about node capabilities, e.g., location-awareness. The clustering process terminates in O(1) iterations, and does not depend on the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. It also achieves fairly uniform cluster head distribution across the network. A careful selection of the secondary clustering parameter can balance load among cluster heads. Our simulation results demonstrate that HEED outperforms weight-based clustering protocols in terms of several cluster characteristics. We also apply our approach to a simple application to demonstrate its effectiveness in prolonging the network lifetime and supporting data aggregation. This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrained large-scale wireless sensor networks. Capitalizing on the spatial sparsity of localized phenomena, compressive data collection is enforced by turning off a fraction of sensors using a simple random node sleeping strategy, which conserves sensing energy and prolongs network lifetime. In the absence of a fusion center, sparse signal recovery via decentralized in-network processing is developed, based on a consensus optimization formulation and the alternating direction method of multipliers. In the proposed algorithm, each active sensor monitors and recovers its local region only, collaborates with its neighboring active sensors through low-power one-hop communication, and iteratively improves the local estimates until reaching the global optimum. Because each sensor monitors the local region rather than the entire large field, the iterative algorithm converges fast, in addition to being scalable in terms of transmission and computation costs. Further, through collaboration, the sensing performance is globally optimal and attains a high spatial resolution commensurate with the node density of the original network containing both active and inactive sensors. Simulations demonstrate the performance of the proposed approach. Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited computation, communication, memory, and energy resources that are being used for huge range of applications where the traditional infrastructure-based network is mostly infeasible. The sensor nodes are densely deployed in a hostile environment to monitor, detect, and analyze the physical phenomenon and consume considerable amount of energy while transmitting the information. It is impractical and sometimes impossible to replace the battery and to maintain longer network life time. So, there is a limitation on the lifetime of the battery power and energy conservation is a challenging issue. Appropriate cluster head (CH) election is one such issue, which can reduce the energy consumption dramatically. Low energy adaptive clustering hierarchy (LEACH) is the most famous hierarchical routing protocol, where the CH is elected in rotation basis based on a probabilistic threshold value and only CHs are allowed to send the information to the base station (BS). But in this approach, a super-CH (SCH) is elected among the CHs who can only send the information to the mobile BS by choosing suitable fuzzy descriptors, such as remaining battery power, mobility of BS, and centrality of the clusters. Fuzzy inference engine (Mamdani’s rule) is used to elect the chance to be the SCH. The results have been derived from NS-2 simulator and show that the proposed protocol performs better than the LEACH protocol in terms of the first node dies, half node alive, better stability, and better lifetime.