324 research outputs found

    Survey on Various Aspects of Clustering in Wireless Sensor Networks Employing Classical, Optimization, and Machine Learning Techniques

    Get PDF
    A wide range of academic scholars, engineers, scientific and technology communities are interested in energy utilization of Wireless Sensor Networks (WSNs). Their extensive research is going on in areas like scalability, coverage, energy efficiency, data communication, connection, load balancing, security, reliability and network lifespan. Individual researchers are searching for affordable methods to enhance the solutions to existing problems that show unique techniques, protocols, concepts, and algorithms in the wanted domain. Review studies typically offer complete, simple access or a solution to these problems. Taking into account this motivating factor and the effect of clustering on the decline of energy, this article focuses on clustering techniques using various wireless sensor networks aspects. The important contribution of this paper is to give a succinct overview of clustering

    Hop-by-hop Channel - Alert Routing to Congestion Control in Wireless Sensor Networks

    Get PDF
    One of the major challenges in wireless sensor networks (WSNs) research is to prevent traffic congestion without compromising with the energy of the sensor nodes. Network congestion leads to packet loss, throughput impairment, and energy waste. To address this issue in this paper, a distributed traffic-aware routing scheme with a capacity of adjusting the data transmission rate of nodes is proposed for multi-sink wireless sensor networks that effectively distribute traffic from the source to sink nodes. Our algorithm is designed through constructing a hybrid virtual gradient field using depth and normalized traffic loading to routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The simulation results indicate that the proposed solution can improve the utilization of network resources, reduce unnecessary packet retransmission, and significantly improve the performance of WSNs. Keywords: Wireless sensor networks; Traffic-aware; Routing; Data transmission rate; Congestion; Gradien

    Optimization of Energy-Efficient Cluster Head Selection Algorithm for Internet of Things in Wireless Sensor Networks

    Get PDF
    The Internet of Things (IoT) now uses the Wireless Sensor Network (WSN) as a platform to sense and communicate data. The increase in the number of embedded and interconnected devices on the Internet has resulted in a need for software solutions to manage them proficiently in an elegant and scalable manner. Also, these devices can generate massive amounts of data, resulting in a classic Big Data problem that must be stored and processed. Large volumes of information have to be produced by using IoT applications, thus raising two major issues in big data analytics. To ensure an efficient form of mining of both spatial and temporal data, a sensed sample has to be collected. So for this work, a new strategy to remove redundancy has been proposed. This classifies all forms of collected data to be either relevant or irrelevant in choosing suitable information even before they are forwarded to the base station or the cluster head. A Low-Energy Adaptive Clustering Hierarchy (LEACH) is a cluster-based routing protocol that uses cluster formation. The LEACH chooses one head from the network sensor nodes, such as the Cluster Head (CH), to rotate the role to a new distributed energy load. The CHs were chosen randomly with the possibility of all CHs being concentrated in one locality. The primary idea behind such dynamic clustering was them resulted in more overheads due to changes in the CH and advertisements. Therefore, the LEACH was not suitable for large networks. Here, Particle Swarm Optimization (PSO) and River Formation Dynamics are used to optimize the CH selection (RFD). The results proved that the proposed method to have performed better compared to other methods

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    A novel nomadic people optimizer-based energy-efficient routing for WBAN

    Get PDF
    In response to user demand for wearable devices, several WBAN deployments now call for effective communication processes for remote data monitoring in real time. Using sensor networks, intelligent wearable devices have exchanged data that has benefited in the evaluation of possible security hazards. If smart wearables in sensor networks use an excessive amount of power during data transmission, both network lifetime and data transmission performance may suffer. Despite the network's effective data transmission, smart wearable patches include data that has been combined from several sources utilizing common aggregators. Data analysis requires careful network lifespan control throughout the aggregation phase. By using the Nomadic People Optimizer-based Energy-Efficient Routing (NPO-EER) approach, which effectively allows smart wearable patches by minimizing data aggregation time and eliminating routing loops, the network lifetime has been preserved in this research. The obtained findings showed that the NPO method had a great solution. Estimated Aggregation time, Energy consumption, Delay, and throughput have all been shown to be accurate indicators of the system's performance

    An Effective Wireless Sensor Network Routing Protocol Based on Particle Swarm Optimization Algorithm

    Get PDF
    Improving wireless communication and artificial intelligence technologies by using Internet of Things (Itoh) paradigm has been contributed in developing a wide range of different applications. However, the exponential growth of smart phones and Internet of Things (IoT) devices in wireless sensor networks (WSNs) is becoming an emerging challenge that adds some limitations on Quality of Service (QoS) requirements. End-to-end latency, energy consumption, and packet loss during transmission are the main QoS requirements that could be affected by increasing the number of IoT applications connected through WSNs. To address these limitations, an effective routing protocol needs to be designed for boosting the performance of WSNs and QoS metrics. In this paper, an optimization approach using Particle Swarm Optimization (PSO) algorithm is proposed to develop a multipath protocol, called a Particle Swarm Optimization Routing Protocol (MPSORP). The MPSORP is used for WSN-based IoT applications with a large volume of traffic loads and unfairness in network flow. For evaluating the developed protocol, an experiment is conducted using NS-2 simulator with different configurations and parameters. Furthermore, the performance of MPSORP is compared with AODV and DSDV routing protocols. The experimental results of this comparison demonstrated that the proposed approach achieves several advantages such as saving energy, low end-to-end delay, high packet delivery ratio, high throughput, and low normalization load.publishedVersio

    Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis

    Get PDF
    Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.https://doi.org/10.3390/s15092220

    A routing protocol for multisink wireless sensor networks in underground coalmine tunnels

    Get PDF
    Traditional underground coalmine monitoring systems are mainly based on the use of wired transmission. However, when cables are damaged during an accident, it is difficult to obtain relevant data on environmental parameters and the emergency situation underground. To address this problem, the use of wireless sensor networks (WSNs) has been proposed. However, the shape of coalmine tunnels is not conducive to the deployment of WSNs as they are long and narrow. Therefore, issues with the network arise, such as extremely large energy consumption, very weak connectivity, long time delays, and a short lifetime. To solve these problems, in this study, a new routing protocol algorithm for multisink WSNs based on transmission power control is proposed. First, a transmission power control algorithm is used to negotiate the optimal communication radius and transmission power of each sink. Second, the non-uniform clustering idea is adopted to optimize the cluster head selection. Simulation results are subsequently compared to the Centroid of the Nodes in a Partition (CNP) strategy and show that the new algorithm delivers a good performance: Power efficiency is increased by approximately 70%, connectivity is increased by approximately 15%, the cluster interference is diminished by approximately 50%, the network lifetime is increased by approximately 6%, and the delay is reduced with an increase in the number of sinks
    • …
    corecore