Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks

Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via packet salvaging at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification

Adaptive Duty Cycling MAC Protocols Using Closed-Loop Control for Wireless Sensor Networks

The fundamental design goal of wireless sensor MAC protocols is to minimize unnecessary power consumption of the sensor nodes, because of its stringent resource constraints and ultra-power limitation. In existing MAC protocols in wireless sensor networks (WSNs), duty cycling, in which each node periodically cycles between the active and sleep states, has been introduced to reduce unnecessary energy consumption. Existing MAC schemes, however, use a fixed duty cycling regardless of multi-hop communication and traffic fluctuations. On the other hand, there is a tradeoff between energy efficiency and delay caused by duty cycling mechanism in multi-hop communication and existing MAC approaches only tend to improve energy efficiency with sacrificing data delivery delay. In this paper, we propose two different MAC schemes (ADS-MAC and ELA-MAC) using closed-loop control in order to achieve both energy savings and minimal delay in wireless sensor networks. The two proposed MAC schemes, which are synchronous and asynchronous approaches, respectively, utilize an adaptive timer and a successive preload frame with closed-loop control for adaptive duty cycling. As a result, the analysis and the simulation results show that our schemes outperform existing schemes in terms of energy efficiency and delivery delay

Location based transmission using a neighbour aware with optimized EIFS MAC for ad hoc networks

In a typical Ad Hoc network, participating nodes have scarce shared bandwidth and limited battery life resources, so resource optimization and enhancing the overall network performance are the primary aims to maintain functionality. This paper proposes a new cross layer Medium Access Control (MAC) algorithm called Location Based Transmission using a Neighbour Aware with optimized Extended Inter-Frame Spacing (EIFS) for Ad Hoc Networks MAC (LBT-NA with optimized-EIFS MAC) that aims to reduce the transmission power when communicating with the next hop receiver based on node’s location which is made available during node deployment. However, node mobility is not taken into account in the study of this paper. According to the algorithm the node dynamically adjusts its transmission power, if there is an active neighbour located beyond the communicating source and destination pair to avoid hidden nodes. The new protocol also defines an optimized EIFS when frame collision, frame error or frame capture takes place, in-order to maintain a fair channel access among the contending nodes. The proposed MAC also uses a modified range of random backoff values, based on the degree of contention unlike IEEE 802.11 series which uses a fixed random backoff value for fresh frames irrespective of the degree of contention. Simulation results indicate that in a random topology with a random source and destination, when the two sources are separated by a minimum distance of 200m, the performance gain of power controlled MAC over IEEE 802.11b ranges from 30% to 70% depending on the type of traffics in the network and the degree of fairness ranges from 62% to 99.99% for a location based MAC with minimum power transmission, whereas LBT-NA with optimized-EIFS MAC secures fairness index ranging from 75% to 99.99%. Communication with a node that is 20m away can save 40% of the battery life in comparison to the traditional transmission power MAC from 802.11b. The validation tests demonstrate that the proposed algorithm increases battery life and reduces the interference impact on shorter distance communication and increases the probability of parallel transmission. The proposed protocol also provides a scope for active nodes to transmit with a higher degree of probability, providing higher degree of overall network throughput in the environment and alleviate the starvation of hidden node by using Dynamic EIFS scheme

A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks

Flooding is an essential and critical service in computer networks that is used by many routing protocols to send packets from a source to all nodes in the network. As the packets are forwarded once by each receiving node, many copies of the same packet traverse the network which leads to high redundancy and unnecessary usage of the sparse capacity of the transmission medium. Gossip routing is a well-known approach to improve the flooding in wireless multi-hop networks. Each node has a forwarding probability p that is either statically per-configured or determined by information that is available at runtime, e.g, the node degree. When a packet is received, the node selects a random number r. If the number r is below p, the packet is forwarded and otherwise, in the most simple gossip routing protocol, dropped. With this approach the redundancy can be reduced while at the same time the reachability is preserved if the value of the parameter p (and others) is chosen with consideration of the network topology. This technical report gives an overview of the relevant publications in the research domain of gossip routing and gives an insight in the improvements that can be achieved. We discuss the simulation setups and results of gossip routing protocols as well as further improved flooding schemes. The three most important metrics in this application domain are elaborated: reachability, redundancy, and management overhead. The published studies used simulation environments for their research and thus the assumptions, models, and parameters of the simulations are discussed and the feasibility of an application for real world wireless networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the focus of this survey but publications about other network types and technologies are also included. As percolation theory, epidemiological models, and delay tolerant networks are often referred as foundation, inspiration, or application of gossip routing in wireless networks, a brief introduction to each research domain is included and the applicability of the particular models for the gossip routing is discussed

Radio Resource Management in LTE-Advanced Systems with Carrier Aggregation

In order to meet the ever-increasing demand for wireless broadband services from fast growing mobile users, the Long Term Evolution -Advanced (LTE-A) standard has been proposed to effectively improve the system capacity and the spectral efficiency for the fourth-generation (4G) wireless mobile communications. Many advanced techniques are incorporated in LTE-A systems to jointly ameliorate system performance, among which Carrier Aggregation (CA) is considered as one of the most promising improvements that has profound significance even in the upcoming 5G era. Component carriers (CCs) from various portions of the spectrum are logically concatenated to form a much larger virtual band, resulting in remarkable boosted system capacity and user data throughput. However, the unique features of CA have posed many emerging challenges as well as span-new opportunities on the Radio Resource Management (RRM) in the LTE-A systems. First, although multi-CC transmission can bring higher throughput, it may incur more intensive interference for each CC and more power consumption for users. Thus the performance gain of CA under different conditions needs fully evaluating. Besides, as CA offers flexible CC selection and cross-CC load balancing and scheduling, enhanced RRM strategies should be designed to further optimize the overall resource utilization. In addition, CA enables the frequency reuse on a CC resolution, adding another dimension to inter-cell interference management in heterogeneous networks (HetNets). New interference management mechanisms should be designed to take the advantage of CA. Last but not least, CA empowers the LTE-A systems to aggregate the licensed spectrum with the unlicensed spectrum, thus offering a capacity surge. Yet how to balance the traffic between licensed and unlicensed spectrum and how to achieve a harmony coexistence with other unlicensed systems are still open issues. To this end, the dissertation emphasizes on the new functionalities introduced by CA to optimize the RRM performance in LTE-A systems. The main objectives are four-fold: 1) to fully evaluate the benefits of CA from different perspectives under different conditions via both theoretical analysis and simulations; 2) to design cross-layer CC selection, packet scheduling and power control strategies to optimize the target performance; 3) to analytically model the interference of HetNets with CA and propose dynamic interference mitigation strategies in a CA scenario; and 4) to investigate the impact of LTE transmissions on other unlicensed systems and develop enhanced RRM mechanisms for harmony coexistence. To achieve these objectives, we first analyze the benefits of CA via investigating the user accommodation capabilities of the system in the downlink admission control process. The LTE-A users with CA capabilities and the legacy LTE users are considered. Analytical models are developed to derive the maximum number of users that can be admitted into the system given the user QoS requirements and traffic features. The results show that with only a slightly higher spectrum utilization, the system can admit as much as twice LTE-A users than LTE users when the user traffic is bursty. Second, we study the RRM in the single-tier LTE-A system and propose a cross-layer dynamic CC selection and power control strategy for uplink CA. Specifically, the uplink power offset effects caused by multi-CC transmission are considered. An estimation method for user bandwidth allocation is developed and a combinatorial optimization problem is formulated to improve the user throughput via maximizing the user power utilization. Third, we explore the interference management problem in multi-tier HetNets considering the CC-resolution frequency reuse. An analytical model is devised to capture the randomness behaviors of the femtocells exploiting the stochastic geometry theory. The interaction between the base stations of different tiers are formulated into a two-level Stackelberg game, and a backward induction method is exploited to obtain the Nash equilibrium. Last, we focus on the mechanism design for licensed and unlicensed spectrum aggregation. An LTE MAC protocol on unlicensed spectrum is developed considering the coexistence with the Wi-Fi systems. The protocol captures the asynchronous nature of Wi-Fi transmissions in time-slotted LTE frame structure and strike a tunable tradeoff between LTE and Wi-Fi performance. Analytical analysis is also presented to reveal the essential relation among different parameters of the two systems. In summary, the dissertation aims at fully evaluating the benefits of CA in different scenarios and making full use of the benefits to develop efficient and effective RRM strategies for better LTE-Advanced system performance

MANETs: Internet Connectivity and Transport Protocols

A Mobile Ad hoc Network (MANET) is a collection of mobile nodes connected together over a wireless medium, which self-organize into an autonomous multi-hop wireless network. This kind of networks allows people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking is not a new concept, having been around in various forms for over 20 years. However, in the past only tactical networks followed the ad hoc networking paradigm. Recently, the introduction of new technologies such as IEEE 802.11, are moved the application field of MANETs to a more commercial field. These evolutions have been generating a renewed and growing interest in the research and development of MANETs. It is widely recognized that a prerequisite for the commercial penetration of the ad hoc networking technologies is the integration with existing wired/wireless infrastructure-based networks to provide an easy and transparent access to the Internet and its services. However, most of the existing solutions for enabling the interconnection between MANETs and the Internet are based on complex and inefficient mechanisms, as Mobile-IP and IP tunnelling. This thesis describes an alternative approach to build multi-hop and heterogeneous proactive ad hoc networks, which can be used as flexible and low-cost extensions of traditional wired LANs. The proposed architecture provides transparent global Internet connectivity and address autocofiguration capabilities to mobile nodes without requiring configuration changes in the pre-existing wired LAN, and relying on basic layer-2 functionalities. This thesis also includes an experimental evaluation of the proposed architecture and a comparison between this architecture with a well-known alternative NAT-based solution. The experimental outcomes confirm that the proposed technique ensures higher per-connection throughputs than the NAT-based solution. This thesis also examines the problems encountered by TCP over multi-hop ad hoc networks. Research on efficient transport protocols for ad hoc networks is one of the most active topics in the MANET community. Such a great interest is basically motivated by numerous observations showing that, in general, TCP is not able to efficiently deal with the unstable and very dynamic environment provided by multi-hop ad hoc networks. This is because some assumptions, in TCP design, are clearly inspired by the characteristics of wired networks dominant at the time when it was conceived. More specifically, TCP implicitly assumes that packet loss is almost always due to congestion phenomena causing buffer overflows at intermediate routers. Furthermore, it also assumes that nodes are static (i.e., they do not change their position over time). Unfortunately, these assumptions do not hold in MANETs, since in this kind of networks packet losses due to interference and link-layer contentions are largely predominant, and nodes may be mobile. The typical approach to solve these problems is patching TCP to fix its inefficiencies while preserving compatibility with the original protocol. This thesis explores a different approach. Specifically, this thesis presents a new transport protocol (TPA) designed from scratch, and address TCP interoperability at a late design stage. In this way, TPA can include all desired features in a neat and coherent way. This thesis also includes an experimental, as well as, a simulative evaluation of TPA, and a comparison between TCP and TPA performance (in terms of throughput, number of unnecessary transmissions and fairness). The presented analysis considers several of possible configurations of the protocols parameters, different routing protocols, and various networking scenarios. In all the cases taken into consideration TPA significantly outperforms TCP

Improving the scalability of MAC protocols in wireless mesh network

Includes abstract.Includes bibliographical references (leaves 128-133).Efficient utilization of multi-channels is critical for the success of multi-channel MACprotocols. Unfortunately, current multi-channel MAC protocols are not efficient in the utilization of the multiple channels. The poor utilization of the available channels is also affected by the following: channel coordination, channel selection, and channel scheduling strategies, which do not lend themselves to scalability and the efficient use of the multiple channels. Good channel coordination and selection techniques are therefore required to improve the efficiency of the multi-channel MAC protocols. These techniques should be coupled with effective and scalable signalling techniques, which reduce substantial signalling overhead. A multi-channel Cyclical Scheduling Algorithm (CSA) is proposed to address these challenges