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.
Energy saving is one of the most investigated problems in wireless networks. In this paper, we introduce two homology based algorithms: a simulated annealing one and a robust one. These algorithms optimize the energy consumption at network level while maintaining the maximal coverage. By using simplicial homology, the complex geometrical calculation of the coverage is reduced to simple matrix computation...
We study the joint resource allocation problem of a mobile heterogeneous network composed of macro cellular users and Device-to-Device (D2D) links. Macro cellular users are always scheduled on uplink shared resources, whereas D2D links may use uplink shared resources, orthogonal resources reserved exclusively for D2D transmissions, or a combination of both types of resources. A sum utility maximization...
Device-to-device (D2D) proximity discovery enables spectral reuse via D2D communications as well as a range of innovative proximity services, such as enhanced social networking and location services. To develop a scalable discovery mechanism, signals transmitted by geographically disparate devices should not differ drastically in their received power at each monitoring device. Discovery schemes are...
We present a performance evaluation of ITLinQ and FlashLinQ, the two most popular schemes proposed to date to channelize D2D transmissions, i.e., to parse transmissions into noninterfering sets to be allocated to separate channels. Recognizing that it captures well the spatial characteristics of D2D networks, a stochastic geometry setting is utilized for this evaluation with the parameters of either...
This paper studies the resource allocation for multi-D2D (Device-to-Device) communications in heterogeneous networks with quality-of-service (QoS) guarantees for both cellular and D2D links. To improve the achievable rate of D2D communication and the spectrum utilization, one D2D pair is allowed to reuse multiple cellular spectrum resources. However, this scheme introduces more interference so that...
We investigate device-to-device (D2D) communication underlaying cellular networks with M-antenna base stations. We consider both beamforming (BF) and interference cancellation (IC) strategies under quantized channel state information (CSI), as well as, perfect CSI. We derive tight closed-form approximations of the ergodic achievable rate which hold for arbitrary transmit power, location of users and...
In the Long Term Evolution (LTE) based device-to-device (D2D) communication systems, there are two resource access modes, i.e., eNB scheduled and random access. The eNB scheduled resource access gives flexibility to eNB with additional signalling overhead. The random access scheme is simple without the eNB control but has the drawback of data collision. In this paper, we propose a collision-aware...
Content distribution using direct device-to-device (D2D) communication is a promising approach for optimizing the utilization of air-interface resources in 5G network. To achieve the best utilization of network resources, the network should bias the distribution of cached content. The optimal caching distribution depends on the content demand distribution. In this paper, we model the locations of...
In this paper, we define a collision area in a heterogeneous cellular network for the purpose of interference management between Device-to-Device (D2D) and conventional cellular (CC) communications. Currently, most D2D routing algorithms assume synchronized accurate location knowledge among users and the base stations. In reality, this level of location accuracy is difficult and power consuming in...
In a device-to-device (D2D) communication underlaying cellular network, user equipments are required to operate cooperatively and unselfishly to transmit data as relays. However, most users behave in a more or less selfish way, which makes user selfishness a key factor that affects the performance of the whole communication system. We focus on the impact of node selfishness on D2D communications....
The energy used to transmit a single bit of data between the devices in sensor networks is equal to the energy for performing hundreds of instructions in those devices. Thus the reduction of the data necessary to transmit, while keeping the same functionality of the employed algorithms is a formidable and challenging scientific task. We describe an algorithm called Small Set of Allowed Coefficients...
In this paper, a power optimization strategy is studied in underlay Device-to-Device (D2D) communication coexisted heterogeneous wireless networks with relay-assisted. In order to reduce the power consumption of cellular users (CUs), especially those far away from the base station (BS), we introduce the relay node (RN) to help transport its data to BS with less power consumption. By taking the advantage...
Future device to device communication using the LTE system bring new opportunities for application development. In the case of wireless sensor networks, unmanned aerial vehicles with LTE capabilities could be used to increase the network lifetime, while ensuring high transfer rates between LTE capable sensor nodes and the aerial vehicles. In this article we propose a hybrid heuristic algorithm able...
We consider a device-to-device (D2D) relay-assisted cellular network where mobile transceivers that are owned by self-interested users are incentivized to relay each other's data using tokens, which they exchange electronically to “buy” and “sell” downlink relay services. We formulate the decision problem faced by each UE, namely, the problem of deciding whether or not to relay, as a Markov decision...
Network coding, by right of the concise form and remarkable effect, has been applauded around the world since its emergence especially in the field of wireless communication. However, we find the superiority of network coding may be concealed by the over redundant information in coded packets under certain circumstances. That is, the back-and-forth coding at intermediate nodes makes the old information...
Network Coding has significantly shown the achievable throughput and robustness in wireless Networks. However, network coding-enabled networks are susceptible to pollution attacks where a small number of polluted messages will propagate due to recoding and corrupt bunches of legitimate messages. Several lightweight Homomorphic Message Authentication Code (HMAC) schemes have been proposed for protecting...
In this paper, we investigate the performance of an ALOHA random access wireless network consisting of nodes with and without RF energy harvesting capability. We develop and analyze a Markov model for the system when nodes with RF energy harvesting capability are infinitely backlogged. Our results indicate that the network throughput is improved when the conventional nodes are underloaded. On the...
A fundamental problem for signal processing in wireless communications is the separation multiple signals/users from their mixture. The problem would be simpler if they are non-overlapping in either time domain or frequency domain. Two signals may be overlapping in both time and frequency, but they still can be easily separated if they are uncorrelated (orthogonal), like in Code Division Multiple...
In device-to-device communications timing and carrier frequency synchronization is crucial for guaranteeing efficient communications within dense networks. A distributed synchronization method without any external reference agent is suitable for these dense networks. This paper presents hardware validation of a recently proposed distributed synchronization algorithm based on consensus paradigms. Identical...
In this paper, we consider multiway relay networks with massive number of users. In this situation a fixed transmission scheduling is difficult to apply. We propose uncoordinated communications using the concept of coded slotted ALOHA (CSA), where simultaneous transmitted signals are detected using iterative demapping (IDM) algorithm to improve the success rate probability. We allow each user to transmit...
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.