Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068980
E. Belyaev, Vitaly Grinko, Anna Ukhanova
This paper discusses the utilization of scalable extension of H.264/AVC standard in digital video broadcasting for handheld devices. In this area the problem of mobile receiver power consumption is critically important. This paper amplifies the well-known idea of the time-slicing and allows the receiver to control the trade-off between video quality and power saving in the receiver depending on the priorities.
{"title":"Power saving control for the mobile DVB-H receivers based on H.264/SVC standard","authors":"E. Belyaev, Vitaly Grinko, Anna Ukhanova","doi":"10.1109/WTS.2009.5068980","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068980","url":null,"abstract":"This paper discusses the utilization of scalable extension of H.264/AVC standard in digital video broadcasting for handheld devices. In this area the problem of mobile receiver power consumption is critically important. This paper amplifies the well-known idea of the time-slicing and allows the receiver to control the trade-off between video quality and power saving in the receiver depending on the priorities.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124147312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068957
M. Méribout, A. Al-Naamany
Vehicular networks are the major ingredients of the envisioned Intelligent Transportation Systems (ITS) concept. An important component of ITS which is currently attracting wider research focus is road traffic monitoring. The actual approaches for traffic road monitoring are characterized by longer response times and are also subject to higher processing requirements and possess high deployment costs. In this paper, we propose a completely distributed and scalable mechanism for wireless sensor network-based road traffic monitoring. The approach relies on the distributed and bidirectional exchange of traffic information between the vehicles traversing the routes and a miniature cluster head and takes into consideration both the security and reliability of data communication. In addition, the communication between nodes is collision free since the underlined data link layer protocol relies on a heuristic time multiplexed-based protocol. The performance analysis shows that the proposed mechanism usually outperforms other algorithms for different traffic densities.
{"title":"A collision free data link layer protocol for wireless sensor networks and its application in intelligent transportation systems","authors":"M. Méribout, A. Al-Naamany","doi":"10.1109/WTS.2009.5068957","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068957","url":null,"abstract":"Vehicular networks are the major ingredients of the envisioned Intelligent Transportation Systems (ITS) concept. An important component of ITS which is currently attracting wider research focus is road traffic monitoring. The actual approaches for traffic road monitoring are characterized by longer response times and are also subject to higher processing requirements and possess high deployment costs. In this paper, we propose a completely distributed and scalable mechanism for wireless sensor network-based road traffic monitoring. The approach relies on the distributed and bidirectional exchange of traffic information between the vehicles traversing the routes and a miniature cluster head and takes into consideration both the security and reliability of data communication. In addition, the communication between nodes is collision free since the underlined data link layer protocol relies on a heuristic time multiplexed-based protocol. The performance analysis shows that the proposed mechanism usually outperforms other algorithms for different traffic densities.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"602 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116335330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068966
G. Habib, T. Divoux, J. Pétin
The automation architecture consists of actuators, sensors, programmable logic controllers (PLC) and monitoring systems. Some research focuses on how to replace the communication between those entities from wired to wireless communication taking in consideration the industrial constraints, given the advantages of this kind of communication. To study the performance of the Wireless Network System, this paper presents an approach for estimating the maximum and minimum delays for each traffic of a wireless network in the worst case. Influence of the Maximum number of retransmission parameter is studied on the estimated delay and on the packet loss rate. Our results are compared and analyzed with simulated ones obtained with the tool OPNET.
{"title":"Estimating maximum and minimum delays for wireless discrete networked control systems","authors":"G. Habib, T. Divoux, J. Pétin","doi":"10.1109/WTS.2009.5068966","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068966","url":null,"abstract":"The automation architecture consists of actuators, sensors, programmable logic controllers (PLC) and monitoring systems. Some research focuses on how to replace the communication between those entities from wired to wireless communication taking in consideration the industrial constraints, given the advantages of this kind of communication. To study the performance of the Wireless Network System, this paper presents an approach for estimating the maximum and minimum delays for each traffic of a wireless network in the worst case. Influence of the Maximum number of retransmission parameter is studied on the estimated delay and on the packet loss rate. Our results are compared and analyzed with simulated ones obtained with the tool OPNET.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131482087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068942
I. Jawhar
Different simulation tools are available to the research community which can be used to validate, test and evaluate networking protocols. Such simulation software packages include OPNET, ns-2 and others. These programs are capable of performing relatively accurate simulations of networking architectures including wireless, ad hoc, and sensor networks. Although they are very useful for a wide range of experiments which involve performance evaluation of existing protocols, selecting them to verify and test the performance of new platforms and protocols that are not implemented in these programs tend to impose considerable restrictions and limitations. Therefore, implementing these protocols in existing simulator packages could be relatively difficult and time consuming. This paper presents an object-oriented framework to design an event-driven network simulator that can be used to evaluate different wireless networking architectures and protocols. The design of the simulator allows for a considerable increase in flexibility for the researcher who is able to include particular aspects and implementations of the corresponding protocols. The different classes that constitute the simulator application along with the main methods, and relationships are presented. In addition, design strategies for simulating node mobility using the popular Waypoint model are also presented.
{"title":"A flexible object-oriented design of an event-driven wireless network simulator","authors":"I. Jawhar","doi":"10.1109/WTS.2009.5068942","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068942","url":null,"abstract":"Different simulation tools are available to the research community which can be used to validate, test and evaluate networking protocols. Such simulation software packages include OPNET, ns-2 and others. These programs are capable of performing relatively accurate simulations of networking architectures including wireless, ad hoc, and sensor networks. Although they are very useful for a wide range of experiments which involve performance evaluation of existing protocols, selecting them to verify and test the performance of new platforms and protocols that are not implemented in these programs tend to impose considerable restrictions and limitations. Therefore, implementing these protocols in existing simulator packages could be relatively difficult and time consuming. This paper presents an object-oriented framework to design an event-driven network simulator that can be used to evaluate different wireless networking architectures and protocols. The design of the simulator allows for a considerable increase in flexibility for the researcher who is able to include particular aspects and implementations of the corresponding protocols. The different classes that constitute the simulator application along with the main methods, and relationships are presented. In addition, design strategies for simulating node mobility using the popular Waypoint model are also presented.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128773834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068982
M. Vanek, P. Farkaš
In this paper a fast version of the Parallel Weighted Bit Flipping LDPC decoding algorithm (PWBF) is presented. The idea, which allowed decreasing the computational complexity of the PWBF method, is based on the observation that in dependency on signal to noise ratio, many of the received bits in the codeword of LDPC code could be without error. The augmented algorithm makes tests based on syndromes and symbol involvement in parity checks, which are given by the factor graph corresponding to the chosen LDPC code in order to define so called guaranteed bits. These guaranteed bits do not participate in the decoding calculations further. Simulation results are presented, which show that there is not visible any significant performance deterioration by application of this method and that the approximate speed up of the decoding for the tested codes is about 25% on the selected hardware in comparison with the known PWBF.
{"title":"Fast Parallel Weighted Bit Flipping decoding algorithm for LDPC codes","authors":"M. Vanek, P. Farkaš","doi":"10.1109/WTS.2009.5068982","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068982","url":null,"abstract":"In this paper a fast version of the Parallel Weighted Bit Flipping LDPC decoding algorithm (PWBF) is presented. The idea, which allowed decreasing the computational complexity of the PWBF method, is based on the observation that in dependency on signal to noise ratio, many of the received bits in the codeword of LDPC code could be without error. The augmented algorithm makes tests based on syndromes and symbol involvement in parity checks, which are given by the factor graph corresponding to the chosen LDPC code in order to define so called guaranteed bits. These guaranteed bits do not participate in the decoding calculations further. Simulation results are presented, which show that there is not visible any significant performance deterioration by application of this method and that the approximate speed up of the decoding for the tested codes is about 25% on the selected hardware in comparison with the known PWBF.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125435383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068931
D. Radev, I. Lokshina
The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. The algorithms for modeling fixed-length sequence generators that are used to simulate self-similar behavior of wireless IP network traffic are developed and applied. Numerical examples and simulation results are provided.
{"title":"Modeling and simulation of self-similar wireless IP network traffic","authors":"D. Radev, I. Lokshina","doi":"10.1109/WTS.2009.5068931","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068931","url":null,"abstract":"The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. The algorithms for modeling fixed-length sequence generators that are used to simulate self-similar behavior of wireless IP network traffic are developed and applied. Numerical examples and simulation results are provided.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122000792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：