ECWAY Technologies provides IEEE projects and software developments with offices in multiple cities in Tamil Nadu, India. They can be contacted via phone or email. The document discusses using network coding for throughput optimization in multi-radio wireless mesh networks. It formulates the joint problem of network coding, channel assignment, and broadcast link scheduling while taking into account opportunistic overhearing, interference constraints, coding constraints, number of channels, radios per node, and fairness among unicast connections. An auction-based algorithm is developed as a suboptimal solution to optimize overall network throughput. Performance evaluations show the algorithm can effectively use multiple radios and channels while addressing fairness issues from the auction approach, and it provides gains over traditional routing

1. ECWAY TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
OUR OFFICES @ CHENNAI / TRICHY / KARUR / ERODE / MADURAI / SALEM / COIMBATORE
CELL: +91 98949 17187, +91 875487 2111 / 3111 / 4111 / 5111 / 6111
VISIT: www.ecwayprojects.com MAIL TO: ecwaytechnologies@gmail.com
CHANNEL ASSIGNMENT FOR THROUGHPUT OPTIMIZATION IN ULTICHANNEL
MULTIRADIO WIRELESS MESH NETWORKS USING NETWORK CODING
ABSTRACT:
Compared to single-hop networks such as WiFi, multihop infrastructure wireless mesh networks
(WMNs) can potentially embrace the broadcast benefits of a wireless medium in a more flexible
manner. Rather than being point-to-point, links in the WMNs may originate from a single node
and reach more than one other node. Nodes located farther than a one-hop distance and
overhearing such transmissions may opportunistically help relay packets for previous hops.
This phenomenon is called opportunistic overhearing/ listening. With multiple radios, a node can
also improve its capacity by transmitting over multiple radios simultaneously using orthogonal
channels. Capitalizing on these potential advantages requires effective routing and efficient
mapping of channels to radios (channel assignment (CA)). While efficient channel assignment
can greatly reduce interference from nearby transmitters, effective routing can potentially relieve
congestion on paths to the infrastructure.
Routing, however, requires that only packets pertaining to a particular connection be routed on a
predetermined route. Random network coding (RNC) breaks this constraint by allowing nodes to
randomly mix packets overheard so far before forwarding. A relay node thus only needs to know
how many packets, and not which packets, it should send. We mathematically formulate the joint
problem of random network coding, channel assignment, and broadcast link scheduling, taking
into account opportunistic overhearing, the interference constraints, the coding constraints, the

2. number of orthogonal channels, the number of radios per node, and fairness among unicast
connections.
We develop a suboptimal, auction-based solution for overall network throughput optimization.
Performance evaluation results show that our algorithm can effectively exploit multiple radios
and channels and can cope with fairness issues arising from auctions. Our algorithm also shows
promising gains over traditional routing solutions in which various channel assignment strategies
are used.