Energy efficient and fairness improved medium access scheduling algorithms for mobile ad hoc networks

Abstract

In mobile ad hoc networks dynamically changing topologies are newlinethe direct result of the mobility of the nodes which characterize the ad hoc newlinenetworks Each node forwards packets to its peer nodes and each flow passes newlinethrough multiple hops of wireless links from a source to a destination The newlineflows compete for shared channel if they are within the interference range of newlineeach other Based on different characteristics like robustness and energy newlineexpenditure the flows can carry out route selection with the availability of newlinemultiple routes to the same node newline newline