• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

• International journal of advanced smart convergence
• /
• v.8 no.4
• /
• pp.169-178
• /
• 2019

Due to the characteristics of an ad hoc network without a control center, self-organization, and flexible topology, the trust evaluation of the nodes in the network is extremely difficult. Based on the analysis of ad hoc networks and the blockchain technology, a blockchain-based node-level trust evaluation model is proposed. The concepts of the node trust degree of the HASH list on the blockchain and the perfect reward and punishment mechanism are adopted to construct the node trust evaluation model of the ad hoc network. According to the needs of different applications the network security level can be dynamically adjusted through changes in the trust threshold. The simulation experiments demonstrate that ad-hoc on-demand distance vector(AODV) Routing protocol based on this model of multicast-AODV(MAODV) routing protocol shows a significant improvement in security compared with the traditional AODV and on-demand multipath distance vector(AOMDV) routing protocols.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1461-1464
• /
• 2005

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories, but those are not well-suited for securing ad hoc networks. Moreover, a fundamental issue of securing mobile ad hoc networks is to ensure mobile nodes can authenticate each other. Because of its strength and efficiency, public key and digital signature is an ideal mechanism to construct the authentication service. Although this is already mature in the internet application, providing public key based authentication is still very challenging in mobile ad hoc networks. In this paper I propose a secure public key authentication service based on clustering model and trust model to protect nodes from getting false public keys of the others efficiently when there are malicious nodes in the network.

• International journal of advanced smart convergence
• /
• v.13 no.3
• /
• pp.183-190
• /
• 2024

This study investigates the conditions under which the compensation effect occurs in advertising, focusing on the influence of warmth messages on consumer perceptions and responses. By comparing single-ad and comparative ad exposure contexts, the research reveals how warmth messages affect perceived brand competence and the intention to like ads. High warmth messages, when viewed in a comparative ad setting, lead to lower perceived brand competence compared to a single-ad setting, emphasizing the need for strategic message placement in competitive environments. The study further explores how consumers' construal levels-whether considering near-future or distant-future purchase decisions-moderate these effects. The negative impact of high warmth messages on perceived competence is amplified in a comparative context at low construal levels, while high construal levels mitigate this negative impact. These results provide both theoretical and practical insights, highlighting the importance of ad context and construal level in advertising strategies.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1395-1398
• /
• 2001

본 논문에서는 설치가 용이하고, 이동이 자유로우며 능동적으로 연결을 맺을 수 있는 무선 환경 특성에 대해 알아보고, 특히 무선 Ad-hoc환경에서의 TCP 버전별 특성을 분석해 보았다. 또한 지연과 오류 확률이 높은 무선환경에서 여러 가지 버전의 TCP가 동시에 사용되는 경우에 각 TCP 버전의 트래픽 특성을 모의 실험하였다. 이 실험을 위해 가장 많이 사용되어지고 있는 네트워크 시뮬레이터2(NS2)를 이용하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.47-55
• /
• 2008

본 논문에서는 모바일 ad-hoc 무선 센서 네트워크[1]에서 안정된 경로의 설정 및 설정된 경로의 lifetime 을 효과적으로 지원하여 데이터 전송효율을 향상시키기 위한 협력 도움 라우팅 프로토콜(CARP: Cooperative_Aided Routing Protocol) 을 제안한다. 제안된 라우팅 프로토콜의 기본 아이디어 및 특징은 다음과 같다. 첫째, 소스노드와 목적지 노드 사이의 안정된 라우팅 경로의 설정이다. 본 연구에서는 모바일 노드들의 이동성 정보를 이용한 엔트로피 기반의 안정된 경로 설정방법을 제안 사용한다. 둘째, 협력도움 전송 방법이다[3][4][5]. 설정된 경로 위로 데이터 패킷을 전송 할 때 경로 lifetime과 SNR의 효과적인 지원으로 데이터 전송률을 증가시키기 위해 이웃 노드들로부터 협력 도움을 받는다. 셋째, 기존의 센서 네트워크는 주로 고정된 노드 환경에서 많은 연구가 되어 왔지만, 본 연구에서는 노드들의 이동성을 고려한 환경에서 연구가 이루어진다. 제안된 CARP 의 성능평가는 OPNET(Optimized Network Engineering Tool)을 사용하여 이루어졌으며 성능평가를 통하여 제안한 프로토콜은 안정된 경로의 설정 및 데이터 전송효율을 효과적으로 증가 시킬 수 있음을 알 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.197-203
• /
• 2011

Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.31-39
• /
• 2011

For rapid formed the ad hoc wireless backbone network in disaster scene, It is necessary for real-time deployment scheme of wireless ad hoc relay devices by first responders without pre-planning. However, in order to realize this scheme, redundant deployment should be minimized, as well as optimal location of relay devices should be selected to expand communication coverage. Therefore, in this paper, we propose a new deployment scheme of relay devices to optimize communication coverage and then through simulations showed that improved performance of algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.173-179
• /
• 2008

An ad hoc network is multi-hop wireledss formed by mobile node without infrastructure. Due to the mobility of nodes in mobile ad hoc networks, the topology of network changes frequently. In this environments, multicast protocols are faced with the challenge of producing multi-hop routes and limitation of bandwidth. We compare the performance of two multicast routing protocols for mobile ad hoc networks - Serial Multiple Disjoint Tree Multicast Routing Protocol (Serial MDTMR) and Adaptive Core Multicast Routing Protocol (ACMRP). The simulator is implemented with GloMoSim.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.123-145
• /
• 2017

Due to the increasing demand for spectrum resources, cognitive radio networks and dynamic spectrum access draw a lot of research into efficiently utilizing limited spectrum resources. To set up cluster-based CR ad-hoc common channels, conventional methods require a relatively long time to successfully exchange the initialization messages. In this paper, we propose a fast and reliable common channel initialization protocol for CR ad-hoc networks. In the proposed method, the cluster head sequentially broadcasts a system activation signal through its available channels with a predetermined correlation pattern. To detect the cluster head's broadcasting channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation of an FFT bin sequence for each available channel of the member node. This is compared to the predetermined reference pattern. The join request and channel decision procedures are also presented in this paper. In a simulation study, the performance of the proposed method is evaluated.