Pub Date : 2016-06-27DOI: 10.1109/ISCC.2016.7543748
Samia Dardouri, R. Bouallègue, A. Wei
The QoS (Quality of Service) requirements of real time (RT) applications are within the most important challenges that LTE (Long Term Evolution) must provide. However, due to the limited radio resources, it is important to take advantage of these resources efficiently. User traffic can be classified into two main classes which are RT (Real Time) and NRT traffic. To respond to RTs QoS requirements, resource allocation steps must be as optimal as possible. This paper proposes a scheduling algorithm in two levels based on cooperative game theory, aiming at improving performance and justice in the distribution of radio resources. Simulations demonstrate that the proposed algorithm improve the level of the system's QoS more effectively than other algorithms under the circumstance that guarantees users minimum QoS requirement.
{"title":"Resource allocation using Nucleolus Value in downlink LTE networks","authors":"Samia Dardouri, R. Bouallègue, A. Wei","doi":"10.1109/ISCC.2016.7543748","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543748","url":null,"abstract":"The QoS (Quality of Service) requirements of real time (RT) applications are within the most important challenges that LTE (Long Term Evolution) must provide. However, due to the limited radio resources, it is important to take advantage of these resources efficiently. User traffic can be classified into two main classes which are RT (Real Time) and NRT traffic. To respond to RTs QoS requirements, resource allocation steps must be as optimal as possible. This paper proposes a scheduling algorithm in two levels based on cooperative game theory, aiming at improving performance and justice in the distribution of radio resources. Simulations demonstrate that the proposed algorithm improve the level of the system's QoS more effectively than other algorithms under the circumstance that guarantees users minimum QoS requirement.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772539","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543720
M. Furini, M. Montangero
Social media platforms contain interesting information that can be used to directly measure people' feelings and, thanks to the use of communication technologies, also to geographically locate these feelings. Unfortunately, the understanding is not as easy as one may think. Indeed, the large volume of data makes the manual approach impractical and the diversity of language combined with the brevity of the texts makes the automatic approach quite complicated. In this paper, we consider the gamification approach to sentimentally classify tweets and we propose TSentiment, a game with a purpose that uses human beings to classify the polarity of tweets (e.g., positive, negative, neutral) and their sentiment (e.g., joy, surprise, sadness, etc.). We created a dataset of more than 65,000 tweets, we developed a Web-based game and we asked students to play the game. Obtained results showed that the game approach was well accepted and thus it can be useful in scenarios where the identification of people' feelings may bring benefits to decision making processes.
{"title":"TSentiment: On gamifying Twitter sentiment analysis","authors":"M. Furini, M. Montangero","doi":"10.1109/ISCC.2016.7543720","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543720","url":null,"abstract":"Social media platforms contain interesting information that can be used to directly measure people' feelings and, thanks to the use of communication technologies, also to geographically locate these feelings. Unfortunately, the understanding is not as easy as one may think. Indeed, the large volume of data makes the manual approach impractical and the diversity of language combined with the brevity of the texts makes the automatic approach quite complicated. In this paper, we consider the gamification approach to sentimentally classify tweets and we propose TSentiment, a game with a purpose that uses human beings to classify the polarity of tweets (e.g., positive, negative, neutral) and their sentiment (e.g., joy, surprise, sadness, etc.). We created a dataset of more than 65,000 tweets, we developed a Web-based game and we asked students to play the game. Obtained results showed that the game approach was well accepted and thus it can be useful in scenarios where the identification of people' feelings may bring benefits to decision making processes.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130911820","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543872
Taycir Bouasker, Mahjoub Langar, R. Robbana
Non functional requirements are very interesting specially in case of business relationships. In fact they are idioms of communication between business environment parties: provider and consumer. In particular in web services context, these requirements and non functional characteristics are also seen as a ranking and selection criteria. Thus, many researchers propose tools to measure the quality of service value of web services and define scoring formulas to rank them. However, we strongly deem that a web service has relative scores depending on end-user requirements rather than an absolute score. In this research paper, we propose a mean for the client to specify his non functional constraints. These, as well as quality attributes measurements will present inputs of a newly developed scoring web service. This web service computes the score of a web service in request relatively to the client's non functional specifications. In addition, a two level ranking is provided to help the client make the suitable decision especially in case of equal scores.
{"title":"NFRs based web services scoring as web service","authors":"Taycir Bouasker, Mahjoub Langar, R. Robbana","doi":"10.1109/ISCC.2016.7543872","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543872","url":null,"abstract":"Non functional requirements are very interesting specially in case of business relationships. In fact they are idioms of communication between business environment parties: provider and consumer. In particular in web services context, these requirements and non functional characteristics are also seen as a ranking and selection criteria. Thus, many researchers propose tools to measure the quality of service value of web services and define scoring formulas to rank them. However, we strongly deem that a web service has relative scores depending on end-user requirements rather than an absolute score. In this research paper, we propose a mean for the client to specify his non functional constraints. These, as well as quality attributes measurements will present inputs of a newly developed scoring web service. This web service computes the score of a web service in request relatively to the client's non functional specifications. In addition, a two level ranking is provided to help the client make the suitable decision especially in case of equal scores.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128341081","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543714
C. Ferreira, S. Sargento, Arnaldo S. R. Oliveira
Since today's networks use traditional centralized management systems, the management became costly with the growth in the number of network equipments and available services. It became then clear that it was necessary to distribute the central management responsibilities throughout the network equipments.
{"title":"Learning-based Autonomic Decision System for bandwidth-aware routing","authors":"C. Ferreira, S. Sargento, Arnaldo S. R. Oliveira","doi":"10.1109/ISCC.2016.7543714","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543714","url":null,"abstract":"Since today's networks use traditional centralized management systems, the management became costly with the growth in the number of network equipments and available services. It became then clear that it was necessary to distribute the central management responsibilities throughout the network equipments.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126869605","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543763
E. Scheid, C. C. Machado, R. Santos, A. E. S. Filho, L. Granville
Network Functions Virtualization (NFV) enables the rapid development, flexible management, and the dynamic placement of new, innovative Virtualized Network Functions (VNFs), such as load balancers, firewalls, and Intrusion Detection Systems (IDSes). Furthermore, NFV along with Software-Defined Networking (SDN) allows VNFs and physical middleboxes to be dynamically composed into service chaining graphs. Despite these benefits, service chaining graphs can be further improved through the use of techniques that have not been satisfactorily explored yet, such as Policy-Based Network Management (PBNM). In PBNM, policies can be written and triggered during runtime, thus supporting the dynamic (re)configuration of service graphs with minimal disruption. In this paper, we propose an approach to automatically design NFV service chaining graphs based on policies. These policies rule the forwarding of traffic and the construction of service chaining graphs. In our approach, service chaining graphs are enforced dynamically in the network during runtime. Finally, to assess its feasibility and generality, we create two different scenarios to demonstrate and discuss how our solution can be employed and its expected results.
{"title":"Policy-based dynamic service chaining in Network Functions Virtualization","authors":"E. Scheid, C. C. Machado, R. Santos, A. E. S. Filho, L. Granville","doi":"10.1109/ISCC.2016.7543763","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543763","url":null,"abstract":"Network Functions Virtualization (NFV) enables the rapid development, flexible management, and the dynamic placement of new, innovative Virtualized Network Functions (VNFs), such as load balancers, firewalls, and Intrusion Detection Systems (IDSes). Furthermore, NFV along with Software-Defined Networking (SDN) allows VNFs and physical middleboxes to be dynamically composed into service chaining graphs. Despite these benefits, service chaining graphs can be further improved through the use of techniques that have not been satisfactorily explored yet, such as Policy-Based Network Management (PBNM). In PBNM, policies can be written and triggered during runtime, thus supporting the dynamic (re)configuration of service graphs with minimal disruption. In this paper, we propose an approach to automatically design NFV service chaining graphs based on policies. These policies rule the forwarding of traffic and the construction of service chaining graphs. In our approach, service chaining graphs are enforced dynamically in the network during runtime. Finally, to assess its feasibility and generality, we create two different scenarios to demonstrate and discuss how our solution can be employed and its expected results.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116915030","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543916
Nickolas Davis, Matthew Broomfield, A. Rezgui
The rise of the Internet of Things, social networking, and embedded connectivity has led to an explosion of available data. In order to better analyze this big data, many different tools have been created that can process the data efficiently. However, the increase in the amount of tools available makes it more difficult to determine which one will provide the most efficient solution to a given big data problem. In this paper, we present a delegation system that takes various frameworks and problem parameters as input and computes the best framework to use for a specific big data problem. To evaluate our system, we used two big data processing frameworks, namely, Hadoop MapReduce and AJIRA, with problem size as an input parameter. Preliminary results show that the system is able to select the most optimal big data processing framework for a given problem 90% of the time. Moreover, the proposed delegation system introduces only an additional 1% overhead when compared to the individual framework in terms of execution time.
{"title":"Efficient, problem tailored big data processing using framework delegation","authors":"Nickolas Davis, Matthew Broomfield, A. Rezgui","doi":"10.1109/ISCC.2016.7543916","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543916","url":null,"abstract":"The rise of the Internet of Things, social networking, and embedded connectivity has led to an explosion of available data. In order to better analyze this big data, many different tools have been created that can process the data efficiently. However, the increase in the amount of tools available makes it more difficult to determine which one will provide the most efficient solution to a given big data problem. In this paper, we present a delegation system that takes various frameworks and problem parameters as input and computes the best framework to use for a specific big data problem. To evaluate our system, we used two big data processing frameworks, namely, Hadoop MapReduce and AJIRA, with problem size as an input parameter. Preliminary results show that the system is able to select the most optimal big data processing framework for a given problem 90% of the time. Moreover, the proposed delegation system introduces only an additional 1% overhead when compared to the individual framework in terms of execution time.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114215391","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543877
Mustafa Al-Bado, C. Sengul, C. Sreenan, Kenneth N. Brown
This paper exposes several problems in managing hidden terminals for uplink traffic in rate-controlled environments, and presents solutions to mitigate them. In particular, we focus on scenarios, in which, clients are associated with an access point (AP). The main challenge stems from the negative interactions between rate-control protocols and hidden terminals. To expose the problems, we use a recent channel estimation approach (CEA) to differentiate the reason for packet losses into three categories, noise, congestion and hidden terminals. Our testbed and simulation-based experiments show that the accuracy of hidden terminal estimations using the CEA degrades as MAC-layer ACK frames are sent with relatively high transmission rates. To improve the accuracy of the CEA, the results demonstrate the necessity and cost of making the AP send ACKs based on the minimum ACK rate of all clients. We propose an adaptive scheme that combines both the CEA and RTS/CTS messages. The proposed scheme increases the overall throughput of Minstrel rate-control algorithm by 60% in case of light congested environments. We also proposed a threshold-based adaptive RTS/CTS scheme based on the prior scheme to handle the highly congested environments. The threshold-based adaptive RTS/CTS scheme improves the overall throughput of the adaptive RTS/CTS scheme and Minstrel algorithm between 20-35%. Finally, we propose and evaluate an opportunistic burst scheme, which enforce fairness among clients. Simulation results show that opportunistic bursting outperforms the prior schemes and Minstrel algorithm in Jain's fairness metric (between 0.11 and 0.38) for a realistic given scenario. It also keeps a relatively high overall throughput.
{"title":"Hidden terminal management for uplink traffic in rate-controlled WiFi networks","authors":"Mustafa Al-Bado, C. Sengul, C. Sreenan, Kenneth N. Brown","doi":"10.1109/ISCC.2016.7543877","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543877","url":null,"abstract":"This paper exposes several problems in managing hidden terminals for uplink traffic in rate-controlled environments, and presents solutions to mitigate them. In particular, we focus on scenarios, in which, clients are associated with an access point (AP). The main challenge stems from the negative interactions between rate-control protocols and hidden terminals. To expose the problems, we use a recent channel estimation approach (CEA) to differentiate the reason for packet losses into three categories, noise, congestion and hidden terminals. Our testbed and simulation-based experiments show that the accuracy of hidden terminal estimations using the CEA degrades as MAC-layer ACK frames are sent with relatively high transmission rates. To improve the accuracy of the CEA, the results demonstrate the necessity and cost of making the AP send ACKs based on the minimum ACK rate of all clients. We propose an adaptive scheme that combines both the CEA and RTS/CTS messages. The proposed scheme increases the overall throughput of Minstrel rate-control algorithm by 60% in case of light congested environments. We also proposed a threshold-based adaptive RTS/CTS scheme based on the prior scheme to handle the highly congested environments. The threshold-based adaptive RTS/CTS scheme improves the overall throughput of the adaptive RTS/CTS scheme and Minstrel algorithm between 20-35%. Finally, we propose and evaluate an opportunistic burst scheme, which enforce fairness among clients. Simulation results show that opportunistic bursting outperforms the prior schemes and Minstrel algorithm in Jain's fairness metric (between 0.11 and 0.38) for a realistic given scenario. It also keeps a relatively high overall throughput.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114360403","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543906
Zongyi Zhao, Qing Li, Mingwei Xu, Lei Wang, Meng Chen
The previous surveys show that more than 90% of the flows in typical data center networks are smaller than 100KB in size, while most bytes transmitted are from a few large flows. The small flows are usually sensitive to their completion times while the large flows require a high throughput. The previous works usually either achieve low completion times for small flows or high throughput for large flows, but not both. In this paper, we propose PTT (Priority-based and Throughput-guaranteed Transport) to minimize the average completion time of small flows while guaranteeing the high throughput of large flows. We conduct comprehensive simulations to evaluate the performance of PTT. The simulation results show that PTT reduces the average completion time of small flows by up to 27.52% over DCTCP and 23.82% over L2DCT while the throughput of large flows is comparable to that in DCTCP, which is 170.46% better than that in L2DCT.
{"title":"Priority-based and Throughput-guaranteed Transport protocol for data center networks","authors":"Zongyi Zhao, Qing Li, Mingwei Xu, Lei Wang, Meng Chen","doi":"10.1109/ISCC.2016.7543906","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543906","url":null,"abstract":"The previous surveys show that more than 90% of the flows in typical data center networks are smaller than 100KB in size, while most bytes transmitted are from a few large flows. The small flows are usually sensitive to their completion times while the large flows require a high throughput. The previous works usually either achieve low completion times for small flows or high throughput for large flows, but not both. In this paper, we propose PTT (Priority-based and Throughput-guaranteed Transport) to minimize the average completion time of small flows while guaranteeing the high throughput of large flows. We conduct comprehensive simulations to evaluate the performance of PTT. The simulation results show that PTT reduces the average completion time of small flows by up to 27.52% over DCTCP and 23.82% over L2DCT while the throughput of large flows is comparable to that in DCTCP, which is 170.46% better than that in L2DCT.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115940317","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543888
Anshu Ranjan, P. Khargonekar, S. Sahni
We consider the scheduling of flexible electric power loads so as to minimize the peak load. We settle a conjecture of Alamdari et al.[1] regarding the performance of the bottom left decreasing height heuristic to schedule preemptable loads with known power requirement and duration and having the same earliest start time and the same deadline. Specifically, we show a tight bound of 4/3 - 1/(3D) relative to the minimum peak power load, where D is the duration of the scheduling interval. On benchmark strip packing data, the bottom left decreasing height heuristic generated schedules that required up to 45% less peak power than required by schedules generated using the next fit decreasing height heuristic. On electric and plug-in hybrid electric vehicles data, these two heuristics are very competitive.
{"title":"Smart grid power scheduling via bottom left decreasing height packing","authors":"Anshu Ranjan, P. Khargonekar, S. Sahni","doi":"10.1109/ISCC.2016.7543888","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543888","url":null,"abstract":"We consider the scheduling of flexible electric power loads so as to minimize the peak load. We settle a conjecture of Alamdari et al.[1] regarding the performance of the bottom left decreasing height heuristic to schedule preemptable loads with known power requirement and duration and having the same earliest start time and the same deadline. Specifically, we show a tight bound of 4/3 - 1/(3D) relative to the minimum peak power load, where D is the duration of the scheduling interval. On benchmark strip packing data, the bottom left decreasing height heuristic generated schedules that required up to 45% less peak power than required by schedules generated using the next fit decreasing height heuristic. On electric and plug-in hybrid electric vehicles data, these two heuristics are very competitive.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"18 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120856764","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 : 2016-06-27DOI: 10.1109/ISCC.2016.7543766
H. Alhumyani, R. Ammar, Hussain Albarakati, Ayman Alharbi
One method of alleviating the burdens of low bandwidth channel in underwater sensor networks (UWSNs) is to perform in-network processing on the collected data, which leads to efficient channel usage, improvement of the end-to-end delay, and improvement of the network lifetime. However, for applications that require large amounts of data, such as seismic monitoring, the detection and tracking of marine objects, and underwater multimedia systems, the use of traditional underwater sensor nodes to perform such data processing techniques is impractical because of their limited power and processing capability. Therefore, the deployment of underwater sensor nodes called processing nodes that have extended power resources and higher features processing units can mitigate the problem of underwater in-network processing. Because the underwater processing nodes are expensive, their deployment is usually considered to be an optimization problem with the objective to best satisfy certain parameters. To solve the optimization problem efficiently, we propose several heuristic approaches that can be used to solve the optimization problem in polynomial time. The quality of the obtained solutions is verified by simulation and compared with the optimal solution.
{"title":"Deployment strategies for underwater sensing and processing networks","authors":"H. Alhumyani, R. Ammar, Hussain Albarakati, Ayman Alharbi","doi":"10.1109/ISCC.2016.7543766","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543766","url":null,"abstract":"One method of alleviating the burdens of low bandwidth channel in underwater sensor networks (UWSNs) is to perform in-network processing on the collected data, which leads to efficient channel usage, improvement of the end-to-end delay, and improvement of the network lifetime. However, for applications that require large amounts of data, such as seismic monitoring, the detection and tracking of marine objects, and underwater multimedia systems, the use of traditional underwater sensor nodes to perform such data processing techniques is impractical because of their limited power and processing capability. Therefore, the deployment of underwater sensor nodes called processing nodes that have extended power resources and higher features processing units can mitigate the problem of underwater in-network processing. Because the underwater processing nodes are expensive, their deployment is usually considered to be an optimization problem with the objective to best satisfy certain parameters. To solve the optimization problem efficiently, we propose several heuristic approaches that can be used to solve the optimization problem in polynomial time. The quality of the obtained solutions is verified by simulation and compared with the optimal solution.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943097","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
扫码关注我们
求助内容：
应助结果提醒方式：