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.5700251
H. Kung, Chit-Kwan Lin, Tsung-Han Lin, Stephen J. Tarsa, D. Vlah
We consider the problem of mitigating a highly varying wireless channel between a transmitting ground node and receivers on a small, low-altitude unmanned aerial vehicle (UAV) in a 802.11 wireless mesh network. One approach is to use multiple transmitter and receiver nodes that exploit the channel's spatial/temporal diversity and that cooperate to improve overall packet reception. We present a series of measurement results from a real-world testbed that characterize the resulting wireless channel. We show that the correlation between receiver nodes on the airplane is poor at small time scales so receiver diversity can be exploited. Our measurements suggest that using several receiver nodes simultaneously can boost packet delivery rates substantially. Lastly, we show that similar results apply to transmitter selection diversity as well.
{"title":"Measuring diversity on a low-altitude UAV in a ground-to-air wireless 802.11 mesh network","authors":"H. Kung, Chit-Kwan Lin, Tsung-Han Lin, Stephen J. Tarsa, D. Vlah","doi":"10.1109/GLOCOMW.2010.5700251","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700251","url":null,"abstract":"We consider the problem of mitigating a highly varying wireless channel between a transmitting ground node and receivers on a small, low-altitude unmanned aerial vehicle (UAV) in a 802.11 wireless mesh network. One approach is to use multiple transmitter and receiver nodes that exploit the channel's spatial/temporal diversity and that cooperate to improve overall packet reception. We present a series of measurement results from a real-world testbed that characterize the resulting wireless channel. We show that the correlation between receiver nodes on the airplane is poor at small time scales so receiver diversity can be exploited. Our measurements suggest that using several receiver nodes simultaneously can boost packet delivery rates substantially. Lastly, we show that similar results apply to transmitter selection diversity as well.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"66 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":"115215714","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.5700250
Ben Pearre, T. Brown
Given multiple widespread stationary data sources such as ground-based sensors, an unmanned aircraft can fly over the sensors and gather the data via a wireless link. To minimize delays and system resources, the unmanned aircraft should collect the data at each node via the shortest trajectory. The trajectory planning is hampered by the complex vehicle and communication dynamics. We present a method that allows the ferry to optimize a multi-node data collection trajectory through an unknown radio field using reinforcement learning. The approach learns improved trajectories in situ obviating the need for detailed system identification. The ferry is able to quickly learn significantly improved trajectories compared to alternative heuristics.
{"title":"Model-free trajectory optimization for wireless data ferries among multiple sources","authors":"Ben Pearre, T. Brown","doi":"10.1109/GLOCOMW.2010.5700250","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700250","url":null,"abstract":"Given multiple widespread stationary data sources such as ground-based sensors, an unmanned aircraft can fly over the sensors and gather the data via a wireless link. To minimize delays and system resources, the unmanned aircraft should collect the data at each node via the shortest trajectory. The trajectory planning is hampered by the complex vehicle and communication dynamics. We present a method that allows the ferry to optimize a multi-node data collection trajectory through an unknown radio field using reinforcement learning. The approach learns improved trajectories in situ obviating the need for detailed system identification. The ferry is able to quickly learn significantly improved trajectories compared to alternative heuristics.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"81 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":"114175145","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.5700214
K. Yoshigoe
Wireless Sensor Networks (WSNs) often are deployed in harsh environment where reliable communication may not be feasible. This work proposes data-driven data transmission mechanism to improve packet delivery frequency especially in harsh communication environments. In particular, this work evaluates the effect of adjusting data transmission frequency based on data priority, to provide sufficient data quality while minimizing the energy consumption incurred by packet transmission. Increasing transmission frequency of critical messages improves the delivery of high resolution messages even if underlying network does not provide reliable transport while reducing the transmission frequency of non-critical messages contributes to energy conservation. Analytical and simulation evaluation confirm the effectiveness of the proposed dynamic data transmission frequency mechanism.
{"title":"Data-driven data transmission mechanism for wireless sensor networks in harsh communication environment","authors":"K. Yoshigoe","doi":"10.1109/GLOCOMW.2010.5700214","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700214","url":null,"abstract":"Wireless Sensor Networks (WSNs) often are deployed in harsh environment where reliable communication may not be feasible. This work proposes data-driven data transmission mechanism to improve packet delivery frequency especially in harsh communication environments. In particular, this work evaluates the effect of adjusting data transmission frequency based on data priority, to provide sufficient data quality while minimizing the energy consumption incurred by packet transmission. Increasing transmission frequency of critical messages improves the delivery of high resolution messages even if underlying network does not provide reliable transport while reducing the transmission frequency of non-critical messages contributes to energy conservation. Analytical and simulation evaluation confirm the effectiveness of the proposed dynamic data transmission frequency mechanism.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"30 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":"114655627","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.5700127
E. Yaacoub, Z. Dawy
Uplink scheduling in a multicell OFDMA system is considered. A non-collaborative intercell interference avoidance method is proposed, where base stations shut down certain subcarriers in a probabilistic manner based on the received interference level. Proportional fair scheduling is implemented in order to ensure fairness for cell edge users. A low complexity scheduling algorithm is proposed for this purpose. The probabilistic interference avoidance scheme is shown to achieve notable performance improvements compared to standard approaches from the literature.
{"title":"Proportional fair scheduling with probabilistic interference avoidance in the uplink of multicell OFDMA systems","authors":"E. Yaacoub, Z. Dawy","doi":"10.1109/GLOCOMW.2010.5700127","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700127","url":null,"abstract":"Uplink scheduling in a multicell OFDMA system is considered. A non-collaborative intercell interference avoidance method is proposed, where base stations shut down certain subcarriers in a probabilistic manner based on the received interference level. Proportional fair scheduling is implemented in order to ensure fairness for cell edge users. A low complexity scheduling algorithm is proposed for this purpose. The probabilistic interference avoidance scheme is shown to achieve notable performance improvements compared to standard approaches from the literature.","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":"114395218","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
扫码关注我们
求助内容：
应助结果提醒方式：