• Title/Summary/Keyword: Mobile Ad-hoc Wireless Networks

Search Result 284, Processing Time 0.025 seconds

A Carrier Preference and Location-based Routing Scheme(CPLR) at Multi-carrier Maritime Data Communications Networks (다중캐리어 해상데이터통신망에서 캐리어선호도와 위치기반 라우팅)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.6
    • /
    • pp.823-829
    • /
    • 2012
  • Data communications networks at sea in the future can be modelled by overlapped MANET networks with Broadband Wireless Access carriers. A novel routing scheme (CPLR) is proposed in this paper, which finds out an optimal route by selecting an optimal carrier for each hop in routes based on carrier preferences of each application, and locations of ships as well. As distances between each ships and destination ships are considered in this scheme, routing can be done much faster. Performance is compared with that of the CPR (only Carrier Preference-based Routing Scheme), and it shows some improvements.

Cluster-Based Node Management Algorithm for Energy Consumption Monitoring in Wireless Mobile Ad Hoc Networks (무선 모바일 애드혹 네트워크상에서 에너지 소모 감시를 위한 클러스터 기반의 노드 관리 알고리즘)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.14 no.9
    • /
    • pp.309-315
    • /
    • 2016
  • The node mobility in the wireless mobile network environment increases the energy consumption. This paper proposes a CNMA (cluster-based node management algorithm) to reduce the energy consumption caused by node mobility, and to prolong the life cycle for cluster member nodes. The proposed CNMA traces the mobility for nodes between cluster header and member, and it analyses the energy capacity as monitoring periodically their relationship. So, it makes a division and merges by analysing the state transition for nodes. This paper is to reduce the energy consumption due to the node mobility. The simulation results show that the proposed CNMA can efficiently control the energy consumption caused by mobility, and it can improve the energy cycle.

An Energy-efficient Data Dissemination Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 데이타 전달 프로토콜)

  • Yi, Seung-Hee;Lee, Sung-Ryoul;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.165-174
    • /
    • 2006
  • Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

A Study on Multi-Channel Multi-Interface MAC Protocols for Mesh Networks (Mesh Networks을 위한 다중채널 다중인터페이스 MAC 프로토콜에 관한 연구)

  • Kim, Young-Beom
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.7
    • /
    • pp.1465-1470
    • /
    • 2011
  • In this paper, we propose a new MAC protocol, namely DM-MMAC (Doze Mode Multi-Channel MAC) for ad hoe wireless networks which can utilize multiple channels effectively, thereby enhancing the network throughput considerably. Basically, the IEEE 802.11 specification allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a single channel with the fatal drawback, so called multi-channel hidden terminal problem in multi-channel environments. In this vein, several multi-channel MAC protocols have been proposed, but most of them demonstrate the performance problem that its throughput drastically decreases as the number of mobile hosts residing in a given network increases with small number of available channels. In this work, we tried to improve the performance of multi-channel MAC protocols in terms of network throughput as well as power saving effects by simplifying the channel assignment and channel capturing procedures and reducing the possibility of collisions between mobile hosts.

Efficient restriction of route search area in cluster based wireless ad hoc networks (클러스터 기반 무선 애드 혹 네트워크에서의 효율적인 경로 탐색 지역 제어)

  • Lee, Jangsu;Kim, Sungchun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.792-795
    • /
    • 2012
  • 애드 혹 네트워크(MANET: Mobile Ad hoc NETworks)는 기본적인 내부구조(infrastructure) 없이 노드들만으로 네트워크 망을 구성한다. 경로 탐색 정책으로 리액티브(reactive) 방식과 프로액티브(proactive) 방식이 있는데, 전통적으로 리액티브 방식의 성능이 더 좋은 것으로 평가된다. 그리고 두가지 방식의 장점을 취합한 하이브리드(hybrid) 방식의 클러스터 토폴로지(cluster topology) 도입에 관한 연구가 이루어지고 있다. 그 중, HCR(Hybrid Cluster Routing)이 제안되었는데, 이는 프로액티브 방식에 보다 중심을 둔 기법이다. HCR 은 리액티브 방식 경로 탐색 방법인 플라딩(flooding)의 탐색 지역을 한정된 범위로 제한할 수 있으나, 프로액티브 방식의 전체 네트워크 구성 정보 유지에 따른 막대한 오버헤드를 발생한다. 본 논문에서는 이러한 오버헤드를 줄이기 위해, 클러스터 내부 경로 탐색 기법인 MICF(Maginot path based Intra Cluster Flooding)를 제안한다. MICF 는 HCR 을 개선한 FSRS(First Search and Reverse Setting) 기반의 기법으로서, 클러스터 내부의 마지노 패스(maginot path)를 기준으로 경로 탐색 지역을 제한한다. MICF 는 게이트웨이(gateway) 간 최단 거리가 항상 클러스터 헤드(cluster head)를 중점으로 원의 내각 지역에 존재함을 바탕으로 하며, 최단 경로의 보장과 플라딩 지역 제한을 동시에 만족한다. 실험 결과, MICF 는 FSRS 기반의 기존 클러스터 내부 플라딩 방식보다 총 에너지의 7.79%만큼 더 에너지를 보존하였다. 결론적으로, MICF 역시 기존의 방식보다 에너지를 더 효율적으로 사용할 수 있으며, 마지노패스 설정과 이를 기반으로 한 제어 과정에 추가적인 오버헤드가 발생하지 않는다. 그리고 플라딩 면적이 작을수록 오버헤드가 줄어들게 됨을 알 수 있다.

A Energy Efficient Routing Protocol with Dual Channel for Mobile Ad Hoc Wireless Networks (모바일 애드 혹 무선 네트워크를 위한 에너지 효율 이중 채널 라우팅 프로토콜)

  • Yoo Dae-Hun;Jo Won-Geun;Choi Woong-Chul;Rhee Seung-Hyong;Chung Kwang-Sue
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06d
    • /
    • pp.259-261
    • /
    • 2006
  • 모바일 애드 혹 네트워크에서 에너지 효율을 위한 많은 라우팅 프로토콜들이 제안되었다. 이미 제안된 프로토콜들에 대한 내용을 살펴보면 에너지 효율을 높이기 위한 경로를 찾는 방법, 경로를 설정하는데 소비하는 패킷의 수를 줄이는 방법, 설정 시간을 줄이기 위한 방법과 이미 설정된 라우팅 정보를 보다 효율적으로 유지하기 위한 방법을 제시하였다. 이와 같은 문제들을 해결하기 위해 본 논문에서는 채널을 라우팅 정보와 데이터를 전송을 하는 채널로 각각 나누고, 이로 인해 얻을 수 있는 장점에 대해 설명한다. 그리고 라우팅 정보를 얻는 과정에서 채널을 나눔으로써 변경되는 라우팅 프로토콜에 대해 제안한다.

  • PDF

End-to-End Performance of VoIP based on Mobility Pattern over MANETs

  • Kim, Young-Dong
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.3
    • /
    • pp.309-313
    • /
    • 2009
  • In this paper, end-to-end VoIP(Voice over Internet Protocol) performance is evaluated by simulation with NS-2 simulation tool. There are many results studied and published for VoIP performance over TCP/IP networks. But, almost all of them were focused on wired or wireless Internet environments. About MANET (Mobile Ad Hoc Network), VoIP is currently studying several points of research. In this paper, analysis of VoIP performance is done with focusing on the mobility of MANETs. MOS(Mean Opinion Score), network delay, packet loss rates are considered as end-to-end QoS performance parameters.

Fault Tolerant Mechanism in Dynamic Multi-homed IPv6 Mobile Networks (IPv6 기반 동적인 이동 네트워크에서의 Fault Tolerant 메커니즘)

  • Jang, Jung-Gyu;Kim, Won-Tae;Park, Yong-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.690-694
    • /
    • 2006
  • 동적인 이동 네트워크는 다중의 무선 Ad-hoc 네트워크들로 구성된 독립적인 WPAN(Wireless Personal Network)이 모인 이동 네트워크의 한 종류이다. 휴대폰과 같은 모바일 장치들이 동적인 이동 네트워크에서 모바일 라우터로 동작하기 때문에 트래픽 과부하, 네트워크 신뢰도, 에너지 소모율 등의 네크워크 fail과 관련된 문제점 들이 제시된다. 따라서 동적인 이동 네트워크에서 fault tolerant 메커니즘은 필수적인 이슈가 될 것이다. 본 논문에서는 빠른 경로 변경 메커니즘과 추가적인 모바일 라우터 선정 메커니즘을 이용하여 향상된 fault tolerant 메커니즘을 제시한다. 최종적으로 모의실험을 통해 에너지 소모율과 패킷 손실 측면에서의 효율성을 보여줄 것이다.

  • PDF

Analysis of Link Error Effects in MANET Address Autoconfiguration Protocols

  • Kim, Sang-Chul;Chung, Jong-Moon
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.84-93
    • /
    • 2009
  • This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

Time Slot Exchange Protocol in a Reservation Based MAC for MANET

  • Koirala, Mamata;Ji, Qi;Choi, Jae-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.3
    • /
    • pp.181-185
    • /
    • 2009
  • Recently, much attention to a self-organizing mobile ad-hoc network is escalating along with progressive deployment of wireless networks in our everyday life. Being readily deployable, the MANET (mobile ad hoc network) can find its applications to emergency medical service, customized calling service, group-based communications, and military purposes. In this paper we investigate a time slot exchange problem found in the time slot based MAC, that is designed for IEEE 802.11b interfaces composing a MANET. The paper provides a method to maintain the quality of voice call by providing a new time slot when the channel assigned for that time slot gets noisy with interferences induced from other nodes, which belong to the same and/or other subgroups. In order to assess the performance of the proposed algorithm, a set of simulations using the OPNET modeler has been performed assuming that the IEEE 802.11b interfaces are operating under a modified MAC, which is a time slot based reservation MAC implemented in the PCF part of the superframe. In a real-time voice call service over a MANET of a size 500 ${\times}$ 500 meter squares with the number of nodes up to 100, the simulation results are collected and analyzed with respect to the packet loss rate and packet delay. The results show us that the proposed time slot exchange protocol improves the quality of voice call over that of plain DCF.

  • PDF