Practical Virtual Coordinates for large wireless sensor networks

Geographic routing is a promising approach for point-to-point routing in wireless sensor networks, but it requires the availability of geographic coordinates. Location devices like GPS do not work indoors and they are often not cost-effective for ubiquitous deployment on a large scale. While it is possible to manually configure coordinates for small sensor networks, it is infeasible to do the same for large-scale networks with thousands of nodes. We present Particle Swarm Virtual Coordinates (PSVC), a distributed virtual coordinate assignment algorithm that employs Particle Swarm Optimization to compute virtual coordinates for geographic routing. PSVC converges faster, achieves a lower hop stretch, and scales well up to large networks of 3,200 nodes compared to NoGeo. Also, PSVC makes no assumptions on the network topology and can naturally be extended to three-dimensional (3D) wireless sensor networks.

[1]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

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

[3]  Matt Welsh,et al.  MoteLab: a wireless sensor network testbed , 2005, IPSN '05.

[4]  David G. Kirkpatrick,et al.  On routing with guaranteed delivery in three-dimensional ad hoc wireless networks , 2010, Wirel. Networks.

[5]  Stefano Chessa,et al.  GPS free coordinate assignment and routing in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Andreas Willig,et al.  TWIST: a scalable and reconfigurable testbed for wireless indoor experiments with sensor networks , 2006, REALMAN '06.

[7]  Guoliang Xing,et al.  On greedy geographic routing algorithms in sensing-covered networks , 2004, MobiHoc '04.

[8]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[9]  Lili Qiu,et al.  S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks , 2007, NSDI.

[10]  Roger Wattenhofer,et al.  Randomized 3D Geographic Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[11]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[12]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[13]  Jie Wu,et al.  Efficient Geometric Routing in Three Dimensional Ad Hoc Networks , 2009, IEEE INFOCOM 2009.

[14]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

[15]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[16]  Cédric Westphal,et al.  Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.

[17]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

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

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

[20]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).