Abstract

The dissemination of numerous information broadcast services, gives rise to the scalability issue in wireless networks. Previous researchers have shown that the push-based data broadcast mechanism is efficient in reducing message traffic. However, most research efforts are dedicated to the dissemination of static information contents. In practice, information broadcast services can produce and deliver dynamic information contents. To efficiently convey the dynamic data, we device, in this paper, an adaptive information dissemination mechanism by exploiting the functionality of data broadcasting, to support the dissemination of static and dynamic information services simultaneously. In our design, both static and dynamic information services are subsumed as service groups, i.e. the building blocks with the uniform representation of structure and group popularity and, thus, the conventional scenario becomes a special case of our framework. Furthermore, in order to tolerate the broadcast traffic dynamics, we design an online load-based slot allocation and feedback control technique to deal with the adaptation of the service group classification, bandwidth allocation, and broadcast schedule so as to avoid performance degradation. It is shown by the experimental study that the proposed adaptive information dissemination mechanism associated with the online loan-based feedback control is able to achieve a substantial reduction of message traffic for dynamic dissemination in wireless networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.