Distributed Clustering and Closest-Match Motion Planning Algorithms for Wireless Ad-Hoc Networks with Movable Base Stations

In this paper algorithms for modelling dynamic reconfiguration of ad-hoc wireless networks with movable base stations in presence of obstacles are proposed. This problem is considerably harder than the one treated in [1] where base stations were organized in a starred network and no obstacles were present. In these models nodes communicate through a clusterehead gateway switching routing protocol. In [1] both host clustering and base stations repositioning computations were performed by the center of the star. Here movable base stations are organized in an Ad-Hoc Network. Clustering, center computation and repositioning are performed in a distributed fashion among the base stations. The amount of transmitted information is proportional to the number of base stations. Obstacles which may interfere with hosts clustering and base stations motion are present. Repositioning is performed by a fast motion planning algorithm based on an extension of the bottleneck matching computational geometry technique to visibility graphs.

[1]  Dennis Shasha,et al.  Fast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks , 2003, Int. J. Found. Comput. Sci..

[2]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[3]  J. Evans,et al.  Networking on the battlefield: challenges in highly dynamic multi-hop wireless networks , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[4]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[5]  Alfredo Ferro,et al.  Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[6]  Mario Gerla,et al.  Clustering with power control , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[7]  Mario Gerla,et al.  Minuteman: Forward projection of unmanned agents using the airborne internet , 2002, Proceedings, IEEE Aerospace Conference.

[8]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[9]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[10]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[11]  Stephan Olariu,et al.  An architecture for robust QoS provisioning for mobile tactical communications , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

[12]  Martial Hebert,et al.  Autonomous Driving with Concurrent Goals and Multiple Vehicles: Mission Planning and Architecture , 2001, Auton. Robots.

[13]  Micha Sharir,et al.  Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications , 1999, SIAM J. Comput..

[14]  Diego Reforgiato Recupero,et al.  Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces , 2005, IEEE Transactions on Knowledge and Data Engineering.

[15]  Samir Khuller,et al.  A clustering scheme for hierarchical control in multi-hop wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Alon Itai,et al.  Geometry Helps in Bottleneck Matching and Related Problems , 2001, Algorithmica.

[17]  Bharat Bhargava,et al.  Hierarchical structure for supporting movable base stations in wireless networks , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[18]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[19]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[20]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[21]  Mario Gerla,et al.  On-demand routing in large ad hoc wireless networks with passive clustering , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[22]  Ranjan K. Sen,et al.  1-Approximation Algorithm for Bottleneck Disjoint Path Matching , 1995, Inf. Process. Lett..