Nodes self-scheduling approach for maximising wireless sensor network lifetime based on remaining energy

Zaïri, S.; Zouari, Belhassen; Niel, Éric; Dumitrescu, Emil

doi:10.1049/iet-wss.2011.0074

Cited by 37 publications

(42 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zairi et al 8 and Zhu et al 9 have provided the relevant proof. Thus, in the monitoring area, the awareness intensity of a certain point can be converted into the probability expression form of the certain point.…”

Section: Definition 5 (Awareness Intensitymentioning

confidence: 99%

“…[4][5][6][7] The energy consuming and the coverage quality of the network are the two key points in the field of wireless sensor network research. [8][9][10] The coverage quality will affect the monitoring effectiveness on moving target; its behavior characteristic is mainly reflected in the deployment mode of sensor node. The energy consumption of the network is shown as the effective reduction of the sensor nodes' quick energy consumption, which can prolong the lifetime of the whole network.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks

Sun

Xing

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In the process of the wireless sensor network research, the issue on the energy consumption and coverage is an essential and critical one. According to the characteristic of the sensor nodes, it is homogeneous, and we proposed the kdegree coverage algorithm based on optimization nodes deployment. First, the algorithm gives the solving procedure of the maximum seamless coverage ratio, when the three-node joint coverage has been provided. Second, when the sensor nodes are covering the monitoring area, the algorithm gives the solving procedure of the expected coverage quality and the judgment methods of the coverage ratio, when the nodes are compared with the nearby ones. And when there is redundancy coverage in the given monitoring area, we have given the solving procedure of any sensor nodes that exist in the redundant nodes coverage. Finally, using the simulation experiment, the results of the coverage algorithm based on optimization nodes deployment are compared with other algorithms in terms of the coverage quality and the network lifetime, the performance indexes have enhanced to 13.36% and 12.92% on average. Thus, the effectiveness and viability of the coverage algorithm based on optimization nodes deployment have been proved.

show abstract

Section: Definition 5 (Awareness Intensitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks

Sun

Xing

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…The maximizing coverage-time problem is solvable in linear time under stochastic setups. The deployment of information coverage and random coverage was conducted by using the sensor density relation, and the upper bound value of probability was given to calculate that of information coverage and the events [13]. The stochastic scheduling algorithm was studied, including simulation of network coverage intensity, delay detection and probability of detection.…”

Section: Related Workmentioning

confidence: 99%

A Linear Programming with Alliance Strategy Coverage in Wireless Sensor Networks

Sun¹,

Yang²,

Dong³

2016

IJFGCN

View full text Add to dashboard Cite

show abstract

“…According to the mobility property of the node, the coverage problem that is an important topic in the wireless sensor network can be divided into two classes: static nodes and mobile nodes [10,11]. Therefore, according to the constitution of nodes, WSN can be divided into two types: static and mobile.…”

Section: Introductionmentioning

confidence: 99%

A novel coverage algorithm based on event-probability-driven mechanism in wireless sensor network

Sun

Wang

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

Coverage problem is an important research topic in the field of wireless sensor network (WSN). The coverage algorithm based on event probability driven mechanism (EPDM) is put forward in this paper. First of all, the network probability model is established and the subordinate relation between sensor nodes and the target nodes is presented. Secondly, a series of probability is computed and the related theorems and reasoning are also proven. Thirdly, effective coverage for the monitoring region is achieved through scheduling mechanism of nodes themselves, thus the purpose of increasing network lifetime can be realized. Finally, experimental results show that the proposed algorithm could achieve complete coverage for networks of different scale and increase the network lifetime. It possesses the good quality of effectiveness and stability.

show abstract

Nodes self-scheduling approach for maximising wireless sensor network lifetime based on remaining energy

Cited by 37 publications

References 20 publications

k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks

k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks

A Linear Programming with Alliance Strategy Coverage in Wireless Sensor Networks

A novel coverage algorithm based on event-probability-driven mechanism in wireless sensor network

Contact Info

Product

Resources

About