Equal Size Clusters to Reduce Congestion in Wireless Multimedia Sensor Networks

Bejaoui, Chaima; Guitton, Alexandre; Kachouri, Abdennaceur

doi:10.1007/s11277-017-4679-0

Cited by 10 publications

(5 citation statements)

References 18 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…False data injection: when an attacker compromises sensor readings in such a tricky way that undetected errors are introduced into calculations of state variables and values [28]. In the experiment shown by Figure 3, we created a group containing 20 nodes (according to [29]), the initial values of the clock are generated randomly in the interval [0.01,0.5], the number of iterations equal to 50; in each iteration, it was assumed that each node received only 18 values (chosen randomly from the 19 values generated by their neighbors) where one value was manipulated by an attacker, so the node will reject it because of false decryption. In Figure 3 A, the experiment is done without generating offset errors during all the iterations, we observe that the system has converged after 10 iterations.…”

Section: A Attack Modelsmentioning

confidence: 99%

Secure Clock Synchronization Protocol in Wireless Sensor Networks

Kara

Laouid

Bounceur

et al. 2023

Preprint

View full text Add to dashboard Cite

Cryptography helps solve many computer and communication problems, including clock synchronization, where a group of nodes wants to agree on a theoretically unique clock in the system with the presence of malicious nodes trying to prevent the process of convergence; so we will need a set of mechanisms, including encryption. Many synchronization techniques suffer from high power consumption or vulnerability to attack or difficulty of implementation. In this article, we propose a synchronization protocol that contains two parts. The first part uses a lightweight linear scheme to encrypt clock messages to fend off certain types of attacks such as message manipulation. This scheme is suitable for Wireless sensor networks (WSNs) with negligible encryption and decryption time. The second part is the process of calculating the clock based on a very simple consensus algorithm. The study of the proposed protocol has shown very satisfactory results.

show abstract

Section: A Attack Modelsmentioning

confidence: 99%

Secure Clock Synchronization Protocol in Wireless Sensor Networks

Kara

Laouid

Bounceur

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Based on the role division of network nodes, Heng et al adopted a multihop, layered routing scheme, which balances the energy consumption of each node, to transmit images [19]. Bejaoui et al proposed a cluster based routing protocol from the perspective of network congestion, considering maximum cluster head utilization; the possible congestion in and the energy consumption of the network can be reduced, and the number of cluster heads can be minimized by balancing the number of nodes in each cluster [20]. Kumar et al considered the difference in the residual energy of wireless multimedia sensor nodes and proposed a heterogeneous clustering scheme based on the weighted election probabilities of each node.…”

Section: Related Workmentioning

confidence: 99%

“…The six camera nodes were located at (20,20), (20,80), (60,20), (60,80), (50,50), (80,50), and (80,50). The coordinates were fluctuated up and down by 5 m, as shown in Figure 6.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…If these tasks are concentrated on a single camera node, the used storage and processing pressure are increased, leading to instantaneous energy depletion. Through distributed image compression, the energy consumption of the network can be balanced, and the life cycle of the network can be extended [18][19][20]. However, because the networks still use the limited battery for power sources, if the depleted battery is not replaced, the network will deplete soon.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Distributed Image Compression Scheme for Energy Harvesting Wireless Multimedia Sensor Networks

Han

Zhang

et al. 2020

Sensors

View full text Add to dashboard Cite

As an emerging technology, edge computing will enable traditional sensor networks to be effective and motivate a series of new applications. Meanwhile, limited battery power directly affects the performance and survival time of sensor networks. As an extension application for traditional sensor networks, the energy consumption of Wireless Multimedia Sensor Networks (WMSNs) is more prominent. For the image compression and transmission in WMSNs, consider using solar energy as the replenishment of node energy; a distributed image compression scheme based on solar energy harvesting is proposed. Two level clustering management is adopted. The camera node-normal node cluster enables camera nodes to gather and send collected raw images to the corresponding normal nodes for compression, and the normal node cluster enables the normal nodes to send the compressed images to the corresponding cluster head node. The re-clustering and dynamic adjustment methods for normal nodes are proposed to adjust adaptively the operation mode in the working chain. Simulation results show that the proposed distributed image compression scheme can effectively balance the energy consumption of the network. Compared with the existing image transmission schemes, the proposed scheme can transmit more and higher quality images and ensure the survival of the network.

show abstract

“…As the node forwards, this error accumulates. Therefore, a correction factor ρ is introduced to improve the actual transmission distance per hop and eliminate the error [19]. In Figure 6, v i+1 is the ideal next hop node of n i node, n i actually chooses the next hop node as n i+1 node.…”

Section: Error Correction Calculationmentioning

confidence: 99%

Multimedia Independent Multipath Routing Algorithms for Internet of Things Based on a Node Hidden Communication Model

Jian-hui

2019

Future Internet

View full text Add to dashboard Cite

In order to achieve a multi-path routing algorithm with time delay and energy consumption balance to alleviate the energy holes around a sink, a multimedia independent multipath routing algorithm for internet of things (IoT) based on node hidden communication model is proposed in this paper. On the premise of satisfying the application delay, a multi-source multi-path routing algorithm is proposed by using the idea of software definition and fitting multiple curves to form independent multi-path routing. Through a sink node centralized programming control source node routing, according to the priority of the source node, the dynamic angle of the source node can be allocated, which effectively reduces the energy consumption of the network. In addition, considering that the Internet of Things has more perceptive nodes, limited computing and storage capacity, frequent joining and exiting operations and other factors, a hidden communication model of nodes is designed for the IoT. It is helpful to improve the level of privacy protection in the IoT, and to effectively improve the ability of nodes to resist attacks in the IoT. The experimental results show that the proposed algorithm avoids the interference between paths and various network attacks to the greatest extent, and the energy consumption is relatively low under the requirement of quality of service (QoS) delay.

show abstract

Equal Size Clusters to Reduce Congestion in Wireless Multimedia Sensor Networks

Cited by 10 publications

References 18 publications

Secure Clock Synchronization Protocol in Wireless Sensor Networks

Secure Clock Synchronization Protocol in Wireless Sensor Networks

A Distributed Image Compression Scheme for Energy Harvesting Wireless Multimedia Sensor Networks

Multimedia Independent Multipath Routing Algorithms for Internet of Things Based on a Node Hidden Communication Model

Contact Info

Product

Resources

About