A new routing scheme based on adaptive selection of geographic directions

Geographic routing is recognized as an appealing approach to achieve efficient communications with low computational complexity and space cost. In order to apply this technology in Cyber-Physical Systems (CPSs), a comprehensive consideration must be given to performance issues such as throughput, delay, and load balance. In this paper, we provide a new routing scheme based on forwarding packets to multiple geographic directions. The proposed routing protocols are studied and analyzed theoretically. Theoretical bounds of throughput, delays and space cost are presented. Simulations show that our method performs more efficiently than traditional geographic routing schemes in terms of throughput, delay, and load balance with acceptable space cost. Our experiments also verify the tradeoff between performance metrics.

[1]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[2]  Yunhao Liu,et al.  Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods , 2009, MobiHoc '09.

[3]  Sanjay Shakkottai,et al.  On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  Wei Zeng,et al.  Exploration of path space using sensor network geometry , 2011, Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks.

[5]  Robert D. Kleinberg Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Xiaogang Wang,et al.  A distributed routing for wireless sensor networks with mobile sink based on the greedy embedding , 2014, Ad Hoc Networks.

[7]  Chen Qian,et al.  Geographic Routing in $d$-Dimensional Spaces With Guaranteed Delivery and Low Stretch , 2011, IEEE/ACM Transactions on Networking.

[8]  David Eppstein,et al.  Succinct Greedy Geometric Routing Using Hyperbolic Geometry , 2011, IEEE Transactions on Computers.

[9]  Hongyi Wu,et al.  Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks , 2011, MobiHoc '11.

[10]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[11]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[12]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[13]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[14]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[15]  Edward A. Lee Cyber Physical Systems: Design Challenges , 2008, 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC).

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

[17]  S. Sastry Nonlinear Systems: Analysis, Stability, and Control , 1999 .

[18]  Xianliang Lu,et al.  Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing , 2009, IEEE INFOCOM 2009.

[19]  I. Stojmenovic,et al.  Message-Efficient Beaconless Georouting With Guaranteed Delivery in Wireless Sensor, Ad Hoc, and Actuator Networks , 2010, IEEE/ACM Transactions on Networking.

[20]  Fabian Kuhn,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[21]  Mark Crovella,et al.  On the choice of a spanning tree for greedy embedding of network graphs , 2013 .

[22]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[24]  Robert Morris,et al.  Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding , 2001 .

[25]  Xiaojun Lin,et al.  The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks , 2022 .

[26]  Chen Qian,et al.  Greedy Distance Vector Routing , 2011, 2011 31st International Conference on Distributed Computing Systems.

[27]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[28]  Roger Wattenhofer,et al.  An algorithmic approach to geographic routing in ad hoc and sensor networks , 2008, TNET.

[29]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[30]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[31]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[32]  Jie Gao,et al.  Greedy routing with guaranteed delivery using Ricci flows , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[33]  Sanjay Shakkottai,et al.  Optimal Geographic Routing for Wireless Networks with Near-Arbitrary Holes and Traffic , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[34]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[35]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[37]  Roger Wattenhofer,et al.  An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks , 2008, IEEE/ACM Transactions on Networking.

[38]  Hongyi Wu,et al.  A robust boundary detection algorithm based on connectivity only for 3D wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[39]  Deying Li,et al.  3D geometric routing without loops and dead ends in wireless sensor networks , 2014, Ad Hoc Networks.

[40]  C. A. Desoer,et al.  Nonlinear Systems Analysis , 1978 .