Study and Analysis of Network Topology Performance Using Wireless Distribution System Technology

The use of wireless networks has become a trend at this time. However, this can cause several problems in the use of this technology. One of the problems arising from this technology is the limited signal coverage in a certain place. To solve these problems, WDS technology is an alternative solution that can be done. WDS technology will be applied to each room. In this study, QOS analysis will be used to evaluate throughput performance and response time. The test scenario is performed with 1000 users (simulated) for seven days, four sampling times considering working hours and outside working hours. The analysis results show that with WDS technology, the resulting performance tends to be more stable with a throughput value of 500 KBps and a max response time of 5.5 ms.

Download Full-text

Using Field Measured Transient Responses in a Water Distribution System to Assess Valve Status and Network Topology

Impacts of Global Climate Change ◽

10.1061/40792(173)54 ◽

2005 ◽

Cited By ~ 1

Author(s):

Mark Stephens ◽

Martin F. Lambert ◽

Angus R. Simpson ◽

John P. Vítkovský ◽

John B. Nixon

Keyword(s):

Network Topology ◽

Distribution System ◽

Water Distribution ◽

Water Distribution System ◽

Transient Responses

Download Full-text

Study on Content Distribute Mechanism of Cloud Storage

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.662.263 ◽

2014 ◽

Vol 662 ◽

pp. 263-266

Author(s):

Chun Ping Wang

Keyword(s):

Genetic Algorithm ◽

Response Time ◽

Network Topology ◽

Cloud Storage ◽

Content Distribution ◽

Cost Models ◽

Full Account ◽

Network Bandwidth ◽

Storage Node ◽

Charging Mechanism

In this paper, the charging mechanism and content distribution mechanisms of cloud storage for analysis, given reasonable network topology and cost models. Suggestions for improvement heuristic cloud storage static content distribution genetic algorithm is put forward. Full account of the current network bandwidth, edge cloud storage node performance and historical visit value, since the convergence of the proposed probabilistic matching content distribution cloud storage load balancing technology, effectively balancing the load, while reducing the edge server response time.

Download Full-text

Dynamic Genetic Algorithms with Hyper-Mutation Schemes for Dynamic Shortest Path Routing Problem in Mobile Ad Hoc Networks

International Journal of Adaptive Resilient and Autonomic Systems ◽

10.4018/jaras.2012010105 ◽

2012 ◽

Vol 3 (1) ◽

pp. 87-98 ◽

Cited By ~ 1

Author(s):

Hui Cheng

Keyword(s):

Genetic Algorithms ◽

Wireless Networks ◽

Shortest Path ◽

Network Topology ◽

Ad Hoc ◽

Optimization Techniques ◽

Mobile Wireless Networks ◽

Mobile Wireless ◽

Routing Problem ◽

Mobile Ad Hoc

In recent years, the static shortest path (SP) routing problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network (WMN), etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. This paper proposes to use two types of hyper-mutation GAs to solve the dynamic SP routing problem in MANETs. The authors consider MANETs as target systems because they represent new generation wireless networks. The experimental results show that the two hyper-mutation GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.

Download Full-text

Delay-throughput performance of load-adaptive power-controlled multihop wireless networks with scheduled transmissions

2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484) ◽

10.1109/vetecf.2003.1286186 ◽

2003 ◽

Cited By ~ 2

Author(s):

I. Rubin ◽

R. Khalaf ◽

A. Moshfegh ◽

A. Behzad

Keyword(s):

Wireless Networks ◽

Multihop Wireless Networks ◽

Throughput Performance ◽

Multihop Wireless ◽

Adaptive Power

Download Full-text

Distribution System Technology for the 21st Century

The Electricity Journal ◽

10.1016/s1040-6190(98)00033-5 ◽

1998 ◽

Vol 11 (4) ◽

pp. 49-57 ◽

Cited By ~ 1

Author(s):

Karl Stahlkopf ◽

Wade Malcolm

Keyword(s):

21St Century ◽

Distribution System ◽

System Technology

Download Full-text

Network Topology Algorithm Based on Energy-consumption Optimization of Multi-hop Wireless Networks

Journal of Networks ◽

10.4304/jnw.9.10.2828-2834 ◽

2014 ◽

Vol 9 (10) ◽

Author(s):

Weiwei Wu ◽

Hua Sun

Keyword(s):

Wireless Networks ◽

Energy Consumption ◽

Network Topology ◽

Energy Consumption Optimization

Download Full-text

A Partial Unit Delaunay Graph with Planar and Spanner for Ad Hoc Wireless Networks

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.267.322 ◽

2011 ◽

Vol 267 ◽

pp. 322-327 ◽

Cited By ~ 1

Author(s):

Peng Fei Xu ◽

Zhi Gang Chen ◽

Xiao Heng Deng ◽

Jian Ping Yu

Keyword(s):

Wireless Networks ◽

Delaunay Triangulation ◽

Network Topology ◽

Ad Hoc ◽

Ad Hoc Wireless Networks ◽

Connected Subgraph ◽

Unit Disk Graph ◽

Position Information ◽

Underlying Network ◽

Message Exchange

This paper proposes a new geometry structure, namely Partial unit Delaunay graph (PuDel), to be as the underlying network topology of Ad hoc wireless networks. PuDel has the following attractive properties: (1) PuDel is a connected subgraph of unit Delaunay triangulation; (2) PuDel is a planar spanner of Unit Disk Graph (UDG) whose length stretch factor is at most 1.21; and (3) PuDel can be locally constructed only based on the position information of 1-hops neighbors, and requires no message exchange between nodes in addition to maintaining UDG.

Download Full-text