한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

  • 제39B권9호
  • /
  • Pages.561-569
  • /
  • 2014
  • /
  • 1226-4717(pISSN)
  • /
  • 2287-3880(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

무선 애드혹 네트워크에서의 확률적 이웃 탐색 기법

Probabilistic Neighbor Discovery Algorithm in Wireless Ad Hoc Networks

  • Song, Taewon (Korea University School of Electrical Engineering) ;
  • Park, Hyunhee (INRIA French Institute for Research in Computer Science and Control) ;
  • Pack, Sangheon (Korea University School of Electrical Engineering)
  • 투고 : 2014.06.04
  • 심사 : 2014.09.03
  • 발행 : 2014.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

무선 애드혹 네트워크에서 이웃 탐색 과정은 네트워크를 초기화하는데 먼저 수행되어야 하고, 라우팅 알고리즘이나 토폴로지 컨트롤, 그리고 MAC 계층 설계를 위해서도 반드시 필요한 과정이므로 효율적인 분산적 이웃 탐색방법 설계가 필수적이다. 본 논문에서는 확률적 이웃 탐색 기법 (PND: Probabilistic neighbor discovery)을 제안한다. 제안한 기법에서는 MIMD (Multiplicative-increase, multiplicative-decrease) 정책을 통해 광고 메시지의 전송확률을 제어함으로써 이웃 탐색에 소요되는 시간을 줄이는 것이 가능하다. 더불어 임의의 기기가 광고 메시지를 전송한 경우, 그 메시지가 성공적으로 전송되었는지 여부를 알 수 있는 충돌 감지 기법 (CD: Collision detection)을 도입함으로써 확률적 이웃 탐색 기법의 성능을 더 높일 수 있다. 시뮬레이션 결과는 제안 기법이 모든 이웃을 탐색하기까지 소요되는 시간을 15.6%~57%까지 감소시킬 수 있음을 보여준다.

In wireless ad hoc networks, neighbor discovery is essential in the network initialization and the design of routing, topology control, and medium access control algorithms. Therefore, efficient neighbor discovery algorithms should be devised for self-organization in wireless ad hoc networks. In this paper, we propose a probabilistic neighbor discovery (PND) algorithm, which aims at reducing the neighbor discovery time by adjusting the transmission probability of advertisement messages through the multiplicative-increase/multiplicative-decrease (MIMD) policy. To further improve PND, we consider the collision detection (CD) capability in which a device can distinguish between successful reception and collision of advertisement messages. Simulation results show that the transmission probabilities of PND and PND with CD converge on the optimal value quickly although the number of devices is unknown. As a result, PND and PND with CD can reduce the neighbor discovery time by 15.6% to 57.0% compared with the ALOHA-like neighbor discovery algorithm.

키워드

참고문헌

  1. L. G. Roberts, "ALOHA packet system with and without slots and capture, " ACM SIGCOMM Comput. Commun. Rev., vol. 5, no. 2, pp. 28-42, Apr. 1975. https://doi.org/10.1145/1024916.1024920
  2. S. Vasudevan, D. Towsley, D. Goeckel, and R. Khalili. "Neighbor discovery in wireless networks and the coupon collector's Problem, " in Proc. Mobicom, pp. 181-192, Beijing, China, Sept. 2009.
  3. X. An, R. V. Prasad, and I. Niemegeers, "Neighbor discovery in 60 GHz wireless personal area networks, " in Proc. IEEE WoWMoM, pp. 1-8, Montreal, Canada, Jun. 2010.
  4. L. You, Z. Yuan, P. Yang, and G. Chen, "ALOHA-like neighbor discovery for low-duty-cycled wireless sensor networks, " in IEEE WCNC, pp. 749-754, Cancun, Mexico, Mar. 2011.
  5. H. Park, Y. Kim, and C.-H. Kang, "Cooperative neighbor discovery in 60GHz ad-hoc networks using directional antennas, " in Proc. KICS ICC, pp. 1165-1166. Jeju Island, Korea, Jun. 2011.
  6. W. Kim and D. Cho, "Directional antenna based neighbor discovery for connectivity of wireless networks, " in Proc. KICS ICC, pp. 1412-1413, Jun. 2010.
  7. J. H. Song, K. Kang, and Y.-J. Cho, "Fast neighbor discovery for construction of WPAN in extreme mobile network, " in Proc. KICS ICC, pp. 720-723, Nov. 2007.
  8. M. Kim and W. Lee, "Analysis of neighbor discovery process with directional antenna for IEEE 802.15.3c, " J. KICS, vol. 37, no. 1, pp. 9-14, Jan. 2012. https://doi.org/10.7840/KICS.2012.37B.1.9
  9. S. Vasudevan, M. Adler, D. Goeckel, and D. Towsley, "Efficient algorithms for neighbor discovery in wireless networks, " IEEE/ACM Trans. Networking, vol. 21, no. 1, pp. 69-83, Feb. 2013. https://doi.org/10.1109/TNET.2012.2189892
  10. F. Tobagi and L. Kleinrock, "Packet switching in radio channels: Part II. the hidden terminal problem in carrier sense multiple-access and the busy-tone solution, " IEEE Trans. Commun., vol. 23, no. 12, pp. 1417-1433, Dec. 1975. https://doi.org/10.1109/TCOM.1975.1092767
  11. J. Peng, L. Cheng, and B. Sikdar, "A wireless MAC protocol with collision detection, " IEEE Trans. Mobile Computing, vol. 6, no. 12, pp. 1357-1369, Dec. 2007. https://doi.org/10.1109/TMC.2007.1073
  12. S. Sen, R. Roy Choudhury, and S. Nelakuditi, "CSMA/CN: Carrier sense multiple access with collision notification, " IEEE/ACM Trans. Networking, vol. 20, no. 2, pp. 544-556, Apr. 2012. https://doi.org/10.1109/TNET.2011.2174461