An efficient cluster tree based data collection scheme for large mobile wireless sensor networks

•Download as DOCX, PDF•

0 likes•4 views

Shakas Technologies

Technology

2020 – 2021
#13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, Vellore – 6.
Off: 0416-2247353 Mo: +91 9500218218 / +91 8220150373
Website: www.shakastech.com, Email - id: shakastech@gmail.com, info@shakastech.com
An Efficient Cluster-Tree Based Data Collection Scheme for Large Mobile
Wireless Sensor Networks
Abstract:
Wireless Sensor Networks (WSNs) play a vital role in today's real world applications. The
effectiveness of WSNs purely depends on the data collection scheme. Numerous data
collection schemes such as multipath, chain, tree, cluster and hybrid topologies are
available in literature for collecting data in WSNs. However, the existing data collection
schemes fail to provide a guaranteed reliable network in terms of mobility, traffic, and end-
to-end connection. In this paper, a Velocity Energy-efficient and Link-aware Cluster-Tree
(VELCT) scheme for data collection in WSNs is proposed which would effectively mitigate
the problems of coverage distance, mobility, delay, traffic, tree intensity, and end-to-end
connection. The proposed VELCT constructs the Data Collection Tree (DCT) based on
the cluster head location. The data collection node in the DCT does not participate in
sensing on this particular round, however, it simply collects the data packet from the
cluster head and delivers it to the sink. The designed VELCT scheme minimizes the
energy exploitation, reduces the end-to-end delay and traffic in cluster head in WSNs by
effective usage of the DCT. The strength of the VELCT algorithm is to construct a simple
tree structure, thereby reducing the energy consumption of the cluster head and avoids
frequent cluster formation. It also maintains the cluster for a considerable amount of time.
Simulation results have demonstrated that VELCTprovides better QoS in terms of energy
consumption, throughput, end-to-end delay, and network lifetime for mobility-based
WSNs.

Similar to An efficient cluster tree based data collection scheme for large mobile wireless sensor networks

Mobile data gathering with load balanced clustering and dual data uploading i...

Shakas Technologies

A fault tolerant approach to extend network life time of wireless sensor network

Shakas Technologies

An autonomic in network query processing for urban sensor networks

Shakas Technologies

Cost aware secure routing (caser) protocol design for wireless sensor networks

Shakas Technologies

With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.

Optimal Coverage Path Planningin a Wireless Sensor Network for Intelligent Tr...

IJCNCJournal

Optimal Coverage Path Planning in a Wireless Sensor Network for Intelligent T...

IJCNCJournal

Recently, the wide adoption of WSNs (Wireless-Sensor-Networks) is been seen for provision non-real time and real-time application services such as intelligent transportation and health care monitoring, intelligent transportation etc. Provisioning these services requires energy-efficient WSN. The clustering technique is an efficient mechanism that plays a main role in reducing the energy consumption of WSN. However, the existing model is designed considering reducing energy- consumption of the sensor-device for the homogenous network. However, it incurs energy-overhead (EO) between cluster-head (CH). Further, maximizing coverage time is not considered by the existing clustering approach considering heterogeneous networks affecting lifetime performance. In order to overcome these research challenges, this work presents an energy efficient clustering and routing optimization (EECRO) model adopting cross-layer design for heterogeneous networks. The EECRO uses channel gain information from the physical layer and TDMA based communication is adopted for communication among both intra-cluster and inter-cluster communication. Further, clustering and routing optimization are presented to bring a good trade-off among minimizing the energy of CH, enhancing coverage time and maximizing the lifetime of sensor-network (SN). The experiments are conducted to estimate the performance of EECRO over the existing model. The significantperformance is attained by EECRO over the existing model in terms of minimizing routing and communication overhead and maximizing the lifetime of WSNs.

Energy efficient clustering and routing optimization model for maximizing lif...

IJECEIAES

As a result of numerous applications and low installation costs, wireless sensor networks (WSNs) have expanded excessively. The main concern in the WSN environment is to lower energy consumption amidst nodes while preserving an acceptable level of service quality. Using multi-mobile sinks to reduce the nodes' energy consumption have been considered as an efficient strategy. In such networks, the dynamic network topology created by the sinks mobility makes it a challenging task to deliver the data to the sinks. Thus, in order to provide efficient data dissemination, the sensor nodes will have to readjust the routes to the current position of the mobile sinks. The route re-adjustment process could result in a significant maximization in the communication cost, which boosts the total energy depletion. This paper proposes a lightweight routes re-adjustment strategy for mobile sink wireless sensor networks (LRAS-MS) aimed at minimizing communication cost and energy consumption by reducing route re-adjustment in a cluster-based WSN environment. The simulation results show a significant reduction in communication costs and extending the network lifetime while maintaining comparable low data delivery delay.

Lightweight route adjustment strategy for mobile sink wireless sensor networks

nooriasukmaningtyas

The existence of a mobile sink for gathering data significantly extends wireless sensor networks (WSNs) lifetime. In recent years, a variety of efficient rendezvous points-based sink mobility approaches has been proposed for avoiding the energy sink-holes problem nearby the sink, diminishing buffer overflow of sensors, and reducing the data latency. Nevertheless, lots of research has been carried out to sort out the energy holes problem using controllable-based sink mobility methods. However, further developments can be demonstrated and achieved on such type of mobility management system. In this paper, a well-rounded strategy involving an energy-efficient routing protocol along with a controllablebased sink mobility method is proposed to extirpate the energy sink-holes problem. This paper fused the fuzzy A-star as a routing protocol for mitigating the energy consumption during data forwarding along with a novel sink mobility method which adopted a grid partitioning system and fuzzy system that takes account of the average residual energy, sensors density, average traffic load, and sources angles to detect the optimal next location of the mobile sink. By utilizing diverse performance metrics, the empirical analysis of our proposed work showed an outstanding result as compared with fuzzy A-star protocol in the case of a static sink.

Energy sink-holes avoidance method based on fuzzy system in wireless sensor ...

IJECEIAES

Implementing energy efficient technique for defens against gray hole and blac...

Shakas Technologies

A novel resource scheduling approach to improve the reliability of shuffle ex...

Shakas Technologies

In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common drawback among them is to data sharing between interconnected nodes. In this paper we propose an Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase, Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an efficient way to handle data in between the intercommunication nodes. By the above approach we can access the data from the node which is not in the list, by sharing the data from the node which is approachable to the desired node. For accessing and sharing we need some security so that the data can be shared between authenticated nodes. For this we use two way security approach one for the accessing node and other for the sharing.

An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...

cscpconf

A wireless sensor networks (WSNs) play a significant application, especially in the monitored remoting environmental, which enables by the availability of sensors which are cheaper, smaller, and intelligent. The equipment of such sensors be with wireless interfaces, which a communication with other sensors occurs for creating a network, that contains many distributed nodes. The closest nodes to the sink are exploited at an enormous traffic load while the data from the whole regions are forwarded between them to reach the sink. This result in exhausting their energy quickly and partitioning the network. This is solved by changing the sink node position in Grid based clustering technique, which considers the optimal method for this purpose. A simulation with MATLAB can be applied for grid based clustering technique to evaluate the performance of WSN. The expected results deal with outperforms in throughput, reducing energy consumption and increasing residual energy, in addition to prolong the network lifetime of the sensor network.

Design and implementation of grid based clustering in WSN using dynamic sink ...

journalBEEI

Data aggregation techniques to remove redundancy in wireless sensor networks

Shakas Technologies

An Efficient Cluster-Tree Based Data Collection Scheme for Large Mobile Wirel...

Nexgen Technology

Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data collection process must be conducted while copying with packet collisions, nodes’ congestion or data redundancy. These issues always result in energy waste which is detrimental to network efficiency and lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise message overhead and packet losses. Simulation results show that this solution can mitigate delay while significantly increasing packet delivery and network lifetime.

CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...

ijwmn

Networking Domain title 2016-2017 Shakas Technologies Provides, 2016-2017 Project titles, Real time project titles, IEEE Project Titles 2016-2017, NON-IEEE Project Titles, Latest project titles 2016, MCA Project titles, Final Year Project titles 2016-2017.. Contact As: Shakas Technologies #13/19, 1st Floor, Municipal Colony, Kangeyanellore Road, Gandhi Nagar, Vellore-632006, Cell: 9500218218 Mobile: 0416-2247353 / 6066663

Distributed long term base station clustering in cellular networks using coal...

Shakas Technologies

Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.

Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...

IJERA Editor

Effects of mobility on latency in a wsn that accommodates mobile nodes

Shakas Technologies

CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...

ijwmn

Similar to An efficient cluster tree based data collection scheme for large mobile wireless sensor networks (20)