Cluster Based Data Aggregation Scheme for Latency and Packet Loss Reduction in WSN

Devi, V. Seedha; Ravi, T.; Priya, S. Baghavathi

doi:10.1016/j.comcom.2019.10.003

Cited by 61 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The choice of data aggregation techniques is determined by the energy requirements of the application. In WSN, the cluster based data aggregation eliminates redundancy in the sensed data, in which the cluster head collects the data from cluster members and sends the aggregated data to the base station [ 33 ]. As a result, it avoids sending of the entire sensed data and conserves significant amount of battery energy [ 34 ].…”

Section: Related Workmentioning

confidence: 99%

An Energy-Efficient T-Based Routing Topology for Target Tracking in Battery Operated Mobile Wireless Sensor Networks

Karunanithy

Idayachandran

Vetrivelan

et al. 2023

Sensors

View full text Add to dashboard Cite

Real-time smart applications are now possible because to developments in communication and sensor technology. Wireless sensor networks (WSNs) are used to collect data from specific disaster sites, such as fire events, gas leaks, land mines, earthquake, landslides, etc., where it is necessary to know the exact location of the detected information to safely rescue the people. For instance, the detection and disposal of explosive materials is a difficult task because land mines consistently threaten human life. Here, the T-based Routing Topology (TRT) is suggested to gather data from sensors (metal detectors, Ground Penetrating Radars (GPR), Infra-Red sensors, etc.), Global Positioning System (GPS), and cameras in land mine-affected areas. Buried explosive materials can be found and located with high accuracy. Additionally, it will be simpler to eliminate bombs and reduce threats to humans. The efficiency of the suggested data collection method is evaluated using Network Simulator-2 (NS-2). Also, the proposed T-based routing topology requires a minimal number of nodes to cover the entire searching area and establish effective communication. In contrast, the number of nodes participating in the sensing area grows, as the depth of the tree increases in the existing tree topology-based data gathering. And for cluster topology, the number of nodes deployment depends on the transmission range of the sensor nodes.

show abstract

Section: Related Workmentioning

confidence: 99%

An Energy-Efficient T-Based Routing Topology for Target Tracking in Battery Operated Mobile Wireless Sensor Networks

Karunanithy

Idayachandran

Vetrivelan

et al. 2023

Sensors

View full text Add to dashboard Cite

show abstract

“…Remark Ref. [34] also proposed a model‐free adaptive control algorithm based on compact form dynamic linearization. However, compared with ref.…”

Section: Design Of the Com‐cmfac Controllermentioning

confidence: 99%

Data‐driven consistent control with data compensation for a class of unknown nonlinear multiagent systems with constraints

Liu

et al. 2023

IET Control Theory & Appl

View full text Add to dashboard Cite

To solve the problem of longitudinal cooperative formation driving control of multiple vehicles, a novel model‐free adaptive control algorithm with data compensation under constraint conditions (COM‐cMFAC) is proposed in this manuscript. In the COM‐cMFAC algorithm, the pseudo partial derivative (PPD), which is a time‐varying parameter, is used to linearize the nonlinear dynamics of the multivehicle cooperative system by using dynamic linearization technology. Then, a COM‐cMFAC controller is designed. For the case of data packet loss, the proposed controller uses a data compensation mechanism that estimates and compensates for the lost data through the data collected at the previous moment to perform packet loss control. Additionally, the controller considers the constrained input and output problems that will occur in the actual control process and imposes input and output constraints. The main advantage of the COM‐cMFAC algorithm is that the entire control process only needs the input and output data of the multivehicle cooperative system, and it also has a good control effect in the case of packet loss. The stability of the proposed method is verified through strict mathematical analysis, and its effectiveness is verified by semiphysical experiments based on a MATLAB/Simulink and Carsim platform connection environment.

show abstract

“…It is challenging for the controller to complete this operation within the carrier-grade network requirement of 50ms [24] or 10ms when dealing with critical data [25]. As reported by [26,27], the operation might be even more complex within a few milliseconds requirement of a vehicle communication system and IoT applications. Another factor to consider is the differences in controllers' processing abilities.…”

Section: Introductionmentioning

confidence: 99%

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Yusuf

Bakar

Isyaku

et al. 2023

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

Software Defined Networking (SDN) introduced network management flexibility that eludes traditional network architecture. Nevertheless, the pervasive demand for various cloud computing services with different levels of Quality of Service requirements in our contemporary world made network service provisioning challenging. One of these challenges is path selection (PS) for routing heterogeneous traffic with end-to-end quality of service support specific to each traffic class. The challenge had gotten the research community's attention to the extent that many PSAs were proposed. However, a gap still exists that calls for further study. This paper reviews the existing PSA and the Baseline Shortest Path Algorithms (BSPA) upon which many relevant PSA(s) are built to help identify these gaps. The paper categorizes the PSAs into four, based on their path selection criteria, (1) PSAs that use static or dynamic link quality to guide PSD, (2) PSAs that consider the criticality of switch in terms of an update operation, FlowTable limitation or port capacity to guide PSD, (3) PSAs that consider flow variabilities to guide PSD and (4) The PSAs that use ML optimization in their PSD. We then reviewed and compared the techniques' design in each category against the identified SDN PSA design objectives, solution approach, BSPA, and validation approaches. Finally, the paper recommends directions for further research.

show abstract

Cluster Based Data Aggregation Scheme for Latency and Packet Loss Reduction in WSN

Cited by 61 publications

References 9 publications

An Energy-Efficient T-Based Routing Topology for Target Tracking in Battery Operated Mobile Wireless Sensor Networks

An Energy-Efficient T-Based Routing Topology for Target Tracking in Battery Operated Mobile Wireless Sensor Networks

Data‐driven consistent control with data compensation for a class of unknown nonlinear multiagent systems with constraints

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Contact Info

Product

Resources

About