The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Applying network coding and opportunistic routing can significantly improve the throughput performance of wireless multi-hop networks, but a mismatch problem still exists among the upper flow rate, routing and lower transmission resource scheduling. This paper models the throughput optimization as a network utility function maximization in wireless multi-hop networks. By applying Lagrangian dual decomposition...
Ultra dense networks and device-to-device communications are expected to play a major role in 5G networks to meet tremendous traffic requirements. In our work, we address traffic offloading in dense device-to-device cooperative heterogeneous networks with focus on use cases where a very large number of users request simultaneously common streaming content from a remote server with quality of service...
We study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical exploration-exploitation setting in that the design and analysis must accommodate the dynamics of packet availability and urgency as well as the cost of each channel use at the time...
The performance of existing coded caching schemes is sensitive to the worst channel quality, when applied to wireless channels. In this paper, we address this limitation in the following manner: in short-term, we allow transmissions to subsets of users with good channel quality, avoiding users with fades, while in long-term we ensure fairness across the different users. Our online delivery scheme...
We study an offloading mechanism for cellular networks in which mobiles with good cellular links can act as hotspots and can assist other mobiles. We study throughput optimal offloading and also a fair offloading strategy which we call proportional increment offloading. We show that the former problem can be reduced to a capacitated facility location problem (CFLP) whereas the latter can be solved...
Tactical networks are generally simple ad-hoc networks in design, however, this simple design often gets complicated, when heterogeneous wireless technologies have to work together to enable seamless multi-hop communications across multiple sessions. In recent years, there has been some significant advances in computational, radio, localization, and networking te, and session's rate i.e., aggregate...
Wireless networks progress into subsequent creation to afford quicker and superior services, a key in technology Wireless mesh networks have been emerged in recent times. A wireless mesh network comprised of radio nodes which a form of wireless ad hoc network. In wireless mesh network nodes are combination of mesh routers and mesh clients. Wireless mesh network shows potential wireless technology...
In this paper, we assess the performance gains of mobility on the downlink of cellular data networks. These gains are only due to the elastic nature of traffic and thus observed even under a blind, fair scheduling scheme: data are more likely transmitted when users are close to the base stations, in good radio conditions. This phenomenon is further amplified by opportunistic scheduling schemes that...
We propose a clean-slate, holistic approach to the design of secure protocols for wireless ad-hoc networks. We design a protocol that enables a collection of distributed nodes to emerge from a primordial birth and form a functioning network. We consider the case when nodes are synchronized and the network is closed, in that no other nodes can join. We define a game between protocols and adversarial...
This paper treats power-aware throughput maximization in a multi-user file downloading system. Each user can receive a new file only after its previous file is finished. The file state processes for each user act as coupled Markov chains that form a generalized restless bandit system. First, an optimal algorithm is derived for the case of one user. The algorithm maximizes throughput subject to an...
Recent advances in interference cancellation and signal-processing techniques can enable full-duplex radios and multipacket reception (MPR), which will have significant impact on medium access control (MAC) schemes. In this paper, we propose a MAC scheme in unmanned aerial vehicle (UAV) ad-hoc networks with full-duplex radios and MPR. To efficiently handle the highly mobile environment of a UAV ad-hoc...
Delay is a critical QoS performance metric for Multi-hop Wireless Network (MHWN). It is well known that schemes that give a higher data rate to the link with larger queue length can achieve high throughput performance. However, this queue-length-based approach may potentially suffer from large (even infinite) packet delays due to the subsequent contention problem caused by the next-hop arriving packets...
Queue-based cross-layer optimization algorithms have recently been a subject of intensive research in wireless networks. Their purpose is to guarantee stable operation and to achieve some form of fairness among users, whenever the traffic demand exceeds network capacity. Despite the plethora of work in this field, the scenario where one or more nodes declare false queue backlog values in order to...
In case of high dynamic topology, reactive routing protocols provide quick convergence by faster route discoveries and route maintenance. Frequent broadcasts reduce routing efficiency in terms of broadcast cost; Bk, and expected time cost; E[t]. These costs are optimized using different mechanisms. So, we select three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source...
In this paper, we propose a distributed resource allocation framework for cognitive radio networks by using the orthogonal frequency division multiple access (OFDMA) modulation. We jointly consider the constraints of quality of service (QoS), maximum power, and minimum rates in the network to obtain optimal available subcarrier sets and transmission power. The fairness of resource allocation is guaranteed...
Cognitive Radios (CR) technology gives network operators more opportunities to create new communication services by sharing under-utilized spectrum owned by the licensed users. Despite of the advantages from CR, since secondary users should protect the primary service during their communication, the channel access of the secondary user is very restricted and opportunistic. This restriction occasionally...
In this paper, we study the spectrum access problem in cognitive radio networks with the objective to maximize the expected throughput of cognitive users. We show that the performance of a uniform access policy that uniformly selects one channel to sense, independent of the primary users' behaviors on the channels, is close to that of the optimal randomized access policy when there are a large number...
To determine the end-to-end throughput capacity of a multi-hop route in wireless networks, existing work either use a simplistic approach to divide the 1-hop throughput capacity by the number of contending links in the bottleneck region, which has limitations in terms of accuracy, or rely on complicated non-linear equations, which is impractical to solve for a large number of hops. In this paper,...
In the last years, there has been an increasing interest in developing and testing Medium Access Control (MAC) protocols for ad hoc networks based on optimal methods. Several solutions do not take into account the throughput-fairness tradeoff, presenting high throughput performance but under-performing in terms of medium access fairness. This work presents a novel MAC scheme, which is designed to...
In the last years, there has been an increasing interest in developing and testing Medium Access Control (MAC) protocols for ad hoc networks based on optimal methods. The solutions already proposed in several works are generally hard to implement because they require extensive message passing among the nodes. Moreover, a relaxation for the optimal solution is generally needed to achieve an implementable...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.