Estimating the free region of a sensor node

MaRDI QIDQ3012570zbMATH OpenFDO

Authors Navin Rongratana, Jan Pedersen, Laxmi P. Gewali

Publication date 6 July 2011

zbMATH Keywords

approximation algorithmsnetwork connectivitymaximal free regionsrelocation of sensor nodes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Free regions of sensor nodes
• Algorithmic Aspects of Wireless Sensor Networks
• Algorithmic Aspects of Wireless Sensor Networks
• Optimizing movement in convex and non-convex path-networks to establish connectivity
• Geometric algorithms for sensor networks

Cited in

(2)

• Free regions of sensor nodes
• Roaming regions for Delaunay nodes

This page was built for publication: Estimating the free region of a sensor node

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012570)