A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network

doi:10.3837/tiis.2018.10.007

Cited by 3 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CHs, which are farther from the sink trajectory, transfer the aggregated data to the RNs. MS announces the arrival to RNs through signals or beacons, and RNs forward the information to the MS when it passes near it 33 …”

Section: Related Workmentioning

confidence: 99%

“…MS announces the arrival to RNs through signals or beacons, and RNs forward the information to the MS when it passes near it. 33 LEACH proposes the self-organization of the sensor nodes i.e., the nodes make the decision to participate in the CH selection process on their own based on energy considerations. 34 Although the integration of MS in the structure does not preserve this ability, it was conserved in the present study.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Energy‐efficient adaptive clustering (EEAC) with rendezvous nodes and mobile sink

Gupta,

Verma,

Gupta

et al. 2023

Int J Communication

View full text Add to dashboard Cite

SummaryWireless sensor networks are an indispensable part of the present industrial and environmental scenario, with the everlasting challenges to increase network lifetime and reduce energy consumption. This paper presents an energy‐efficient adaptive clustering (EEAC) model, which is built upon the existing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol with mobile sink and rendezvous nodes. The nodes are energy aware and participate in cluster head selection only if their current energy is higher than the average energy for the round. The idle nodes in the rendezvous region, which do not act as rendezvous nodes undergo clustering within themselves for the efficient routing of data. The EEAC inspires local clustering successfully conserves the energy of continuous long‐range transmission and enhances network lifetime. The proposed scheme proves to be remarkably better than the previous schemes, especially in large network cross‐sections. It improves alive nodes' performance for around 50% more rounds than the optimizing‐LEACH and the remaining energy curves improve around 500 rounds for 250 mx250 m network. For 350 mx350 m and 450 mx450 m networks, the results improved much in EEAC. In addition, the improvement in stability period is 450%, 578%, and 198% for the network cross‐section 150 mx150 m, 200 mx200m, and 250 mx250 m, respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Energy‐efficient adaptive clustering (EEAC) with rendezvous nodes and mobile sink

Gupta,

Verma,

Gupta

et al. 2023

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Hu et al 14 proposed rendezvous node selection and routing algorithm (RNSRA) for WSNs. In this approach, they first derived the rendezvous node that will work as a data collector.…”

Section: Related Workmentioning

confidence: 99%

M‐RPSS: A modified RPSS for path scheduling of mobile sink in wireless sensor network

Kundaliya

Hadia

2020

Int J Communication

View full text Add to dashboard Cite

In wireless sensor networks (WSNs), data gathering is the main concern, since it directly affects the network lifetime and data latency. Rendezvous Point Selection Scheme (RPSS) is a mobile sink node approach; it offers superior performance than its preceding mobile sink schemes like Rendezvous Design for Variable Track (RD-VT), RD-VT with Steiner Minimum Tree (RD-VT-SMT), and Weight Rendezvous Planning with Steiner Minimum Tree (WRP-SMT).However, a more uniform distribution of the rendezvous node leads to less energy consumption in WSNs. The more optimum path offers less data latency. In the proposed approach, we use particle swarm optimization (PSO) to find the optimum rendezvous point and adaptive PSO (APSO) to find an optimum path by solving the travelling salesman problem. By rigorous simulation, we prove that modified RPSS (M-RPSS) increases the network lifetime by more than 10% and decreases the data latency. K E Y W O R D SAPSO, M-RPSS, PSO, travelling salesman problem, WSN

show abstract

Group signature with time-bound keys and unforgeability of expiry time for smart cities

Fang

Feng

2021

J Wireless Com Network

View full text Add to dashboard Cite

Internet of Things (IoT) lays the foundation for the various applications in smart cities, yet resource-constrained IoT devices are prone to suffer from devastating cyberattacks and privacy leak threats, thus are inevitability supposed as the weakest link of the systems in smart cities. Mitigating the security risks of data and the computing limitation of edge devices, especially identity authentication and key validity management of group devices are essential for IoT system security. In order to tackle the issues of anonymity, traceability, unforgeability of expiry time as well as efficient membership revocation for life-cycle management of devices in IoT setting, we presented a dynamic time-bound group signature with unforgeability of expiry time. Unforgeability of expiry time disables a revoked signer to create a valid signature by means of associating the signing key with an expiry time. The anonymity and traceability of the proposed scheme contribute to the identity privacy of the entities and supervision for authority agency. Moreover, our proposal is feasible in the resource-constrained setting for efficient computational cost of signing and verification algorithms.

show abstract

A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network

Cited by 3 publications

References 18 publications

Energy‐efficient adaptive clustering (EEAC) with rendezvous nodes and mobile sink

Energy‐efficient adaptive clustering (EEAC) with rendezvous nodes and mobile sink

M‐RPSS: A modified RPSS for path scheduling of mobile sink in wireless sensor network

Group signature with time-bound keys and unforgeability of expiry time for smart cities

Contact Info

Product

Resources

About