Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

Zhu, R. Y.

doi:10.3837/tiis.2011.09.001

Cited by 21 publications

(13 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large number of MCs retrieve data items by issuing queries. The items accessed by a query would not vary during its lifetime; this is a reasonable assumption for typical real-life data broadcast applications and was commonly assumed in previous studies, for example, [33][34][35]. After launching a query, the MC selectively tunes into the broadcast channel and retrieves the needed data when they appear.…”

Section: Preliminariesmentioning

confidence: 99%

“…The items accessed by a query would not vary during its lifetime; this is a reasonable assumption for typical real-life data broadcast applications and was commonly assumed in previous studies, for example, [33][34][35]. A large number of MCs retrieve data items by issuing queries.…”

Section: Preliminariesmentioning

confidence: 99%

“…As can be seen, a range query q denoted by a hollow circle is located in Cell 31. An orange circle centered at q:l has a radius q:r and includes all the points whose Euclidean distance from q:l is not larger than q:r. A blue irregular polygon gives the actual query scope, which is centered at q:l, and includes all the points whose network distance from q:l is not larger than q:r. As shown in Figure 12(a), Cells 10,11,28,29,30,31,32,35, and 53 are within the query scope, and all other cells can be pruned safely. And by executing Algorithm 1, we can obtain the actual broadcast frames, viz., 0, 28, 32, 35, and 53, as shown in Figure 12(b).…”

Section: Range Query Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

A novel distributed air index for efficient spatial query processing in road sensor networks on the air

Shu

Zhu

et al. 2016

Int J Communication

Self Cite

View full text Add to dashboard Cite

Recent development of wireless technology and smart mobile devices has spurred intense research efforts to address spatial queries. In particular, an increasing interest for tackling spatial query processing in broadcast environments has been observed. To the best of our knowledge, most of the existing work on this problem has assumed an Euclidean space. However, for real applications, query clients move within a road sensor network, where the distance between a data object and a query is determined by the connectivity of the road sensor network. This paper explores the problem of spatial query processing in road sensor networks by means of wireless data broadcast. We present an efficient method to partition the recordkeeping information about the underlying road sensor network and its associated objects, by which we develop a fully distributed air index, called integrated exponential index, based on an extended version of the Hilbert curve. We also propose efficient client-side algorithms to facilitate the processing of several kinds of spatial queries, including kNN query, CkNN query, and range query. Finally, extensive simulation experiments have been conducted to demonstrate the strengths of our proposed techniques. access for relatively heavily loaded systems. A year and a half ago, soccer fans from around the world arrived in Brasilia to watch the 2014 FIFA World Cup. After a game, many people would like to locate good nearby restaurants. Because there could be tons of people doing the search at the same time, an ideal solution in this case would be to provide spatial query processing using data broadcast.Earlier approaches to designing broadcast-based spatial query processing methods [2-7] had assumed that MCs and searched objects were located in an Euclidean space. In real-life situations, however, MCs normally move along a road sensor network, and the Euclidean distance may not properly reflect real road sensor network distance [8]. Thus, the existing spatial query processing methods proposed for Euclidean space are inapplicable to process spatial queries in road sensor networks. Recently, researchers have begun to zero in on the problem. Li et al. [9] addressed the issue of processing CNN queries in road networks on the air and proposed an network Voronoi diagrams (NVDs)-based distributed air index to support query processing. One key limitation of the proposed method is that it processes CkNN queries with k D 1. Sun et al. [10] presented an air index called network partition index (NPI) to support spatial query processing in road networks on the air and proposed efficient algorithms to process different spatial queries such as kNN query, range query, and CNN query. NPI is, however, not a fully distributed structure, and thus, each query client will have to wait for the arrival of the index part followed by the whole index before starting its query processing, which could lead to long access latency and tuning time. In this paper, we aim to overcome these limitations and propose a fully distributed air ...

show abstract

Section: Preliminariesmentioning

confidence: 99%

Section: Preliminariesmentioning

confidence: 99%

Section: Range Query Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A novel distributed air index for efficient spatial query processing in road sensor networks on the air

Shu

Zhu

et al. 2016

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…Adaptive Packet Scheduling (APS) scheme was proposed [15] to support real-time traffic in WLAN Mesh Networks where the performance is improved by assuring inter- and intraclass service demarcation of the packet. APS establishes a way to fairly allocate resources within the service classes.…”

Section: Related Workmentioning

confidence: 99%

On the Exploration of Adaptive Mechanisms Providing Reliability in Clustered WSNs for Power Plant Monitoring

Rathinavel

Vijayakumar²,

Audithan

2016

The Scientific World Journal

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) are used in almost every sensing and detection environment instead of wired devices in the current world, all the more in power plant monitoring applications. In such a kind of environment, providing reliability is a challenging task, since WSN makes use of low powered sensors. There are many existing works that provide reliable transmission in WSN (predominantly via multipath routing). However, most of the existing works take additional delay, excessive packet loss, and energy consumption, and hence they provide less packet delivery and throughput. Adaptive Priority Routing (APR) is first proposed during the initial design to provide efficiency in next hop selection. APR computes the priority value for selecting the intermediate nodes during the data transmission in order to improve the packet delivery, throughput, and energy efficiency. In addition to this, APR is developed into QAPR protocol to provide reliability which can operate in two modes, D representing distance mode and Q representing quality of service (QoS) mode. The proposed work is simulated in both flat topology and hierarchical topologies and the simulation analysis shows that the reliability is increased significantly in comparison with existing works.

show abstract

“…The energy of it is limited and cannot be recharged. Therefore, it needs considering first to prolong the network life by adopting effective energy-saving coverage method and energy-consuming balance mechanism in the research and designing of WSN [6][7][8]. In wireless sensor networks, the ultimate goal of coverage is to allocate each node's state efficiently, minimize the network's energy consumption in each cycle, and balance the share of each node's energy consumption in the network without reducing the existing level [9].…”

Section: Introductionmentioning

confidence: 99%

A novel coverage algorithm based on event-probability-driven mechanism in wireless sensor network

Sun

Wang

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

Coverage problem is an important research topic in the field of wireless sensor network (WSN). The coverage algorithm based on event probability driven mechanism (EPDM) is put forward in this paper. First of all, the network probability model is established and the subordinate relation between sensor nodes and the target nodes is presented. Secondly, a series of probability is computed and the related theorems and reasoning are also proven. Thirdly, effective coverage for the monitoring region is achieved through scheduling mechanism of nodes themselves, thus the purpose of increasing network lifetime can be realized. Finally, experimental results show that the proposed algorithm could achieve complete coverage for networks of different scale and increase the network lifetime. It possesses the good quality of effectiveness and stability.

show abstract

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

Cited by 21 publications

References 27 publications

A novel distributed air index for efficient spatial query processing in road sensor networks on the air

A novel distributed air index for efficient spatial query processing in road sensor networks on the air

On the Exploration of Adaptive Mechanisms Providing Reliability in Clustered WSNs for Power Plant Monitoring

A novel coverage algorithm based on event-probability-driven mechanism in wireless sensor network

Contact Info

Product

Resources

About