English

On the Energy Efficient Displacement of Random Sensors for Interference and Connectivity

Data Structures and Algorithms 2019-05-07 v3 Information Theory math.IT

Abstract

This paper investigates the problem of the minimilization of energy consumption in reallocation of wireless mobile sensors network (WMSN) to assure good communication without interference. Fix dN{0}.d\in\mathbb{N}\setminus\{0\}. Assume nn sensors are initially randomly placed in the hyperoctant [0,)d[0,\infty)^d according to dd identical and independent Poisson processes each with arrival rate λ>0.\lambda>0. Let 0<sv0< s \le v be given real numbers. We are allowed to move the sensors, so that every two consecutive sensors are placed at distance greater than or equal to ss and less than or equal to v.v. Fix a1.a\ge 1. Assume that ii-th sensor is displaced a distance equal to m(i).m(i). The cost measure for the displacement of the team of sensors is the sum i=1ndia\sum_{i=1}^{n}d_i^a (aa-total movement). In this work, we discover and explain a sharp decline and a sharp increase (a threshold phenomena) in the expected minimal aa-total movement around the interference-connectivity distances s,vs,v equal to 1λ.\frac{1}{\lambda}.

Keywords

Cite

@article{arxiv.1611.06329,
  title  = {On the Energy Efficient Displacement of Random Sensors for Interference and Connectivity},
  author = {Rafał Kapelko},
  journal= {arXiv preprint arXiv:1611.06329},
  year   = {2019}
}