Advertisement

Neighbor Discovery Algorithm Based on the Regulation of Duty-Cycle in Mobile Sensor Network

  • Jinbao Li
  • Jian Yang
  • Yanqing Zhang
  • Longjiang Guo
  • Yingshu Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7992)

Abstract

In this paper, aiming at the problem that the node discovers its neighbor nodes, when it is moving in mobile sensor network, we propose an algorithm for dynamical regulating the duty cycle of the node which needs to discover it neighbor node. This algorithm uses the boundary nodes in the communication range of the node to predict potential neighbor nodes, applies passion point process to predict the number of nodes in communication range of the node, regulates the duty-cycle of the node based on the model of balls and boxes, and then schedules the waking time of the node periodically by using the duty-cycle which is regulated to finish the detection. Finally, theoretical analysis and simulation experiments show that the proposed algorithm can discover more neighbor nodes in the short period of time with less energy.

Keywords

Mobile wireless sensor networks sleep-wake scheduling duty cycle neighbor node 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    McGlynn, M.J., Borbash, S.A.C.: Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks. In: ACM MOBIHOC, pp. 137–145. ACM Press, New York (2001)Google Scholar
  2. 2.
    Dutta, P., Culler, D.C.: Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications. In: SenSys, pp. 71–84. IEEE Press, New York (2008)CrossRefGoogle Scholar
  3. 3.
    Kandhalu, A., Lakshmanan, K., Rajkumar, R.R.C.: U-connect: a low latency energy-efficient asynchronous neighbor discovery protocol. In: IPSN, pp. 350–361. IEEE Press, New York (2010)Google Scholar
  4. 4.
    Tseng, Y.C., Hsu, C.S., Hsieh, T.Y.C.: Power-saving protocols for ieee 802.11-based multi-hop ad hoc networks. In: INFOCOM, pp. 200–209. IEEE Press, New York (2002)Google Scholar
  5. 5.
    Lai, S., Ravindran, B., Cho, H.C.: Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks. IEEE Transactions on Computers, 1562–1575 (2010)Google Scholar
  6. 6.
    Karowski, N., Viana, A.C., Wolisz, A.C.: Optimized Asynchronous Multi-channel Neighbor. In: INFOCOM, pp. 536–540. IEEE Press, New York (2011)Google Scholar
  7. 7.
    Mehedi, B., Robin, K.C.: SearchLight: A Systematic Probing-based Asynchronous Neighbor Discovery Protocol. In: ACM SIGMOBILE, pp. 71–76. ACM Press, New York (2010)Google Scholar
  8. 8.
    Vasudevan, S., Towsley, D., Dennis, D., Khalili, R.C.: Neighbor discovery in wireless networks and the coupon collectors problem. In: ACM MobiCom. ACM Press, New York (2009)Google Scholar
  9. 9.
    C.: Statistical Analysis and Modeling of Spatial Point PatternsGoogle Scholar
  10. 10.
    Purohit, A., Priyantha, B., Liu, J.C.: WiFlock: Collaborative group discovery and maintenance in mobile sensor networks. In: IPSN, pp. 37–48. IEEE Press, New York (2011)Google Scholar
  11. 11.
    Karowski, N., Viana, A.C., Wolisz, A.C.: Optimized Asynchronous Multi-channel Neighbor Discovery. In: INFOCOM, pp. 536–540. IEEE Press, New York (2011)Google Scholar
  12. 12.
    Zhang, P., Sadler, C.M., Lyon, S.A., Martonosi, M.C.: Hardware design experiences in zebranet. In: SenSys., pp. 227–238. IEEE Press, New York (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jinbao Li
    • 1
    • 2
  • Jian Yang
    • 1
    • 2
  • Yanqing Zhang
    • 1
    • 2
  • Longjiang Guo
    • 1
    • 2
  • Yingshu Li
    • 3
  1. 1.School of Computer Science and TechnologyHeilongjiang UniversityHarbinChina
  2. 2.Key Laboratory of Database and Parallel Computing of Heilongjiang ProvinceHarbinChina
  3. 3.Department of Computer ScienceGeorgia State UniversityAtlantaUSA

Personalised recommendations