Results 11 to 20 of about 70,985 (214)
PETAL: A fully distributed location service for wireless ad hoc networks [PDF]
Abstract Location service is an essential prerequisite for mobile wireless ad hoc networks (MANETs) in which the underlying routing protocol leverages physical location information of sender and receiver nodes. Fulfillment of this requirement is challenging partly due to the mobility and unpredictability of nodes in MANETs.
Ilkhechi A.R.+3 more
openaire +4 more sources
The potential gains of NOMA were evaluated in a satellite system with heterogeneous receivers, after considering the use of specific DVB‐S2X MODCODs, along with the impact of non‐linearities. It was concluded that a judicious power allocation in NOMA, jointly optimized with the IBO of the PAs, can yield significant sum‐rate gains.
Tomás Ramírez, Carlos Mosquera
wiley +1 more source
Distributed wireless network resource optimisation method based on mobile edge computing
This paper mainly compares the network ranking leader, consumption amount and network signal reception of the three algorithms. The study found that in terms of network sort captain, there are significant differences between the CPLEX algorithm, the CCST algorithm, and edge computing methods. The CCST algorithm and edge computing have little difference
Jiongting Jiang+4 more
wiley +1 more source
Robust and low‐communication geographic routing for wireless ad hoc networks [PDF]
AbstractA novel beacon‐less algorithm called Blind Geographic Routing (BGR) is presented, which comes with an effective and robust recovery strategy to circumvent voids, and a new technique to avoid simultaneous forwarding by more than one node, features not included in other beacon‐less algorithms.
Chen, K.C.+5 more
openaire +16 more sources
We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh+4 more
wiley +1 more source
Low hitting time random walks in wireless networks [PDF]
AbstractRandom walks can be conveniently exploited for implementing probabilistic algorithms to solve many searching problems arised by distributed applications, for example, service discovery, p2p file sharing, etc. In this paper we consider random walks executed on uniform wireless networks and study how to reduce the expected number of walk steps ...
Aissani, Mohamed+3 more
openaire +13 more sources
A formalized approach for designing a P2P‐based dynamic load balancing scheme [PDF]
AbstractQuality of service (QoS) is attracting more and more attention in many areas, including entertainment, emergency services, transaction services, and so on. Therefore, the study of QoS‐aware systems is becoming an important research topic in the area of distributed systems.
Khalil Drira+3 more
openaire +20 more sources
MAC protocols using directional antennas in IEEE 802.11 based ad hoc networks [PDF]
AbstractUsing directional antennas can be beneficial for wireless ad hoc networks consisting of a collection of wireless hosts. The most important benefit includes a reduction of the radio interference. Thus, it can significantly increase the spatial reuse, thereby improving the network throughput.
Hamed M. K. Alazemi+3 more
openaire +14 more sources
The capability of the EDCA mechanism to support voice traffic in a mixed voice/data transmission over 802.11e WLANs - an experimental investigation [PDF]
—We analyze IEEE 802.16e medium access control (MAC) sublayer and provides a simple analytical model to compute the 802.16e MAC throughput. Our approach is to begin with a key approximation made by [1] in IEEE 802.11. This study leads to a fixed point equation, which characterizes the operating point of system.
Tim Stevens+6 more
openaire +22 more sources
N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in IP Networks [PDF]
For over a decade researchers have been reporting the impact of self-similar long-range dependent network traffic. Long-range dependence (LRD) is of great significance in traffic engineering problems such as measurement, queuing strategy, buffer sizing and admission and congestion control.
Thiemo Voigt+9 more
openaire +41 more sources