Search

Your search keyword '"Random Way Point mobility model"' showing total 3 results
Start Over Descriptor "Random Way Point mobility model" Topic throughput optimization
3 results on '"Random Way Point mobility model"'

1. Obstacles constrained group mobility models in event-driven wireless networks with movable base stations.

Author

Cristaldi, S., Ferro, A., Giugno, R., Pigola, G., and Pulvirenti, A.

Subjects
CONSTRAINT satisfaction, WIRELESS communications, AD hoc computer networks, SIGNAL processing, ALGORITHMS, GRAPH theory
Abstract

Abstract: In this paper, we propose a protocol for dynamic reconfiguration of ad-hoc wireless networks with movable base stations in presence of obstacles. Hosts are assigned to base stations according to a probabilistic throughput function based on both the quality of the signal and the base station load. In order to optimize space coverage, base stations cluster hosts using a distributed clustering algorithm. Obstacles may interfere with transmission and obstruct base stations and hosts movement. To overcome this problem, we perform base stations repositioning making use of a motion planning algorithm on the visibility graph based on an extension of the bottleneck matching technique. We implemented the protocol on top of the NS2 simulator as an extension of the AODV. We tested it using both Random Way Point and Reference Point Group mobility models properly adapted to deal with obstacles. Experimental analysis shows that the protocol ensures the total space coverage together with a good throughput on the realistic model (Reference Point Group) outperforming both the standard AODV and DSR. [ABSTRACT FROM AUTHOR]

Published
2011
Full Text
View/download PDF

2. Distributed Algorithms for the Configuration and Management of Wireless Ad-Hoc Networks with Movable Base Stations constrained by Motion and Communication Obstacles

Author

Cristaldi, Salvatore

Subjects
Mobile Base Stations, Throughput Optimization, Random Way Point Mobility Model, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Communication and Movement Obstacles, Reference Point Group Mobility Model, Distributed Clustering, Dynamic Two Level Hierarchy AODV
Abstract

In this thesis, we propose a protocol for dynamic reconfiguration of ad-hoc wireless networks with movable base stations in presence of obstacles. Hosts are assigned to base stations according to a probabilistic throughput function based on both the quality of the signal and the base station load. In order to optimize space coverage, base stations cluster hosts using a distributed clustering algorithm. Obstacles may interfere with transmission and obstruct base stations and hosts movement. To overcome this problem, we perform base stations repositioning making use of a motion planning algorithm on the visibility graph based on an extension of the bottleneck matching technique. We implemented the protocol on top of the NS2 simulator as an extension of the AODV. We tested it using both Random Way Point and Reference Point Group mobility models properly adapted to deal with obstacles. Experimental analysis shows that the protocol ensures the total space coverage together with a good throughput on the realistic model (Reference Point Group) outperforming both the standard AODV and DSR. Results of this thesis have been published in the journal Ad-Hoc Net-works, Elsevier.

Published
2011

3. Obstacles constrained group mobility models in event-driven wireless networks with movable base stations

Author

Rosalba Giugno, Alfredo Pulvirenti, Alfredo Ferro, S. Cristaldi, and Giuseppe Pigola

Subjects
Mobility model, Computer Networks and Communications, Wireless network, business.industry, Computer science, Dynamic two level hierarchy AODV, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Reference Point Group mobility model, Random Way Point mobility model, Mobile base stations, Distributed clustering, Communication and movement obstacles, Throughput optimization, Throughput, Bottleneck, clustering algorithm, Base station, Hardware and Architecture, Ad hoc On-Demand Distance Vector Routing, Motion planning, business, Cluster analysis, Software, Computer network
Abstract

In this paper, we propose a protocol for dynamic reconfiguration of ad-hoc wireless networks with movable base stations in presence of obstacles. Hosts are assigned to base stations according to a probabilistic throughput function based on both the quality of the signal and the base station load. In order to optimize space coverage, base stations cluster hosts using a distributed clustering algorithm. Obstacles may interfere with transmission and obstruct base stations and hosts movement. To overcome this problem, we perform base stations repositioning making use of a motion planning algorithm on the visibility graph based on an extension of the bottleneck matching technique. We implemented the protocol on top of the NS2 simulator as an extension of the AODV. We tested it using both Random Way Point and Reference Point Group mobility models properly adapted to deal with obstacles. Experimental analysis shows that the protocol ensures the total space coverage together with a good throughput on the realistic model (Reference Point Group) outperforming both the standard AODV and DSR.

Published
2011

Catalog

Books, media, physical & digital resources
See catalog results