
AbstractIn this paper, we address the recurrent problem of node redundancy in heterogeneous Wireless Sensor Networks (WSNs). In addition to presenting a new analytical approach for estimating redundancy and unlike existing works, we propose a new solution where sensors are competing for the identification and relocation of redundant sensors. In our solution, which is mainly based on a comprehensive formulation of redundancy as a dynamic matter, sensors with low redundancy weights force neighboring peers with high redundancy weights to relocate or go to sleep according to a bully strategy. First simulations with the ns3 tool are showing promising results.
Redundancy Directions, Competitive Redundancy Detection, Dynamic redundancy, Sensor Relocation, Wireless Sensor Networks
Redundancy Directions, Competitive Redundancy Detection, Dynamic redundancy, Sensor Relocation, Wireless Sensor Networks
| citations The total number of citations received by all articles of the researcher of interest. | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
