Manhattan Grid Research Articles

Path length prediction in MANET under AODV routing: Comparative analysis of ARIMA and MLP model

Mobile Ad-hoc network (MANET) is infra-structure less collection of mobile nodes which can communicate with each other through single hop or multi-hop technique. The hop count also known as path length plays a crucial role in packet delivery, routing load, delay, etc. The path length between source destination pair nodes depends upon factors such as the mobility patterns of nodes, routing algorithm, transmission range, etc. In this article, we have tried to predict the path length between a source destination pair in MANET using Autoregressive Integrated Moving Average (ARIMA) and multilayer perceptron (MLP) models. The path length data are collected from MANETs using three different mobility models namely (i) Manhattan Grid Mobility Model (MHG), (ii) Random Way Point mobility model (RWP) and (iii) Reference Point Group Mobility Model (RPGM). This paper evaluates the predictive accuracy in forecasting the path length between source and destination nodes for Ad hoc On-Demand Distance Vector AODV routing in MANET using ARIMA model and MLP. It is found that neural networks can be effectively used in forecasting path length between mobile nodes better than statistical model and the MLP based neural network models are found to be better forecaster than ARIMA model.

A rate control video dissemination solution for extremely dynamic vehicular ad hoc networks

Video dissemination to a group of vehicles is one of the many fundamental services envisioned for Vehicular Ad hoc Networks, especially as a building block for entertainment applications. For this purpose, in this paper we describe VoV, a video dissemination protocol that operates under extremely dynamic road traffic conditions. Contrary to most existing approaches that focus exclusively on always-connected networks and tackle the broadcast storm problem inherent to them, VoV is designed to operate under any kind of road traffic condition. We propose a new geographic-based broadcast suppression mechanism that gives a higher priority to rebroadcast to vehicles inside especial forwarding zones. Furthermore, vehicles store and carry received messages in a local buffer in order to forward them to vehicles that were not covered by the first dissemination process, probably as a result of collisions or intermittent disconnections. Finally, VoV employs a rate control mechanism that sets the pace at which messages must be transmitted according to the perceived network data traffic, thus avoiding channel overloading. Therefore, VoV adapts not only to the perceived road traffic condition, but also to the perceived channel quality. When compared to two related and well-accepted solutions–ABSM and AID–under Manhattan grid and real city scenarios, we show that, overall, our proposal is more efficient in terms of message delivery, delay and overhead.

Power Management of Ad Hoc Routing Protocols Using Mobility Impact and Magnetic Resonance

The performance of an ad hoc routing protocol is highly dependent on the mobility model used in the ad hoc networks. Most of previous work used only Random Waypoint mobility model, which is unrealistic in many situations. The mobile nodes are often power constrained so that energy conservation is also an important issue on evaluating protocols performance. This issue can be sort out in this paper with the help of two concepts: energy conservation based on different mobility models and concept of wirelessly recharges the networks node. Most of them focused on metrics such as packet delivery ratio, delay, and route optimality. In this paper, three on demand routing protocols AODV, DSR and TORA would be evaluate at power management metrics. These protocols are simulated and compared under three different mobility models: Random Waypoint, RPGM, and Manhattan Grid and various scenarios.

IJARCCE - Computer and Communication Engineering

This paper evaluates the performance of two different mobile ad-hoc networks (MANET) routing protocols based upon one of the Mobility Model: Manhattan Grid (MG) with varying Speed of the mobile nodes in two different traffic Patterns. We have considered CBR and an Exponential Traffic Pattern (which is based on Exponential distribution). Simulations have been carried out by using Network Simulator Version 2.35 (NS-2) and its associated tools for analysis of results. Comparative analysis of simulation results includes the value of Packet Delivery Ratio (PDR), Throughput and Normalized Routing Load (NRL). It is found that the Exponential Traffic pattern gives better results as comparative to CBR Traffic pattern. A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links, to form an arbitrary topology. The nodes are free to move randomly. Thus the network's wireless topology may be unpredictable and may change rapidly. Each node in the MANET is equipped with a wireless transmitter and receiver, with the aid of which it communicates with the other nodes in its wireless vicinity. The nodes which are not in wireless vicinity, communicate with each other hop by hop following a set of rules (routing protocol) for the hopping sequence to be followed. Routing protocols will need to perform four important functions of determination of network topology,

The Effect of Mobility Models and Traffic Patterns on the Performance of Routing Protocols in MANETs

Mobile ad-hoc networks (MANETs) are self-organizing networks which can form a communication network without any fixed infrastructure. Constant bit rate (CBR) traffic pattern is very well known traffic model for MANETs which generates data packets at a constant rate. Transmission Control Protocol (TCP) provides reliability to data transferring in all end-to-end data stream services on the MANETs. There are several TCP traffic patterns such as TCP Reno, TCP New Reno, TCP Vegas, and TCP Selective Acknowledgment (Sack). The traffic pattern plays an important role in so far as the performance of a routing protocol is concerned. In this paper, we study the effect of impact of mobility models and traffic patterns on the behavior of Reactive (AODV) and Proactive (DSDV, OLSR) routing protocols used in MANETs considering both CBR and TCP traffic patterns with different mobility models namely, Reference Point Group Mobility (RPGM) and Manhattan Grid (MG). The performance metrics used to evaluate the efficiency of the considered protocols are packet delivery ratio, average throughput and End-to-End Delay. The experimental results conducted using NS2 simulator show that the relative ranking of routing protocols may vary depending on both mobility models and traffic patterns.

A COMPREHENSIVE REVIEW ON PERFORMANCE OF AODV AND DSDV PROTOCOL USING MANHATTAN GRID MOBILITY MODEL

Wireless networks have become an epitome of revolution in the communication industry as these have enabled the devices to communicate and access information independent of their location. These networks can be classified into two categories: Infrastructure based and Infrastructure less. Mobile ad hoc networks (MANET) fall under infrastructureless category in which nodes are able to move thereby making the topology of the network highly dynamic. Due to the dynamically changing topology, efficient routing mechanisms needed to be developed, which led to the foundations of various mobile ad hoc routing protocols. There are a number of mobile ad hoc routing protocols proposed to serve different purposes like security and transmission efficiency. These protocols are divided into two categories: Table based and Demand based. Through this work, table based traditional routing protocol DSDV and demand based routing protocol AODV have been assessed through simulation using Manhattan Grid mobility model. Comprehensive analysis was carried out to analyze which protocol performs better in the assumed scenarios. The performance metrics evaluated for the two protocols are Throughput, Average End to End delay, Routing Overhead and Packet Delivery Ratio.

DAWN: A density adaptive routing for deadline-based data collection in vehicular delay tolerant networks

Vehicular Delay Tolerant Networks (DTN) use moving vehicles to sample and relay sensory data for urban areas, making it a promising low-cost solution for the urban sensing and infotainment applications. However, routing in the DTN in real vehicle fleet is a great challenge due to uneven and fluctuant node density caused by vehicle mobility patterns. Moreover, the high vehicle density in urban areas makes the wireless channel capacity an impactful factor to network performance. In this paper, we propose a local capacity constrained density adaptive routing algorithm for large scale vehicular DTN in urban areas which targets to increase the packet delivery ratio within deadline, namely Density Adaptive routing With Node deadline awareness (DAWN). DAWN enables the mobile nodes awareness of their neighbor density, to which the nodes' transmission manners are adapted so as to better utilize the limited capacity and increase the data delivery probability within delay constraint based only on local information. Through simulations on Manhattan Grid Mobility Model and the real GPS traces of 4960 taxi cabs for 30 days in the Beijing city, DAWN is demonstrated to outperform other classical DTN routing schemes in performance of delivery ratio and coverage within delay constraint. These simulations suggest that DAWN is practically useful for the vehicular DTN in urban areas.

Evaluation of Vehicular Communication Networks in a Car Sharing System

Yet even with an increase in car sharing programs worldwide, there has been little research on the application of Vehicular Ad hoc Network (VANET) in car sharing systems. This study employed three parameters of communication networks to evaluate VANET performance in car sharing systems. The integration of vehicle mobility generation and vehicular communication networks simulation is crucial to this research. A variety of scenarios on a partial Manhattan grid network were simulated to assess the influence of different parameters in the communication network. Through the performance analysis, it evaluates the feasibility of VANET in car sharing systems and gives some suggestions for future field deployment.

뉴욕시 공립학교에 나타난 배치 특성에 관한 연구 - 맨하튼 가로체계와 외부공간의 관계를 중심으로 -

The purpose of this study is to analyze patterns of public school building layout types, open space and relationship with communities in the Manhattan grid plan. The study illustrates how building layout patterns of school facilities are influenced by societal demands in the urban grid environment. During the nineteenth century, the Island of Manhattan was transformed into a physical representation of the Cartesian coordinate system via the development of the grid street plan. In order to take advantage of streets as urban space, it is quite important to understand characteristics of communities and open space relationships between buildings and streets. Moreover, the strategic planning of schools' outdoor space vitalizes public streets as a critical community anchor. This research reviews 118 Manhattan public schools and categorizes them by (1) building layout type, (2) site type, (3) circulation and public open space, which are the biggest factors that determine the layout patterns of the public schools in Manhattan. As a result of analysis, the layout patterns are classified into seven types : "ㅡ", "L", "ㄷ", "ㅁ", "H", "T" and "other" type. Of these, "ㅡ" type and "L" type occur most frequently, because these configurations most flexibly fit into the limited grid-locked blocks, the various types of site & topography, and adapt most dynamically to the open spaces created by using avenues and streets. The ultimate objective of this study is to provide a case study for future efforts to plan open spaces for campuses that effectively utilize the streets in proximity.

Performance Evaluation and Statistical Analysis of MANET routing Protocols for RPGM and MG

Mobile Ad Hoc Network is a collection of mobile nodes forming temporary network. In MANET routing protocols are classified as Proactive, Reactive and Hybrid. The work presented here evaluates performance of three Reactive routing protocols such as AODV, DSR and TORA under six performance metrics such as packet delivery ratio, routing overhead, packet loss, normalized routing load, throughput and end to end delay The nodes follow two realistic mobility models such as Reference Point Group Mobility model (RPGM) and Manhattan Grid (MG) model. This work also presents the statistical analysis of AODV, DSR and TORA in Manhattan Grid (MG) model and Reference Point Group Mobility (RPGM) model in low load with low speed, average load with average speed, high load with high speed and very high load with high speed. Contribution in this work is beneficial in deciding which protocol to choose for better QoS.

The Impact of Mobility Patterns on MANET Vulnerability to DDoS Attacks

In this article, we investigate the influence of mobility models, node speed and attack duration on the MANET vulnerability to bandwidth attacks, which are performed as distributed denial of service (DDoS) attacks. We propose the attack model and present a comprehensive simulation study, carried out by the network simulator ns-2 and its associated tools for mobile scenario generation, network animation and trace files analysis. The following mobility models have been compared: Random Waypoint, Manhattan Grid, Gauss-Markov, and Reference Point Group Mobility. Simulation results indicate that MANET inherent features, such as node mobility pattern and speed, strongly affect the degree of vulnerability to DDoS attacks. Possible countermeasures against this type of attack have also been discussed. Ill. 6, bibl. 17, tabl. 2 (in English; abstracts in English and Lithuanian). DOI: http://dx.doi.org/10.5755/j01.eee.119.3.1358

Classification and Evaluation of Mobility Metrics for Mobility Model Movement Patterns in Mobile Ad-Hoc Networks

A mobile ad hoc network is collection of self configuring and adaption of wireless link between communicating devices (mobile devices) to form an arbitrary topology and multihop wireless connectivity without the use of existing infrastructure. It requires efficient dynamic routing protocol to determine the routes subsequent to a set of rules that enables two or more devices to communicate with each others. This paper basically classifies and evaluates the mobility metrics into two categories- direct mobility metrics and derived mobility metrics. These two mobility metrics has been used to measure different mobility models, this paper considers some of mobility models i.e Random Waypoint Model, Reference Point Group Mobility Model, Random Direction Mobility Model, Random Walk Mobility Model, Probabilistic Random Walk, Gauss Markov, Column Mobility Model, Nomadic Community Mobility Model and Manhattan Grid Model.

The Temporal Effect of Mobility on Path Length in MANET

Ad hoc network consists of a set of identical nodes that move freely and independently and communicate among themselves via wireless links. The most interesting feature of this network is that they do not require any existing infrastructure of central administration and hence is very suitable for temporary communication links in an emergency situation. This flexibility, however, is achieved at a price of communication uncertainty induced due to frequent topology changes. In this article, we have tried to identify the system dynamics using the proven concepts of time series modeling. Here, we have analyzed variation of path length between a particular source destination pair nodes over a fixed area for different mobility patterns under different routing algorithm. We have considered four different mobility models—(i) Gauss-Markov mobility model, (ii) Manhattan Grid mobility model and (iii) Random Way Point mobility model and (iv) Reference Point Group mobility model. The routing protocols under which, we carried out our experiments are (i) Ad hoc On demand Distance Vector routing (AODV), (ii) Destination Sequenced Distance Vector routing (DSDV) and (iii) Dynamic Source Routing (DSR). The path length between two particular nodes behaves as a random variable for all mobility models for all routing algorithms. The pattern of path length for every combination of mobility model and for every routing protocol can be well modeled as an autoregressive model of order p i.e. AR(p). The order p is estimated and it is found that most of them are of order unity only. We also calculate the average path length for all mobility models and for all routing algorithms.

Resource Sharing Optimization for Device-to-Device Communication Underlaying Cellular Networks

We consider Device-to-Device (D2D) communication underlaying cellular networks to improve local services. The system aims to optimize the throughput over the shared resources while fulfilling prioritized cellular service constraints. Optimum resource allocation and power control between the cellular and D2D connections that share the same resources are analyzed for different resource sharing modes. Optimality is discussed under practical constraints such as minimum and maximum spectral efficiency restrictions, and maximum transmit power or energy limitation. It is found that in most of the considered cases, optimum power control and resource allocation for the considered resource sharing modes can either be solved in closed form or searched from a finite set. The performance of the D2D underlay system is evaluated in both a single-cell scenario, and a Manhattan grid environment with multiple WINNER II A1 office buildings. The results show that by proper resource management, D2D communication can effectively improve the total throughput without generating harmful interference to cellular networks.

Mythologies of the Grid in the Empire City, 1811–2011*

In this article, I examine the performative dimensions of historical narration as a form of modern mythmaking by reconsidering conventional narratives on the “origins” of Manhattan's grid street plan of 1811. The historical mythology of the grid espoused in canonical readings of the Plan of 1811 relies extensively on a rearticulation of the official explanation that the grid's designers provided in a foundational text known as the “Commissioners’ Remarks”. I argue that such accounts result in an extraordinarily narrow and formulaic interpretation of the utilitarian motives and intentions behind the city's grid plan, one that reinforces a form of “morphological essentialism”. To support this argument, I shift the focus of attention beyond the “Commissioners’ Remarks” in order to complicate readings of the intentionality that gave rise to the 1811 street plan. I conclude by suggesting that the mythic search for the “origins” of the grid in the realm of founding intentions can most effectively be challenged by drawing attention to the proliferation of countermyths of gridded space.

Temporal Modeling of Link Characteristic in Mobile Ad hoc Network

Ad hoc network consists of a set of identical nodes that move freely and independently and communicate among themselves via wireless links. The most interesting feature of this network is that they do not require any existing infrastructure of central administration and hence is very suitable for temporary communication links in an emergency situation. This flexibility, however, is achieved at a price of communication uncertainty induced due to frequent topology changes. In this article, we have tried to identify the system dynamics using the proven concepts of time series modeling. Here, we have analyzed variation of link utilization between any two particular nodes over a fixed area for differentmobility patterns under different routing algorithm. We have considered four different mobility models – (i) Gauss-Markov mobility model, (ii) Manhattan Grid Mobility model and (iii) Random Way Point mobility model and (iv) Reference Point Group mobility model. The routing protocols under which, we carried out our experiments are (i) Ad hoc On demand Distance Vector routing (AODV), (ii) Destination Sequenced Distance Vector routing (DSDV) and (iii) Dynamic Source Routing (DSR). The value of link load between two particular nodes behaves as a random variable for any mobility pattern under a routing algorithm. The pattern of link load for every combination of mobility model and for every routing protocol can be well modeled as an autoregressive model of order p i.e. AR(p). The order of p is estimated and it is found that most of them are of order 1 only.

Distributed Graph Coloring for Self‐Organization in LTE Networks

Primary Component Carrier Selection and Physical Cell ID Assignment are two important self‐configuration problems pertinent to LTE‐Advanced. In this work, we investigate the possibility to solve these problems in a distributive manner using a graph coloring approach. Algorithms based on real‐valued interference pricing of conflicts converge rapidly to a local optimum, whereas algorithms with binary interference pricing have a chance to find a global optimum. We apply both local search algorithms and complete algorithms such as Asynchronous Weak‐Commitment Search. For system level performance evaluation, a picocellular scenario is considered, with indoor base stations in office houses placed in a Manhattan grid. We investigate a growing network, where neighbor cell lists are generated using practical measurement and reporting models. Distributed selection of conflict‐free primary component carriers is shown to converge with 5 or more component carriers, while distributed assignment of confusion‐free physical cell IDs is shown to converge with less than 15 IDs. The results reveal that the use of binary pricing of interference with an attempt to find a global optimum outperforms real‐valued pricing.

M-PRMA protocol for vehicular multimedia communication

Medium access control (MAC) protocols, responsible for sharing the channel among users, are receiving more attention especially in vehicular networks due to the highly dynamic nature of the environment in which they operate. Typically MAC protocols were designed for one traffic class such as voice, video or data as all of them have different characteristics. In this paper, we introduce a modified version of packet reservation multiple access namely M-PRMA MAC protocol for vehicular networks responsible for multimedia communication while maintaining quality of service (QoS) for each traffic class. We evaluate the performance of the MAC protocol in terms of packet dropping probability, average delay and throughput under a 3 × 3 km Manhattan grid representing a typical modern city.

Analysing a Multi-hop UMTS over Multiple Frequency Schemes and an Urban Environment

In this paper we analyse the performance of a relay based UMTS system in an urban environment using multiple hops on multiple frequency bands. Measurement based path loss, fading and shadowing models are used in the Manhattan grid deployment scenario. Both uplink and downlink operations of the cellular system are considered at the same time. Two hop communication links over the uplink and downlink are operated at four non-overlapping spectrum bands in order to minimise interference. This results in several possible frequency schemes. Power solutions are derived analytically for the selected frequency schemes. The system performance is evaluated both by simulation and analysis and improvement by employing relays is shown.

Standard directed search strategies and their applications

Given a digraph that contains an intruder hiding on vertices or along edges, a directed searching problem is to find the minimum number of searchers required to capture the intruder. In this paper, we propose the standard directed search strategies, which can simplify arguments in proving search numbers, lower bounds, and relationships between search models. Using these strategies, we characterize k-directed-searchable graphs when k≤3. We also use standard directed search strategies to investigate the searching problems on oriented grids. We give tight lower and upper bounds for the directed search number of general oriented grids. Finally, we show how to compute the directed search number of a Manhattan grid.