• Title/Summary/Keyword: Ad Hoc Networks

Search Result 1,365, Processing Time 0.024 seconds

Adaptive Routing Scheme to Avoid Clusterhead Congestion in c-DSDV Routing Protocol (c-DSDV 라우팅 프로토콜에서 클러스터헤드의 혼잡 회피를 위한 적응적 라우팅 방법)

  • Oh, Hoon;Yun, Seok-Yeol;Vu, Trong Tuan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.219-224
    • /
    • 2008
  • In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

Positioning using ZigBee and Ultrasound

  • Park, Chan-Sik;Kim, Seung-Beom;Kang, Dong-Youn;Yun, Hee-Hak;Cha, En-Jong;Lee, Sang-Jeong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.217-222
    • /
    • 2006
  • To find a location, GPS has been wildly used. But, it is hard to use in indoor because of very weak signal level. To meet indoor requirements, there have been many studies applying wireless communication networks such as WLAN, UWB and ZigBee. Among these, ZigBee is widely adopted in many WSN applications because it has an advantage of low-power and low-cost. In ZigBee, the RSSI is used as range measurement for ad-hoc network. The RSSI are converted to ranges using the signal attenuation model and these ranges become inputs of positioning methods. The obtained position with RSSI has large error because of its poor accuracy. To overcome this problem, ultrasonic sensors are added in many researches. By measuring the arrival time difference of ZigBee and ultrasound as a range measurement, the precise position can be found. However, there are still many problems: scheduling of beacons to transmit signals in a correct order, addition and synchronization of beacons and low-rate positioning rate. At this paper, an efficient method to solve these problems is proposed. In the proposed method, a node transmits ZigBee and ultrasound signal simultaneously. And beacons find the range with the received signals and send it back to a node with ZigBee. The position is computed in a node with the received ranges. In addition, a new positioning algorithm to solve the risk of the divergence in the linearization method and the singularity problem in the Savarese method is presented. Both static and dynamic experimental results show 0.02m RMS errors with high output rate.

  • PDF

Adaptive analysis of characteristic nodes using prediction method in DTN (DTN에서 예측 기반한 적응적 노드 속성 분석)

  • Dho, Yoon-Hyung;Jeon, Il-Kyu;Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2771-2778
    • /
    • 2014
  • In this paper, we propose an algorithm that select efficient relay nodes using information of network environment and nodes. The proposed algorithm can be used changeable weight factors as following network environment in node density. The routing protocols adopting store-carry-forward method are used for solving network problems occurred by unstable end-to-end connection in Delay Tolerant Networks(DTNs). Exiting DTN routing algorithms have problems that large latency and overhead because of deficiency of network informations. The proposed algorithm could be provide a solution this problems using changeable weight factor and prediction of network environment. Thus, selected relay nodes work efficiently in unstable and stressed network environment. Simulation results show that enhancement performance as overhead, delivery ratio, average latency compared to exiting DTN routing algorithm.

DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol (DT-GPSR: 지연감내형 GPSR 라우팅 프로토콜)

  • Nam, Jae-Choong;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.189-197
    • /
    • 2016
  • Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

Channel Aware Reliable Routing Protocol in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서네트워크에서 신뢰성향상을 위한 채널상태기반 경로설정 프로토콜)

  • Cho, Byeong Seok;Lee, Juhyeon;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.2
    • /
    • pp.459-465
    • /
    • 2014
  • Recently, multimedia data transmission becomes important issues in the wireless sensor network. For the multimedia data transmission in wireless sensor network, QoS (Quality of service) is an important factor to determine the system performance. AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment. In AODV, the destination node selects the route with the smallest hop count. Since AODV only considers the hop count, the selected route could have low channel condition, and degrade QoS. In this paper, we propose a modified AODV algorithm that considers the successful transmission rate of each link. The proposed algorithm regards the number of retransmission which can be obtained from the successful transmission rate as the hop count, and applies the modified hop count to AODV. The advantage of the proposed algorithm is that the modified AODV can support QoS without significant change of the conventional algorithm.

Practical Password-Authenticated Three-Party Key Exchange

  • Kwon, Jeong-Ok;Jeong, Ik-Rae;Lee, Dong-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.6
    • /
    • pp.312-332
    • /
    • 2008
  • Password-based authentication key exchange (PAKE) protocols in the literature typically assume a password that is shared between a client and a server. PAKE has been applied in various environments, especially in the “client-server” applications of remotely accessed systems, such as e-banking. With the rapid developments in modern communication environments, such as ad-hoc networks and ubiquitous computing, it is customary to construct a secure peer-to-peer channel, which is quite a different paradigm from existing paradigms. In such a peer-to-peer channel, it would be much more common for users to not share a password with others. In this paper, we consider password-based authentication key exchange in the three-party setting, where two users do not share a password between themselves but only with one server. The users make a session-key by using their different passwords with the help of the server. We propose an efficient password-based authentication key exchange protocol with different passwords that achieves forward secrecy in the standard model. The protocol requires parties to only memorize human-memorable passwords; all other information that is necessary to run the protocol is made public. The protocol is also light-weighted, i.e., it requires only three rounds and four modular exponentiations per user. In fact, this amount of computation and the number of rounds are comparable to the most efficient password-based authentication key exchange protocol in the random-oracle model. The dispensation of random oracles in the protocol does not require the security of any expensive signature schemes or zero-knowlegde proofs.

An Address Autoconfiguration Mechanism for Connected MANET with Multiple Gateways having a Same Network Prefix (동일한 네트워크 프리픽스를 갖는 다중 게이트웨이 기반의 connected MANET에서 주소 자동 설정 방법)

  • Lee, Jae-Hwoon;Lee, Beom-Jae;Jung, Woo-Young
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.5
    • /
    • pp.405-412
    • /
    • 2009
  • Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. In the MANET, it is required not only a route setup mechanism that makes nodes not within each other's transmission range communicate but also mechanism in order for a node to auto-configure a unique address. In this paper, we propose an address auto-configuration mechanism when MANET is connected to the Internet via several Internet Gateways and all gateways advertise the same network prefix. By using the proposed mechanism, once a node configures an Internet topologically correct and globally unique IP address, then the node can utilize the configured address even though the node moves within the MANET. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that out proposed mechanism outperforms the existing mechanism.

IDMMAC: Interference Aware Distributed Multi-Channel MAC Protocol for WSAN

  • Kakarla, Jagadeesh;Majhi, Banshidhar;Battula, Ramesh Babu
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1229-1242
    • /
    • 2017
  • In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

A study on the overseas expansion strategy of domestic ICT companies in the post-corona era -Focusing on case studies of ICT companies- (포스트 코로나 시대의 국내 ICT기업의 해외 진출 전략에 관한 연구 -ICT 기업 사례분석을 중심으로-)

  • Park, Sang-Hee;Kim, Ki-Yoon;Jung, Hyun-Seung;Hyun, Daiwon
    • Journal of Digital Convergence
    • /
    • v.19 no.10
    • /
    • pp.163-173
    • /
    • 2021
  • The purpose of this study was to explore a support model for domestic ICT companies to advance into overseas markets suitable for the post-corona era along with the rapidly changing global economic situation. As a result of the analysis, first, by analyzing the internationalization cases of domestic ICT companies through the realization theory, in the COVID-19 situation, domestic ICT companies organically respond to crisis situations through ad hoc responses, use of international networks, use of external organizations, and resource-based practices. Through qualitative analysis, we were able to confirm that we are growing overseas while achieving our goals. In addition, strategies for domestic ICT companies to grow through internationalization were derived. Ultimately, it was interpreted as a part that required advancement of government policy according to the government's overseas expansion support system.

A Study on Intrusion Detection Method using Collaborative Technique (협업 기법을 이용한 침입탐지 탐지 방법에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.21 no.1
    • /
    • pp.121-127
    • /
    • 2021
  • MANET, which does not have any infrastructure other than wireless nodes, has the advantage of being able to construct a fast network. However, the movement of nodes and wireless media are also the causes of security vulnerabilities of MANET. In particular, the damage caused by the attacking nodes existing on the network is considerably greater than that of other networks. Therefore, it is necessary to detection technique for attacking nodes and techniques to reduce damage caused by attacks. In this paper, we proposed a hierarchical structure technique to increase the efficiency of intrusion detection and collaboration-based intrusion detection technique applying a P2P mesh network configuration technique to reduce damage caused by attacks. There was excluded the network participation of the attacking node in advance through the reliability evaluation of the nodes in the cluster. In addition, when an attack by an attacking node is detected, this paper was applied a method of minimizing the damage of the attacking node by transmitting quickly the attack node information to the global network through the P2P mesh network between cluster heads. The ns-2 simulator was used to evaluate the performance of the proposed technique, and the excellent performance of the proposed technique was confirmed through comparative experiments.