Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928896
Shangguang Wang, Zibin Zheng, Qibo Sun, Hua Zou, Fangchun Yang
Cloud computing is Internet-based computing where computing resources are offered over the Internet as scalable, on-demand services. Web services are widely employed for building distributed cloud applications. Performance of web services may fluctuate due to the dynamic Internet environment, which makes the Quality-of-Service (QoS) inherently uncertain. With the increase of Web services in the Internet, selecting the optimal service from a set of functionally equivalent candidates becomes an important research problem. In this paper, we propose an efficient and effective QoS-aware service selection approach. Our approach first employs cloud model to compute the QoS uncertainty for pruning redundant services while extracting reliable services. Then, mixed integer programming is used to select optimal services. The experimental results show that our approach can provide reliable and efficient optimal service selection for users.
{"title":"Cloud model for service selection","authors":"Shangguang Wang, Zibin Zheng, Qibo Sun, Hua Zou, Fangchun Yang","doi":"10.1109/INFCOMW.2011.5928896","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928896","url":null,"abstract":"Cloud computing is Internet-based computing where computing resources are offered over the Internet as scalable, on-demand services. Web services are widely employed for building distributed cloud applications. Performance of web services may fluctuate due to the dynamic Internet environment, which makes the Quality-of-Service (QoS) inherently uncertain. With the increase of Web services in the Internet, selecting the optimal service from a set of functionally equivalent candidates becomes an important research problem. In this paper, we propose an efficient and effective QoS-aware service selection approach. Our approach first employs cloud model to compute the QoS uncertainty for pruning redundant services while extracting reliable services. Then, mixed integer programming is used to select optimal services. The experimental results show that our approach can provide reliable and efficient optimal service selection for users.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"9 Suppl 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116797599","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-04-10DOI: 10.1109/INFCOMW.2011.5928949
Shui Yu, Guofeng Zhao, Song Guo, Yang Xiang, A. Vasilakos
With the significant growth of botnets, application layer DDoS attacks are much easier to launch using large botnet, and false negative is always a problem for intrusion detection systems in real practice. In this paper, we propose a novel application layer DDoS attack tool, which mimics human browsing behavior following three statistical distributions, the Zipf-like distribution for web page popularity, the Pareto distribution for page request time interval for an individual browser, and the inverse Gaussian distribution for length of browsing path. A Markov model is established for individual bot to generate attack request traffic. Our experiments indicated that the attack traffic that generated by the proposed tool is pretty similar to the real traffic. As a result, the current statistics based detection algorithms will result high false negative rate in general. In order to counter this kind of attacks, we discussed a few preliminary solutions at the end of this paper.
{"title":"Browsing behavior mimicking attacks on popular web sites for large botnets","authors":"Shui Yu, Guofeng Zhao, Song Guo, Yang Xiang, A. Vasilakos","doi":"10.1109/INFCOMW.2011.5928949","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928949","url":null,"abstract":"With the significant growth of botnets, application layer DDoS attacks are much easier to launch using large botnet, and false negative is always a problem for intrusion detection systems in real practice. In this paper, we propose a novel application layer DDoS attack tool, which mimics human browsing behavior following three statistical distributions, the Zipf-like distribution for web page popularity, the Pareto distribution for page request time interval for an individual browser, and the inverse Gaussian distribution for length of browsing path. A Markov model is established for individual bot to generate attack request traffic. Our experiments indicated that the attack traffic that generated by the proposed tool is pretty similar to the real traffic. As a result, the current statistics based detection algorithms will result high false negative rate in general. In order to counter this kind of attacks, we discussed a few preliminary solutions at the end of this paper.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114832020","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-04-10DOI: 10.1109/INFCOMW.2011.5928923
Shao-Yu Lien, Kwang-Cheng Chen
Deploying 3GPP LTE-Advanced to the ISM band resolves the deployment issue of obtaining feasible bandwidth from crowded spectrum. However, considering that wireless local area networks (WLANs) have been deployed to the ISM band, recent researches show that LTE-Advanced needs to provide communication opportunities for WLANs. Such a coexistence relies on applying the cognitive radio technology to LTE-Advanced. However, the cognitive channel access leading to severe channel availability variation obstructs quality-of-service (QoS) guarantees in LTE-Advanced. To alleviate channel availability variation, we adopt a powerful technology known as the network multiple-input-multiple-output (MIMO) and propose the statistical traffic control scheme comprising the packet transmission scheduling and the admission control for LTE-Advanced to tackle critical challenges of the packet transmission coordination and the radio resources allocation in the network MIMO. Simulations results demonstrate an effective support of voice and video transmissions, thus enabling a successful coexistence with WLANs.
{"title":"Statistical traffic control for cognitive radio empowered LTE-Advanced with network MIMO","authors":"Shao-Yu Lien, Kwang-Cheng Chen","doi":"10.1109/INFCOMW.2011.5928923","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928923","url":null,"abstract":"Deploying 3GPP LTE-Advanced to the ISM band resolves the deployment issue of obtaining feasible bandwidth from crowded spectrum. However, considering that wireless local area networks (WLANs) have been deployed to the ISM band, recent researches show that LTE-Advanced needs to provide communication opportunities for WLANs. Such a coexistence relies on applying the cognitive radio technology to LTE-Advanced. However, the cognitive channel access leading to severe channel availability variation obstructs quality-of-service (QoS) guarantees in LTE-Advanced. To alleviate channel availability variation, we adopt a powerful technology known as the network multiple-input-multiple-output (MIMO) and propose the statistical traffic control scheme comprising the packet transmission scheduling and the admission control for LTE-Advanced to tackle critical challenges of the packet transmission coordination and the radio resources allocation in the network MIMO. Simulations results demonstrate an effective support of voice and video transmissions, thus enabling a successful coexistence with WLANs.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"383 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127589074","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-04-10DOI: 10.1109/INFCOMW.2011.5928812
G. López, Pedro S. Moura, J. I. Moreno, A. D. de Almeida
This paper presents the main features of the EU R&D project ENERsip. The main objective of this FP7 ICT project is to design, develop, and test an adaptive service-oriented M2M-based platform that enables optimizing, in near real-time, and saving energy by remotely monitoring, controlling and coordinating power generation and consumption within neighborhoods with energy-positive buildings. The paper describes the system architecture designed to meet such requirements, putting special emphasis on the M2M communication infrastructure. The novel services that will be delivered on top of such M2M communication infrastructure and the potential users who will enjoy them are also presented. Finally, the ENERsip platform validation plan is outlined.
{"title":"ENERsip: M2M-based platform to enable energy efficiency within energy-positive neighbourhoods","authors":"G. López, Pedro S. Moura, J. I. Moreno, A. D. de Almeida","doi":"10.1109/INFCOMW.2011.5928812","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928812","url":null,"abstract":"This paper presents the main features of the EU R&D project ENERsip. The main objective of this FP7 ICT project is to design, develop, and test an adaptive service-oriented M2M-based platform that enables optimizing, in near real-time, and saving energy by remotely monitoring, controlling and coordinating power generation and consumption within neighborhoods with energy-positive buildings. The paper describes the system architecture designed to meet such requirements, putting special emphasis on the M2M communication infrastructure. The novel services that will be delivered on top of such M2M communication infrastructure and the potential users who will enjoy them are also presented. Finally, the ENERsip platform validation plan is outlined.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125600806","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-04-10DOI: 10.1109/infcomw.2011.5928798
A. Germoni, P. Testa, R. Sabella, M. Listanti
The main requirement for the Next Generation Transport Network infrastructure is a flexible and efficient support of different services, demanding for several levels of Quality of Service (QoS) and resilience. In order to have an effective utilization of network resources, and the ability to react to traffic demand changes with time, such multi-service next generation transport networks, should be, to some extend, self-adapting. This requirement are pushing the migration from the traditional legacy circuit based transport networks towards integrated packet optical solutions. The need to introduce packet flexibility into the optics world relying on huge and reliable static pipes, without impacting the scalability of the nodes has lead to multilayer solutions such as current MSPP and POTP platforms based on multiple switching layers (i.e. packet, OTN and optical). This however requires complex control plane functionalities that limit their effectiveness and flexibility. This paper presents a new approach for next generation optical packet transport, based on a pure Layer 2 switching, that is Ethernet compliant since it does not require changes in Ethernet frame format and main Ethernet switch functionalities. It relies on a burst transmission structure that allows to reduce packet processing without introducing underlaid switching layers and consequently to scale switch forwarding functionalities. It could be regarded as a concrete step towards the realization of self-adapting networks. Some relevant simulation results are reported to discuss the main characteristics of such a new transport solution and assess the feasibility of the concept.
{"title":"Ethernet burst transport for next generation optical metro networks","authors":"A. Germoni, P. Testa, R. Sabella, M. Listanti","doi":"10.1109/infcomw.2011.5928798","DOIUrl":"https://doi.org/10.1109/infcomw.2011.5928798","url":null,"abstract":"The main requirement for the Next Generation Transport Network infrastructure is a flexible and efficient support of different services, demanding for several levels of Quality of Service (QoS) and resilience. In order to have an effective utilization of network resources, and the ability to react to traffic demand changes with time, such multi-service next generation transport networks, should be, to some extend, self-adapting. This requirement are pushing the migration from the traditional legacy circuit based transport networks towards integrated packet optical solutions. The need to introduce packet flexibility into the optics world relying on huge and reliable static pipes, without impacting the scalability of the nodes has lead to multilayer solutions such as current MSPP and POTP platforms based on multiple switching layers (i.e. packet, OTN and optical). This however requires complex control plane functionalities that limit their effectiveness and flexibility. This paper presents a new approach for next generation optical packet transport, based on a pure Layer 2 switching, that is Ethernet compliant since it does not require changes in Ethernet frame format and main Ethernet switch functionalities. It relies on a burst transmission structure that allows to reduce packet processing without introducing underlaid switching layers and consequently to scale switch forwarding functionalities. It could be regarded as a concrete step towards the realization of self-adapting networks. Some relevant simulation results are reported to discuss the main characteristics of such a new transport solution and assess the feasibility of the concept.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124794166","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-04-10DOI: 10.1109/INFCOMW.2011.5928927
Hassan Gobjuka, Kamal A. Ahmat
In this paper, we investigate the problem of improving the performance and scalability of large firewall policies that comprise thousands of rules by detecting and resolving any potential conflicts among them. We present a novel, highly scalable data structure that requires O(n) space where n is the number of rules in the policy to represent the dependency among rules. After that, we describe a practical heuristic that utilizes our data structure to find conflicting rules, and consequently find an optimal ordering of consistent ones. Our algorithm has time complexity O(n2 log n), making it the fastest to-date known algorithm for firewall rule anomaly dis- covery and resolution. We validate the practicality of our algorithm through real-life firewall policies and synthetic firewall policies of large data. Performance results show that our heuristic algorithm achieves from 40% to 87% improvement in the number of comparisons overhead, comparatively with the original policies.
{"title":"Fast and scalable method for resolving anomalies in firewall policies","authors":"Hassan Gobjuka, Kamal A. Ahmat","doi":"10.1109/INFCOMW.2011.5928927","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928927","url":null,"abstract":"In this paper, we investigate the problem of improving the performance and scalability of large firewall policies that comprise thousands of rules by detecting and resolving any potential conflicts among them. We present a novel, highly scalable data structure that requires O(n) space where n is the number of rules in the policy to represent the dependency among rules. After that, we describe a practical heuristic that utilizes our data structure to find conflicting rules, and consequently find an optimal ordering of consistent ones. Our algorithm has time complexity O(n2 log n), making it the fastest to-date known algorithm for firewall rule anomaly dis- covery and resolution. We validate the practicality of our algorithm through real-life firewall policies and synthetic firewall policies of large data. Performance results show that our heuristic algorithm achieves from 40% to 87% improvement in the number of comparisons overhead, comparatively with the original policies.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"16 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124359900","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-04-10DOI: 10.1109/INFCOMW.2011.5928799
G. Shen, Limei Peng, Yunfeng Shen, H. Sardesai
Most of the studies on traffic grooming focus on minimizing network link capacity and providing serving-relationship between client services and link capacity. Subsequent to this step, it is important to plan for adding/dropping client services over client service ports and setting up end-to-end lightpaths over network ports, which is however seldom investigated. We call such effort node hardware module planning. This is an industrially practical problem aiming to minimize node hardware cost since hardware modules are the most expensive components in a network. Based on a link-based traffic grooming result that provides information on end-to-end capacity units incident to nodes and aggregation relationship between client services and capacity units, we develop an Integer Linear Programming (ILP) model to optimally plan hardware modules. To overcome the computation difficulty of the ILP model under large-sized planning scenarios, we also develop a fast sub-optimal heuristic for hardware module planning. Simulation studies indicate that the heuristic is efficient to achieve a design close to an optimal solution obtained by the ILP model. Also, the evaluation of the impact of switch backplane size shows that given a certain set of network modules, an optimal switch backplane size exists, which achieves the lowest hardware cost.
{"title":"Optimal node hardware module planning for layer-one Optical Transport Networks","authors":"G. Shen, Limei Peng, Yunfeng Shen, H. Sardesai","doi":"10.1109/INFCOMW.2011.5928799","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928799","url":null,"abstract":"Most of the studies on traffic grooming focus on minimizing network link capacity and providing serving-relationship between client services and link capacity. Subsequent to this step, it is important to plan for adding/dropping client services over client service ports and setting up end-to-end lightpaths over network ports, which is however seldom investigated. We call such effort node hardware module planning. This is an industrially practical problem aiming to minimize node hardware cost since hardware modules are the most expensive components in a network. Based on a link-based traffic grooming result that provides information on end-to-end capacity units incident to nodes and aggregation relationship between client services and capacity units, we develop an Integer Linear Programming (ILP) model to optimally plan hardware modules. To overcome the computation difficulty of the ILP model under large-sized planning scenarios, we also develop a fast sub-optimal heuristic for hardware module planning. Simulation studies indicate that the heuristic is efficient to achieve a design close to an optimal solution obtained by the ILP model. Also, the evaluation of the impact of switch backplane size shows that given a certain set of network modules, an optimal switch backplane size exists, which achieves the lowest hardware cost.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123476524","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-04-10DOI: 10.1109/INFCOMW.2011.5928958
Neeraj Jaggi, Umesh MarappaReddy, R. Bagai
We first illustrate using examples that existing measures in literature are not sufficient to fully characterize the anonymity provided by an anonymous system. We then propose a new isolation measure, based upon presence of outliers in a distribution, and show that this measure is critical towards quantifying the overall anonymity provided by the system. We provide justification for three distinct aspects of anonymity, important from the perspectives of a user, a system designer, and an attacker, leading to a three-dimensional approach towards measuring sender anonymity. We further show how two anonymous systems can be compared in terms of the degree of anonymity provided, using the proposed 3-tuple metric and appropriate weights reflecting the attributes desired in the system. Finally, we apply the proposed metric to an existing anonymous system and discuss the insights gained.
{"title":"A three-dimensional approach towards measuring sender anonymity","authors":"Neeraj Jaggi, Umesh MarappaReddy, R. Bagai","doi":"10.1109/INFCOMW.2011.5928958","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928958","url":null,"abstract":"We first illustrate using examples that existing measures in literature are not sufficient to fully characterize the anonymity provided by an anonymous system. We then propose a new isolation measure, based upon presence of outliers in a distribution, and show that this measure is critical towards quantifying the overall anonymity provided by the system. We provide justification for three distinct aspects of anonymity, important from the perspectives of a user, a system designer, and an attacker, leading to a three-dimensional approach towards measuring sender anonymity. We further show how two anonymous systems can be compared in terms of the degree of anonymity provided, using the proposed 3-tuple metric and appropriate weights reflecting the attributes desired in the system. Finally, we apply the proposed metric to an existing anonymous system and discuss the insights gained.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121827070","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-04-10DOI: 10.1109/INFCOMW.2011.5928856
M. Moore, T. Nakano
A transmitter nanomachine performs molecular communication to transmit information to a receiver nanomachine using molecules (e.g. calcium ions, DNA) as the transmission medium. Existing approaches use the type of molecule to address receivers within a local broadcast area. In the proposed system, molecular beacons provide distance measurements using molecular communication to establish a coordinate system (e.g. molecular beacons form a concentration gradient using a few types of beacon molecules). Transmitters then address a receiver at a location by the distance from the receiver to each beacon. A transmitter communicates by encapsulating information into a molecular device capable of active transport and distance measurement (e.g. a bacterium performs chemotaxis to a location with the corresponding concentrations of each type of beacon molecule). This paper describes a model of the proposed system, simulation model for the example of bacterial chemotaxis, and measurement of success rate and delay.
{"title":"Addressing by beacon coordinates using molecular communication","authors":"M. Moore, T. Nakano","doi":"10.1109/INFCOMW.2011.5928856","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928856","url":null,"abstract":"A transmitter nanomachine performs molecular communication to transmit information to a receiver nanomachine using molecules (e.g. calcium ions, DNA) as the transmission medium. Existing approaches use the type of molecule to address receivers within a local broadcast area. In the proposed system, molecular beacons provide distance measurements using molecular communication to establish a coordinate system (e.g. molecular beacons form a concentration gradient using a few types of beacon molecules). Transmitters then address a receiver at a location by the distance from the receiver to each beacon. A transmitter communicates by encapsulating information into a molecular device capable of active transport and distance measurement (e.g. a bacterium performs chemotaxis to a location with the corresponding concentrations of each type of beacon molecule). This paper describes a model of the proposed system, simulation model for the example of bacterial chemotaxis, and measurement of success rate and delay.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123552687","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-04-10DOI: 10.1109/INFCOMW.2011.5928878
Liang He, Jianping Pan, Jingdong Xu
The introduction of mobile elements has created a new dimension to reduce and balance energy consumption in wireless sensor networks, however, data collection latency may become higher. Thus the scheduling of mobile elements, i.e., how they traverse through the sensing field and when they collect data from which sensor, is of ultimate importance and has attracted increasing attention from the research community. Formulated as the Traveling Salesman Problem with Neighborhoods (TSPN) and due to its NP-hardness, so far only approximation and heuristic algorithms have appeared in the literature, but the former only have theoretical value now due to their large approximation factors. In this paper, following a progressive optimization approach, we propose a combine-skip-substitute (css) scheme, which is shown to outperform the best known heuristic algorithm. Besides the correctness and complexity analysis of the proposed scheme, we also show its performance and potentials for further extension through extensive simulation results.
{"title":"Reducing data collection latency in Wireless sensor networks with mobile elements","authors":"Liang He, Jianping Pan, Jingdong Xu","doi":"10.1109/INFCOMW.2011.5928878","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928878","url":null,"abstract":"The introduction of mobile elements has created a new dimension to reduce and balance energy consumption in wireless sensor networks, however, data collection latency may become higher. Thus the scheduling of mobile elements, i.e., how they traverse through the sensing field and when they collect data from which sensor, is of ultimate importance and has attracted increasing attention from the research community. Formulated as the Traveling Salesman Problem with Neighborhoods (TSPN) and due to its NP-hardness, so far only approximation and heuristic algorithms have appeared in the literature, but the former only have theoretical value now due to their large approximation factors. In this paper, following a progressive optimization approach, we propose a combine-skip-substitute (css) scheme, which is shown to outperform the best known heuristic algorithm. Besides the correctness and complexity analysis of the proposed scheme, we also show its performance and potentials for further extension through extensive simulation results.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115091218","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
扫码关注我们
求助内容：
应助结果提醒方式：