Design and implementation of resource allocation protocols in wireless networks, utilizing testbed experimentation platforms

Abstract

Particularly for the cooperative scheduling problem, a novel communication architectureis proposed which considers the exploitation of intermediate relays.Relays are employed for forwarding information to the final destination whennetworking conditions do not benefit the direct transmissions from source todestination. Our architecture improves drastically networking performance byincorporating advanced mechanisms from optimization theory. As a result, sophisticatedscheduling and resource allocation techniques for unicast and multicastscenarios are activated so that a wireless network to attain desired powerperformance vs. networking delay trade-offs. A primitive design of our architectureis the ability offered to operators to fine-tune and balance the networkoperation through a control knob that achieves power savings with an inducedcost in the networking delay. The above design feature is enabled by effectivelyexploiting information storage capabilities and power efficient scheduling. Finally,testbed experimentation conducted in NITOS testbed has revealed a significantreduction in the transmission power with the use of our cooperativearchitecture. Moreover, we identify ways to incorporate the same architectureprinciples in LTE-A cellular networks. To this end, we assume wireless meshnetworking by evolving the user equipment to act as a relay in a 3GPP LTE-Asystem. Thus, interconnecting two eNBs with mobile user equipment. Wirelessmesh networking in LTE networks has recently become a focal point of interestin the emerging scenarios for 5G technology. We propose specific scenarioswhere this architecture can be effectively applied and illustrate the correspondingresults from the experimentation that was conducted in the OpenAirInterface For the data offloading problem, we study a framework for toggling LTE-A cellularmobile users to WiFi mesh networks. Mobile network operators can leasethese mesh networks to offload their traffic and reduce their servicing cost. Inthis context, we determine the most-costly users to the cellular network andwe design a routing policy that the mesh network can employ so as to servethe offloaded traffic with the minimum possible cost. Moreover, the reimbursementoffered by the operator should be dispensed to the different mesh users,according to their contribution and added-value significance. We address thisissue by employing the Shapley value profit sharing rule, which ensures theparticipation of the mesh nodes in this joint task.