No Arabic abstract
In recent times, there have been a lot of efforts for improving the ossified Internet architecture in a bid to sustain unstinted growth and innovation. A major reason for the perceived architectural ossification is the lack of ability to program the network as a system. This situation has resulted partly from historical decisions in the original Internet design which emphasized decentralized network operations through co-located data and control planes on each network device. The situation for wireless networks is no different resulting in a lot of complexity and a plethora of largely incompatible wireless technologies. The emergence of programmable wireless networks, that allow greater flexibility, ease of management and configurability, is a step in the right direction to overcome the aforementioned shortcomings of the wireless networks. In this paper, we provide a broad overview of the architectures proposed in literature for building programmable wireless networks focusing primarily on three popular techniques, i.e., software defined networks, cognitive radio networks, and virtualized networks. This survey is a self-contained tutorial on these techniques and its applications. We also discuss the opportunities and challenges in building next-generation programmable wireless networks and identify open research issues and future research directions.
Wireless Mesh Networks (WMNs) have been extensively studied for nearly two decades as one of the most promising candidates expected to power the high bandwidth, high coverage wireless networks of the future. However, consumer demand for such networks has only recently caught up, rendering efforts at optimizing WMNs to support high capacities and offer high QoS, while being secure and fault tolerant, more important than ever. To this end, a recent trend has been the application of Machine Learning (ML) to solve various design and management tasks related to WMNs. In this work, we discuss key ML techniques and analyze how past efforts have applied them in WMNs, while noting some existing issues and suggesting potential solutions. We also provide directions on how ML could advance future research and examine recent developments in the field.
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimize maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.
With the seamless coverage of wireless cellular networks in modern society, it is interesting to consider the shape of wireless cellular coverage. Is the shape a regular hexagon, an irregular polygon, or another complex geometrical shape? Based on fractal theory, the statistical characteristic of the wireless cellular coverage boundary is determined by the measured wireless cellular data collected from Shanghai, China. The measured results indicate that the wireless cellular coverage boundary presents an extremely irregular geometrical shape, which is also called a statistical fractal shape. Moreover, the statistical fractal characteristics of the wireless cellular coverage boundary have been validated by values of the Hurst parameter estimated in angular scales. The statistical fractal characteristics of the wireless cellular coverage boundary can be used to evaluate and design the handoff scheme of mobile user terminals in wireless cellular networks.
An energy cooperation policy for energy harvesting wireless sensor networks (WSNs) with wireless power transfer is proposed in this paper to balance the energy at each sensor node and increase the total energy utilization ratio of the whole WSNs. Considering the unbalanced spatio-temporal properties of the energy supply across the deployment terrain of energy harvesting WSNs and the dynamic traffic load at each sensor node, the energy cooperation problem among sensor nodes is decomposed into two steps: the local energy storage at each sensor node based on its traffic load to meet its own needs; within the energy storage procedure sensor nodes with excess energy transmit a part of their energy to nodes with energy shortage through the energy trading. Inventory theory and game theory are respectively applied to solving the local energy storage problem at each sensor node and the energy trading problem among multiple sensor nodes. Numerical results show that compared with the static energy cooperation method without energy trading, the Stackelberg Model based Game we design in this paper can significantly improve the trading volume of energy thereby increasing the utilization ratio of the harvested energy which is unevenly distributed in the WSNs.
Millimeter-wave (mmWave) frequency bands offer a new frontier for next-generation wireless networks, popularly known as 5G, to enable multi-gigabit communication; however, the availability and reliability of mmWave signals are significantly limited due to its unfavorable propagation characteristics. Thus, mmWave networks rely on directional narrow-beam transmissions to overcome severe path-loss. To mitigate the impact of transmission-reception directionality and provide uninterrupted network services, ensuring the availability of mmWave transmission links is important. In this paper, we proposed a new flexible network architecture to provide efficient resource coordination among serving basestations during user mobility. The key idea of this holistic architecture is to exploit the software-defined networking (SDN) technology with mmWave communication to provide a flexible and resilient network architecture. Besides, this paper presents an efficient and seamless uncoordinated network operation to support reliable communication in highly-dynamic environments characterized by high density and mobility of wireless devices. To warrant high-reliability and guard against the potential radio link failure, we introduce a new transmission framework to ensure that there is at least one basestation is connected to the UE at all times. We validate the proposed transmission scheme through simulations.