• Title/Summary/Keyword: MANET

Search Result 600, Processing Time 0.023 seconds

Survivability Analysis of MANET Routing Protocols under DOS Attacks

  • Abbas, Sohail;Haqdad, Muhammad;Khan, Muhammad Zahid;Rehman, Haseeb Ur;Khan, Ajab;Khan, Atta ur Rehman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3639-3662
    • /
    • 2020
  • The network capability to accomplish its functions in a timely fashion under failures and attacks is known as survivability. Ad hoc routing protocols have been studied and extended to various domains, such as Intelligent Transport Systems (ITSs), Unmanned Aerial Vehicles (UAVs), underwater acoustic networks, and Internet of Things (IoT) focusing on different aspects, such as security, QoS, energy. The existing solutions proposed in this domain incur substantial overhead and eventually become burden on the network, especially when there are fewer attacks or no attack at all. There is a need that the effectiveness of these routing protocols be analyzed in the presence of Denial of Service (DoS) attacks without any intrusion detection or prevention system. This will enable us to establish and identify the inherently stable routing protocols that are capable to survive longer in the presence of these attacks. This work presents a DoS attack case study to perform theoretical analysis of survivability on node and network level in the presence of DoS attacks. We evaluate the performance of reactive and proactive routing protocols and analyse their survivability. For experimentation, we use NS-2 simulator without detection or prevention capabilities. Results show that proactive protocols perform better in terms of throughput, overhead and packet drop.

Hybrid Multipath Routing in Mobile Ad Hoc Networks (MANET환경에서 적용 가능한 복합적 다중 라우팅 기술)

  • Ninh, Khanhchi;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.49-56
    • /
    • 2011
  • One of the most important VANET applications is providing active safety by broadcasting emergency messages. In order to prevent broadcast storm of flooding-based broadcasting scheme in which any node receiving message will rebroadcast, the existing protocols use the different methods to limit the number of relay nodes. Nevertheless, the existing protocols have low delivery ratio with high traffic density and cause message overhead. Currently, the dramatic increase in the number of vehicles equipped with Global Positioning System (GPS) and onboard radar created new application scenarios that were not feasible before. Consequently, we proposed a broadcasting protocol that selects relay node by using GPS-based position information and detecting neighboring vehicles with the help of onboard radar to. Simulation results show that our proposed protocol has better performance than the existing schemes.

A Novel Geographical On-Demand Routing Protocol (새로운 지리적 온디맨드 라우팅 프로토콜)

  • Choi, Youngchol;Lim, Yong-kon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.6
    • /
    • pp.1092-1099
    • /
    • 2017
  • In this paper, we propose a novel geographical on-demand routing protocol for a mobile ad-hoc network (MANET) that resolves the broadcast storm problem of ad-hoc on-demand distance vector (AODV) routing protocol. The candidates relaying route request (RREQ) packet are geographically restricted by the locations of the destination and a (RREQ sender. Then, the duplicate RREQs, which are generally discarded in the protocols that follow the principle of the AODV, are parsed to avoid redundant RREQ rebroadcasts and to perform passive acknowledgement with respect to a RREQ rebroadcast. The proposed routing protocol is implemented by modifying the source code of the AODV in QualNet. It is shown through QualNet simulations that the proposed routing protocol significantly improves the packet delivery ratio and the latency of the AODV in high-density and heavy traffic network scenarios.

An Energy-Efficient Algorithm for Solving Coverage Problem and Sensing Big Data in Sparse MANET Environments (희소 모바일 애드 혹 네트워크 환경에서 빅데이터 센싱을 위한 에너지 효율적인 센서 커버리지 알고리즘)

  • Gil, Joon-Min
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.11
    • /
    • pp.463-468
    • /
    • 2017
  • To sense a wide area with mobile nodes, the uniformity of node deployment is a very important issue. In this paper, we consider the coverage problem to sense big data in sparse mobile ad hoc networks. In most existing works on the coverage problem, it has been assumed that the number of nodes is large enough to cover the area in the network. However, the coverage problem in sparse mobile ad hoc networks differs in the sense that a long-distance between nodes should be formed to avoid the overlapping coverage areas. We formulate the sensor coverage problem in sparse mobile ad hoc networks and provide the solution to the problem by a self-organized approach without a central authority. The experimental results show that our approach is more efficient than the existing ones, subject to both of coverage areas and energy consumption.

Cooperative Spectrum Sensing with Ad-Hoc Network for Cognitive Radio (애드 혹 네트워크에서의 협력 센싱 기법의 성능 분석)

  • Lee, Kyung-Sun;Kim, Yoon-Hyun;Kim, Jin-Young
    • Journal of Satellite, Information and Communications
    • /
    • v.6 no.1
    • /
    • pp.75-79
    • /
    • 2011
  • Wireless devices can communicate between each other without existing infrastructure in mobile Ad-hod network. Ad hoc networks can be used under difficult conditions, where it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio (CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. In this paper, we simulate and compare the performance of conventional single and cooperative spectrum sensing with CR system using ad-hoc networks in additive white Gaussian noise (AWGN) and Rayleigh channel model. And we demonstrate performance improvement by analyzing the system performance.

Women's Fashion and Signs of the Modern City Expressed on Paintings by the Impressionists (인상주의 회화에 나타난 근대도시의 기호와 여성패션)

  • Park, Hyewon
    • Journal of Fashion Business
    • /
    • v.22 no.4
    • /
    • pp.76-92
    • /
    • 2018
  • The purpose of this study is to find the meaning of women's fashion in the city culture of Paris in the nineteenth century by examining paintings by the Impressionists. The research method was based on literature survey and visual examination paintings, 224 paintings(by ${\acute{E}}douard$ Manet, James Tissot, Edgar DeGas, Gustave Cailleboat, Jean $B{\acute{e}}raud$, Pierre-Auguste Renoir) were analyzed in this study. The results are as follows: In the nineteenth century, Paris was a new city with new department stores. Department stores were centers of consumer culture, where the power of capital appeared rather than class. The spatial backgrounds of Impressionist paintings were places where they could see the consumption and leisure culture of urban people, such as outdoor parks, cafes, theaters, ballrooms, bars, streets, and the boats. As for the characteristics of women's fashion in paintings, it was found that various changes of artificial silhouettes were developed. Various frills, ruffles, gatherings, and pleats were thought to have been made by machines. In the urban space, many of the women's costumes stood out because of the black color. Not only the black color came to represent widows and mourning but the black outfits worn by women enhanced their sensual appearances. Women's fashion expressed in Impressionist paintings eventually contained a modern meaning that changed from 'class symbol' to 'expression of taste'. And the symbol of consumer and leisure culture showed, and a Demimonde's fashion became a trendsetter, and painters were used as an important element expressing modernity.

Dual Mode-AODV for the Hybrid Wireless Mesh Network (하이브리드 무선 메시 네트워크를 위한 듀얼모드-AODV)

  • Kim, Hocheal
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.1
    • /
    • pp.1-9
    • /
    • 2017
  • With the Development of Wireless Network Technology and Wireless Link Technology, Wireless Mesh Network (WMN) is Attracting Attention as a Key Technology to Construct the Wireless Transit Network. The WMN has been Studied for a Long Time in Various Fields, however there are still many Problems that have not been solved yet. One of them is the Routing Problem to find an Optimal path in a Multi-hop Network Composed of Wireless Links. In the Hybrid-WMN, which is one of the Three Types of WMN, Optimal Path Selection Requires Research on Path Search Protocols that Effectively use the Infrastructure Mesh as a Transit Network, Together with Research for a Routing Metric with Excellent Performance. Therefore, this Paper Proposes a Dual Mode-AODV(Ad hoc On-demand Distance Vector) for Hybrid-WMN. Simulation result shows that the Path Selection Delay was Reduced by 52% than AODV when the Proposed Dual Mode-AODV was applied.

A Message Broadcast Scheme using Contention Window in Vehicular Ad-hoc Network (차량 애드혹 네트워크에서 경쟁윈도우를 이용한 메시지 브로드캐스트 기법)

  • Kim, Tae-Hwan;Hong, Won-Kee;Kim, Hie-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.423-434
    • /
    • 2007
  • Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

CASPER: Congestion Aware Selection of Path with Efficient Routing in Multimedia Networks

  • Obaidat, Mohammad S.;Dhurandher, Sanjay K.;Diwakar, Khushboo
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.241-260
    • /
    • 2011
  • In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

An Ad-hoc Routing Protocol for High-speed Multimedia Traffic Based on Path Quality and Bandwidth Estimation in Wireless Ad Hoc Networks (무선 애드혹 네트워크에서 경로 품질 및 잔여 대역폭 예측에 기반한 고속 멀티미디어 데이터 전송의 라우팅 프로토콜)

  • Shohel, Ahmed Md.;Yoon, Seokhoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.6
    • /
    • pp.203-210
    • /
    • 2013
  • Majority of the wireless ad hoc routing protocols are proposed to find feasible routes without considering the network load, end-to-end link quality and bandwidth requirements of the application. Therefore, protocol may not provide sufficient quality of service (QoS) to a high speed traffic such as multimedia. In this paper, we propose a path-quality and bandwidth-estimation based routing protocol (PBBR) for the high quality multimedia stream that can meet the application's bandwidth requirements and find the best reliable route. The novelty of this protocol is to select a reliable path to respond the application's requirements based on available bandwidth at each intermediate node and end-to-end path loss ratio. Obtained results from the simulation demonstrates that our protocol can achieve sufficient performance in terms of throughput and end-to-end delay.