Table of Contents
ISRN Sensor Networks
Volume 2013, Article ID 805635, 15 pages
http://dx.doi.org/10.1155/2013/805635
Research Article

Borel Cayley Graph-Based Topology Control for Consensus Protocol in Wireless Sensor Networks

1Department of Electrical and Computer Engineering, Stony Brook University—SUNY, Stony Brook, NY 11794-2350, USA
2Intel Labs, 2111 Northeast 25th Avenue, Hillsboro, OR 97124, USA
3AT&T Laboratories, 200s Laurel Avenue, Middletown, NJ 07747, USA

Received 15 June 2013; Accepted 11 July 2013

Academic Editors: C.-Y. Chow and S. Srinivasan

Copyright © 2013 Junghun Ryu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Culler, D. Estrin, and M. Srivastava, “Introduction: overview of sensor networks,” Computer, vol. 37, no. 8, pp. 41–49, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, vol. 40, no. 8, pp. 102–114, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. C. E. Perkins, “Ad hoc networking: an introduction,” in Ad Hoc Networking, pp. 1–28, Addison-Wesley Longman, Boston, Mass, USA, 2001. View at Google Scholar
  4. T. Schmid, H. Dubois-ferriere, and M. Vetterli, “Sensorscope: experiences with a wireless building monitoring sensor network,” in Proceedings of the 1st Workshop on Real-World Wireless Sensor Networks (REALWSN '05), 2005.
  5. G. Werner-Allen, K. Lorincz, M. Welsh et al., “Deploying a wireless sensor network on an active volcano,” IEEE Internet Computing, vol. 10, no. 2, pp. 18–25, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Selavo, A. Wood, Q. Cao et al., “LUSTER: wireless sensor network for environmental research,” in Proceedings of the 5th ACM International Conference on Embedded Networked Sensor Systems (SenSys '07), pp. 103–116, November 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. K. Martinez, J. K. Hart, and R. Ong, “Environmental sensor networks,” Computer, vol. 37, no. 8, pp. 50–56, 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Coleri, S. Y. Cheung, and P. Varaiya, “Sensor networks for monitoring traffic,” in Proceedings of the Allerton Conference on Communication, Control and Computing, 2004.
  9. T. Yan, T. He, and J. A. Stankovic, “Differentiated surveillance for sensor networks,” in Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03), pp. 51–62, November 2003. View at Scopus
  10. E. Shih, S.-H. Cho, N. Ickes et al., “Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks,” in Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 272–287, New York, NY, USA, July 2001. View at Scopus
  11. C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed diffusion: a scalable and robust communication paradigm for sensor networks,” in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM '00), pp. 56–67, August 2000. View at Scopus
  12. R. Rajaraman, “Topology control and routing in ad hoc networks: a survey,” SIGACT News, vol. 33, pp. 60–73, 2002. View at Google Scholar
  13. P. Santi, “Topology control in wireless ad hoc and sensor networks,” ACM Computing Surveys, vol. 37, no. 2, pp. 164–194, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. S. B. Akers and B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks,” IEEE Transactions on Computers, vol. 38, no. 4, pp. 555–566, 1989. View at Google Scholar · View at Scopus
  15. K. N. Sivarajan and R. Ramaswami, “Lightwave networks based on de Bruijn graphs,” IEEE/ACM Transactions on Networking, vol. 2, no. 1, pp. 70–79, 1994. View at Publisher · View at Google Scholar · View at Scopus
  16. J. Sun and E. Modiano, “Capacity provisioning and failure recovery for Low Earth Orbit satellite constellation,” International Journal of Satellite Communications and Networking, vol. 21, no. 3, pp. 259–284, 2003. View at Publisher · View at Google Scholar · View at Scopus
  17. T. Bjerregaard and S. Mahadevan, “A survey of research and practices of network-on-chip,” ACM Computing Surveys, vol. 38, no. 1, pp. 71–121, 2006. View at Google Scholar · View at Scopus
  18. E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A survey and comparison of peer-to-peer overlay network schemes,” IEEE Communications Surveys & Tutorials, vol. 7, no. 2, pp. 72–93, 2005. View at Google Scholar
  19. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: a scalable peer-to-peer lookup service for internet applications,” in Proceedings of the Applications, Technologies, Architectures, and Protocols for Computers Communications (ACM SIGCOMM '01), pp. 149–160, New York, NY, USA, August 2001. View at Publisher · View at Google Scholar · View at Scopus
  20. M. F. Kaashoek and D. R. Karger, “Koorde: a simple degree-optimal distributed hash table,” in Peer-to-Peer Systems II, vol. 2735 of Lecture Notes in Computer Science, pp. 98–107, 2003. View at Google Scholar
  21. M. Naor and U. Wieder, “Novel architectures for P2P applications: the continuous-discrete approach,” ACM Transactions on Algorithms, vol. 3, no. 3, Article ID 1273350, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Loguinov, J. Casas, and X. Wang, “Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience,” IEEE/ACM Transactions on Networking, vol. 13, no. 5, pp. 1107–1120, 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. C. Qu, W. Nejdl, and M. Kriesell, “Cayley dhts—a group-theoretic framework for analyzing dhts based on cayley graphs,” in Proceedings of the International Symposium on Parallel and Distributed Processing and Applications (ISPA '04), Springer, 2004.
  24. S. S. Iyengar, D. N. Jayasimha, and D. Nadig, “A versatile architecture for the distributed sensor integration problem,” IEEE Transactions on Computers, vol. 43, no. 2, pp. 175–185, 1994. View at Publisher · View at Google Scholar · View at Scopus
  25. A. A. Taleb, J. Mathew, and D. K. Pradhan, “Fault diagnosis in multi layered De Bruijn based architectures for sensor networks,” in Proceedings of the 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops '10), pp. 456–461, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. A. A.-B. Al-Mamou and H. Labiod, “ScatterPastry: an overlay routing using a DHT over wireless sensor networks,” in Proceedings of the International Conference on Intelligent Pervasive Computing (IPC '07), pp. 274–279, kor, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. M. Caesar, M. Castro, E. B. Nightingale, G. O’Shea, and A. Rowstron, “Virtual ring routing: network routing inspired by dhts,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM ’06), pp. 351–362, ACM, New York, NY, USA, 2006.
  28. F. Araujo, L. Rodrigues, J. Kaiser, C. Liu, and C. Mitidieri, “Chr: a distributed hash table for wireless ad hoc networks,” in Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops, pp. 407–413, 2005.
  29. K. W. Tang and B. W. Arden, “Representations of borel cayley graphs,” SIAM Journal on Discrete Mathematics, vol. 6, pp. 655–676, 1993. View at Google Scholar
  30. B. W. Arden and K. W. Tang, “Representations and routing for Cayley graphs,” IEEE Transactions on Communications, vol. 39, no. 11, pp. 1533–1537, 1991. View at Publisher · View at Google Scholar · View at Scopus
  31. K. W. Tang and B. W. Arden, “Vertex-transitivity and routing for Cayley graphs in GCR representations,” in Proceedings of the ACM/SIGAPP Symposium on Applied Computing (SAC '92), pp. 1180–1187, March 1992. View at Scopus
  32. R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proceedings of the IEEE, vol. 95, no. 1, pp. 215–233, 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. J. Yu, E. Noel, and K. W. Tang, “A graph theoretic approach to ultrafast information distribution: borel Cayley graph resizing algorithm,” Computer Communications, vol. 33, no. 17, pp. 2093–2104, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Ryu, J. Yu, E. Noel, and K. Tang, “Node id assignment in group theoretic graphs for wsns,” in Proceedings of the Wireless Telecommunications Symposium (WTS '11), pp. 1–8, 2011. View at Publisher · View at Google Scholar
  35. L. Xiao, S. Boyd, and S. Lall, “A scheme for robust distributed sensor fusion based on average consensus,” in Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN '05), pp. 63–70, April 2005. View at Scopus
  36. Y. Hatano and M. Mesbahi, “Agreement over random networks,” in Proceedings of the 43rd IEEE Conference on Decision and Control (CDC '04), vol. 2, pp. 2010–2015, December 2004. View at Scopus
  37. L. Schenato and G. Gamba, “A distributed consensus protocol for clock synchronization in wireless sensor network,” in Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07), pp. 2289–2294, December 2007. View at Publisher · View at Google Scholar · View at Scopus
  38. P. Braca, S. Marano, and V. Matta, “Running consensus in wireless sensor networks,” in Proceedings of the 11th International Conference on Information Fusion (FUSION '08), pp. 1–6, July 2008. View at Publisher · View at Google Scholar · View at Scopus
  39. A. G. Dimakis, S. Kar, J. M. F. Moura, M. G. Rabbat, and A. Scaglione, “Gossip algorithms for distributed signal processing,” Proceedings of the IEEE, vol. 98, no. 11, pp. 1847–1864, 2010. View at Publisher · View at Google Scholar · View at Scopus
  40. R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520–1533, 2004. View at Publisher · View at Google Scholar · View at Scopus
  41. R. Olfati-Saber, “Ultrafast consensus in small-world networks,” in Proceedings of the American Control Conference (ACC '05), vol. 4, pp. 2371–2378, June 2005. View at Scopus
  42. M. Marta and M. Cardei, “Using sink mobility to increase wireless sensor networks lifetime,” in Proceedings of the 9th IEEE International Symposium on Wireless, Mobile and Multimedia Networks (WoWMoM '08), pp. 1–10, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  43. N. Li, J. C. Hou, and L. Sha, “Design and analysis of an MST-based topology control algorithm,” IEEE Transactions on Wireless Communications, vol. 4, no. 3, pp. 1195–1206, 2005. View at Publisher · View at Google Scholar · View at Scopus
  44. D. M. Blough, M. Leoncini, G. Resta, and P. Santi, “The K-Neigh protocol for symmetric topology control in ad hoc networks,” in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC '03), pp. 141–152, New York, NY, USA, June 2003. View at Scopus
  45. B. Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for wireless networks,” in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM '00), pp. 243–254, August 2000. View at Scopus