Medium Access Control Protocols for Ad-Hoc Wireless Networks: A Survey

Studies of ad hoc wireless networks are a relatively new field gaining more popularity for various new applications. In these networks, the Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. These protocols are of significant importance since the wireless communication channel is inherently prone to errors and unique problems such as the hidden-terminal problem, the exposed-terminal problem, and signal fading effects. Although a lot of research has been conducted on MAC protocols, the various issues involved have mostly been presented in isolation of each other. We therefore make an attempt to present a comprehensive survey of major schemes, integrating various related issues and challenges with a view to providing a big-picture outlook to this vast area. We present a classification of MAC protocols and their brief description, based on their operating principles and underlying features. In conclusion, we present a brief summary of key ideas and a general direction for future work

Distributed multimedia systems

A distributed multimedia system (DMS) is an integrated communication, computing, and information system that enables the processing, management, delivery, and presentation of synchronized multimedia information with quality-of-service guarantees. Multimedia information may include discrete media data, such as text, data, and images, and continuous media data, such as video and audio. Such a system enhances human communications by exploiting both visual and aural senses and provides the ultimate flexibility in work and entertainment, allowing one to collaborate with remote participants, view movies on demand, access on-line digital libraries from the desktop, and so forth. In this paper, we present a technical survey of a DMS. We give an overview of distributed multimedia systems, examine the fundamental concept of digital media, identify the applications, and survey the important enabling technologies.published_or_final_versio

Enabling Technologies for Ultra-Reliable and Low Latency Communications: From PHY and MAC Layer Perspectives

© 1998-2012 IEEE. Future 5th generation networks are expected to enable three key services-enhanced mobile broadband, massive machine type communications and ultra-reliable and low latency communications (URLLC). As per the 3rd generation partnership project URLLC requirements, it is expected that the reliability of one transmission of a 32 byte packet will be at least 99.999% and the latency will be at most 1 ms. This unprecedented level of reliability and latency will yield various new applications, such as smart grids, industrial automation and intelligent transport systems. In this survey we present potential future URLLC applications, and summarize the corresponding reliability and latency requirements. We provide a comprehensive discussion on physical (PHY) and medium access control (MAC) layer techniques that enable URLLC, addressing both licensed and unlicensed bands. This paper evaluates the relevant PHY and MAC techniques for their ability to improve the reliability and reduce the latency. We identify that enabling long-term evolution to coexist in the unlicensed spectrum is also a potential enabler of URLLC in the unlicensed band, and provide numerical evaluations. Lastly, this paper discusses the potential future research directions and challenges in achieving the URLLC requirements

Dynamic channel allocation in satellite and wireless networks

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 161-165).The objective of this thesis is to understand how to utilize wireless channels in a fair and efficient manner within a multi-users communication environment. We start by exploring the allocation of a single wireless downlink fading channel among competing users. The allocation of a single uplink multiacccess fading channel is studied as well. With multiple parallel fading channels, a MAC protocol based on pricing is proposed to allocate network resource according to users' demand. We also investigate the use of parallel transmissions and redundant packets to reduce the file transmission delay. Specifically, we develop a novel auction-based algorithm to allow users to fairly compete for a downlink wireless fading channel. We first use the second-price auction mechanism whereby user bids for the channel, during each time-slot, based on the fade state of the channel, and the user that makes the highest bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited budget for bidding, we show the existence of a Nash equilibrium strategy. And the Nash equilibrium leads to a unique allocation for certain channel state distribution. We also show that the Nash equilibrium strategy leads to an allocation that is pareto optimal. We also investigate the use of another auction mechanism, the all-pay auction, in allocating a single downlink channel. A unique Nash equilibrium is shown to exist. We also show that the Nash equilibrium strategy achieves a throughput allocation for each user that is proportional to the user's budget For the uplink of a wireless channel, we present a game-theoretical model of a wireless communication system with multiple competing users sharing a multiaccess fading channel.(cont.) With a specified capture rule and a limited amount of energy available, a user opportunistically adjusts its transmission power based on its own channel state to maximize the user's own individual throughput. We derive an explicit form of the Nash equilibrium power allocation strategy. Furthermore, as the number of users in the system increases, the total system throughput obtained by using a Nash equilibrium strategy approaches the maximum attainable throughput. In a communication scenario where multiple users sharing a set of multiple parallel channels to communicate with multiple satellites, we propose a novel MAC protocol based on pricing that allocates network resources efficiently according to users' demand. We first characterize the Pareto efficient throughput region (i.e., the achievable throughput region). The equilibrium price, where satellite achieve its objective and users maximize their payoffs, is shown to exist and is unique. The resulting throughput at the equilibrium is shown to be Pareto efficient. Finally, we explore how a user can best utilize the available parallel channels to reduce the delay in sending a file to the base-station or satellite. We study the reduction of the file delay by adding redundant packets (i.e., coding). Our objective here is to characterize the delay and coding tradeoff in a single flow case. We also want to address the question whether coding will help to reduce delay if every user in the system decides to add redundancy for its file transmission.by Jun Sun.Ph.D

Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems

The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service. This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment

Real-Time Sensor Networks and Systems for the Industrial IoT

The Industrial Internet of Things (Industrial IoT—IIoT) has emerged as the core construct behind the various cyber-physical systems constituting a principal dimension of the fourth Industrial Revolution. While initially born as the concept behind specific industrial applications of generic IoT technologies, for the optimization of operational efficiency in automation and control, it quickly enabled the achievement of the total convergence of Operational (OT) and Information Technologies (IT). The IIoT has now surpassed the traditional borders of automation and control functions in the process and manufacturing industry, shifting towards a wider domain of functions and industries, embraced under the dominant global initiatives and architectural frameworks of Industry 4.0 (or Industrie 4.0) in Germany, Industrial Internet in the US, Society 5.0 in Japan, and Made-in-China 2025 in China. As real-time embedded systems are quickly achieving ubiquity in everyday life and in industrial environments, and many processes already depend on real-time cyber-physical systems and embedded sensors, the integration of IoT with cognitive computing and real-time data exchange is essential for real-time analytics and realization of digital twins in smart environments and services under the various frameworks’ provisions. In this context, real-time sensor networks and systems for the Industrial IoT encompass multiple technologies and raise significant design, optimization, integration and exploitation challenges. The ten articles in this Special Issue describe advances in real-time sensor networks and systems that are significant enablers of the Industrial IoT paradigm. In the relevant landscape, the domain of wireless networking technologies is centrally positioned, as expected

Data Communication in VANETs: Survey, Applications and Challenges

International audienceVANETs have emerged as an exciting research and application area. Increasingly vehicles are being equipped with embedded sensors, processing and wireless communication capabilities. This has opened a myriad of possibilities for powerful and potential life-changing applications on safety, efficiency, comfort, public collaboration and participation, while they are on the road. Although, considered as a special case of a Mobile Ad Hoc Network, the high but constrained mobility of vehicles bring new challenges to data communication and application design in VANETs. This is due to their highly dynamic and intermittent connected topology and different application's QoS requirements. In this work, we survey VANETs focusing on their communicationand application challenges. In particular, we discuss the protocol stack of this type of network, and provide a qualitative comparison between most common protocols in the literature. We then present a detailed discussion of dfferent categories of VANET applications. Finally, we discuss open research problems to encourage the design of new VANET solutions

Cooperative & cost-effective network selection: a novel approach to support location-dependent & context-aware service migration in VANETs

Vehicular networking has gained considerable interest within the research community and industry. This class of mobile ad hoc network expects to play a vital role in the design and deployment of intelligent transportation systems. The research community expects to launch several innovative applications over Vehicular Ad hoc Networks (VANETs). The automotive industry is supporting the notion of pervasive connectivity by agreeing to equip vehicles with devices required for vehicular ad hoc networking. Equipped with these devices, mobile nodes in VANETs are capable of hosting many types of applications as services for other nodes in the network. These applications or services are classified as safety-critical (failure or unavailability of which may lead to a life threat) and non-safety-critical (failure of which do not lead to a life threat). Safety-critical and non-safety-critical applications need to be supported concurrently within VANETs. This research covers non-safety-critical applications since the research community has overlooked this class of applications. More specifically, this research focuses on VANETs services that are location-dependent. Due to high speed mobility, VANETs are prone to intermittent network connectivity. It is therefore envisioned that location-dependence and intermittent network connectivity are the two major challenges for VANETs to host and operate non-safety-critical VANETs services. The challenges are further exacerbated when the area where the services are to be deployed is unplanned i.e. lacks communication infrastructure and planning. Unplanned areas show irregular vehicular traffic on the road. Either network traffic flows produced by irregular vehicular traffic may lead to VANETs communication channel congestion, or it may leave the communication channel under-utilized. In both cases, this leads to communication bottlenecks within VANETs. This dissertation investigates the shortcomings of location-dependence, intermittent network connectivity and irregular network traffic flows and addresses them by exploiting location-dependent service migration over an integrated network in an efficient and cost-effective manner

QoS Routing in Wireless Mesh Networks

Wireless Mesh Networking is envisioned as an economically viable paradigm and a promising technology in providing wireless broadband services. The wireless mesh backbone consists of fixed mesh routers that interconnect different mesh clients to themselves and to the wireline backbone network. In order to approach the wireline servicing level and provide same or near QoS guarantees to different traffic flows, the wireless mesh backbone should be quality-of-service (QoS) aware. A key factor in designing protocols for a wireless mesh network (WMN) is to exploit its distinct characteristics, mainly immobility of mesh routers and less-constrained power consumption. In this work, we study the effect of varying the transmission power to achieve the required signal-to-interference noise ratio for each link and, at the same time, to maximize the number of simultaneously active links. We propose a QoS-aware routing framework by using transmission power control. The framework addresses both the link scheduling and QoS routing problems with a cross-layer design taking into consideration the spatial reuse of the network bandwidth. We formulate an optimization problem to find the optimal link schedule and use it as a fitness function in a genetic algorithm to find candidate routes. Using computer simulations, we show that by optimal power allocation the QoS constraints for the different traffic flows are met with more efficient bandwidth utilization than the minimum power allocations