The increasing demand for interactive mobile multimedia service is causing the integration of 3rd generation （3G） cellular systems and wireless broadcast systems. The key challenge is to support data dissemination w...The increasing demand for interactive mobile multimedia service is causing the integration of 3rd generation （3G） cellular systems and wireless broadcast systems. The key challenge is to support data dissemination with low response time, request drop rate, and the unfairness of request drop. This article proposes a novel scheduling algorithm called DAG （on-demand scheduling utilizing analytic hierarchy process （AHP） and grey relational analysis （GRA））, which takes multiple factors--waiting time, number of active requests, deadline--into consideration, and models the data scheduling process as a multiple factors＇ decision-making and best option-selecting process. The proposed approach comprises two parts. The first part applies AHP to decide the relative weights of multiple decision factors according to user requests, while the second adopts GRA to rank the data item alternatives through the similarity between each option and the ideal option. Simulation results are presented to demonstrate that DAG performs well in the multiple criterions mentioned above.展开更多
Abnormal effects in GPS broadcast ephemerides can have a significant effect on real-time navigation and positioning solutions that use the orbit and clock error data provided by GPS broadcast ephemerides.This paper de...Abnormal effects in GPS broadcast ephemerides can have a significant effect on real-time navigation and positioning solutions that use the orbit and clock error data provided by GPS broadcast ephemerides.This paper describes three types of non-integerhour navigation data in GPS broadcast ephemeris data.Compared with GPST integer hour data,we find that there are two types of data blocks for non-integer-hour navigation containing gross errors with different levels of precision,which is reflected in the user range accuracy(URA)of the broadcast ephemeris.These gross errors can cause large deviations when using the GPS broadcast ephemeris for orbit calculation and lead to a decrease in the kinematic positioning accuracy.An improved weighting method which is based on the consistency relationship between the URA value and the orbital precision is proposed to improve the positioning accuracy by controlling the effect of gross errors in the broadcast ephemerides.The correction algorithm proposed in this paper was applied to real-time kinematic positioning with shipborne GPS data over the South China Sea.The results showed that the proposed positioning algorithm can effectively reduce the effects of gross errors in the broadcast ephemeris,and significantly improve the accuracy of the navigation and positioning.展开更多
With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast...With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast is an effective means for data dissemination in mobile networks. In this paper, the def＇mition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of a minor increase in data access time, in the case of no transmission error and presence of transmission errors. As a result, lower uncertainty of data benefits the qualifies of the query results based on the data.展开更多
Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for...Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for data dissemination in asymmetric communication networks, such as wireless networks. In this paper, definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for constantly-evolving data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted constantly-evolving data effectively at the cost of minor increase in data access time, in the case of no transmission error, transmission errors present, and multiple broadcast channels. As a result it benefits the qualities of the query results based on the data.展开更多
Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previou...Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.展开更多
Digital broadcasting is a novel paradigm for the next generation broadcasting. Its goal is to provide not only better quality of pictures but also a variety of services that is impossible in traditional airwaves broad...Digital broadcasting is a novel paradigm for the next generation broadcasting. Its goal is to provide not only better quality of pictures but also a variety of services that is impossible in traditional airwaves broadcasting. One of the important factors for this new broadcasting environment is the interoperability among broadcasting applications since the environment is distributed. Therefore the broadcasting metadata becomes increasingly important and one of the metadata standards for a digital broadcasting is TV-Anytime metadata. TV-Anytime metadata is defined using XML schema, so its instances are XML data. In order to fulfill interoperability, a standard query language is also required and XQuery is a natural choice. There are some researches for dealing with broadcasting metadata. In our previous study, we have proposed the method for efficiently managing the broadcasting metadata in a service provider. However, the environment of a Set-Top Box for digital broadcasting is limited such as low-cost and low-setting. Therefore there are some considerations to apply general approaches for managing the metadata into the Set-Top Box. This paper proposes a method for efficiently managing the broadcasting metadata based on the Set-Top Box and a prototype of metadata management system for evaluating our method. Our system consists of a storage engine to store the metadata and an XQuery engine to search the stored metadata and uses special index for storing and searching. Our two engines are designed independently with hardware platform therefore these engines can be used in any low-cost applications to manage broadcasting metadata.展开更多
A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environment...A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.展开更多
An automatic dependent surveillance- broadcast （ADS-B） system has serious security problems, and the data can be spoofed during broadcasting precise position information of aircraft. A solution of the ADS-B system d...An automatic dependent surveillance- broadcast （ADS-B） system has serious security problems, and the data can be spoofed during broadcasting precise position information of aircraft. A solution of the ADS-B system data authentication based on the elliptic curve cipher （ECC） and X.509 certificate is proposed. It can avoid the key distribution problem by using the symmetric key algorithm and prevent the ADS-B data from being spoofed thoroughly. Experimental test results show that the solution is valid and appropriate in ADS-B universal access transceiver （UAT） mode.展开更多
Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data sy...Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.展开更多
As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels...As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.展开更多
The problem of maintaining data consistency in mobile broadcast environments is researched. Quasi serializability is formally defined and analyzed at first. It was shown that quasi serializability is less stringent th...The problem of maintaining data consistency in mobile broadcast environments is researched. Quasi serializability is formally defined and analyzed at first. It was shown that quasi serializability is less stringent than serializability when database consistency is maintained for transactions. Then, corresponding concurrency control protocol that supports both update transactions and read-only transactions is outlined for mobile broadcast environments. Finally, the simulation results confirmed that the proposed protocol could improve the response time significantly.展开更多
Given the asymmetric communication capabilities in mobile real-time environments, traditional serializability-based approaches are too restrictive, unnecessary, and impractical. The new notion of correctness called we...Given the asymmetric communication capabilities in mobile real-time environments, traditional serializability-based approaches are too restrictive, unnecessary, and impractical. The new notion of correctness called weak serializability is given. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol based on this criterion is outlined for real-time broadcast environments. The simulation results confirmed that the proposed techniques help mobile transactions to meet their deadlines and improve query response time.展开更多
基金EU project under the information society technologies（IST）Programme（045461）； the National Natural Science Foundation of China（60772112）.
文摘The increasing demand for interactive mobile multimedia service is causing the integration of 3rd generation （3G） cellular systems and wireless broadcast systems. The key challenge is to support data dissemination with low response time, request drop rate, and the unfairness of request drop. This article proposes a novel scheduling algorithm called DAG （on-demand scheduling utilizing analytic hierarchy process （AHP） and grey relational analysis （GRA））, which takes multiple factors--waiting time, number of active requests, deadline--into consideration, and models the data scheduling process as a multiple factors＇ decision-making and best option-selecting process. The proposed approach comprises two parts. The first part applies AHP to decide the relative weights of multiple decision factors according to user requests, while the second adopts GRA to rank the data item alternatives through the similarity between each option and the ideal option. Simulation results are presented to demonstrate that DAG performs well in the multiple criterions mentioned above.
基金The authors would like to thank to Second Institute of Oceanography for the marine GPS data in the South China Sea.And this study is under the support by the National Key Research and Development Program of China(2016YFB0501701 and 2016YFB0501900).National Natural Science Foundation of China(Grant Nos.41574013 and 41874032)and the Funded by the State Key Laboratory of Geo-information Engineering(SKLGIE2016-M-1-1).
文摘Abnormal effects in GPS broadcast ephemerides can have a significant effect on real-time navigation and positioning solutions that use the orbit and clock error data provided by GPS broadcast ephemerides.This paper describes three types of non-integerhour navigation data in GPS broadcast ephemeris data.Compared with GPST integer hour data,we find that there are two types of data blocks for non-integer-hour navigation containing gross errors with different levels of precision,which is reflected in the user range accuracy(URA)of the broadcast ephemeris.These gross errors can cause large deviations when using the GPS broadcast ephemeris for orbit calculation and lead to a decrease in the kinematic positioning accuracy.An improved weighting method which is based on the consistency relationship between the URA value and the orbital precision is proposed to improve the positioning accuracy by controlling the effect of gross errors in the broadcast ephemerides.The correction algorithm proposed in this paper was applied to real-time kinematic positioning with shipborne GPS data over the South China Sea.The results showed that the proposed positioning algorithm can effectively reduce the effects of gross errors in the broadcast ephemeris,and significantly improve the accuracy of the navigation and positioning.
基金Initial Research Foundation of Shanghai Second Polytechnic University ( No.001943)National High Technology Research and Development Program of China(863 Program) (No.2007AA01Z309)
文摘With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast is an effective means for data dissemination in mobile networks. In this paper, the def＇mition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of a minor increase in data access time, in the case of no transmission error and presence of transmission errors. As a result, lower uncertainty of data benefits the qualifies of the query results based on the data.
基金supported by the National High-Technology Research and Development Program of China (Grant No.2007AA01Z309)the National Natural Science Foundation of China (Grant No.60203017)
文摘Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for data dissemination in asymmetric communication networks, such as wireless networks. In this paper, definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for constantly-evolving data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted constantly-evolving data effectively at the cost of minor increase in data access time, in the case of no transmission error, transmission errors present, and multiple broadcast channels. As a result it benefits the qualities of the query results based on the data.
基金Sponsored by the Research Grants Council of the Hong Kong Special Administrative Region,China ( Grant No. CityU 7002702)the Social Science Foundation from the Ministry of Education,China ( Grant No. 10YJC630021 )the National Natural Science Foundation of China ( Grant No.71202120)
文摘Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.
文摘Digital broadcasting is a novel paradigm for the next generation broadcasting. Its goal is to provide not only better quality of pictures but also a variety of services that is impossible in traditional airwaves broadcasting. One of the important factors for this new broadcasting environment is the interoperability among broadcasting applications since the environment is distributed. Therefore the broadcasting metadata becomes increasingly important and one of the metadata standards for a digital broadcasting is TV-Anytime metadata. TV-Anytime metadata is defined using XML schema, so its instances are XML data. In order to fulfill interoperability, a standard query language is also required and XQuery is a natural choice. There are some researches for dealing with broadcasting metadata. In our previous study, we have proposed the method for efficiently managing the broadcasting metadata in a service provider. However, the environment of a Set-Top Box for digital broadcasting is limited such as low-cost and low-setting. Therefore there are some considerations to apply general approaches for managing the metadata into the Set-Top Box. This paper proposes a method for efficiently managing the broadcasting metadata based on the Set-Top Box and a prototype of metadata management system for evaluating our method. Our system consists of a storage engine to store the metadata and an XQuery engine to search the stored metadata and uses special index for storing and searching. Our two engines are designed independently with hardware platform therefore these engines can be used in any low-cost applications to manage broadcasting metadata.
基金Project(20030533011)supported by the National Research Foundation for the Doctoral Program of Higher Education of China
文摘A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.
基金supported by the National Natural Science Foundation of China under Grant No. 61179072the Civil Aviation Science Foundation of China
文摘An automatic dependent surveillance- broadcast （ADS-B） system has serious security problems, and the data can be spoofed during broadcasting precise position information of aircraft. A solution of the ADS-B system data authentication based on the elliptic curve cipher （ECC） and X.509 certificate is proposed. It can avoid the key distribution problem by using the symmetric key algorithm and prevent the ADS-B data from being spoofed thoroughly. Experimental test results show that the solution is valid and appropriate in ADS-B universal access transceiver （UAT） mode.
基金This work is financially supported by Beijing Municipal Natural Science Foundation(No.L202012)the Open Research Project of the State Key Laboratory of Media Convergence and Communication,Communication University of China(No.SKLMCC2020KF008)the Fundamental Research Funds for the Central Universities(No.2020RC05).
文摘Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.
文摘As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.
文摘The problem of maintaining data consistency in mobile broadcast environments is researched. Quasi serializability is formally defined and analyzed at first. It was shown that quasi serializability is less stringent than serializability when database consistency is maintained for transactions. Then, corresponding concurrency control protocol that supports both update transactions and read-only transactions is outlined for mobile broadcast environments. Finally, the simulation results confirmed that the proposed protocol could improve the response time significantly.
文摘Given the asymmetric communication capabilities in mobile real-time environments, traditional serializability-based approaches are too restrictive, unnecessary, and impractical. The new notion of correctness called weak serializability is given. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol based on this criterion is outlined for real-time broadcast environments. The simulation results confirmed that the proposed techniques help mobile transactions to meet their deadlines and improve query response time.
