Journal of Network and Systems Management

, Volume 14, Issue 3, pp 359–380 | Cite as

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

  • Gilbert G. Chen
  • Joel W. Branch
  • Boleslaw K. Szymanski
Article

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node’s delay of transmitting a signal is dependent on the probability of the node’s ability to best perform a pertinent task, and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding called Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.

KEY WORDS:

Wireless ad hoc networks wireless networks ad hoc routing ad hoc flooding leader election 

REFERENCES

  1. 1.
    C. Sivaram Murthy and B. S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall, New Jersey, 2004.Google Scholar
  2. 2.
    Bluetooth.com, http://www.bluetooth.com.Google Scholar
  3. 3.
    F. Zhao and L. J. Guibas, Wireless Sensor Networks: An Information Processing Approach, Elsevier, San Francisco, CA, 2004.Google Scholar
  4. 4.
    V. C. Barbosa, An Introduction to Distributed Algorithms, MIT Press, Cambridge, MA, 1996.Google Scholar
  5. 5.
    N. A. Lynch, Distributed algorithms, The Morgan Kaufmann Series in Data Management Systems, Morgan Kaufmann, San Francisco, CA, 1996.Google Scholar
  6. 6.
    J. Elson, L. Girod, and D. Estrin, Fine-grained network time synchronization using reference broadcasts, in 2002 Usenix Symposium on Operating Systems Design and Implementation (OSDI’02), pp. 147–163, 2002.Google Scholar
  7. 7.
    D. Ganesan, S. Ratnasamy, H. Wang, and D. Estrin, Coping with irregular spatio-temporal sampling in sensor networks, ACM SIGCOMM Computer Communication Review, Vol. 34, No. 1, pp. 125–130, 2004.CrossRefGoogle Scholar
  8. 8.
    M. L. Sichitiu and C. Veerarittiphan, Simple, accurate time synchronization for wireless sensor networks, in WCNC 2003 – IEEE Wireless Communications and Networking Conference, pp. 1266–1273, 2003.Google Scholar
  9. 9.
    J. Van Greunen and J. Rabaey, Lightweight time synchronization for sensor networks, in Proceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003, pp. 11–19, 2003.Google Scholar
  10. 10.
    R. M. Metcalfe and D. R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, Vol. 19, No. 7, pp. 359–404, 1976.CrossRefGoogle Scholar
  11. 11.
    B. P. Crow, I. Widjaja, L. G. Kim, and P. T. Sakai, IEEE 802.11 Wireless Local Area Networks, IEEE Communications Magazine, Vol. 35, No. 9, pp. 116–126, 1997.CrossRefGoogle Scholar
  12. 12.
    B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, Wireless Networks, Vol. 8, No. 5, pp. 481–494, 2002.MATHCrossRefGoogle Scholar
  13. 13.
    G. Chen, J. Branch, and B. Szymanski, Local leader election, signal strength aware flooding, and routeless routing, in 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc Networks and Sensor Networks (WMAN05), April 2005.Google Scholar
  14. 14.
    G. Chen, J. Branch, and B. Szymanski, Self-selective routing for wireless ad hoc networks, in Proceedings of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob05), Vol. 3, pp. 57–64, Aug. 2005.Google Scholar
  15. 15.
    Y. C. Tseng, S. Y. Ni, Y. S. Chen, and J. P. Sheu, The broadcast storm problem in a mobile ad hoc network, in Proceedings of 5th Annual Joint ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM’99), pp. 153–167, 1999.Google Scholar
  16. 16.
    T. S. Rappaport, Wireless Communications: Principles and Practice, Prentice Hall, New Jersey, 2001.Google Scholar
  17. 17.
    J. Zhao, and R. Govindan, Understanding packet delivery performance in dense wireless sensor networks, in Proceedings of the First International Conference on Embedded Networked Sensor Systems. pp. 1–13, 2003.Google Scholar
  18. 18.
    G. Chen, J. Branch, E. Brevdo, L. Zhu, and B. Szymanski, SENSE: A Sensor Network Simulator, in B. K. Szymanski and B. Yener (eds.), Advances in Pervasive Computing and Networking, Springer, pp. 249–267, 2004.Google Scholar
  19. 19.
    M. Abolhasan, T. Wysocki, and E. Dutkiewicz, A review of routing protocols for mobile ad hoc networks, Ad Hoc Networks, Vol. 2, No. 1, pp. 1–22, 2004.CrossRefGoogle Scholar
  20. 20.
    C. E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, Computer Communication Review, ACM SIGCOMM ‘94 Conference on Communications Architectures, Protocols and Applications, Vol. 24, No. 4, pp. 234–244, 1994.Google Scholar
  21. 21.
    C. Perkins, E. Belding-Royer, and S. Das, RFC 3561-ad hoc on-demand distance vector (AODV) routing [Online], 2003, Available: http://www.faqs.org/rfcs/rfc3561.html.Google Scholar
  22. 22.
    D. Johnson, D. Maltz, and J. Broch, DSR the dynamic source routing protocol for multihop wireless ad hoc networks, in C. E. Perkins (ed.), Ad Hoc Networking, Addison-Wesley, Boston, MA, pp. 139–172, 2001.Google Scholar
  23. 23.
    W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in Proceedings of HICSS33: Hawaii International Conference on System Sciences, pp. 8020, 2000.Google Scholar
  24. 24.
    W. R. Heinzelman, J. Kulik, and H. Balakrishnan, Adaptive protocols for information dissemination in wireless sensor networks, in Proceedings of 5th Annual Joint ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM’99), pp. 174–185, 1999.Google Scholar
  25. 25.
    C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in Proceedings of Sixth Annual International Conference on Mobile Computing and Networking (MobiCom 2000), pp. 56–67, 2000.Google Scholar
  26. 26.
    J. W. Branch, G. Chen, and B. Szymanski, ESCORT: energy-efficient sensor network communal routing topology using signal quality metrics, in Proceedings of the 4th International Conference on Networking, Part I, LNCS, Vol. 3420, Springer Verlag, Berlin, pp. 438–448, 2005.Google Scholar
  27. 27.
    M. Zuniga and B. Krishnamachari, Analyzing the transitional region in low power wireless links, in Proceedings of the 1st IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, pp. 517–526, 2004.Google Scholar
  28. 28.
    A. Woo, T. Tong, and D. Culler, Taming the underlying challenges of reliable multihop routing in sensor networks, in Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, pp. 14–27, 2003.Google Scholar
  29. 29.
    D. E. Willard, Log-logarithmic selection resolution protocols in a multiple access channel, SIAM Journal on Computing, Vol. 15, No. 2, pp. 468–477, 1986.MATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    K. Nakano and S. Olariu, Uniform leader election protocols for radio networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 5, pp. 516–526, 2002.CrossRefGoogle Scholar
  31. 31.
    S. Vasudevan, B. DeCleene, N. Immerman, J. Kurose, and D. Towsley, Leader election algorithms for wireless ad hoc networks, in Proceedings DARPA Information Survivability Conference and Exposition, pp. 261–272, 2003.Google Scholar
  32. 32.
    N. Malpani, J. L. Welch, and N. Vaidya, Leader election algorithms for mobile ad hoc networks, in Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 96–103, 2000.Google Scholar
  33. 33.
    C. Fetzer and F. Cristian, A highly available local leader election service, IEEE Transactions on Software Engineering, Vol. 25, No. 5, pp. 603–618, 1999.CrossRefGoogle Scholar
  34. 34.
    V. D. Park and M. S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in Proceedings of the 16th Annual Conference of the IEEE Computer and Communications Societies, pp. 1405–1413, 1997.Google Scholar
  35. 35.
    S. Corson, S. Papademetriou, P. Papadopoulos, V. Park, and A. Qayyum, An internet MANET encapsulation protocol (IMEP) specification, IETF Draft, draft-ietf-manet-imep-spec02.txt, 1999.Google Scholar
  36. 36.
    R. Poor, Gradient routing in ad hoc networks, unpublished.Google Scholar
  37. 37.
    F. Ye, G. Zhong, S. Lu, and L. Zhang, GRAdient Broadcast: a robust data delivery protocol for large scale sensor networks, in ACM Wireless Networks, Vol. 11, No. 2, March 2005.Google Scholar
  38. 38.
    M. Zorzi and R. R. Rao, Geographic random forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance, in IEEE Transactions on Mobile Computing, Vol. 2, No. 4, pp. 349–365, Oct.–Dec. 2003.Google Scholar
  39. 39.
    B. Blum, T. He, S. Son, and J. Stankovic, IGF: A state-free robust communication protocol for wireless sensor networks, Technical Report CS-2003-11, University of Virginia, Computer Science Department, 2003.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Gilbert G. Chen
    • 1
  • Joel W. Branch
    • 1
  • Boleslaw K. Szymanski
    • 1
  1. 1.Department of Computer ScienceRensselaer Polytechnic InstituteTroyUSA

Personalised recommendations