• Title/Summary/Keyword: cooperative routing

Search Result 48, Processing Time 0.024 seconds

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.

Wireless Ad-hoc Networks Using Cooperative Diversity-based Routing in Fading Channel

  • Kim, Nam-Soo;An, Beong-Ku;Kim, Do-Hyeon;Lee, Ye-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2B
    • /
    • pp.69-75
    • /
    • 2008
  • We propose new routing scheme, Cooperative Diversity-based Routing (CDR)which utilize the cooperative space diversity for power saving and for performance enhancement of wireless ad-hoc networks. The end-to-end performance of the proposed routing, CDR, is analyzed based on the Haenggi's link model. The improved performance is compared with Multi-hop Relay Routing (MRR) by analytical methods. When the required outage probability is $1{\times}10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 21.5 dB in average, by using our proposed CDR compared to MRR.

Minimum Energy Cooperative Path Routing in All-Wireless Networks: NP-Completeness and Heuristic Algorithms

  • Li, Fulu;Wu, Kui;Lippman, Andrew
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.204-212
    • /
    • 2008
  • We study the routing problem in all-wireless networks based on cooperative transmissions. We model the minimum-energy cooperative path (MECP) problem and prove that this problem is NP-complete. We hence design an approximation algorithm called cooperative shortest path (CSP) algorithm that uses Dijkstra's algorithm as the basic building block and utilizes cooperative transmissions in the relaxation procedure. Compared with traditional non-cooperative shortest path algorithms, the CSP algorithm can achieve a higher energy saving and better balanced energy consumption among network nodes, especially when the network is in large scale. The nice features lead to a unique, scalable routing scheme that changes the high network density from the curse of congestion to the blessing of cooperative transmissions.

CooRP: A Cooperative Routing Protocol in Mobile Ad-hoc Wireless Sensor Networks (CooRP: 모바일 Ad-hoc 무선 센서 네트워크에서 협력 라우팅 프로토콜)

  • An, Beong-Ku;Lee, Joo-Sang;Kim, Nam-Soo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.6
    • /
    • pp.25-34
    • /
    • 2011
  • In this paper, In this paper, we propose a Cooperative Routing Protocol (CooRP) for supporting network convergence and transmission services efficiently in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the routing routes are decided on route stability based on entropy concepts using mobility of nodes within the direction guided line region to increase the operational lifetime of routes as well as reduce control overhead for route construction. Second, a cooperative data transmission strategy based on the constructed stable routing route is used to increase packet delivery ratio with advanced SNR. Third, a theoretical analysis for cooperative data transmission of the proposed CooRP with outage probability is presented. The performance evaluation of the proposed CooRP is performed via simulation using OPNET and analysis. The results of performance evaluation show that the proposed CooRP by using stable routing routes and cooperative transmission can increase packet delivery ratio efficiently.

Cooperative Routing of Wireless Ad-hoc Networks in Rayleigh Fading Channel (레일레이 페이딩 채널에서 무선 애드 혹 네트워크의 협동라우팅)

  • Kim, Nam-Soo;An, Beong-Ku;Kim, Do-Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.290-296
    • /
    • 2007
  • We propose new routing scheme, Cooperative Diversity-based Routing (CDR) which utilizes the cooperative space diversity for power saving and performance enhancement of wireless ad-hoc networks. The improved performance is compared with Multi-hop Relay Routing (NRR) by analytical methods. When the required outage probability is $1\times10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 15.5 dB in average, by using our proposed CDR compared to MRR.

A Generous Cooperative Routing Protocol for Vehicle-to-Vehicle Networks

  • Li, Xiaohui;Wang, Junfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5322-5342
    • /
    • 2016
  • In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

Cluster-based Cooperative Data Forwarding with Multi-radio Multi-channel for Multi-flow Wireless Networks

  • Aung, Cherry Ye;Ali, G.G. Md. Nawaz;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5149-5173
    • /
    • 2016
  • Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

An Entropy-based Cooperative-Aided Routing Protocol for Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크를 위한 엔트로피기반 협력도움 라우팅 프로토콜)

  • An, Beong-Ku;Lee, Joo-Sang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.106-113
    • /
    • 2008
  • In this paper, we propose an Entropy-based Cooperative-Aided Routing Protocol (ECARP) in Mobile Ad-hoc fireless Sensor Networks (MAWSN). The main contributions and features of this paper are as follows. First, the entropy-based cooperative routing protocol which is based on node mobility is proposed for supporting stable routing route construction. Second, cooperative data transmission method is used for improving data transmission ratio with the improved SNR. Third, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation and analysis.

A Location-Aided Cooperative Transmission Method in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 위치도움 협력 전송 방법)

  • Son, Dong-Hwan;Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.23-28
    • /
    • 2008
  • In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

  • PDF

A Cross-Layer Cooperative Routing Architecture for Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크를 위한 Cross-Layer 협력도움 라우팅 구조)

  • Lee, Joo-Sang;An, Beong-Ku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.141-150
    • /
    • 2011
  • In this paper, we propose a Cross-Layer Cooperative Routing(CLCR) architecture to support transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed architecture and method are as follows. First, the clustering which uses the location information of nodes is utilized as infrastructure. Second, a cross-layer strategy which uses the technologies of network layer, MAC layer, physical layer together to support transmission efficiency and channel efficiency for cooperative-aided routing and transmission. Third, we consider realistic approach in the view points of the mobile ad-hoc wireless sensor networks while conventional methods just consider fixed sensor network environments. The performance evaluation of the proposed method is performed via simulation using OPNET and theoretical analysis. The results of performance evaluation of the proposed CLCR show improvement of transmission efficiency by the proposed CLCR.