Scheduling and routing algorithm for co-operative wireless networks

The major challenges in wireless communication system have increased spectral efficiency and improved connection reliability. Cooperative communications and networking represent a new paradigm which involves both transmission and distributed processing and also increases the capacity and diversity gain in wireless networks. Cooperative transmission is an emerging communication technology that takes advantage of the broadcast nature of wireless channels. In cooperative transmission, the use of relays can create a virtual antenna array, so that multiple-input/multiple-output (MIMO) technique can be employed. The relaying process in cooperative networks can be either transparent or regenerative. In wireless networks the problem of allocating transmission rights to subsets of network users at each time and under different channel qualities is known as the scheduling problem. The generic routing problem in communications networks can be informally stated as the problem of building and using routing tables to direct data traffic so that some measure of network performance, function of the network type and of the services provided, is maximized. Our technical approach is based on modified energy aware scheduling algorithm and also ant colony optimization technique in order to improve the packet delivery ratio and reduces the congestion.