101 research outputs found
Clustering and Data collection in Wireless Sensor network using Dual Data Uploading
In this project, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-DDU. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-DDU scheme. The results show that when each cluster has at most two cluster heads, LBC-DDU achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Improving Energy Efficiency of WSN Using Multiple Cluster Head Selection with Dual Data Uploading
In this project, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-DDU. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-DDU scheme. The results show that when each cluster has at most two cluster heads, LBC-DDU achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Multihead Node Selection Technique for Improving Lifetime and Energy Efficiency of WSN
In this paper, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-DDU. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The results show that when each cluster has at most two cluster heads, LBC-DDU achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering. This system provides much better efficiency as compared to SISO system
Clustering objectives in wireless sensor networks: A survey and research direction analysis
Wireless Sensor Networks (WSNs) typically include thousands of resource-constrained sensors to monitor their surroundings, collect data, and transfer it to remote servers for further processing. Although WSNs are considered highly flexible ad-hoc networks, network management has been a fundamental challenge in these types of net- works given the deployment size and the associated quality concerns such as resource management, scalability, and reliability. Topology management is considered a viable technique to address these concerns. Clustering is the most well-known topology management method in WSNs, grouping nodes to manage them and/or executing various tasks in a distributed manner, such as resource management. Although clustering techniques are mainly known to improve energy consumption, there are various quality-driven objectives that can be realized through clustering. In this paper, we review comprehensively existing WSN clustering techniques, their objectives and the network properties supported by those techniques. After refining more than 500 clustering techniques, we extract about 215 of them as the most important ones, which we further review, catergorize and classify based on clustering objectives and also the network properties such as mobility and heterogeneity. In addition, statistics are provided based on the chosen metrics, providing highly useful insights into the design of clustering techniques in WSNs.publishedVersio
Kinetic Gas Molecule Optimization based Cluster Head Selection Algorithm for minimizing the Energy Consumption in WSN
As the amount of low-cost and low-power sensor nodes increases, so does the size of a wireless sensor network (WSN). Using self-organization, the sensor nodes all connect to one another to form a wireless network. Sensor gadgets are thought to be extremely difficult to recharge in unfavourable conditions. Moreover, network longevity, coverage area, scheduling, and data aggregation are the major issues of WSNs. Furthermore, the ability to extend the life of the network, as well as the dependability and scalability of sensor nodes' data transmissions, demonstrate the success of data aggregation. As a result, clustering methods are thought to be ideal for making the most efficient use of resources while also requiring less energy. All sensor nodes in a cluster communicate with each other via a cluster head (CH) node. Any clustering algorithm's primary responsibility in these situations is to select the ideal CH for solving the variety of limitations, such as minimising energy consumption and delay. Kinetic Gas Molecule Optimization (KGMO) is used in this paper to create a new model for selecting CH to improve network lifetime and energy. Gas molecule agents move through a search space in pursuit of an optimal solution while considering characteristics like energy, distance, and delay as objective functions. On average, the KGMO algorithm results in a 20% increase in network life expectancy and a 19.84% increase in energy stability compared to the traditional technique Bacterial Foraging Optimization Algorithm (BFO)
Multi-Hop Routing Mechanism for Reliable Sensor Computing
Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms
Recommended from our members
Performance Analysis of Cluster Based Communication Protocols for Energy Efficient Wireless Sensor Networks. Design, Analysis and Performance Evaluation of Communication Protocols under Various Topologies to Enhance the Lifetime of Wireless Sensor Networks.
Sensor nodes are deployed over sensing fields for the purpose of monitoring certain
phenomena of interest. The sensor nodes perform specific measurements, process the
sensed data, and send the data to a base station over a wireless channel. The base station
collects data from the sensor nodes, analyses this data, and reports it to the users.
Wireless sensor networks are different from traditional networks, because of the
following constraints. Typically, a large number of sensor nodes need to be randomly
deployed and, in most cases, they are deployed in unreachable environments; however,
the sensor nodes may fail, and they are subject to power constraints.
Energy is one of the most important design constraints of wireless sensor networks.
Energy consumption, in a sensor node, occurs due to many factors, such as: sensing the
environment, transmitting and receiving data, processing data, and communication
overheads. Since the sensor nodes behave as router nodes for data propagation, of the
other sensor nodes to the base station, network connectivity decreases gradually. This
may result in disconnected sub networks of sensor nodes. In order to prolong the
network¿s lifetime, energy efficient protocols should be designed for the characteristics
of the wireless sensor network. Sensor nodes in different regions of the sensing field can
collaborate to aggregate the data that they gathered.
Data aggregation is defined as the process of aggregating the data from sensor nodes to
reduce redundant transmissions. It reduces a large amount of the data traffic on the
network, it requires less energy, and it avoids information overheads by not sending all
of the unprocessed data throughout the sensor network. Grouping sensor nodes into
clusters is useful because it reduces the energy consumption. The clustering technique
can be used to perform data aggregation. The clustering procedure involves the selection
of cluster heads in each of the cluster, in order to coordinate the member nodes. The
cluster head is responsible for: gathering the sensed data from its cluster¿s nodes,
aggregating the data, and then sending the aggregated data to the base station.
An adaptive clustering protocol was introduced to select the heads in the wireless sensor
network. The proposed clustering protocol will dynamically change the cluster heads to
obtain the best possible performance, based on the remaining energy level of sensor
nodes and the average energy of clusters. The OMNET simulator will be used to present
the design and implementation of the adaptive clustering protocol and then to evaluate
it.
This research has conducted extensive simulation experiments, in order to fully study
and analyse the proposed energy efficient clustering protocol. It is necessary for all of
the sensor nodes to remain alive for as long as possible, since network quality decreases
as soon as a set of sensor nodes die. The goal of the energy efficient clustering protocol
is to increase the lifetime and stability period of the sensor network.
This research also introduces a new bidirectional data gathering protocol. This protocol
aims to form a bidirectional ring structure among the sensor nodes, within the cluster, in
order to reduce the overall energy consumption and enhance the network¿s lifetime. A bidirectional data gathering protocol uses a source node to transmit data to the base
station, via one or more multiple intermediate cluster heads. It sends data through
energy efficient paths to ensure the total energy, needed to route the data, is kept to a
minimum. Performance results reveal that the proposed protocol is better in terms of: its
network lifetime, energy dissipation, and communication overheads
Mobile Ad Hoc Networks
Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms
Mobile Ad Hoc Networks
Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms
Mobile Ad hoc Networking: Imperatives and Challenges
Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET\u27s characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future
- …