A Geometric Deployment and Routing Scheme for Directional Wireless Mesh Networks

This paper first envisions the advent of the wireless mesh networks with multiple radios and directional antennas in future. Then, based on the observation that simplicity induces efficiency and scalability, the paper proposes a joint geometric deployment and routing strategy for such mesh networks, and also gives a concrete approach under this strategy. The main idea of this strategy is to deploy mesh networks in certain kind of geometric graph, and then design a geometric routing protocol by exploiting the routing properties of this graph. The proposed concrete approach comprises two parts: (1) a topology generation algorithm based on Delaunay triangulations and (2) a geometric routing protocol based on the greedy forwarding algorithm. Both parts are characterized by simplicity and appealing properties, with formal proofs provided when possible. The simulation results validate our proposed approach.

[1]  Edward W. Knightly,et al.  A Performance Study of Deployment Factors in Wireless Mesh Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  L.J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2001, IEEE Journal on Selected Areas in Communications.

[3]  Prosenjit Bose,et al.  On the stabbing number of a random Delaunay triangulation , 2007, Comput. Geom..

[4]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[5]  Vangelis Angelakis,et al.  The effect of using directional antennas on adjacent channel interference in 802.11a: Modeling and experience with an outdoors testbed , 2008, 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops.

[6]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[7]  Yuanyuan Yang,et al.  Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks , 2005, IEEE Transactions on Computers.

[8]  Michael Zink,et al.  The Impact of Directional Antenna Orientation, Spacing, and Channel Separation on Long-distance Multi-hop 802.11g Networks: A Measurement Study , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[9]  Randy Bush,et al.  Some Internet Architectural Guidelines and Philosophy , 2002, RFC.

[10]  MetroMesh TM Architecture A Technology Whitepaper.  Tropos Networks MetroMesh Architecture Metro-Scale Mesh Networking DefinedTM , 2008 .

[11]  Alper Üngör.  O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations , 2004, LATIN.

[12]  Azriel Rosenfeld,et al.  Learning in Navigation Goal Finding in Graphs , 1996, Int. J. Pattern Recognit. Artif. Intell..

[13]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[14]  Edoardo Amaldi,et al.  Planning UMTS base station location: optimization models with power control and algorithms , 2003, IEEE Trans. Wirel. Commun..

[15]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[16]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[17]  P. Giblin.  Computational geometry: algorithms and applications (2nd edn.), by M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Pp. 367. £20.50. 2000. ISBN 3 540 65620 0 (Springer-Verlag). , 2001, The Mathematical Gazette.

[18]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[19]  Maarten Löffler,et al.  The spanning ratio of the Delaunay triangulation is greater than pi/2 , 2009, CCCG.

[20]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[21]  Ge Xia.  Improved upper bound on the stretch factor of delaunay triangulations , 2011, SoCG '11.

[22]  Frank Harary,et al.  Graph Theory , 2016 .

[23]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[24]  Weisheng Si,et al.  A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[25]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[26]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[27]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[28]  Pramod K. Varshney,et al.  A survey of void handling techniques for geographic routing in wireless networks , 2007, IEEE Communications Surveys & Tutorials.

[29]  Nitin H. Vaidya,et al.  Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks , 2006, MOCO.

[30]  Leonidas J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2005 .

[31]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[32]  Hassan Masum,et al.  Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf , 2000, SIGA.

[33]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[34]  Sanjay Chouhan,et al.  TECHNOLOGY Performance Analysis of Brain MRI Using Multiple Method , 2015 .

[35]  Rudolf Mathar,et al.  Optimum positioning of base stations for cellular radio networks , 2000, Wirel. Networks.

[36]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[37]  Solving the Wireless Mesh Multi-Hop Dilemma , 2005 .

[38]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..