Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Quality of Monitoring for Multi-channel Wireless Infrastructure Networks
133
0
0.0
(
0
)
Added by
Huy Nguyen
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource management and critical path analysis. In this paper, we introduce a quality of monitoring (QoM) metric defined by the expected number of active users monitored, and investigate the problem of maximizing QoM by judiciously assigning sniffers to channels based on the knowledge of user activities in a multi-channel wireless network. Two types of capture models are considered. The user-centric model assumes frame-level capturing capability of sniffers such that the activities of different users can be distinguished while the sniffer-centric model only utilizes the binary channel information (active or not) at a sniffer. For the user-centric model, we show that the implied optimization problem is NP-hard, but a constant approximation ratio can be attained via polynomial complexity algorithms. For the sniffer-centric model, we devise stochastic inference schemes to transform the problem into the user-centric domain, where we are able to apply our polynomial approximation algorithms. The effectiveness of our proposed schemes and algorithms is further evaluated using both synthetic data as well as real-world traces from an operational WLAN.
rate research
Read More
In this paper, we propose a new Quality Link Metric (QLM), ``Inverse Expected Transmission Count (InvETX) in Optimized Link State Routing (OLSR) protocol. Then we compare performance of three existing QLMs which are based on loss probability measurements; Expected Transmission Count (ETX), Minimum Delay (MD), Minimum Loss (ML) in Static Wireless Multi-hop Networks (SWMhNs). A novel contribution of this paper is enhancement in conventional OLSR to achieve high efficiency in terms of optimized routing load and routing latency. For this purpose, first we present a mathematical framework, and then to validate this frame work, we select three performance parameters to simulate default and enhanc
The resource constraints and accuracy requirements for Internet of Things (IoT) memory chips need three-dimensional (3D) monolithic integrated circuits, of which the increasing stack layers (currently more than 176) also cause excessive energy consumption and increasing wire length. In this paper, a novel 3D wireless network on chips (3DWiNoCs) model transmitting signal directly to the destination in arbitrary layer is proposed and characterized. However, due to the the reflection and refraction characteristics in each layer, the complex and diverse wireless paths in 3DWiNoC add great difficulty to the channel characterization. To facilitate the modeling in massive layer NoC situation, both boundary-less model boundary-constrained 3DWiNoC model are proposed, of which the channel gain can be obtained by a computational efficient approximate algorithm. These 3DWiNoC models with approximation algorithm can well characterize the 3DWiNoC channel in aspect of complete reflection and refraction characteristics, and avoid massive wired connections, high power consumption of cross-layer communication and high-complexity of 3DWiNoC channel characterization. Numerical results show that: 1) The difference rate between the two models is lower than 0.001% (signal transmit through 20 layers); 2) the channel gain decreases sharply if refract time increases; and 3) the approximate algorithm can achieve an acceptable accuracy (error rate lower than 0.1%).
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to improve spatial throughput. In such networks, given a source and destination, it is of interest to compute an optimal path and channel assignment on every link in the path such that the path bandwidth is the same as that of the link bandwidth and such a path satisfies the constraint that no two consecutive links on the path are assigned the same channel, referred to as Channel Discontinuity Constraint (CDC). CDC-paths are also quite useful for TDMA system, where preferably every consecutive links along a path are assigned different time slots. This paper contains several contributions. We first present an $O(N^{2})$ distributed algorithm for discovering the shortest CDC-path between given source and destination. This improves the running time of the $O(N^{3})$ centralized algorithm of Ahuja et al. for finding the minimum-weight CDC-path. Our second result is a generalized $t$-spanner for CDC-path; For any $theta>0$ we show how to construct a sub-network containing only $O(frac{N}{theta})$ edges, such that that length of shortest CDC-paths between arbitrary sources and destinations increases by only a factor of at most $(1-2sin{tfrac{theta}{2}})^{-2}$. We propose a novel algorithm to compute the spanner in a distributed manner using only $O(nlog{n})$ messages. An important conclusion of this scheme is in the case of directional antennas are used. In this case, it is enough to consider only the two closest nodes in each cone.
We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the different traffic streams. We show the stability of the network for this policy by convergence to a fluid limit. It is intractable to obtain the stationary distribution of this network. Thus we also provide a diffusion approximation for this scheme under heavy traffic. We show that the stationary distribution of the scaled process of the network converges to that of the Brownian limit. This theoretically justifies the performance of the system. We provide simulations to verify our claims.
We study the minimum latency broadcast scheduling (MLBS) problem in Single-Radio Multi-Channel (SR-MC) wireless ad-hoc networks (WANETs), which are modeled by Unit Disk Graphs. Nodes with this capability have their fixed reception channels, but can switch their transmission channels to communicate with their neighbors. The single-radio and multi-channel model prevents existing algorithms for single-channel networks achieving good performance. First, the common assumption that one transmission reaches all the neighboring nodes does not hold naturally. Second, the multi-channel dimension provides new opportunities to schedule the broadcast transmissions in parallel. We show MLBS problem in SR-MC WANETs is NP-hard, and present a benchmark algorithm: Basic Transmission Scheduling (BTS), which has approximation ratio of 4k + 12. Here k is the number of orthogonal channels in SR-MC WANETs. Then we propose an Enhanced Transmission Scheduling (ETS) algorithm, improving the approximation ratio to k + 23. Simulation results show that ETS achieves better performance over BTS, and the performance of ETS approaches the lower bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
