The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2011 vol.10)
pp: 1214-1226
Abdalkarim Awad , University of Erlangen, Erlangen
Reinhard German , University of Erlangen, Erlangen
Falko Dressler , University of Erlangen, Erlangen
We present the Virtual Cord Protocol (VCP), which exploits virtual coordinates to provide efficient and failure tolerant routing and data management in sensor networks. VCP maintains a virtual cord interconnecting all the nodes in the network and which, operating similar to a Distributed Hash Table (DHT), provides means for inserting data fragments into sensor nodes and retrieving them. Furthermore, it supports service discovery using indirections. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always provides a path toward the destination. Second, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the shortest path (achieving a stretch ratio of less than 125 percent) with very low overhead. We also extended VCP with data replication mechanisms to improve failure handling. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g., Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The presented results outline the capabilities of VCP to handle such cases more efficiently compared to other protocols. We also compared the capabilities to reliably store and retrieve data in the network to Geographic Hash Tables (GHTs). VCP, in the worst case, performs similar to GHTs, but outperforms this protocol in most cases, especially when complex routing is involved.
Virtual coordinates, ad hoc routing, data management, sensor networks.
Abdalkarim Awad, Reinhard German, Falko Dressler, "Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks", IEEE Transactions on Mobile Computing, vol.10, no. 9, pp. 1214-1226, September 2011, doi:10.1109/TMC.2010.218
[1] M. Caesar, M. Castro, E.B. Nightingale, G. O'Shea, and A. Rowstron, “Virtual Ring Routing: Network Routing Inspired by DHTs,” Proc. ACM SIGCOMM, Sept. 2006.
[2] C.-H. Lin, B.-H. Liu, H.-Y. Yang, C.-Y. Kao, and M.-J. Tasi, “Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks with Unidirectional Links,” Proc. IEEE INFOCOM, Apr. 2008.
[3] A. Awad, C. Sommer, R. German, and F. Dressler, “Virtual Cord Protocol (VCP): A Flexible DHT-like Routing Service for Sensor Networks,” Proc. Fifth IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS '08), pp. 133-142, Sept. 2008.
[4] M.-J. Tsai, F.-R. Wang, H.-Y. Yang, and Y.-P. Cheng, “VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks,” Proc. IEEE INFOCOM, Apr. 2009.
[5] T. Watteyne, D. Simplot-Ryl, I. Augé-Blum, and M. Dohler, “On Using Virtual Coordinates for Routing in the Context of Wireless Sensor Networks,” Proc. 18th IEEE Int'l Symp. Personal, Indoor and Mobile Radio Comm. (PIMRC '07), pp. 1-5, Sept. 2007.
[6] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, pp. 393-422, 2002.
[7] J. Yick, B. Mukherjee, and D. Ghosal, “Wireless Sensor Network Survey,” Computer Networks, vol. 52, no. 12, pp. 2292-2330, Aug. 2008.
[8] F. Dressler, Self-Organization in Sensor and Actor Networks. John Wiley & Sons, Dec. 2007.
[9] K. Akkaya and M. Younis, “A Survey of Routing Protocols in Wireless Sensor Networks,” Ad Hoc Networks, vol. 3, no. 3, pp. 325-349, 2005.
[10] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
[11] I. Chakeres and C. Perkins, “Dynamic MANET On-Demand (DYMO) Routing,” Internet Draft (Work in Progress), draft-ietf-manet-dymo-10.txt, July 2007.
[12] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H.F. Korth, eds., vol. 353, pp. 152-181, Kluwer Academic, 1996.
[13] B. Krishnamachari, D. Estrin, and S. Wicker, “The Impact of Data Aggregation in Wireless Sensor Networks,” Proc. Int'l Workshop Distributed Event Based System (DEBS '02), July 2002.
[14] R. Govindan, “Data-Centric Routing and Storage in Sensor Networks,” Wireless Sensor Networks, C.S. Raghavendra, K.M. Sivalingam, and T. Znati, eds., pp. 185-205, Springer, 2004.
[15] J. Gehrke and S. Madden, “Query Processing in Sensor Networks,” IEEE Pervasive Computing, vol. 3, no. 1, pp. 46-55, Jan.-Mar. 2004.
[16] Peer-to-Peer Systems and Applications, R. Steinmetz and K. Wehrle, eds. Springer, 2005.
[17] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
[18] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware), pp. 329-350, Nov. 2001.
[19] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, pp. 243-254, 2000.
[20] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information,” Proc. ACM MobiCom, Sept. 2003.
[21] M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad-Hoc Networks,” IEEE Network, vol. 15, no. 6, pp. 30-39, Nov./Dec. 2001.
[22] R. Flury, S.V. Pemmaraju, and R. Wattenhofer, “Greedy Routing with Bounded Stretch,” Proc. IEEE INFOCOM, Apr. 2009.
[23] G. Tan, M. Bertier, and A.-M. Kermarrec, “Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing,” Proc. IEEE INFOCOM, Apr. 2009.
[24] A. Awad, L.R. Shi, R. German, and F. Dressler, “Advantages of Virtual Addressing for Efficient and Failure Tolerant Routing in Sensor Networks,” Proc. Sixth IEEE/IFIP Conf. Wireless On Demand Network Systems and Services (WONS '09), pp. 111-118, Feb. 2009.
[25] F. Dressler and F. Chen, “Dynamic Address Allocation for Self-Organized Management and Control in Sensor Networks,” Int'l J. Mobile Network Design and Innovation, vol. 2, no. 2, pp. 116-124, 2007.
[26] C.N. Ververidis and G.C. Polyzos, “Service Discovery for Mobile Ad Hoc Networks: A Survey of Issues and Techniques,” IEEE Comm. Surveys and Tutorials, vol. 10, no. 3, pp. 30-45, 2008.
[27] A. Awad, R. German, and F. Dressler, “Efficient Routing and Service Discovery in Sensor Networks Using Virtual Cord Routing,” Proc. Seventh ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys '09), June 2009.
[28] S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu, “Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table,” ACM/Springer Mobile Networks and Applications, Special Issue on Wireless Sensor Networks, vol. 8, no. 4, pp. 427-442, Aug. 2003.
[29] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, “GHT: A Geographic Hash Table for Data-Centric Storage,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), Sept. 2002.
[30] G. Tan, M. Bertier, and A.-M. Kermarrec, “Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks,” Proc. IEEE INFOCOM, Apr. 2009.
[31] K. Liu and N. Abu-Ghazaleh, “Aligned Virtual Coordinates for Greedy Routing in WSNs,” Proc. Third IEEE Int'l Conf. Mobile Ad Hoc and Sensor Systems (MASS '06), pp. 377-386, Oct. 2006.
[32] B. Leong, B. Liskov, and R. Morris, “Greedy Virtual Coordinates for Geographic Routing,” Proc. 15th IEEE Int'l Conf. Network Protocols (ICNP '07), pp. 71-80, Oct. 2007.
[33] Y. Zhao, Y. Chen, B. Li, and Q. Zhang, “Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 6, no. 9, pp. 1075-1089, Sept. 2007.
[34] J. Newsome and D.X. Song, “GEM: Graph Embedding for Routing and Data-Centric Storage in Sensor Networks without Geographic Information,” Proc. First ACM Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 76-88, Nov. 2003.
[35] C.T. Ee, S. Ratnasamy, and S. Shenker, “Practical Data-Centric Storage,” Proc. Third Symp. Networked Systems Design and Implementation (NSDI '06), pp. 325-338, May 2006.
[36] Ö.D. Incel and B. Krishnamachari, “Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks,” Proc. Fifth IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON '08), pp. 569-577, June 2008.
[37] A. Varga, “The OMNeT++ Discrete Event Simulation System,” Proc. European Simulation Multiconf. (ESM '01), June 2001.
[38] F. Chen, N. Wang, R. German, and F. Dressler, “Simulation Study of IEEE 802.15.4 LR-WPAN for Industrial Applications,” Wireless Comm. and Mobile Computing, vol. 10, no. 5, pp. 609-621, May 2010.
[39] C. Sommer, I. Dietrich, and F. Dressler, “Simulation of Ad Hoc Routing Protocols Using OMNeT++: A Case Study for the DYMO Protocol,” ACM/Springer Mobile Networks and Applications, Special Issue on Simulation Techniques and Tools for Mobile Networking, doi:10.1007/s11036-009-0174-5, 2009.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool