Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898918
Philipp M. Glatz, L. Hörmann, C. Steger, R. Weiss
Wireless sensor network (WSN) motes are resource constrained devices. This is due to optimizations tailoring them towards application-specific and cost-efficient scenarios and setups. Many to most of these optimizations are built upon power aware aspects and dependability measures due to the fact that battery technology still evolves quite slowly and WSN's inherent redundancy is suitable for fault-tolerant schemes. What we do here is implementing a programming paradigm where several applications may be distributed heterogeneously among different subsets of a WSN's motes. Multiple applications can be run side by side on the same mote. This is far more efficient than deploying hardware for each and every application. The Multi-Application Mid-dlewAre (MAMA) layer allows running different TinyOS applications at the same time easily. Concurrent sensor usage and messaging is handled by MAMA. Results from simulation runs, hardware deployments, power profiling and scope measurements show good scalability, only little timing and memory overhead and power efficient properties.
{"title":"MAMA: Multi-applicationmiddleware for efficient wireless sensor networks","authors":"Philipp M. Glatz, L. Hörmann, C. Steger, R. Weiss","doi":"10.1109/CTS.2011.5898918","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898918","url":null,"abstract":"Wireless sensor network (WSN) motes are resource constrained devices. This is due to optimizations tailoring them towards application-specific and cost-efficient scenarios and setups. Many to most of these optimizations are built upon power aware aspects and dependability measures due to the fact that battery technology still evolves quite slowly and WSN's inherent redundancy is suitable for fault-tolerant schemes. What we do here is implementing a programming paradigm where several applications may be distributed heterogeneously among different subsets of a WSN's motes. Multiple applications can be run side by side on the same mote. This is far more efficient than deploying hardware for each and every application. The Multi-Application Mid-dlewAre (MAMA) layer allows running different TinyOS applications at the same time easily. Concurrent sensor usage and messaging is handled by MAMA. Results from simulation runs, hardware deployments, power profiling and scope measurements show good scalability, only little timing and memory overhead and power efficient properties.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269864","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898980
YaDung. Pan, Xue-song Qiu, Shun-li Zhang
Virtual networks have emerged as a powerful and flexible platform for future network. The dependability of virtual services relies on the network's capabilities to effectively diagnose and recover faults. But the flexible characteristics of virtual networks bring to virtualization fault diagnosis new challenges, such as network scalability, inaccessible substrate network fault information, incomplete and inaccurate network observations, dynamic symptom-fault causality relationships, and multi-layer complexity. To tackle with these challenges, the paper proposes a virtual network fault diagnosis framework (called VNFD). VNFD can use observed end-to-end symptoms reported by monitoring systems to get a set of potential faulty components for evaluating their fault likelihood, and select the most likely faulty hypothesis set to explain all the observed symptoms. VNFD can locate root causes without relying on substrate network fault probabilistic quantification (e.g. prior fault probability). Simulations and experimental studies show that VNFD can efficiently and accurately get a hypothesis set explaining all the observed symptoms, even when the symptoms are incomplete and inaccurate.
{"title":"Fault diagnosis in network virtualization environment","authors":"YaDung. Pan, Xue-song Qiu, Shun-li Zhang","doi":"10.1109/CTS.2011.5898980","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898980","url":null,"abstract":"Virtual networks have emerged as a powerful and flexible platform for future network. The dependability of virtual services relies on the network's capabilities to effectively diagnose and recover faults. But the flexible characteristics of virtual networks bring to virtualization fault diagnosis new challenges, such as network scalability, inaccessible substrate network fault information, incomplete and inaccurate network observations, dynamic symptom-fault causality relationships, and multi-layer complexity. To tackle with these challenges, the paper proposes a virtual network fault diagnosis framework (called VNFD). VNFD can use observed end-to-end symptoms reported by monitoring systems to get a set of potential faulty components for evaluating their fault likelihood, and select the most likely faulty hypothesis set to explain all the observed symptoms. VNFD can locate root causes without relying on substrate network fault probabilistic quantification (e.g. prior fault probability). Simulations and experimental studies show that VNFD can efficiently and accurately get a hypothesis set explaining all the observed symptoms, even when the symptoms are incomplete and inaccurate.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121116624","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898992
M. Kheirabadi, Alireza Ghiamatioun, S. Nader-Esfahani
This paper focuses on the uplink transmission in a cellular system in which the channels in two neighboring cells are modeled as two mutually interfering multiple access channels (2-IMAC). The base stations (BSs) are equipped with multiple antennas while each user has only one antenna and K users are active in each cell. By increasing the number of users, it is shown in [1] that for single-antenna BSs, using interference alignment, each cell can approach the interference-free degrees of freedom (DOF) provided that the bandwidth is sufficiently large. But as the number of users grows, the correlation between adjacent subcarriers increases and this degrades the performance of interference alignment. The proposed scheme incorporates the concept of cyclic delay diversity (CDD) to reduce the correlation among subcarriers with the help of multiple antennas at the BSs. Simulation results show the performance improvement of the proposed scheme.
{"title":"Uplink interference alignment for OFDM systems","authors":"M. Kheirabadi, Alireza Ghiamatioun, S. Nader-Esfahani","doi":"10.1109/CTS.2011.5898992","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898992","url":null,"abstract":"This paper focuses on the uplink transmission in a cellular system in which the channels in two neighboring cells are modeled as two mutually interfering multiple access channels (2-IMAC). The base stations (BSs) are equipped with multiple antennas while each user has only one antenna and K users are active in each cell. By increasing the number of users, it is shown in [1] that for single-antenna BSs, using interference alignment, each cell can approach the interference-free degrees of freedom (DOF) provided that the bandwidth is sufficiently large. But as the number of users grows, the correlation between adjacent subcarriers increases and this degrades the performance of interference alignment. The proposed scheme incorporates the concept of cyclic delay diversity (CDD) to reduce the correlation among subcarriers with the help of multiple antennas at the BSs. Simulation results show the performance improvement of the proposed scheme.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124726823","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898965
H. Xiong, E. Bodanese
Orthogonal Frequency Division Multiple Access (OFDMA) has been used as a multiple access scheme in many infrastructure based wireless networks, such as IEEE 802.16, 3GPP LTE etc. because of its prominent features. Interestingly, there are only a few proposals on implementing OFDMA in mobile ad hoc networks. In this paper, a Signal-Strength based Medium Access Protocol (SSMAP) is proposed to orchestrate the channel access in OFDMA based mobile ad hoc networks. SSMAP introduces a sub-channel selection criterion which is based on the interference power of the subchannels in the receiver side aiming to reduce the co-channel interference and reduce the signaling overhead. The proposed sub-channel allocation scheme is fully distributed and each node does not need to exchange periodic update information with its neighbors. The simulation results illustrate the major performance advantages of SSMAP compared to prior channel access protocols, such as signal-radio multi-channel and multi-radio multi-channel in wireless ad hoc networks.
{"title":"A signal strength based medium access control for OFDMA based wireless ad hoc networks","authors":"H. Xiong, E. Bodanese","doi":"10.1109/CTS.2011.5898965","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898965","url":null,"abstract":"Orthogonal Frequency Division Multiple Access (OFDMA) has been used as a multiple access scheme in many infrastructure based wireless networks, such as IEEE 802.16, 3GPP LTE etc. because of its prominent features. Interestingly, there are only a few proposals on implementing OFDMA in mobile ad hoc networks. In this paper, a Signal-Strength based Medium Access Protocol (SSMAP) is proposed to orchestrate the channel access in OFDMA based mobile ad hoc networks. SSMAP introduces a sub-channel selection criterion which is based on the interference power of the subchannels in the receiver side aiming to reduce the co-channel interference and reduce the signaling overhead. The proposed sub-channel allocation scheme is fully distributed and each node does not need to exchange periodic update information with its neighbors. The simulation results illustrate the major performance advantages of SSMAP compared to prior channel access protocols, such as signal-radio multi-channel and multi-radio multi-channel in wireless ad hoc networks.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"37 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124843393","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898936
A. Iossifides
This paper proposes and analyzes a maximum aposteriori probability (MAP) coherent detector for Walsh-Hadamard multiplexed binary antipodal signals, based on vector detection at the code-length size of the Walsh-Hadamard codes. Tight bounds on the bit error probability that are analytically derived or numerically computed, together with simulation results, show significant performance gain over symbol-by-symbol MAP detection for either one-dimensional or two-dimensional system configurations that lead to pulse amplitude modulation (PAM) and quadrature amplitude modulation (QAM) rectangular constellations, respectively. In addition, the proposed system with MAP vector detection, presents great performance enhancement compared to standard binary phase shift keying (BPSK) modulation under identical information bit rate and mean power constraints, at a cost of higher instant power and moderate detection complexity.
{"title":"Optimum detection of Walsh-Hadamard multiplexed antipodal signals over Rayleigh fading channels","authors":"A. Iossifides","doi":"10.1109/CTS.2011.5898936","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898936","url":null,"abstract":"This paper proposes and analyzes a maximum aposteriori probability (MAP) coherent detector for Walsh-Hadamard multiplexed binary antipodal signals, based on vector detection at the code-length size of the Walsh-Hadamard codes. Tight bounds on the bit error probability that are analytically derived or numerically computed, together with simulation results, show significant performance gain over symbol-by-symbol MAP detection for either one-dimensional or two-dimensional system configurations that lead to pulse amplitude modulation (PAM) and quadrature amplitude modulation (QAM) rectangular constellations, respectively. In addition, the proposed system with MAP vector detection, presents great performance enhancement compared to standard binary phase shift keying (BPSK) modulation under identical information bit rate and mean power constraints, at a cost of higher instant power and moderate detection complexity.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116053432","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898923
Dimitrios Zorbas, C. Douligeris, V. Fodor
One of the main challenges in wireless sensor networks is to prolong the network lifetime by efficiently handling the limited battery life of the nodes. This problem becomes harder in applications where the nodes are randomly dropped in the field. In this paper we deal with the problem of the sink placement and of the network longevity, assuming a number of points in the field with known positions which must be covered by the sensors. Unlike other approaches, we consider the more realistic scenario where the coordinates of the sensors are not assumed to be known in advance and, thus, they cannot be used for the computation of the positions of the sinks. We present two solutions for the above problem; one based on the distance between the points and the second on the probability that a sensor may cover many points. We evaluate our approaches and compare them to algorithms that use the knowledge of the positions of the sensors in order to compute likely sink locations. It is shown that both proposed approaches present similar or better performance concerning network lifetime, while at the same time they significantly decrease the algorithm complexity.
{"title":"Target location based sink positioning in wireless sensor networks","authors":"Dimitrios Zorbas, C. Douligeris, V. Fodor","doi":"10.1109/CTS.2011.5898923","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898923","url":null,"abstract":"One of the main challenges in wireless sensor networks is to prolong the network lifetime by efficiently handling the limited battery life of the nodes. This problem becomes harder in applications where the nodes are randomly dropped in the field. In this paper we deal with the problem of the sink placement and of the network longevity, assuming a number of points in the field with known positions which must be covered by the sensors. Unlike other approaches, we consider the more realistic scenario where the coordinates of the sensors are not assumed to be known in advance and, thus, they cannot be used for the computation of the positions of the sinks. We present two solutions for the above problem; one based on the distance between the points and the second on the probability that a sensor may cover many points. We evaluate our approaches and compare them to algorithms that use the knowledge of the positions of the sensors in order to compute likely sink locations. It is shown that both proposed approaches present similar or better performance concerning network lifetime, while at the same time they significantly decrease the algorithm complexity.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122879393","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898921
L. Galdino, José Maranhão Neto, M. Furtado, E. Moschim, L. H. Bonani, F. Durand
The performance of Optical Code/Wavelength Conversion (OCWC) switch architectures are investigated in this work. We employed hybrid technologies within in Optical Burst Switching (OBS) networks, which include wavelength and optical code division multiplexing. The simulated results demonstrate the concomitant increase of optical codes per wavelength and the utilization of Sparse Partial Optical Code/Wavelength Conversion. Both lead to a considerable decrease of the Burst Blocking Probability (BBP). In addition, such hybrid approach also improves the utilization of network resources.
{"title":"Sparse partial optical Code and Wavelength Conversion architecture in hybrid WDM/OCDM OBS networks","authors":"L. Galdino, José Maranhão Neto, M. Furtado, E. Moschim, L. H. Bonani, F. Durand","doi":"10.1109/CTS.2011.5898921","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898921","url":null,"abstract":"The performance of Optical Code/Wavelength Conversion (OCWC) switch architectures are investigated in this work. We employed hybrid technologies within in Optical Burst Switching (OBS) networks, which include wavelength and optical code division multiplexing. The simulated results demonstrate the concomitant increase of optical codes per wavelength and the utilization of Sparse Partial Optical Code/Wavelength Conversion. Both lead to a considerable decrease of the Burst Blocking Probability (BBP). In addition, such hybrid approach also improves the utilization of network resources.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198131","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898988
K. Munasinghe, F. Javadi, A. Jamalipour
Multiple traffic flows generated by multiservice applications converge at the core of the Next Generation Network (NGN). Therefore, various admission control techniques are implemented at the NGN core for ensuring that the admittance of a new flow in a resource constrained network does not unfairly disadvantage the performance of other ongoing flows. Regardless of the admission control scheme used, as the resource availability diminishes with time, a competition among the newly arriving flows with various resource consumption levels and characteristics become inevitable. As in the case of any competition, there will be negative effects, which one flow has upon another by consuming or withholding access to a resource that is limited in availability. In this paper, the phenomenon of resource competition at the core of the NGN is explored. Under this study, the NGN is considered as an ecosystem with finite resources, which comprises of heterogeneous access networks. Despite the presence of an admission control mechanism, we argue that in a competitive environment, over a period of time, certain flows corresponding to certain service classes will unfairly overwhelm the others. Analytical proof and simulation results are provided for supporting the above argument.
{"title":"Resource competition at the NGN core network: An ecologically inspired analysis","authors":"K. Munasinghe, F. Javadi, A. Jamalipour","doi":"10.1109/CTS.2011.5898988","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898988","url":null,"abstract":"Multiple traffic flows generated by multiservice applications converge at the core of the Next Generation Network (NGN). Therefore, various admission control techniques are implemented at the NGN core for ensuring that the admittance of a new flow in a resource constrained network does not unfairly disadvantage the performance of other ongoing flows. Regardless of the admission control scheme used, as the resource availability diminishes with time, a competition among the newly arriving flows with various resource consumption levels and characteristics become inevitable. As in the case of any competition, there will be negative effects, which one flow has upon another by consuming or withholding access to a resource that is limited in availability. In this paper, the phenomenon of resource competition at the core of the NGN is explored. Under this study, the NGN is considered as an ecosystem with finite resources, which comprises of heterogeneous access networks. Despite the presence of an admission control mechanism, we argue that in a competitive environment, over a period of time, certain flows corresponding to certain service classes will unfairly overwhelm the others. Analytical proof and simulation results are provided for supporting the above argument.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569070","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898947
K. Qaraqe, Nariman Rahimian, H. Çelebi, C. Georghiades
Cognitive Radio (CR) systems are a promising solution to the spectrum scarcity problem. However, accurate modeling of spectrum utilization is essential to obtain a better quantitative understanding of important concepts of CR systems. Compact mathematical formulations that describe the realistic spectrum usage would improve the recent theoretical work to a large extent. The data generated from such models would also increase the quality of the simulation based research in the aspect of realism. Besides, in practice, measurement campaigns would prefer if they could characterize results with a few well known parameters instead of exchanging large amount of data. Therefore, in this paper we try to come up with a mathematical model for the spectrum usage by estimating the Probability Mass Function (PMF) of the number of occupied channels. Note that this also gives an insight regarding the spectrum availability. To do this, the data collected from a spectrum occupancy measurement campaign conducted in the State of Qatar is used. The measurements are performed over three consecutive days considering 700–3000 MHz frequency band at four different locations concurrently. We show that after applying the Chi square test, the Log-Normal distribution fits the best among other candidates to the empirical PMF independent of location and the threshold used to define a channel as occupied.
{"title":"Spatio-temporal measurement and model for number of occupied channels","authors":"K. Qaraqe, Nariman Rahimian, H. Çelebi, C. Georghiades","doi":"10.1109/CTS.2011.5898947","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898947","url":null,"abstract":"Cognitive Radio (CR) systems are a promising solution to the spectrum scarcity problem. However, accurate modeling of spectrum utilization is essential to obtain a better quantitative understanding of important concepts of CR systems. Compact mathematical formulations that describe the realistic spectrum usage would improve the recent theoretical work to a large extent. The data generated from such models would also increase the quality of the simulation based research in the aspect of realism. Besides, in practice, measurement campaigns would prefer if they could characterize results with a few well known parameters instead of exchanging large amount of data. Therefore, in this paper we try to come up with a mathematical model for the spectrum usage by estimating the Probability Mass Function (PMF) of the number of occupied channels. Note that this also gives an insight regarding the spectrum availability. To do this, the data collected from a spectrum occupancy measurement campaign conducted in the State of Qatar is used. The measurements are performed over three consecutive days considering 700–3000 MHz frequency band at four different locations concurrently. We show that after applying the Chi square test, the Log-Normal distribution fits the best among other candidates to the empirical PMF independent of location and the threshold used to define a channel as occupied.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"696 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970280","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898903
C. Patrikakis, A. Voulodimos, Emmanuel Sardis, N. Papaoulakis, Dora Christofi, Georgios Dimosthenous
In this paper we investigate the requirements and propose the design of a platform that will serve emergency operations such as in cases of wildfires or road accidents. This platform will provide assistance to the rescue and the disaster relief operations through the use of social networking and P2P based multimedia streaming. The general idea is to create a platform that will facilitate the provision of an efficient communication network between the stakeholders who will be involved in such life threatening situations and of the means for having a rich, multimedia based communication for first aid and guidance. Based on the use of the proposed platform the distribution of multimedia streams can be supported through innovative techniques such as media encoding and media distribution. The matching and notification of the most appropriate volunteers can be made through the use of personal profiles and the deployment of social networking tools. The access to multimedia content can be adapted to the obstacles which are introduced through the impairment of infrastructures of services capabilities.
{"title":"Emergency operations support through social networking and P2P multimedia services","authors":"C. Patrikakis, A. Voulodimos, Emmanuel Sardis, N. Papaoulakis, Dora Christofi, Georgios Dimosthenous","doi":"10.1109/CTS.2011.5898903","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898903","url":null,"abstract":"In this paper we investigate the requirements and propose the design of a platform that will serve emergency operations such as in cases of wildfires or road accidents. This platform will provide assistance to the rescue and the disaster relief operations through the use of social networking and P2P based multimedia streaming. The general idea is to create a platform that will facilitate the provision of an efficient communication network between the stakeholders who will be involved in such life threatening situations and of the means for having a rich, multimedia based communication for first aid and guidance. Based on the use of the proposed platform the distribution of multimedia streams can be supported through innovative techniques such as media encoding and media distribution. The matching and notification of the most appropriate volunteers can be made through the use of personal profiles and the deployment of social networking tools. The access to multimedia content can be adapted to the obstacles which are introduced through the impairment of infrastructures of services capabilities.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132799633","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
扫码关注我们
求助内容：
应助结果提醒方式：