Dynamic Cooperative CommunicationsUsing Dijkstra's Algorithm
M Viji. · 2013
Abstract: Cooperative communication has become a tremendous interest in Wireless Network. This type of cooperative communication is used for improving the network capacity in wireless network by reducing the interference and also improving the transmission power. In a normal networking communication, require so much time to transmit the message from source system to destination system, even if a node failure in between the transmission time. The goal of this paper is to improve the network capacity in order to reduce the interference by increasing the transmission power. The existing paper discusses less improvements of network capacity in a single network. By the use of COCO(Capacity Optimized Cooperative) topology, increase in the network capacity by jointly considering both the link level physical layer issues ( such as outage probability & outage capacity) and upper level network layer issues (such as network capacity, routing, topology control) and also time should be delayed, if a system failure during transmission. So, propose a shortest path algorithm called Dijkstra’s algorithm is used for finding the shortest distance between systems.