• 한국전자통신학회논문지
• /
• 제9권7호
• /
• pp.767-772
• /
• 2014

임시망으로서 애드-혹 네트워크는 네트워크가 설치된 환경이나 구조에 의하여 많은 영향을 받는다. 본 논문에서는 센서 네트워크나 IoT(Internet of Things)와 같은 특수한 통신 환경에서 사용될 것으로 예상되는 격자구조 애드-혹 네트워크의 전송성능을 정보침해가 발생되는 측면에서 분석하고 대응 방안으로 모색하여 본다. 본 논문은 NS-2를 기반으로 한 컴퓨터 시뮬레이션을 사용하여 수행하였으며, 성능측정은 응용 서비스로 널리 사용되는 VoIP(Voice over Internet Protocol) 서비스를 대상으로 하였다. 성능 파라미터로는 MOS(Mean Opinion Score)와 호연결율을 사용하였다. 성능분석 결과 침해가 발생되는 애드-혹 네트워크에서 MOS의 경우 랜덤구조가 격자구조에 비하여 성능이 다소 높았고, 호연결율의 경우는 격자구조가 랜덤구조에 비하여 우수한 성능을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권8호
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.