Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700221
E. Menegatti, M. Danieletto, M. Mina, A. Pretto, A. Bardella, S. Zanconato, P. Zanuttigh, A. Zanella
This paper presents a framework that enables the interaction of robotic systems and wireless sensor network technologies for discovering, localizing and recognizing a number of smart objects (SO) placed in an unknown environment. Starting with no a priori knowledge of the environment, the robot will progressively build a virtual reconstruction of the surroundings in three phases: first, it discovers the SOs located in the area by using radio communication; second, it performs a rough localization of the SOs by using a range-only SLAM algorithm based on the RSSI-range measurements; third, it refines the SOs localization by comparing the descriptors extracted from the images acquired by the onboard camera with those transmitted by the motes attached to the SOs. Experimental results show how the combined use of the RSSI data and of the image features allows to discover and localize the SOs located in the environment with a good accuracy.
{"title":"Autonomous discovery, localization and recognition of smart objects through WSN and image features","authors":"E. Menegatti, M. Danieletto, M. Mina, A. Pretto, A. Bardella, S. Zanconato, P. Zanuttigh, A. Zanella","doi":"10.1109/GLOCOMW.2010.5700221","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700221","url":null,"abstract":"This paper presents a framework that enables the interaction of robotic systems and wireless sensor network technologies for discovering, localizing and recognizing a number of smart objects (SO) placed in an unknown environment. Starting with no a priori knowledge of the environment, the robot will progressively build a virtual reconstruction of the surroundings in three phases: first, it discovers the SOs located in the area by using radio communication; second, it performs a rough localization of the SOs by using a range-only SLAM algorithm based on the RSSI-range measurements; third, it refines the SOs localization by comparing the descriptors extracted from the images acquired by the onboard camera with those transmitted by the motes attached to the SOs. Experimental results show how the combined use of the RSSI data and of the image features allows to discover and localize the SOs located in the environment with a good accuracy.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133743837","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700265
Anxiao Jiang, Yue Wang
Rank modulation is a scheme that uses the relative order of cell levels to represent data. Its applications include flash memories, phase-change memories, etc. An extension of rank modulation is studied in this paper, where multiple cells can have the same rank. We focus on the rewriting of data based on this new scheme, and study its basic properties.
{"title":"Rank modulation with multiplicity","authors":"Anxiao Jiang, Yue Wang","doi":"10.1109/GLOCOMW.2010.5700265","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700265","url":null,"abstract":"Rank modulation is a scheme that uses the relative order of cell levels to represent data. Its applications include flash memories, phase-change memories, etc. An extension of rank modulation is studied in this paper, where multiple cells can have the same rank. We focus on the rewriting of data based on this new scheme, and study its basic properties.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133949041","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700406
G. de la Roche, Á. Ladányi, D. López-Pérez, Chia-Chin Chong, Jie Zhang
Femtocells are envisioned to be deployed in indoor environments in order to improve both radio coverage and system capacity. This paper focuses on the self-organization of enterprise femtocells, which is certainly more challenging than that of home femtocells. In the context of 3GPP LTE, we propose solutions to automatically tune parameters such as radio spectrum, pilot power, resource blocks, and access control mechanisms for optimal performance via self-organization network (SON). Furthermore, on-site radio measurements and system-level simulations are used to benchmark their performance.
{"title":"Self-organization for LTE enterprise femtocells","authors":"G. de la Roche, Á. Ladányi, D. López-Pérez, Chia-Chin Chong, Jie Zhang","doi":"10.1109/GLOCOMW.2010.5700406","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700406","url":null,"abstract":"Femtocells are envisioned to be deployed in indoor environments in order to improve both radio coverage and system capacity. This paper focuses on the self-organization of enterprise femtocells, which is certainly more challenging than that of home femtocells. In the context of 3GPP LTE, we propose solutions to automatically tune parameters such as radio spectrum, pilot power, resource blocks, and access control mechanisms for optimal performance via self-organization network (SON). Furthermore, on-site radio measurements and system-level simulations are used to benchmark their performance.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133961580","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700143
D. Vergados, Aggeliki Sgora, D. Vergados
In wireless multihop networks, route selection plays an important role in network performance in terms of throughput capacity, as well as, energy efficiency. In general, the route selection strategy should distribute the traffic throughout the network, in order to avoid congestion. This strategy also has the side-effect of distributing the energy consumption among all nodes, so that the energy starvation of highly used nodes is avoided. However, the optimal route selection strategy is not always the same with respect to throughput and energy efficiency. In this paper we evaluate several route selection strategies in terms of average message transmission durations and network connectivity lifetime. The simulation results show which strategy is more beneficial for each objective, and how a combination of strategies may lead to balanced results.
{"title":"Energy and throughput efficiency in wireless multihop networks","authors":"D. Vergados, Aggeliki Sgora, D. Vergados","doi":"10.1109/GLOCOMW.2010.5700143","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700143","url":null,"abstract":"In wireless multihop networks, route selection plays an important role in network performance in terms of throughput capacity, as well as, energy efficiency. In general, the route selection strategy should distribute the traffic throughout the network, in order to avoid congestion. This strategy also has the side-effect of distributing the energy consumption among all nodes, so that the energy starvation of highly used nodes is avoided. However, the optimal route selection strategy is not always the same with respect to throughput and energy efficiency. In this paper we evaluate several route selection strategies in terms of average message transmission durations and network connectivity lifetime. The simulation results show which strategy is more beneficial for each objective, and how a combination of strategies may lead to balanced results.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134434072","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700192
Soraya Ait Chellouche, D. Négru, E. Borcoci, Eric LeBars
Internet video services have experienced an immense popularity in the recent years and will probably be the dominant applications of Future Internet. Therefore, the design of scalable video distribution systems that on the one hand, improve the end-users experience and deal with theirs context heterogeneity and on the other hand, optimize the cost of these services, is becoming a very important and challenging issue. One common approach for this purpose is the server replication. Nevertheless, this approach brings new issues such as the server selection (how to direct the user request to the closest replica), the servers' placement, etc. This paper deals with the server selection issue. Thus, we present a two-level filtering based server selection. The policy-based filtering retrieves the list of servers whose services matches the client context while The metric-based filtering select from this list the most convenient server that on the one hand, avoid the servers overload and in the other hand, copes with the underlying network state and capabilities. The paper also presents the preliminary evaluation of the proposed video provisioning scheme. The promising results led to more extensive evaluation of the approach and later to the launch of real developments in the framework of a large-scale European project which objective focuses on Future Media Internet.
{"title":"Anycast-based context-aware server selection strategy for VoD services","authors":"Soraya Ait Chellouche, D. Négru, E. Borcoci, Eric LeBars","doi":"10.1109/GLOCOMW.2010.5700192","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700192","url":null,"abstract":"Internet video services have experienced an immense popularity in the recent years and will probably be the dominant applications of Future Internet. Therefore, the design of scalable video distribution systems that on the one hand, improve the end-users experience and deal with theirs context heterogeneity and on the other hand, optimize the cost of these services, is becoming a very important and challenging issue. One common approach for this purpose is the server replication. Nevertheless, this approach brings new issues such as the server selection (how to direct the user request to the closest replica), the servers' placement, etc. This paper deals with the server selection issue. Thus, we present a two-level filtering based server selection. The policy-based filtering retrieves the list of servers whose services matches the client context while The metric-based filtering select from this list the most convenient server that on the one hand, avoid the servers overload and in the other hand, copes with the underlying network state and capabilities. The paper also presents the preliminary evaluation of the proposed video provisioning scheme. The promising results led to more extensive evaluation of the approach and later to the launch of real developments in the framework of a large-scale European project which objective focuses on Future Media Internet.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133396427","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700337
Takeru Inoue, Yohei Katayama, Hiroshi Sato, Takahiro Yamazaki, N. Takahashi
Many applications in the current Internet follow the multicast paradigm, not the unicast one that has traditionally ruled the design of TCP/IP. These applications are, therefore, required to construct overlay networks for multicasting, which unfortunately offers too little efficiency to support the immanent emergence of trillions of groups. IP multicast, which is the natural implementation of the multicast paradigm, has not been deployed widely. Though recent years have seen several alternatives, we still have no clear direction for future networks that provide the multicast functionality efficiently. The aim of this paper is to indicate the most promising research direction on the multicast forwarding plane of future networks. Through intensive analysis, we conclude that packet-driven forwarding (source routing) has several advantages over traditional table-driven forwarding including IP multicast.
{"title":"Multicast forwarding plane in future networks: Source routing has a competitive edge","authors":"Takeru Inoue, Yohei Katayama, Hiroshi Sato, Takahiro Yamazaki, N. Takahashi","doi":"10.1109/GLOCOMW.2010.5700337","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700337","url":null,"abstract":"Many applications in the current Internet follow the multicast paradigm, not the unicast one that has traditionally ruled the design of TCP/IP. These applications are, therefore, required to construct overlay networks for multicasting, which unfortunately offers too little efficiency to support the immanent emergence of trillions of groups. IP multicast, which is the natural implementation of the multicast paradigm, has not been deployed widely. Though recent years have seen several alternatives, we still have no clear direction for future networks that provide the multicast functionality efficiently. The aim of this paper is to indicate the most promising research direction on the multicast forwarding plane of future networks. Through intensive analysis, we conclude that packet-driven forwarding (source routing) has several advantages over traditional table-driven forwarding including IP multicast.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"106 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133686319","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700292
Efstratios G. Dimopoulos, P. A. Frangoudis, George C. Polyzos
With the low installation and maintenance cost of IEEE 802.11-based equipment, dense Wi-Fi deployments are a reality, especially in today's urban areas. This vast number of WLANs can be exploited to achieve low-cost ubiquitous wireless Internet access, which is also demostrated by the emergence of community-based wireless access schemes. In our prior work we have developed a reciprocity-based peer-to-peer architecture for Wi-Fi sharing, where peers provide free Wi-Fi access to others in order to enjoy the same benefit when they are away from their own Wi-Fi network. Our system tries to match peer consumption with contribution and we have shown it to work well for city-scale Wi-Fi sharing communities. However, when attempting to roam outside the city boundaries, the statistics are such that there is typically a lack of consumption-contribution information between consuming and providing members, which hinders the system's scalability. In this work, we extend our architecture with global-scale roaming capabilities by relaxing the requirement for full decentralization. In particular, we exploit special trusted super-peers which act as representatives of different Wi-Fi sharing communities (e.g., communities of different geographical regions) and which mediate transactions when there is insufficient information about peer contribution history. Extensive simulations show that this super-peer-assisted approach can significantly enhance the system's performance in terms of roaming coverage.
{"title":"Exploiting super peers for large-scale peer-to-peer Wi-Fi roaming","authors":"Efstratios G. Dimopoulos, P. A. Frangoudis, George C. Polyzos","doi":"10.1109/GLOCOMW.2010.5700292","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700292","url":null,"abstract":"With the low installation and maintenance cost of IEEE 802.11-based equipment, dense Wi-Fi deployments are a reality, especially in today's urban areas. This vast number of WLANs can be exploited to achieve low-cost ubiquitous wireless Internet access, which is also demostrated by the emergence of community-based wireless access schemes. In our prior work we have developed a reciprocity-based peer-to-peer architecture for Wi-Fi sharing, where peers provide free Wi-Fi access to others in order to enjoy the same benefit when they are away from their own Wi-Fi network. Our system tries to match peer consumption with contribution and we have shown it to work well for city-scale Wi-Fi sharing communities. However, when attempting to roam outside the city boundaries, the statistics are such that there is typically a lack of consumption-contribution information between consuming and providing members, which hinders the system's scalability. In this work, we extend our architecture with global-scale roaming capabilities by relaxing the requirement for full decentralization. In particular, we exploit special trusted super-peers which act as representatives of different Wi-Fi sharing communities (e.g., communities of different geographical regions) and which mediate transactions when there is insufficient information about peer contribution history. Extensive simulations show that this super-peer-assisted approach can significantly enhance the system's performance in terms of roaming coverage.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124957068","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700263
Eitan Yaakobi, Jing Ma, Laura M. Grupp, P. Siegel, S. Swanson, J. Wolf
In this work, we use an extensive empirical database of errors induced by write, read, and erase operations to develop a comprehensive understanding of the error behavior of flash memories. Error characterization of MLC and SLC flash is given on the block, page, and bit level. Based on our error characterization in MLC flash, we propose an error-correcting scheme which outperforms the conventional BCH code. We compare several schemes which use an MLC block as an SLC block. Finally, an implementation of two-write WOM-codes in SLC flash is given as well as the BER for the first and second write.
{"title":"Error characterization and coding schemes for flash memories","authors":"Eitan Yaakobi, Jing Ma, Laura M. Grupp, P. Siegel, S. Swanson, J. Wolf","doi":"10.1109/GLOCOMW.2010.5700263","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700263","url":null,"abstract":"In this work, we use an extensive empirical database of errors induced by write, read, and erase operations to develop a comprehensive understanding of the error behavior of flash memories. Error characterization of MLC and SLC flash is given on the block, page, and bit level. Based on our error characterization in MLC flash, we propose an error-correcting scheme which outperforms the conventional BCH code. We compare several schemes which use an MLC block as an SLC block. Finally, an implementation of two-write WOM-codes in SLC flash is given as well as the BER for the first and second write.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134228622","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700169
A. Fehske, P. Marsch, G. Fettweis
Energy consumption is lately receiving increased interest, and research efforts to assess the energy efficiency of cellular communication networks are made. This paper addresses the tradeoffs between gains in cell throughput that can be expected from coordinated multi point transmission and reception technologies and the increased energy consumption that they induce in cellular base stations. We explicitly consider effective transmission rates, taking into account the additional pilot, control and feedback overhead required for CoMP schemes, and determine the bit per Joule efficiency of network models for common propagation parameters under varying network densities and cooperation cluster sizes.
{"title":"Bit per Joule efficiency of cooperating base stations in cellular networks","authors":"A. Fehske, P. Marsch, G. Fettweis","doi":"10.1109/GLOCOMW.2010.5700169","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700169","url":null,"abstract":"Energy consumption is lately receiving increased interest, and research efforts to assess the energy efficiency of cellular communication networks are made. This paper addresses the tradeoffs between gains in cell throughput that can be expected from coordinated multi point transmission and reception technologies and the increased energy consumption that they induce in cellular base stations. We explicitly consider effective transmission rates, taking into account the additional pilot, control and feedback overhead required for CoMP schemes, and determine the bit per Joule efficiency of network models for common propagation parameters under varying network densities and cooperation cluster sizes.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134598520","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700086
H. Moradi, H. Refai, P. Lopresti, Mohammed Atiquzzaman
The availability of Channel State Information (CSI) at the receiver side of a Free Space Optical (FSO) link is required for optimal detection and diversity combining. Consequently, providing instantaneous CSI knowledge introduces challenges to receiver design and an increase in estimation error and bandwidth waste. In this work we investigate two selection-combining diversity schemes and their achieved gains when perfect instantaneous CSI is not available. An average SNR estimation value at the receiver is used for branch selection, and signal combining is performed with branch balance and unbalance. Channel fading is modeled as a lognormal distribution with spatially correlated samples. BER performance and outage probabilities are analytically characterized. Further, analytical results are verified using computer simulation.
{"title":"Selection diversity for wireless optical communications with non-coherent detection without CSI","authors":"H. Moradi, H. Refai, P. Lopresti, Mohammed Atiquzzaman","doi":"10.1109/GLOCOMW.2010.5700086","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700086","url":null,"abstract":"The availability of Channel State Information (CSI) at the receiver side of a Free Space Optical (FSO) link is required for optimal detection and diversity combining. Consequently, providing instantaneous CSI knowledge introduces challenges to receiver design and an increase in estimation error and bandwidth waste. In this work we investigate two selection-combining diversity schemes and their achieved gains when perfect instantaneous CSI is not available. An average SNR estimation value at the receiver is used for branch selection, and signal combining is performed with branch balance and unbalance. Channel fading is modeled as a lognormal distribution with spatially correlated samples. BER performance and outage probabilities are analytically characterized. Further, analytical results are verified using computer simulation.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131461396","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
扫码关注我们
求助内容：
应助结果提醒方式：