16 April 2006 in Foundations and Trends® in Networking
Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner in order to support information transfer. In this text we will present abstract models that capture the cross-layer interaction from the physical to transport layer in wireless network architectures including cellular, ad-hoc and sensor networks as well as hybrid wireless-wireline. The model allows for arbitrary network topologies as well as traffic forwarding modes, including datagrams and virtual circuits. Furthermore the time varying nature of a wireless network, due either to fading channels or to changing connectivity due to mobility, is adequately captured in our model to allow for state dependent network control policies. Quantitative performance measures that capture the quality of service requirements in these systems depending on the supported applications are discussed, including throughput maximization, energy consumption minimization, rate utility function maximization as well as general performance functionals. Cross-layer control algorithms with optimal or suboptimal performance with respect to the above measures are presented and analyzed. A detailed exposition of the related analysis and design techniques is provided.
4 April 2006 in Mobile Networks and Applications
26 April 2012 in Queueing Systems
12 March 2019 in IEEE Transactions on Network Science and Engineering
Exchange of services and resources over sharing economy networks is attracting increasing interest. Despite their broad applicability however, many fundamental questions regarding their properties and efficiency remain unanswered. We consider a general sharing economy model and analyze the users' dynamic interactions under three different approaches in a stochastic environment. First, we study a centrally designed service allocation policy that yields the fair total service each user should receive based on the resources it offers to others. Next, we consider a competitive market where each user determines its allocation policy so as to maximize the service it receives in return, and a coalitional game model where users may coordinate their policies. We prove there is a unique equilibrium exchange allocation for both settings, which also coincides with the central fair service allocation. Furthermore, we characterize the properties of the long-term equilibrium allocations, and analyze their dependency on the network graph. Finally, a dynamic decentralized algorithm is introduced that achieves this desirable operation point with minimal information exchange. The proposed servicing policy is the natural reference point to the various mechanisms that are currently proposed to incentivize user participation and improve the efficiency of such networked sharing economy markets.
18 December 2014 in IEEE Journal on Selected Areas in Communications
CFConstantinos Fragiadakis
We study a one-hop broadcast channel with two receivers. The receivers have side information obtained by overhearing wireless channels. The relay takes control decisions by coding transmissions based on its knowledge of side information in the receivers. We consider two control mechanisms. In the ACK system, the relay has definite knowledge of side information announced via overhearing reports. In the NACK system, the relay has statistical knowledge of side information and receives feedback after every decoding failure. Our contribution is as follows. We provide the minimal evacuation times for the two systems and obtain analytical expressions of the throughput region for the ACK and the code-constrained region for the NACK system. When the transmission rates are the same (r 1 = r 2 ) or when the receiver with the highest transmission rate has perfect side information (p f =1), we show that the two regions are equal. We then provide simple joint xor coding and scheduling policies that achieve those regions and, thus, are throughput optimal. Subsequently, we evaluate the report overhead performance for both mechanisms and reflect on the involved tradeoff with throughput. Ultimately, we demonstrate by simulations that the proposed throughput optimal policies can be appropriately enhanced to have good delay properties, particularly for protocols that utilize sequenced packet delivery.