Wireless Power Transfer Algorithms, Technologies and Applications in Ad Hoc Communication Networks by Sotiris Nikoletseas Yuanyuan Yang & Apostolos Georgiadis

Author:Sotiris Nikoletseas, Yuanyuan Yang & Apostolos Georgiadis
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Fig. 15.9Routing robustness for uniform deployments

Fig. 15.10Coverage aging for uniform deployments

(iii) Similar to the routing robustness, the number of strongly connected graph components is an overall measure of connectivity quality in a wireless sensor network. Disconnected components are unable to communicate with each other and support efficient data propagation, resulting in high data delivery failures. A strategy of improving data delivery latency is the maintenance of a small number of connected components in the network. High numbers of components may lead to isolation of critical nodes, thus loss of important information. Figure 15.8c depicts the evolution of the number of network components throughout the experiments. As we noted earlier, DC and CC protocols lead to a higher node death rate in comparison to CCRK and DCLK protocols, a fact that results in early disconnections and sharp increase of connected components. The powerful CCGK maintains a single strongly connected component for much longer.

(iv) Point coverage problem regards the assurance that some selected points in the network are covered by an adequate number of sensors and is an important aspect in numerous wireless sensor networks functionalities (e.g. localization, tracking, etc.). A point that is covered by k sensors is called k-covered. In Fig. 15.10 we can see the coverage aging of 1000 randomly selected points scattered throughout the network. We examine how many points are <2-covered, 2-covered, 3-covered and >3-covered for 4000 generated events. Each bar in the plot represents a number of the covered points. In the no charger case, the number of <2-covered points is increasing in contrast to the number of >3-covered points that is decreasing. CCGK, DCLK and CCRK protocols improve the network coverage by reducing the rate that the coverage of >3-covered points is decreasing. The absolute difference of the number of <2-covered and >3-covered points, between different time instances, is not increasing quickly, compared to the no charger case.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.