Multichannel Broadcast in Duty-Cycling WBANs via Channel Hopping
4
Citation
27
Reference
10
Related Paper
Citation Trend
Abstract:
We formulate and study a broadcast problem arising in multichannel duty-cycling wireless body area networks (WBANs) which the sink needs to broadcast control information to all sensor nodes on or implanted in the human body. Despite its fundamental importance for the network configuration and secure key management, the multichannel broadcast problem is largely unaddressed in duty-cycling WBANs. In this paper, we devise novel 2-D scheduling specifying the rule of channel hopping and wake-up time slot selection, which achieves the order-minimal worst-case broadcast delay while guaranteeing the full broadcast diversity regardless of clock drifts and asymmetric duty cycles and channel perceptions. Specifically, we first employ the Chinese remainder theorem to design an effective multichannel broadcast (MCB) algorithm and further propose improved MCB that enhances the granularity of MCB in matching actual duty cycles and number of channels, reducing the theoretically worst-case broadcast delay of MCB by up to 75%. We demonstrate the performance of the proposed algorithms through theoretical analysis and extensive simulations.Keywords:
Granularity
Duty cycle
The information entropy between coarse granularity and fine granularity is comparatively studied,the influence on decision tree caused by coarse granularity and fine granularity is investigated,and the conclusion is provided that the information entropy under coarse granularity is not less than the one under fine granularity.It is shown that the decision tree generated by selecting the expanded attribute under fine granularity is better than the one under coarse granularity.
Granularity
Cite
Citations (1)
In several mobile applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data mainly consider single broadcast channel environments. In view of this, we explore the problem of broadcasting dependent data in multiple broadcast channels. By analyzing the model of dependent data broadcasting, we derive several theoretical properties for the average access time in a multiple channel environment. In light of the theoretical results, we develop a genetic algorithm to generate broadcast programs.
Replication
Cite
Citations (42)
Granularity
Cite
Citations (9)
Granularity
Granular Computing
Cite
Citations (13)
This paper discusses a mining problem of approximate periodicity with multi-granularity time in the temporal database. It introduces the concepts and properties of the multi-granularity time interval on the basis of multi-granularity time and multi-granularity time format. It constructs multi-granularity approximate periodic pattern. It proposes an mining algorithm based on self-organizing map to find multi-granularity approximate periodic pattern. Results obtained from experiments on high frequency stock market data of 580000 Bao Steel JBT1 demonstrate that the proposed algorithm is efficient.
Granularity
Temporal database
Basis (linear algebra)
Cite
Citations (0)
Broadcasting/multicasting may be an efficient way to disseminate delay-sensitive content in vehicular networks. However, conventional broadcasting schemes have suffered from reliability issues, since they cannot go along with ACK and RTS/CTS. In this paper, we design a novel receiver-driven broadcast scheme for periodic messaging in vehicular applications, where receivers request broadcasting to their neighbors and data is broadcast as a response. Via simulation study, it is shown that the proposed scheme effectively 1) controls contention and 2) mitigates hidden node effects in broadcast communication.
Broadcast domain
Cite
Citations (1)
A new mathematical formula for colour granularity has recently been proposed by Saunders1. Whereas some previously derived mathematical expressions of colour granularity have proved difficult to apply in practice due to the existence of terms having no real physical correlate, this new formula relates granularity to easily measured film parameters. Using this formula, successful granularity predictions have been made for a series of single-laver colour negative structures in which the coupler silver halide ratio was systematically varied.
Granularity
Cite
Citations (1)
Data broadcasting is a promising technique to improve the bandwidth utilization and conserve the power consumption in a mobile computing environment. In many applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data are restricted to a single broadcast channel environment which imposes an impractical limitation. In view of this, we explore in this paper the problem of broadcasting dependent date in multiple broadcast channels. By analyzing the model of dependent data broadcasting, we derive several theoretical properties for the average access time in a multiple channel environment. In light of the theoretical results, we develop a genetic algorithm to generate broadcast programs. Our experimental results show that the theoretical results derived are able to guide the search of the genetic algorithm very effectively, thus leading to solution broadcast programs of very high quality.
Cite
Citations (18)
An equation to describe the granularity of an electrophotographic imaging system has been developed to include the density variance attributed to the reflectance of paper and toner surfaces. Granularity measurements from two conventional electrophotographic copiers were used to validate the relationship. The results show good agreement with the overall shape of the granularity-versus-density curve; however, the values are not consistent with estimated toner particle size. Clustering of the toner particles is suggested as the cause of the high granularity values.
Granularity
Particle (ecology)
Cite
Citations (1)