[논문]장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법

임동현; 김창화

doi:10.9717/kmms.2022.25.10.1404

장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법
A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces 원문보기

멀티미디어학회논문지 = Journal of Korea Multimedia Society, v.25 no.10, 2022년, pp.1404 - 1415

임동현 (Dept. of Computer Science&Engineering, GangneungWonju National University) , 김창화 (Dept. of Computer Science&Engineering, GangneungWonju National University)

Abstract ▼ AI-Helper

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

주제어

표/그림 (10)

그림 Fig. 1. Node placement using blocks.
그림 Fig. 2. 3D block structure and its X-Y, Y-Z, and Z-X plane projections. (a) 3D block structure (the top) and its plane projection (the bottom), (b) 3D NAA(Node Allocate Area) (the top) and its plane projection (the bottom), and (c) 3D empty area (the top) and its plane projection (the bottom).
그림 Fig. 3. NAA structure and its plane projection.
그림 Fig. 4. Node placements of the neighbor blocks of the block A, where NAA includes only one node. (a) neighbor blocks of the block A and (b) the centers, a, b, c, and d, of block A, B, C, and D.
$Fig. 5. Node placements of the Neighboring blocks A and B, without NAA. (a) Neighboring blocks A and B, (b) top view of blocks b and c, and (c) points to calculate <TEX>$\bar{mn}$</TEX>, a, a', b, c, d and e, of block A's NAA.$ 그림 Fig. 5. Node placements of the Neighboring blocks A and B, without NAA. (a) Neighboring blocks A and B, (b) top view of blocks b and c, and (c) points to calculate $\bar{mn}$, a, a', b, c, d and e, of block A's NAA.
그림 Fig. 6. Process for the implementation and performance evaluation of 3D Node Allocation algorithm.
그림 Fig. 7. Average processing time for the generation and 3D placement of a node. (a) average processing time according to media range and (b) average processing time according to network size.
그림 Fig. 8. Duration time for generating and placing all the nodes according to the number of them.
그림 Fig. 9. Visualization time according to the number of nodes.
그림 Fig. 10. Scatter plotted visualization's of all generated and placed nodes. (a) Scatter plotted visualizations according to the number of nodes and (b) An enlarged scatter plot of the uniformly randomly generated and placed nodes within a particular area.

참고문헌 (16)

D. Shin and C. Kim, "A Method for Applying Multiple Wireless Communication Media to Underwater Communication," Proceedings of the Korea Software Congress 2017, pp. 1334-1336, 2017.
D. You and C. Kim, "Comparison Analysis of Integrated MAC Design Approaches for Multiple Media Communication in Underwater Environments," Proceedings of Symposium of the Korean Institute of Communications and Information Sciences, pp. 1219-1220, 2019.
D. You, D. Shin, S. Lim, S. Jeon, and C. Kim. "Implementation of a Fragmentation Method for Flow Control in Underwater Multi-Media Communication," Journal of Korea Multimedia Society, Vol. 23, No. 7, pp. 819-829, 2017.
B. Lee and H. Kim, "Design and Implementation of a Secure IBS Platform Using RFID and Sensor Network," IEEE International Symposium on Consumer Electronics, pp. 1-4, 2006.
N.-T. Dinh and Y. Kim. "Auto-Configuration in Wireless Sensor Networks:A Review," Sensors, Vol. 10, No. 19, pp. 1-24, 2019.
D. You and C. Kim, "Approaches to the Design and Modularization for Implementing Multimedia-Based Underwater Communication to Use Integrated MAC," Journal of Korea Multimedia Society, Vol. 22, No. 11, pp. 1259-1268, 2019.
D. Shin, S. Park, and C. Kim, "Underwater Acoustic Communication technology and trend," The Magazine of the IEEE, Vol. 45, No. 5, pp. 32-48, 2018.
D. Shin and C. Kim, "Requirements for Underwater Communications Based on Multiple Wireless Underwater Communication Media," Proceedings of the Korean Institute of Communication Sciences Conference, pp. 621-622, 2018.
W. Lee, J.-H. Youn, and T.-S. Song, "Combined Quorum-based NDP in Hetero- geneous Wireless Sensor Networks," Journal of Digital Contents Society, Vol. 18, No. 4, pp. 753-760, 2017.
J.-J. You, Y.-K. Kim, and J.-W. Chang, "Design and Implementation of A LocationBased Energy-Efficient Routing Protocol Using Quantity of Energy Consumed," Journal of Korea Spatial Information System Society, Vol 12, No. 1, pp. 1-9, 2010.
J.-M. He and C.-S. Rhe, "An Energy Efficient Routing Algorithm based on Center of Local Clustering in Wireless Sensor Networks," Journal of Knowledge Information Technology and Systems, Vol. 9, No. 4, pp. 502-508, 2014.
Y.-G. Lee and S.-Y. Cho, Method and Apparatus for Measuring the Distance Between Nodes, 10-0984479, Korea, 2010.
Agency for Defense Development, A Node Deployment Strategy Considering Environmental Factors and the Number of Nodes in Surveillance and Reconnaissance Sensor Networks, 10-1327325, Korea, 2012.
C. Kim and I. Kim, "Three Dimensional Euclidean Minimum Spanning Tree for Connecting Nodes of Space with the Shortest Length," Journal of The Korean Society of Computer and Information, Vol. 17, No. 1, pp. 161-169, 2012.
J. Carle, J.-F. Myoupo, and D. Seme, "A Basis for 3-D Cellular Networks," Proceedings 15th International Conference on Information Networking, pp. 631-636, 2001.
S.M. Nazrul Alam and Z.J. Haas, "Coverage and Connectivity in Three-Dimensional Networks with Random Node Deployment," Ad Hoc Networks, Vol. 34, pp. 157-169, 2015.

상세보기

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format