Characteristic function of connectivity with obstacles

Previous works usually simplify the network area as a disk, a square or a torus without obstacles. However, geometry in practical environment is much more intricate. Rectilinear communication between nodes is often blocked by external surroundings, such as buildings and mountains. Complicated shapes of the obstacles may cause the computation intractable. In this paper, we propose a characteristic function of connectivity to capture the geometric features of an ad-hoc network. The function can be expressed as power series, of which the orders and coefficients is based on the characteristics of the network. We formulate the shapes with fundamental factors and investigate their algebraic impact on connectivity. The critical transmission range is also calculated to mitigate the influence of obstacles.

[1]  Erland Jungert,et al.  Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Joel M. Esposito,et al.  Maintaining wireless connectivity constraints for swarms in the presence of obstacles , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[3]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[4]  Anne-Marie Kermarrec,et al.  Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[5]  Yu-Chee Tseng,et al.  Efficient deployment algorithms for ensuring coverage and connectivity of wireless sensor networks , 2005, First International Conference on Wireless Internet (WICON'05).