Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583382
S. Soltani, M. Mutka
Cognitive radio networks are developed to solve the under utilization problem of available spectrum. Typically, available spectrum is not fully utilized without supporting multimedia applications. In this work we translate video routing in a dynamic cognitive radio network into a decision theory problem. Then terminal analysis backward induction is used to produce our routing scheme that improves the peak signal-to-noise ratio of the received video. In the proposed Video aware Cognitive Routing strategy (VCR), two components are introduced that improve the precision of correct decision making in a highly dynamic environment; First, a sample and posterior distribution are introduced to explain the status of channels and nodes in supporting video frame quality of service. Second, a utility function is introduced to capture the effects of spectrum stability, fluctuation of bandwidth availability and path quality. In comparison to a deterministic routing scheme developed for dynamic environment (OSDRP), our simulation results show that VCR improves the video quality by at least 30% at the receiver.
{"title":"Decision tree modeling for video routing in cognitive radio mesh networks","authors":"S. Soltani, M. Mutka","doi":"10.1109/WoWMoM.2013.6583382","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583382","url":null,"abstract":"Cognitive radio networks are developed to solve the under utilization problem of available spectrum. Typically, available spectrum is not fully utilized without supporting multimedia applications. In this work we translate video routing in a dynamic cognitive radio network into a decision theory problem. Then terminal analysis backward induction is used to produce our routing scheme that improves the peak signal-to-noise ratio of the received video. In the proposed Video aware Cognitive Routing strategy (VCR), two components are introduced that improve the precision of correct decision making in a highly dynamic environment; First, a sample and posterior distribution are introduced to explain the status of channels and nodes in supporting video frame quality of service. Second, a utility function is introduced to capture the effects of spectrum stability, fluctuation of bandwidth availability and path quality. In comparison to a deterministic routing scheme developed for dynamic environment (OSDRP), our simulation results show that VCR improves the video quality by at least 30% at the receiver.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123564735","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583476
S. Robitzsch, S. Murphy, Piotr Szczechowiak
This paper presents the high level specification of a Self Configuration Framework for 802.11 multi-radio Wireless Mesh Networks based on a centralised topology discovery and channel assignment mechanism. The framework was designed to support the introduction of a new Mesh Node into the network at any time of the network's operational phase. Further, it enables a new Mesh Node to locate and communicate with the Mesh Gateway and vice versa before any routing protocol has been activated. Finally, the paper presents an estimation of time required to boot a single node and the entire multi-radio Wireless Mesh Network.
{"title":"Architecture of a Self Configuration Framework for 802.11-based multi-radio Mesh Networks","authors":"S. Robitzsch, S. Murphy, Piotr Szczechowiak","doi":"10.1109/WoWMoM.2013.6583476","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583476","url":null,"abstract":"This paper presents the high level specification of a Self Configuration Framework for 802.11 multi-radio Wireless Mesh Networks based on a centralised topology discovery and channel assignment mechanism. The framework was designed to support the introduction of a new Mesh Node into the network at any time of the network's operational phase. Further, it enables a new Mesh Node to locate and communicate with the Mesh Gateway and vice versa before any routing protocol has been activated. Finally, the paper presents an estimation of time required to boot a single node and the entire multi-radio Wireless Mesh Network.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"326 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124300648","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583443
B. Bonné, Arno Barzan, P. Quax, W. Lamotte
To simulate crowds at mass events, realistic movement data of people is required. Despite their limited capacity for approximating real human mobility, synthetic movement models are traditionally used for this purpose. More realistic simulations can be achieved by using real-life movement data, gathered by observing people in the desired context. This paper presents a method for tracking people at mass events without the need for active cooperation by the subjects. The mechanism works by scanning at multiple locations for packets sent out by the Wi-Fi interface on visitors' smartphones, and correlating the data captured at these different locations. The proposed method can be implemented at very low cost on Raspberry Pi computers. This implementation was trialed in two different contexts: a popular music festival and a university campus. The method allows for tracking thousands of people simultaneously, and achieves a higher coverage rate than similar methods for involuntary crowd tracking. Moreover, the coverage rate is expected to increase even further as more people will start using smartphones. The proposed method has many applications in different domains. It also entails privacy implications that must be considered when deploying a similar system.
{"title":"WiFiPi: Involuntary tracking of visitors at mass events","authors":"B. Bonné, Arno Barzan, P. Quax, W. Lamotte","doi":"10.1109/WoWMoM.2013.6583443","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583443","url":null,"abstract":"To simulate crowds at mass events, realistic movement data of people is required. Despite their limited capacity for approximating real human mobility, synthetic movement models are traditionally used for this purpose. More realistic simulations can be achieved by using real-life movement data, gathered by observing people in the desired context. This paper presents a method for tracking people at mass events without the need for active cooperation by the subjects. The mechanism works by scanning at multiple locations for packets sent out by the Wi-Fi interface on visitors' smartphones, and correlating the data captured at these different locations. The proposed method can be implemented at very low cost on Raspberry Pi computers. This implementation was trialed in two different contexts: a popular music festival and a university campus. The method allows for tracking thousands of people simultaneously, and achieves a higher coverage rate than similar methods for involuntary crowd tracking. Moreover, the coverage rate is expected to increase even further as more people will start using smartphones. The proposed method has many applications in different domains. It also entails privacy implications that must be considered when deploying a similar system.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126332162","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583381
Stefano Paris, J. Elias, A. Mehaoua
In recent years, Body-to-Body Networks (BBNs) have gained momentum as a means to monitor people behavior and simplify their interaction with the surrounding environment; thus representing a key element of the Internet of Things (IoT) networking paradigm. Within BBNs, several transmission technologies sharing the same unlicensed band (namely the ISM band) coexist, increasing dramatically the level of interference, which in turn negatively affects the network performance. In this paper, we consider an IoT system composed of several BBNs and we analyze the Cross Technology Interference (CTI) problem caused by the utilization of different transmission technologies that share the same radio spectrum. We formulate an optimization model considering both the Mutual and Cross Technology Interference in order to mitigate the overall level of interference within the IoT system, taking explicitly into account the node mobility. We further develop two heuristic approaches to solve efficiently the interference mitigation problem in large scale network scenarios. Numerical results show that the proposed heuristics represent two efficient and practical alternatives to the optimal solution for solving the CTI mitigation problem in large scale IoT scenarios.
{"title":"Cross Technology Interference Mitigation in Body-to-Body Area Networks","authors":"Stefano Paris, J. Elias, A. Mehaoua","doi":"10.1109/WoWMoM.2013.6583381","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583381","url":null,"abstract":"In recent years, Body-to-Body Networks (BBNs) have gained momentum as a means to monitor people behavior and simplify their interaction with the surrounding environment; thus representing a key element of the Internet of Things (IoT) networking paradigm. Within BBNs, several transmission technologies sharing the same unlicensed band (namely the ISM band) coexist, increasing dramatically the level of interference, which in turn negatively affects the network performance. In this paper, we consider an IoT system composed of several BBNs and we analyze the Cross Technology Interference (CTI) problem caused by the utilization of different transmission technologies that share the same radio spectrum. We formulate an optimization model considering both the Mutual and Cross Technology Interference in order to mitigate the overall level of interference within the IoT system, taking explicitly into account the node mobility. We further develop two heuristic approaches to solve efficiently the interference mitigation problem in large scale network scenarios. Numerical results show that the proposed heuristics represent two efficient and practical alternatives to the optimal solution for solving the CTI mitigation problem in large scale IoT scenarios.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130052164","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583392
E. D. Souza, I. Nikolaidis
We consider the problem of scheduling wireless transmissions in a sensor network to perform aggregation convergecast. In contrast to studies that attempt to shorten the schedule for completing a single data collection cycle, we aim to increase the frequency at which updates are collected (higher throughput). To achieve higher throughput, we use a form of pipelined concurrent collection of multiple data snapshots through the network. To attain high performance pipelining, we “expand” the time in which precedence constraints need to be satisfied such that they span over multiple schedule cycles. Our approach involves the unconventional approach of constructing the schedule before finalizing the exact form of the precedence constraints, i.e., before determining the data aggregation tree, which in turn requires that the schedule construction phase guarantees that every node can reach the sink. We compare our results using pipelining against a previously proposed algorithm that also uses pipelining, as well as against an algorithm that, although lacking pipelining, exhibits the ability to produce very short schedules. The results confirm the potential to achieve a substantial throughput increase at the cost of increased latency.
{"title":"On the application of pipelining in aggregation convergecast scheduling","authors":"E. D. Souza, I. Nikolaidis","doi":"10.1109/WoWMoM.2013.6583392","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583392","url":null,"abstract":"We consider the problem of scheduling wireless transmissions in a sensor network to perform aggregation convergecast. In contrast to studies that attempt to shorten the schedule for completing a single data collection cycle, we aim to increase the frequency at which updates are collected (higher throughput). To achieve higher throughput, we use a form of pipelined concurrent collection of multiple data snapshots through the network. To attain high performance pipelining, we “expand” the time in which precedence constraints need to be satisfied such that they span over multiple schedule cycles. Our approach involves the unconventional approach of constructing the schedule before finalizing the exact form of the precedence constraints, i.e., before determining the data aggregation tree, which in turn requires that the schedule construction phase guarantees that every node can reach the sink. We compare our results using pipelining against a previously proposed algorithm that also uses pipelining, as well as against an algorithm that, although lacking pipelining, exhibits the ability to produce very short schedules. The results confirm the potential to achieve a substantial throughput increase at the cost of increased latency.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726937","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583454
Luca Zappaterra, Joseph S. Gomes, Amrinder Arora, Hyeong-Ah Choi
Cognitive Radio Networks (CRNs) aim to maximize the utilization of existing wireless channels by allowing secondary users (SUs) to transmit when licensed primary users (PUs) are not using the same channels. An SU monitors the CRN channels, sensing PU presence to avoid interference and estimating the link quality before transmitting. It stops when one or more available channels with satisfactory link quality are found. Algorithms for making the optimal decision regarding when to stop exploring the channels and start transmitting are expensive in terms of time and space, which are both scarce in hardware-constrained SUs, such as mobile devices. In this paper, we propose a low-complexity algorithm, which utilizes link quality and PU-activity statistics of the CRN channels to pre-compute a set of decision thresholds that will aid the channel exploration phase in maximizing SU-throughput. Our algorithm takes quadratic time and space for offline computations and linear time and space for online processing, which makes it very suitable for space and energy constrained mobile SUs. Our extensive simulation study and analytical model matching the simulation results demonstrate our solution's validity by showing the closeness of throughput and delay performances with the optimum solution as well as solutions by the well-known backward induction method, which often runs in exponential time for offline computations.
{"title":"A linear-time algorithm for optimal multi-channel access in Cognitive Radio Networks","authors":"Luca Zappaterra, Joseph S. Gomes, Amrinder Arora, Hyeong-Ah Choi","doi":"10.1109/WoWMoM.2013.6583454","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583454","url":null,"abstract":"Cognitive Radio Networks (CRNs) aim to maximize the utilization of existing wireless channels by allowing secondary users (SUs) to transmit when licensed primary users (PUs) are not using the same channels. An SU monitors the CRN channels, sensing PU presence to avoid interference and estimating the link quality before transmitting. It stops when one or more available channels with satisfactory link quality are found. Algorithms for making the optimal decision regarding when to stop exploring the channels and start transmitting are expensive in terms of time and space, which are both scarce in hardware-constrained SUs, such as mobile devices. In this paper, we propose a low-complexity algorithm, which utilizes link quality and PU-activity statistics of the CRN channels to pre-compute a set of decision thresholds that will aid the channel exploration phase in maximizing SU-throughput. Our algorithm takes quadratic time and space for offline computations and linear time and space for online processing, which makes it very suitable for space and energy constrained mobile SUs. Our extensive simulation study and analytical model matching the simulation results demonstrate our solution's validity by showing the closeness of throughput and delay performances with the optimum solution as well as solutions by the well-known backward induction method, which often runs in exponential time for offline computations.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128312127","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583405
S. Tornell, Enrique Hernández-Orallo, C. Calafate, Juan-Carlos Cano, P. Manzoni
The Delay Tolerant Networks (DTN) approach is considered the best strategy to address the specific issues of the VANETs, namely high mobility, variable node density or frequent radio obstacles. Several protocols have been proposed for DTNs, being the epidemic routing (and variations of it) the most representative protocol. Nevertheless, the availability of navigation systems, thanks to which each vehicle is aware of its location within a map, introduces the possibility for a new routing approach, known as Geographic Routing. In this paper we analytically evaluate the performance of our previously presented Map-based Sensor-data Delivery Protocol (MSDP). We introduce an analytical model that takes into account the effect of constrained buffers. The results show that adopting the Map-based Sensor-data Delivery Protocol (MSDP) routing mechanism allows achieving a reasonable delivery time with an insignificant overhead compared with epidemic routing.
{"title":"An analytical evaluation of a Map-based Sensor-data Delivery Protocol for VANETs","authors":"S. Tornell, Enrique Hernández-Orallo, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/WoWMoM.2013.6583405","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583405","url":null,"abstract":"The Delay Tolerant Networks (DTN) approach is considered the best strategy to address the specific issues of the VANETs, namely high mobility, variable node density or frequent radio obstacles. Several protocols have been proposed for DTNs, being the epidemic routing (and variations of it) the most representative protocol. Nevertheless, the availability of navigation systems, thanks to which each vehicle is aware of its location within a map, introduces the possibility for a new routing approach, known as Geographic Routing. In this paper we analytically evaluate the performance of our previously presented Map-based Sensor-data Delivery Protocol (MSDP). We introduce an analytical model that takes into account the effect of constrained buffers. The results show that adopting the Map-based Sensor-data Delivery Protocol (MSDP) routing mechanism allows achieving a reasonable delivery time with an insignificant overhead compared with epidemic routing.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133198240","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583485
Nicola Accettura, M. Palattella, G. Boggia, L. Grieco, M. Dohler
The emerging IEEE802.15.4e standard and IETF RPL routing protocol are core to the organization of multi-hop Low-power and Lossy Networks. They provide key functionalities useful for a really viable Internet of Things. However, several open issues still remain and require research efforts to be solved. Among others, the design of effective scheduling schemes in such systems is one of the major problems; in fact, there are no specifications about how schedules should be realized. Trying to fill this gap, this paper presents a new Decentralized Traffic-Aware Scheduling algorithm, which is able to construct optimum multi-hop schedules in a distributed fashion. Its effectiveness has been proved by using simulation results and comparing it with a centralized scheme. The reported performance results encourage the use of the developed scheduling technique, since it allows a very efficient queue management, and thus it minimizes packet discards due to buffer overflows, while at the same time minimizing the network duty cycle.
{"title":"Decentralized Traffic Aware Scheduling for multi-hop Low power Lossy Networks in the Internet of Things","authors":"Nicola Accettura, M. Palattella, G. Boggia, L. Grieco, M. Dohler","doi":"10.1109/WoWMoM.2013.6583485","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583485","url":null,"abstract":"The emerging IEEE802.15.4e standard and IETF RPL routing protocol are core to the organization of multi-hop Low-power and Lossy Networks. They provide key functionalities useful for a really viable Internet of Things. However, several open issues still remain and require research efforts to be solved. Among others, the design of effective scheduling schemes in such systems is one of the major problems; in fact, there are no specifications about how schedules should be realized. Trying to fill this gap, this paper presents a new Decentralized Traffic-Aware Scheduling algorithm, which is able to construct optimum multi-hop schedules in a distributed fashion. Its effectiveness has been proved by using simulation results and comparing it with a centralized scheme. The reported performance results encourage the use of the developed scheduling technique, since it allows a very efficient queue management, and thus it minimizes packet discards due to buffer overflows, while at the same time minimizing the network duty cycle.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124313840","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583372
P. Órtiz, Ó. Lázaro, Mikel Uriarte, M. Carnerero
Collaborative networked organizations represent an important paradigm to help manufacturing companies to cope with the challenges of market turbulence. However, although manufacturing companies are increasingly aiming to implement mobile collaboration models, there are still some barriers that prevent manufacturers from effectively sharing big data leveraged in particular by the use of Internet of Things technologies. These barriers are basically related to the lack of security controls and lightweight data management enablers that would guarantee the protection of sensitive information published on the Linked Data cloud and leverage customers from the burden of linked data sharing. The aim of this paper is to present and discuss the industrial application of the necessary extensions to traditional role-based multi-domain access control approaches to enable secure and mobile collaboration among manufacturing enterprises in logistic, manufacturing and e-Commerce processes in the context of the Web of Data.
{"title":"Enhanced multi-domain access control for secure mobile collaboration through Linked Data cloud in manufacturing","authors":"P. Órtiz, Ó. Lázaro, Mikel Uriarte, M. Carnerero","doi":"10.1109/WoWMoM.2013.6583372","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583372","url":null,"abstract":"Collaborative networked organizations represent an important paradigm to help manufacturing companies to cope with the challenges of market turbulence. However, although manufacturing companies are increasingly aiming to implement mobile collaboration models, there are still some barriers that prevent manufacturers from effectively sharing big data leveraged in particular by the use of Internet of Things technologies. These barriers are basically related to the lack of security controls and lightweight data management enablers that would guarantee the protection of sensitive information published on the Linked Data cloud and leverage customers from the burden of linked data sharing. The aim of this paper is to present and discuss the industrial application of the necessary extensions to traditional role-based multi-domain access control approaches to enable secure and mobile collaboration among manufacturing enterprises in logistic, manufacturing and e-Commerce processes in the context of the Web of Data.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122976973","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583384
M. A. Hoque, M. Siekkinen, J. Nurminen, Mika Aalto
Multimedia streaming applications are among the most energy hungry applications in smartphones. The energy consumption mostly depends on the delivery techniques and on the power management techniques of wireless interfaces (Wi-Fi and 3G). In order to provide insights on what kind of streaming techniques exist, how they work on different mobile platforms, and what is their impact on the energy consumption of mobile phones, we have done a large set of active measurements with several smartphones having both Wi-Fi and cellular network access. Our analysis reveals five different techniques to deliver the content to the video players. The selection of a technique depends on the device, player, quality, and service. The results from our power measurements allow us to conclude that none of the identified techniques is optimal because they take none of the following facts into account: access technology used, user behaviour, and user preferences concerning data waste. However, we point out the techniques that provide the most attractive trade-offs in particular situations. Furthermore, we make several observations on the energy consumption of different players, containers, and video qualities that should be taken into consideration when optimizing the energy consumption.
{"title":"Dissecting mobile video services: An energy consumption perspective","authors":"M. A. Hoque, M. Siekkinen, J. Nurminen, Mika Aalto","doi":"10.1109/WoWMoM.2013.6583384","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583384","url":null,"abstract":"Multimedia streaming applications are among the most energy hungry applications in smartphones. The energy consumption mostly depends on the delivery techniques and on the power management techniques of wireless interfaces (Wi-Fi and 3G). In order to provide insights on what kind of streaming techniques exist, how they work on different mobile platforms, and what is their impact on the energy consumption of mobile phones, we have done a large set of active measurements with several smartphones having both Wi-Fi and cellular network access. Our analysis reveals five different techniques to deliver the content to the video players. The selection of a technique depends on the device, player, quality, and service. The results from our power measurements allow us to conclude that none of the identified techniques is optimal because they take none of the following facts into account: access technology used, user behaviour, and user preferences concerning data waste. However, we point out the techniques that provide the most attractive trade-offs in particular situations. Furthermore, we make several observations on the energy consumption of different players, containers, and video qualities that should be taken into consideration when optimizing the energy consumption.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115579189","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
扫码关注我们
求助内容：
应助结果提醒方式：