scholarly journals WIT: A Wireless Integrated Traffic Model

2008 ◽  
Vol 4 (3) ◽  
pp. 219-235 ◽  
Author(s):  
Arta Doci ◽  
Fatos Xhafa

Simulation is a common approach for designing ad hoc network applications, due to the slow deployment of these networks. The main building blocks of ad hoc network applications are the routing protocols, mobility, and traffic models. Several studies, which use synthetic models, show that mobility and traffic have a significant effect on protocol performance. Synthetic models do not realistically reflect the environment where the ad hoc networks will be deployed. In addition, mobility and traffic tools are designed independently of each other, however real trace data challenge that assumption. Indeed, recent protocol performance evaluation using real testbeds show that performance evaluations under real testbeds and simulations that use synthetic models differ significantly. In this paper we consider jointly both real mobility and traffic for protocol performance evaluation. The contributions of this work are as follows: (1) demonstrates that real mobility and traffic are interconnected; (2) announces the design and implementation of WIT –Wireless Integrated Traffic–, which includes the design of a real traffic generator; (3) shows that under real mobility and integrated traffic the performance metrics need to be re-thought, thus we propose availability as a new ad hoc network protocol performance metric; and, finally, (4) evaluates protocol performance under synthetic and real mobility models with integrated traffic. We believe that the results of our work constitute a step forward toward benchmarking of ad hoc network performance evaluations.

Nodes are important aspect of Mobile network. Mobile ad-hoc network means any network that is made at the time of need. Ad-hoc network has its own place in networking. Mobility in network makes it more demandable. Nodes are the device that takes part in network or makes network. Nodes behavior describes network configuration. Genuine node insures you proper working of network with best results as throughput or packet ratio. Presence of malicious nodes differs in comparison to genuine node. Malicious node degrades output of network. Performance metrics noted degradation in their quality when malicious node encounters in network. Malicious nodes in different sets of node density affect the network in different way


2021 ◽  
Author(s):  
ALTAF HUSSAIN

Abstract Mobile Ad-hoc NETwork (MANET) is a decentralized type of wireless network. The network is ad hoc because it does not rely on a pre-existing infrastructure, such as routers in wired networks or access points in managed wireless networks. One of the major issue and challenging area in MANET is the process of routing due to dynamic topologies and high mobility of mobile nodes. The efficiency and accuracy of a protocol depend on many parameters in these networks. In addition to other parameters node velocity and propagation models are among them. Calculating signal strength at the receiver is the responsibility of a propagation model while the mobility of nodes is responsible for the topology of the network. A huge amount of loss in performance is occurred due to the variation of signal strength at the receiver while increasing and decreasing the distance of nodes. In this paper, a novel approach is identified and portrayed of the said propagation models based on distance from each other. It has been analyzed to check distance based performance evaluation of Two Ray Ground and Free Space Radio Wave Propagation Models on the performance of Ad-hoc On-demand Distance Vector (AODV) Routing Protocol in MANET. The simulation has been carried out in (Network Simulator-2) NS-2 by using performance metrics that are Average Throughput (kpbs), Average Latency (milliseconds) and Average Packet Drop (packets). The results predicted that propagation models and mobility have a strong influence on the performance of AODV in considered distance based scenario.


Author(s):  
Twahirwa Evariste ◽  
Willie Kasakula ◽  
James Rwigema ◽  
Raja Datta

Vehicular Ad Hoc Network (VANET) is a subclass of Mobile Ad Hoc Network that mainly consists of moving and/or stationary vehicles, connected through wireless protocols such as IEEE 802.11p and wireless access in vehicular environments (WAVE). With the evolution of the Internet of Things (IoT), ordinary VANET has turned to the Internet of Vehicles (IoV), with additional social aspects, a novel extension themed SIoV has become common in urban areas. However vehicular wireless communication paradigms exhibit short radio communication. This problem has always been approached by supplementing moving vehicles with stationary Road Side Infrastructures, commonly known as roadside units (RSUs). The penetration of such RSUs on the global market is very low; furthermore, their procurement, deployment, and maintenance costs are prohibitively very high. All mentioned challenges have discouraged the widespread deployment of roadside infrastructure especially within large urban scenarios. With this research, we leverage on-street parked vehicles to allow them to exist as temporal gateways in the case study area. A novel modeling technique is introduced to enable a specific Percentage of parked vehicles to take up the role of roadside gateways for a certain percentage of their parking time. A mobile application is implemented that manages parking duration of the vehicle, based on the arrival, and departure time frames. Two more existing strategies were discussed (road-intersection RSUs deployment approach and Inter-vehicle scheme) to validate our proposed method through comparative studies. To evaluate the network performance evaluation, we compare two performance metrics, that is, Packets success delivery rate, and overall packets throughput under numerous vehicle densities. Using parked vehicles as temporal roadside gateways has demonstrated better results in comparison to intersection based RSUs deployment approach, and free vehicle to vehicle communication approach.


2013 ◽  
Vol 12 (22) ◽  
pp. 6595-6599
Author(s):  
M.H. Hsu ◽  
K.W. Su ◽  
C.J. Chang ◽  
C.Y. Chen ◽  
Chau-Yang Lai ◽  
...  

2008 ◽  
Vol 2008 ◽  
pp. 1-25 ◽  
Author(s):  
Michel Mandjes ◽  
Werner Scheinhardt

Fluid queues offer a natural framework for analyzing waiting times in a relay node of an ad hoc network. Because of the resource sharing policy applied, the input and output of these queues are coupled. More specifically, when there are users who wish to transmit data through a specific node, each of them obtains a share of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction is used to serve the queue; here is a free design parameter. Assume now that jobs arrive at the relay node according to a Poisson process, and that they bring along exponentially distributed amounts of data. The case has been addressed before; the present paper focuses on the intrinsically harder case , that is, policies that give more weight to serving the queue. Four performance metrics are considered: (i) the stationary workload of the queue, (ii) the queueing delay, that is, the delay of a “packet” (a fluid particle) that arrives at an arbitrary point in time, (iii) the flow transfer delay, (iv) the sojourn time, that is, the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. We explicitly compute the Laplace transforms of these random variables.


Sign in / Sign up

Export Citation Format

Share Document