• Title/Summary/Keyword: Ad hoc Wireless Network

Search Result 715, Processing Time 0.028 seconds

A Novel Method for Avoiding Congestion in a Mobile Ad Hoc Network for Maintaining Service Quality in a Network

  • Alattas, Khalid A.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.9
    • /
    • pp.132-140
    • /
    • 2021
  • Under the mobile ad-hoc network system, the main reason for causing congestion is because of the limited availability of resources. On the other hand, the standardised TCP based congestion controlling mechanism is unable to control and handle the major properties associated with the shared system of wireless channels. It creates an effect on the design associated with suitable protocols along with protocol stacks through the process of determining the mechanisms of congestion on a complete basis. Moreover, when bringing a comparison with standard TCP systems the major environment associated with mobile ad hoc network is regraded to be more problematic on a complete basis. On the other hand, an agent-based mobile technique for congestion is designed and developed for the part of avoiding any mode of congestion under the ad-hoc network systems.

Particle filter-assisted ad hoc routing in a multi-hop wireless ad hoc network for multi-robots

  • Doh, Nak-Ju Lett;Nam, Chang-Joo;Lee, Suk-Kyu;Kim, Hwang-Nam
    • Journal of IKEEE
    • /
    • v.14 no.4
    • /
    • pp.312-316
    • /
    • 2010
  • We describe in this paper how to facilitate ad hoc routing with a particle filter in a hostile radio environment for multi-hop wireless ad hoc networks that connect multi-robots. The proposed scheme increases a connection's throughput by exploiting alternative links without going through the procedure of route discovery when link failure happens among multi-robots' networking. The scheme is implemented by using a particle filter to find strongly connected nodes. The filter estimates the probability distribution function in a sample-based manner with N particles. The particles are associated with a weight which represents the probability of the corresponding node to be the node with the best link. At every step of the estimation, the weights of particles are calculated and particles are resampled based on the weights. Since a node with the strongest link status possesses the largest number of particles, we take this node to forward the packets.

Autonomous Broadcast Pruning Scheme using Coverage Estimation in Wireless Ad Hoc Network (무선 Ad Hoc 망에서 영역 추정을 통한 ABP 브로드캐스트 기법)

  • Bae Ki chan;Kim Nam gi;Yoon Hyun soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.170-177
    • /
    • 2005
  • Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.

Cooperation Models and Cooperative Routing for Exploiting Hop-by-Hop Cooperative Diver sity in Ad Hoc Networks

  • Shin, Hee-Wook;Moh, Sang-Man;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.12
    • /
    • pp.1559-1571
    • /
    • 2011
  • In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

An Improved Energy Aware Greedy Perimeter Stateless Routing Protocol for Wireless Ad Hoc Network (무선 Ad Hoc 네트워크를 위한 개선된 위치정보 기반의 에너지를 고려한 라우팅 프로토콜)

  • Kim, Hak-Je;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.25-31
    • /
    • 2009
  • In this paper we propose an improved energy aware greedy perimeter stateless routing protocol (EAGPSR) for wireless ad hoc network. The existing greedy perimeter stateless routine (GPSR) has some problems with overloaded node and void situation. The improved EAGPSR protocol is proposed to remedy these problems. It also gives the solution for the fundamental problem in geographical routine called void communication. It considers two parameters (Residual Energy of battery and distance to the destination) for the next hop selection. In order to use efficiently limited-energy of node in wireless ad hoc network, network lifetime is focused. To evaluate the performance of our protocol we simulated EAGPSR in ns-2. The simulation results show that the proposed protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR) and the existing Energy aware greedy perimeter stateless routing protocol (EAGPSR).

On Providing Anonymity in Ad Hoc Networks (Ad Hoc Network에서 익명성 제공에 관한 연구)

  • Kang, Seung-Seok
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.93-103
    • /
    • 2007
  • Networking environments are exposed to outside attacks and privacy threats. Due to broadcast nature of radio transmissions, wireless devices experience more vulnerable situations than those of wired network devices. This paper assumes that a wireless device has two network interfaces, one for accessing internet using 3G services, and the other for constructing an ad hoc network. To deal with privacy threats, this paper introduces an approach in which wireless devices form a special ad hoc network in order to exchange data using anonymous communications. One or more intermediate peers should be involved in the construction of an anonymous path. The proposed anonymous communication mechanism discourages traffic analysis and improves user privacy. According to simulation results, the anonymous connection in an ad hoc network prefers the intermediate peer(s) which is located near the source and/or the destination peer, rather than randomly-selected peers.

  • PDF

Ad-hoc home network system using wireless sensor network technology (무선 센서네트워크기술을 활용한 Ad-hoc 홈 네트워크시스템)

  • Shin, Kwang-Sig;Kwon, Joon-Dal;Lee, Young-Dong;Chung, Wan-Young
    • Journal of Sensor Science and Technology
    • /
    • v.16 no.2
    • /
    • pp.142-149
    • /
    • 2007
  • Wireless sensor network technology is an emerging technology consisting of small, low power, and low cost devices that integrate limited computation, sensing, and radio communication capabilities. An ad-hoc home network system based embedded system for home environment monitoring was fabricated and tested. The wireless sensor node consists of a MCU, RF transceiver and sensors (temperature, humidity and light). Wireless sensor nodes run application software for data sampling and wireless communication, that was developed using 'nesC language' which runs on TinyOS. In our tests, acquired sensors data were monitored on 6.4" TFT-LCD of base-station through IEEE802.15.4 standard wireless communication. Also, the sensor data can be monitored by client user at the terminal PC to monitor environmental status of home in real time.

Multi-Channel/Radio based CAC Mechanism for Wireless Ad-hoc Networks (무선 애드혹 통신망용 멀티 채널/라디오 기반 호접속 제어 메저니즘)

  • Ko, Sung-Won;Kang, Min-Su;Kim, Young-Han
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.396-404
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol which works in wireless Ad-hoc communication networks with multiple radios and multiple channels, and controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which makes full duplex transmission between wireless Ad-hoc nodes, and reduces the intra interference on a route. Also, a fixed channel only for reception at each node enables the measurement of the available bandwidth, which is used to control the call admission for QoS provision. The performance of MCQosR is verified by simulation.

Ad hoc Network for Dynamic Multicast Routing Protocol Using ADDMRP

  • Chi, Sam-Hyun;Kim, Sung-Uk;Lee, Kang-Whan
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.209-214
    • /
    • 2007
  • In this paper, we proposed a new MANET (Mobile Ad hoc Networks) technology of routing protocol. The MANET has a mobility formation of mobile nodes in the wireless networks. Wireless network have two types architecture: the Tree based multicast and shared tree based. The two kind's architecture of general wireless networks have difficult to solve the problems existing in the network, such as connectivity, safety, and reliability. For this purpose, as using that ADDMRP (Ad hoc network Doppler effect-based for Dynamic Multicast Routing Protocol), this study gives the following suggestion for new topology through network durability and Omni-directional information. The proposed architectures have considered the mobility location, mobility time, density, velocity and simultaneous using node by Doppler effects and improved the performance.

A Hybrid Key Management Scheme in Tactical Ad-hoc Network (전술 Ad-hoc 네트워크에서 하이브리드 키 관리 기법)

  • Lee, Yun-Ho;Lee, Soo-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1413-1421
    • /
    • 2011
  • A next generation military communication system called Tactical Information Communication Network(TICN) is designed to advance into large capacity, high speed, and long distance wireless relay transmission. To support mobility in battlefield, the application of Ad-hoc networking technology to its wireless communication is being considered. In Ad-hoc network, the key management technique is very important to ensure the confidentiality, integrity, and authentication. In this paper, we propose a new hybrid key management scheme considering the hierarchical characteristics of the tactical ad-hoc such as TICN. For upper layer with sufficient energy and computation capability, we apply PKI based key management scheme. For lower layer with restricted resources, we propose a new key management scheme using the location-based authentication to ensure the energy efficiency.