An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa

Topology-aware transmission scheduling for distributed highway traffic monitoring wireless sensor networks

Wireless sensor networks have been deployed along highways for traffic monitoring. The thesis studies a set of transmission scheduling methods for optimizing network throughput, message transfer delay, and energy efficiency. Today\u27s traffic monitoring systems are centrally managed. Several studies have envisioned the advantages of distributed traffic management techniques. The thesis is based on previously proposed hierarchical sensor network architecture, for which the routing and transmission scheduling methods are derived. Wireless sensor networks have a lifetime limited by battery energy of the sensors. The thesis proposes to assign schedules for nodes to transmit and receive packets and turning off their radios during other times to save energy. The schedules are assigned to minimize the end-to-end packet delivery latency and maximize the network throughput. Conflict-free transmission slots are assigned to sensors along road segments leading to a common intersection based on locally discovered topology. The slot assignment adopts a heuristic that rotates among segments, assigns closest possible slots to neighboring nodes in a pipelined fashion, and exploits radio capture effects when possible. Based on the single-intersection approach, centralized and distributed multi-intersection scheduling methods are proposed to resolve conflicts among nodes belonging to different intersections. The centralized approach designates a controller as the leader to collect topology information of a set of contiguous intersections and assign schedules using the same single-intersection algorithm. The distributed approach has each intersection determine its own schedule independently and then exchange the topology information and schedules with its adjacent intersections to resolve conflicts locally. Based on simulation studies in ns-2, the centralized approach achieves better performance, while the distributed approach tries to approach the centralized performance at much lower communication costs. A communication cost analysis is performed to assess the trade-off between the centralized and distributed approaches

On Enabling Concurrent Communications in Wireless Networks

Today innumerable devices use the wireless spectrum for communication, including cell-phones, WiFi devices, military radios, public safety radios, satellite phones etc. This crowding is limiting the experience of each device either through interference or by waiting fortheir turn to communicate. So, how do we allow a limited spectral resource to reliably scale to many more devices? This is possible through concurrent communication where multiple links share the spectrum and communicate simultaneously using multi-antenna techniques. One promising technique is Interference Alignment (IA), that has been shown to be Degrees-of-Freedom optimal under some conditions. Still, IA requires accurate channel knowledge to be effective and its ability to achieve high throughput under time varying wireless conditions is yet unproven. We make progress towards understanding these limitations and provide viable solutions.We study an IA system under different models of the time varying channel and derive expressions for the achieved rate over time and the system throughput. Using these, we can arrive at the optimal duration of the data phase that maximizes throughput. We proposetwo strategies that help to counter the effects of a time varying channel. First, data aided receiver beam-tracking along with link adaptation provides a sizable improvement in the received signal to interference and noise ratio. Second, updating the transmit beams during data transmission using short feedback pilots improves alignment at the receivers. In faster varying channels, we get a more stable achieved rate whereas in slower varying channels, we see additional throughput gains. The conclusion from this work is that an IA system must be trained more frequently than the channel coherence time to ensure high throughput and beam adaptation during the data phase gives significant robustness to the system.Lastly, we present an IA based medium access control (MAC) protocol that outperforms traditional protocols. Our concurrent carrier sense multiple access (CSMA) protocol based on beam-nulling is compatible with CSMA and increases the sum throughput by 2 to 3x.We also show that IA outperforms optimal time division multiple access under time varying conditions. Hence a well-designed IA system can enable reliable concurrent communications in a wireless network

TD-SCDMA Relay Networks

PhDWhen this research was started, TD-SCDMA (Time Division Synchronous Code Division Multiple Access) was still in the research/ development phase, but now, at the time of writing this thesis, it is in commercial use in 10 large cities in China including Beijing and Shang Hai. In all of these cities HSDPA is enabled. The roll-out of the commercial deployment is progressing fast with installations in another 28 cities being underway now. However, during the pre-commercial TD-SCDM trail in China, which started from year 2006, some interference problems have been noticed especially in the network planning and initialization phases. Interference is always an issue in any network and the goal of the work reported in this thesis is to improve network coverage and capacity in the presence of interference. Based on an analysis of TD-SCDMA issues and how network interference arises, this thesis proposes two enhancements to the network in addition to the standard N-frequency technique. These are (i) the introduction of the concentric circle cell concept and (ii) the addition of a relay network that makes use of other users at the cell boundary. This overall approach not only optimizes the resilience to interference but increases the network coverage without adding more Node Bs. Based on the cell planning parameters from the research, TD-SCDMA HSDPA services in dense urban area and non-HSDPA services in rural areas were simulated to investigate the network performance impact after introducing the relay network into a TD-SCDMA network. The results for HSDPA applications show significant improvement in the TDSCDMA relay network both for network capacity and network interference aspects compared to standard TD-SCDMA networks. The results for non- HSDPA service show that although the network capacity has not changed after adding in the relay network (due to the code limitation in TD-SCDMA), the TD-SCDMA relay network has better interference performance and greater coverage

Multipath routing and QoS provisioning in mobile ad hoc networks

PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can communicate with each other using multihop wireless links without utilizing any fixed based-station infrastructure and centralized management. Each mobile node in the network acts as both a host generating flows or being destination of flows and a router forwarding flows directed to other nodes. Future applications of MANETs are expected to be based on all-IP architecture and be capable of carrying multitude real-time multimedia applications such as voice and video as well as data. It is very necessary for MANETs to have an efficient routing and quality of service (QoS) mechanism to support diverse applications. This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol (NDMR) with low broadcast redundancy. Multipath routing allows the establishment of multiple paths between a single source and single destination node. It is also beneficial to avoid traffic congestion and frequent link breaks in communication because of the mobility of nodes. The important components of the protocol, such as path accumulation, decreasing routing overhead and selecting node-disjoint paths, are explained. Because the new protocol significantly reduces the total number of Route Request packets, this results in an increased delivery ratio, smaller end-to-end delays for data packets, lower control overhead and fewer collisions of packets. Although NDMR provides node-disjoint multipath routing with low route overhead in MANETs, it is only a best-effort routing approach, which is not enough to support QoS. DiffServ is a standard approach for a more scalable way to achieve QoS in any IP network and could potentially be used to provide QoS in MANETs because it minimises the need for signalling. However, one of the biggest drawbacks of DiffServ is that the QoS provisioning is separate from the routing process. This thesis presents a Multipath QoS Routing protocol for iv supporting DiffServ (MQRD), which combines the advantages of NDMR and DiffServ. The protocol can classify network traffic into different priority levels and apply priority scheduling and queuing management mechanisms to obtain QoS guarantees

Performance of voice and data transmission using the IEEE 802.11 MAC Protocol

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 99-100).This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.The IEEE 802.11 wireless LAN standard attempts to provide high throughput and reliable data delivery for stations transmitting over a lossy, wireless medium. To efficiently allocate resources for bursty sources, the 802.11 Medium Access Control (MAC) sublayer uses a type of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol called the Distributed Coordination Function (DCF). The MAC protocol also includes an optional polling scheme called the Point Coordination Function (PCF) to deliver near-isochronous service to stations. This thesis analyzes the performance of these two medium access mechanisms under real-time voice and asynchronous data transmissions. Using analytical and simulative methods, the efficiency and capacity of the 802.11 protocol is determined for each type of traffic individually, as well as for a traffic mix of the two types. It is shown that the upper bound of data efficiency for DCF is 65.43% percent when transmitting maximum-sized IP packets at 11 Mbps. Furthermore, due to the difference in packet size of the two traffic types, for each additional GSM voice call (approximately 11 kbps including voice activity) to be supported using DCF, the non-real-time traffic load must decrease by approximately 250 kbps. Voice receives very little real-time Quality of Service (QoS) when using DCF to contend with constantly sending data stations. In order for 802.11 to provide real-time QoS for voice packets despite all levels of asynchronous traffic data load, the PCF mechanism can be used. By only using PCF for voice traffic, voice packets will always take priority over asynchronous data packets and receive the required real-time QoS.by Jessica M. Yeh.M.Eng

Performance modelling and enhancement of wireless communication protocols

In recent years, Wireless Local Area Networks(WLANs) play a key role in the data communications and networking areas, having witnessed significant research and development. WLANs are extremely popular being almost everywhere including business,office and home deployments.In order to deal with the modem Wireless connectivity needs,the Institute of Electrical and Electronics Engineers(IEEE) has developed the 802.11 standard family utilizing mainly radio transmission techniques, whereas the Infrared Data Association (IrDA) addressed the requirement for multipoint connectivity with the development of the Advanced Infrared(Alr) protocol stack. This work studies the collision avoidance procedures of the IEEE 802.11 Distributed Coordination Function (DCF) protocol and suggests certain protocol enhancements aiming at maximising performance. A new, elegant and accurate analysis based on Markov chain modelling is developed for the idealistic assumption of unlimited packet retransmissions as well as for the case of finite packet retry limits. Simple equations are derived for the through put efficiency, the average packet delay, the probability of a packet being discarded when it reaches the maximum retransmission limit, the average time to drop such a packet and the packet inter-arrival time for both basic access and RTS/CTS medium access schemes.The accuracy of the mathematical model is validated by comparing analytical with OPNET simulation results. An extensive and detailed study is carried out on the influence of performance of physical layer, data rate, packet payload size and several backoff parameters for both medium access mechanisms. The previous mathematical model is extended to take into account transmission errors that can occur either independently with fixed Bit Error Rate(BER) or in bursts. The dependency of the protocol performance on BER and other factors related to independent and burst transmission errors is explored. Furthermore, a simple-implement appropriate tuning of the back off algorithm for maximizing IEEE 802-11 protocol performance is proposed depending on the specific communication requirements. The effectiveness of the RTS/CTS scheme in reducing collision duration at high data rates is studied and an all-purpose expression for the optimal use of the RTS/CTS reservation scheme is derived. Moreover, an easy-to-implement backoff algorithm that significantly enhances performance is introduced and an alternative derivation is developed based on elementary conditional probability arguments rather than bi-dimensional Markov chains. Finally, an additional performance improvement scheme is proposed by employing packet bursting in order to reduce overhead costs such as contention time and RTS/CTSex changes. Fairness is explored in short-time and long-time scales for both the legacy DCF and packet bursting cases. AIr protocol employs the RTS/CTS medium reservation scheme to cope with hidden stations and CSMA/CA techniques with linear contention window (CW) adjustment for medium access. A 1-dimensional Markov chain model is constructed instead of the bi-dimensional model in order to obtain simple mathematical equations of the average packet delay.This new approach greatly simplifies previous analyses and can be applied to any CSMA/CA protocol.The derived mathematical model is validated by comparing analytical with simulation results and an extensive Alr packet delay evaluation is carried out by taking into account all the factors and parameters that affect protocol performance. Finally, suitable values for both backoff and protocol parameters are proposed that reduce average packet delay and, thus, maximize performance

Design and Analysis of Medium Access Control Protocols for Broadband Wireless Networks

The next-generation wireless networks are expected to integrate diverse network architectures and various wireless access technologies to provide a robust solution for ubiquitous broadband wireless access, such as wireless local area networks (WLANs), Ultra-Wideband (UWB), and millimeter-wave (mmWave) based wireless personal area networks (WPANs), etc. To enhance the spectral efficiency and link reliability, smart antenna systems have been proposed as a promising candidate for future broadband access networks. To effectively exploit the increased capabilities of the emerging wireless networks, the different network characteristics and the underlying physical layer features need to be considered in the medium access control (MAC) design, which plays a critical role in providing efficient and fair resource sharing among multiple users. In this thesis, we comprehensively investigate the MAC design in both single- and multi-hop broadband wireless networks, with and without infrastructure support. We first develop mathematical models to identify the performance bottlenecks and constraints in the design and operation of existing MAC. We then use a cross-layer approach to mitigate the identified bottleneck problems. Finally, by evaluating the performance of the proposed protocols with analytical models and extensive simulations, we determine the optimal protocol parameters to maximize the network performance. In specific, a generic analytical framework is developed for capacity study of an IEEE 802.11 WLAN in support of non-persistent asymmetric traffic flows. The analysis can be applied for effective admission control to guarantee the quality of service (QoS) performance of multimedia applications. As the access point (AP) becomes the bottleneck in an infrastructure based WLAN, we explore the multiple-input multiple-output (MIMO) capability in the future IEEE 802.11n WLANs and propose a MIMO-aware multi-user (MU) MAC. By exploiting the multi-user degree of freedom in a MIMO system to allow the AP to communicate with multiple users in the downlink simultaneously, the proposed MU MAC can minimize the AP-bottleneck effect and significantly improve the network capacity. Other enhanced MAC mechanisms, e.g., frame aggregation and bidirectional transmissions, are also studied. Furthermore, different from a narrowband system where simultaneous transmissions by nearby neighbors collide with each other, wideband system can support multiple concurrent transmissions if the multi-user interference can be properly managed. Taking advantage of the salient features of UWB and mmWave communications, we propose an exclusive region (ER) based MAC protocol to exploit the spatial multiplexing gain of centralized UWB and mmWave based wireless networks. Moreover, instead of studying the asymptotic capacity bounds of arbitrary networks which may be too loose to be useful in realistic networks, we derive the expected capacity or transport capacity of UWB and mmWave based networks with random topology. The analysis reveals the main factors affecting the network (transport) capacity, and how to determine the best protocol parameters to maximize the network capacity. In addition, due to limited transmission range, multi-hop relay is necessary to extend the communication coverage of UWB networks. A simple, scalable, and distributed UWB MAC protocol is crucial for efficiently utilizing the large bandwidth of UWB channels and enabling numerous new applications cost-effectively. To address this issue, we further design a distributed asynchronous ER based MAC for multi-hop UWB networks and derive the optimal ER size towards the maximum network throughput. The proposed MAC can significantly improve both network throughput and fairness performance, while the throughput and fairness are usually treated as a tradeoff in other MAC protocols