Related papers: A Selection Region Based Routing Protocol for Rand…
In this paper, we investigate joint optimal relay selection and resource allocation under bandwidth exchange (BE) enabled incentivized cooperative forwarding in wireless networks. We consider an autonomous network where N nodes transmit…
In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…
Routing the packets efficiently in mobile ad hoc network does not have end to end paths. Multiple copies are forwarded from the source to the destination. To deal with such networks, researches introduced flooding based routing schemes…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
In Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus delay more conveniently than epidemic routing. Literature provides comprehensive results on optimal routing policies for mobile nodes with homogeneous mobility,…
This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…
Harvesting energy from the radio-frequency (RF) signal is an exciting solution to replenish energy in energy-constrained wireless networks. In this paper, an amplify-and-forward (AF) based wireless relay network is considered, where the…
We investigate the problem of multi-hop scheduling in self-backhauled millimeter wave (mmWave) networks. Owing to the high path loss and blockage of mmWave links, multi-hop paths between the macro base station and the intended users via…
We propose and evaluate a scalable position-publish and an accompanying routing protocol which is efficient despite operating with imperfect information regarding the destination's location. The traffic generated by our position-publish…
This work considers secure transmission protocol for flexible load-balance control in two-hop relay wireless networks without the information of both eavesdropper channels and locations. The available secure transmission protocols via relay…
We consider a novel routing protocol suitable for ad-hoc networks with dynamically changing topologies, such as DECT 2020 NR (NR+) systems, which often lead to missing links between the nodes and thus, incomplete or inefficient routes. A…
Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad…
Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…
An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time…
In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…
This work proposes an analytical framework to study how relay selection strategies perform in half- and full-duplex deployments by combining renewal theory and stochastic geometry. Specifically, we assume that the network nodes -- operating…
The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver…
In this paper, we consider the problem of multi-relay selection for multi-stream cooperative MIMO systems with $M$ relay nodes. Traditionally, relay selection approaches are primarily focused on selecting one relay node to improve the…
Being most popular and IETF standard metric, minimum hop count is appropriately used by Ad hoc Networks, as new paths must rapidly be found in the situations where quality paths could not be found in due time due to high node mobility.…
We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…