Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098673
Ashwathi Nambiar, G. Kasbekar
We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MS) in a given time slot so as to limit the interference to neighboring cells; also, each base station (BS) uses a fixed transmit power on every allocated subchannel. The objective is to allocate the available subchannels in each cell to the MSs in the cell for downlink transmissions taking into account the channel qualities from BSs to MSs as well as traffic requirements of the MSs so as to maximize the weighted sum of throughputs of all the MSs. First, we show that this problem is NP-Complete. Next, we show that when the potential interference levels to each MS on every subchannel are above a threshold (which is a function of the transmit power and the channel gain to the MS from the BS it is associated with), the problem can be optimally solved in polynomial-time via a reduction to the matching problem in bipartite graphs. Also, we design two heuristic algorithms for the general problem: a greedy distributed algorithm and a simulated annealing based algorithm. The distributed algorithm is fast and requires only message exchanges between neighboring BSs. The simulated annealing based algorithm is centralized and allows a tradeoff between quality of solution and execution time via an appropriate choice of parameters. Finally, we study the performance of the above algorithms via simulations, which show that the distributed algorithm on average achieves an objective function value that is 0.6 times that obtained by the simulated annealing based algorithm using only a small fraction of the number of computations.
{"title":"Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem","authors":"Ashwathi Nambiar, G. Kasbekar","doi":"10.1109/COMSNETS.2015.7098673","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098673","url":null,"abstract":"We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MS) in a given time slot so as to limit the interference to neighboring cells; also, each base station (BS) uses a fixed transmit power on every allocated subchannel. The objective is to allocate the available subchannels in each cell to the MSs in the cell for downlink transmissions taking into account the channel qualities from BSs to MSs as well as traffic requirements of the MSs so as to maximize the weighted sum of throughputs of all the MSs. First, we show that this problem is NP-Complete. Next, we show that when the potential interference levels to each MS on every subchannel are above a threshold (which is a function of the transmit power and the channel gain to the MS from the BS it is associated with), the problem can be optimally solved in polynomial-time via a reduction to the matching problem in bipartite graphs. Also, we design two heuristic algorithms for the general problem: a greedy distributed algorithm and a simulated annealing based algorithm. The distributed algorithm is fast and requires only message exchanges between neighboring BSs. The simulated annealing based algorithm is centralized and allows a tradeoff between quality of solution and execution time via an appropriate choice of parameters. Finally, we study the performance of the above algorithms via simulations, which show that the distributed algorithm on average achieves an objective function value that is 0.6 times that obtained by the simulated annealing based algorithm using only a small fraction of the number of computations.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113959851","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098664
S. Pradhan, Sourav Kumar Dandapat, Niloy Ganguly, Bivas Mitra, Pradipta De
Cellular radio interfaces on smartphones consume a significant amount of battery power, specially with growing number of network centric applications. With high bandwidth cellular access links pushing the bottleneck to the network core, the risk of poor bandwidth utilization of the access link increases, which leads to energy wastage as the radio interface must stay active longer. In addition, small sized packet transmissions from applications wake up the interface frequently, but do not require the entire bandwidth capacity. In this work, we improve the radio usage by aggregating packet transmission from multiple applications. We introduce different time delays while transmitting packets from foreground and background applications such that user experience is minimally impacted. Through empirical observations, we determine the impact of different types of traffic on bandwidth utilization. Naive attempts to improve bandwidth utilization lead to increase in the number of packets missing the deadline for dispatch. With these observations, we propose a technique that balances the bandwidth utilization and deadline misses. Simulation driven experiments using synthetic traces and real trace based on application usage on Android based smartphones show energy gain of around 10% over other competing techniques.
{"title":"Aggregating inter-app traffic to optimize cellular radio energy consumption on smartphones","authors":"S. Pradhan, Sourav Kumar Dandapat, Niloy Ganguly, Bivas Mitra, Pradipta De","doi":"10.1109/COMSNETS.2015.7098664","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098664","url":null,"abstract":"Cellular radio interfaces on smartphones consume a significant amount of battery power, specially with growing number of network centric applications. With high bandwidth cellular access links pushing the bottleneck to the network core, the risk of poor bandwidth utilization of the access link increases, which leads to energy wastage as the radio interface must stay active longer. In addition, small sized packet transmissions from applications wake up the interface frequently, but do not require the entire bandwidth capacity. In this work, we improve the radio usage by aggregating packet transmission from multiple applications. We introduce different time delays while transmitting packets from foreground and background applications such that user experience is minimally impacted. Through empirical observations, we determine the impact of different types of traffic on bandwidth utilization. Naive attempts to improve bandwidth utilization lead to increase in the number of packets missing the deadline for dispatch. With these observations, we propose a technique that balances the bandwidth utilization and deadline misses. Simulation driven experiments using synthetic traces and real trace based on application usage on Android based smartphones show energy gain of around 10% over other competing techniques.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131453546","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098732
V. Raychoudhury, Divya Saxena, M. Chaudhary, S. Mangla
In recent years, revolutions across the middle-east, mass protests in USA and Spain, and aggregated general discontents in many other countries of the world have lived a cyber life parallel to the streets - mainly in Twitter. Much have been said and believed about Twitter based revolutions. However, there is real dearth of in-depth empirical studies to support those claims. Before the heat of earlier revolutions on Twitter cooled down, a new revolution emerged in the Shahbag Square in Dhaka, capital of Bangladesh. It started by declaration in social networks, quickly gathered huge momentum, and soon got spread all over the country. In this study, we analyzed about a million tweets to study the nature of the movement, the participants and their activities. The results show that the modern revolutions bring together people from all strata of the society around the epicenter and grow in a completely apolitical manner.
{"title":"Shahbag movement: The tweeted perspective","authors":"V. Raychoudhury, Divya Saxena, M. Chaudhary, S. Mangla","doi":"10.1109/COMSNETS.2015.7098732","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098732","url":null,"abstract":"In recent years, revolutions across the middle-east, mass protests in USA and Spain, and aggregated general discontents in many other countries of the world have lived a cyber life parallel to the streets - mainly in Twitter. Much have been said and believed about Twitter based revolutions. However, there is real dearth of in-depth empirical studies to support those claims. Before the heat of earlier revolutions on Twitter cooled down, a new revolution emerged in the Shahbag Square in Dhaka, capital of Bangladesh. It started by declaration in social networks, quickly gathered huge momentum, and soon got spread all over the country. In this study, we analyzed about a million tweets to study the nature of the movement, the participants and their activities. The results show that the modern revolutions bring together people from all strata of the society around the epicenter and grow in a completely apolitical manner.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"2 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128286679","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098723
Dineshkumar Singh, D. Piplani, S. Nar, S. Karthik, Rahul Sharma, Aditya Tiwari
Climate change is now more visible in the form of frequent changes in the weather patterns leading to severe drought or floods. It endangers the food security, especially shrinking of cultivable land and increasing population. Agricultural Research Institutes are working on new cropping patterns, new heat and flood tolerant varieties and cultivation practices. However in the absence of sound knowledge extension system the results of such massive and costly research do not reach its end users, in this case farmers, on time. This research paper talks about the, National Agricultural Innovation Project (NAIP) pilot conducted to develop strategies to enhance Adaptive Capacity to Climate Change in vulnerable regions in India. As part of this research, extensive field demonstrations and data analysis were done to demonstrate how Information and Communication Technology (ICT) can play a crucial role in establishing a two way connect between the Research Lab and the end users of research. While Agricultural research can focus on identification of current and future risks to livelihoods due to climatic variability and development or identification of regional climate specific crop varieties and crop practices, the IT and ICT can work jointly to use the outcome of such research to spread awareness and promote the use of such varieties and practices in adaptation by farmers and other stakeholders through an ICT platform.
{"title":"ICT platform for Climate Change Adaptation in agriculture","authors":"Dineshkumar Singh, D. Piplani, S. Nar, S. Karthik, Rahul Sharma, Aditya Tiwari","doi":"10.1109/COMSNETS.2015.7098723","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098723","url":null,"abstract":"Climate change is now more visible in the form of frequent changes in the weather patterns leading to severe drought or floods. It endangers the food security, especially shrinking of cultivable land and increasing population. Agricultural Research Institutes are working on new cropping patterns, new heat and flood tolerant varieties and cultivation practices. However in the absence of sound knowledge extension system the results of such massive and costly research do not reach its end users, in this case farmers, on time. This research paper talks about the, National Agricultural Innovation Project (NAIP) pilot conducted to develop strategies to enhance Adaptive Capacity to Climate Change in vulnerable regions in India. As part of this research, extensive field demonstrations and data analysis were done to demonstrate how Information and Communication Technology (ICT) can play a crucial role in establishing a two way connect between the Research Lab and the end users of research. While Agricultural research can focus on identification of current and future risks to livelihoods due to climatic variability and development or identification of regional climate specific crop varieties and crop practices, the IT and ICT can work jointly to use the outcome of such research to spread awareness and promote the use of such varieties and practices in adaptation by farmers and other stakeholders through an ICT platform.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127572884","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098721
S. Manipriya, Gitakrishnan Ramadurai, V. Reddy
The paper presents a fast algorithm for real-time image processing for counting and classification of vehicles in heterogeneous traffic recorded using a single stationary camera. The proposed method uses a single feature as the base parameter which is given by the user to classify the vehicles into four different classes. The algorithm has an error of 6.1% on an average for the total count when studied under varying illumination and weather conditions.
{"title":"Grid-based real-time image processing (GRIP) algorithm for heterogeneous traffic","authors":"S. Manipriya, Gitakrishnan Ramadurai, V. Reddy","doi":"10.1109/COMSNETS.2015.7098721","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098721","url":null,"abstract":"The paper presents a fast algorithm for real-time image processing for counting and classification of vehicles in heterogeneous traffic recorded using a single stationary camera. The proposed method uses a single feature as the base parameter which is given by the user to classify the vehicles into four different classes. The algorithm has an error of 6.1% on an average for the total count when studied under varying illumination and weather conditions.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131543082","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098677
Vinod Sudheesh, K. Jagannathan, S. Bhashyam
We consider the problem of distributed resource allocation in a single-hop wireless network under the SINR model. The network consists of fixed transmitters and their distinct receivers, and the physical layer model we consider is the SINR threshold model, where the transmitter will be able to send data successfully to its receiver at a fixed rate if the SINR at the receiver is greater than a given threshold. We address the problem of joint power control and link activation in a distributed setting, in order to stably support any traffic arrival process whose rate vector lies inside the capacity region. One of the technical contributions of this paper is in identifying a linear program to determine the optimal durations for employing each activation, whose solution decouples into a distributed algorithm, upon introducing a logarithmic barrier function.
{"title":"Distributed resource allocation for single-hop networks under the SINR model","authors":"Vinod Sudheesh, K. Jagannathan, S. Bhashyam","doi":"10.1109/COMSNETS.2015.7098677","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098677","url":null,"abstract":"We consider the problem of distributed resource allocation in a single-hop wireless network under the SINR model. The network consists of fixed transmitters and their distinct receivers, and the physical layer model we consider is the SINR threshold model, where the transmitter will be able to send data successfully to its receiver at a fixed rate if the SINR at the receiver is greater than a given threshold. We address the problem of joint power control and link activation in a distributed setting, in order to stably support any traffic arrival process whose rate vector lies inside the capacity region. One of the technical contributions of this paper is in identifying a linear program to determine the optimal durations for employing each activation, whose solution decouples into a distributed algorithm, upon introducing a logarithmic barrier function.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"105 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131942134","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098731
P. Kovács, G. Raina, N. Walton
Control schemes for motorways and urban roads are often modelled as separate systems. This may be reasonable when there is substantial buffering at on-ramps on motorways. However, in many densely populated areas, the length of these on-ramps can be limited, and traffic may easily propagate into the urban road network. We consider the problem of congestion control on a motorway and its surrounding roads. We analyse two control policies: Proportional fairness and Backpressure, which are commonplace in the modelling of communication networks. We provide an initial analysis and performance evaluation, of these control policies, in the context of joint motorway and urban traffic scheduling.
{"title":"Ramp and signal control: Where motorways and urban roads meet","authors":"P. Kovács, G. Raina, N. Walton","doi":"10.1109/COMSNETS.2015.7098731","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098731","url":null,"abstract":"Control schemes for motorways and urban roads are often modelled as separate systems. This may be reasonable when there is substantial buffering at on-ramps on motorways. However, in many densely populated areas, the length of these on-ramps can be limited, and traffic may easily propagate into the urban road network. We consider the problem of congestion control on a motorway and its surrounding roads. We analyse two control policies: Proportional fairness and Backpressure, which are commonplace in the modelling of communication networks. We provide an initial analysis and performance evaluation, of these control policies, in the context of joint motorway and urban traffic scheduling.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131249475","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098717
B. Jha, S. K. Jha, R. Mukherjee, Debdulal Basak
Information technology (IT) has emerged as a boon to expedite the process of agricultural extension. The growth in mobile has surpassed Internet due to cost effectiveness. Mobile as a tool holds promise for facilitating access of agricultural information by majority of the farmers. Its promotion has already been started by a few organizations, but mostly in supply mode. Hence, it was decided to develop the SMS based solution that works in demand mode. The solution consists of server stub and client stub. The server stub is a group of applications that receive surrogated query from client component in asynchronous mode and deliver desired information in flawless, efficient and uninterrupted manner. The server stub consists of message process, query process, database and analytical process. Client stub is a single application that is installed in user's mobile. The major functionalities of the client stub are: presentation and navigation, data management and message processing. In the implemented solution, total number of decision points and lists are 495 and 130 respectively. In list total number of elements varies from 2 to 15. The user selects information node from the list as per requirement. After selection of terminal node, message processing layer generates surrogated query which on confirmation is forwarded to Application Service Provider (ASP) end for processing. The solution has been developed for agriculture domain with crop, fertilizer, water management, crop protection, weather and agricultural implements as primary information area.
{"title":"Development of guided SMS solution in local languages for demand-driven access of agricultural information","authors":"B. Jha, S. K. Jha, R. Mukherjee, Debdulal Basak","doi":"10.1109/COMSNETS.2015.7098717","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098717","url":null,"abstract":"Information technology (IT) has emerged as a boon to expedite the process of agricultural extension. The growth in mobile has surpassed Internet due to cost effectiveness. Mobile as a tool holds promise for facilitating access of agricultural information by majority of the farmers. Its promotion has already been started by a few organizations, but mostly in supply mode. Hence, it was decided to develop the SMS based solution that works in demand mode. The solution consists of server stub and client stub. The server stub is a group of applications that receive surrogated query from client component in asynchronous mode and deliver desired information in flawless, efficient and uninterrupted manner. The server stub consists of message process, query process, database and analytical process. Client stub is a single application that is installed in user's mobile. The major functionalities of the client stub are: presentation and navigation, data management and message processing. In the implemented solution, total number of decision points and lists are 495 and 130 respectively. In list total number of elements varies from 2 to 15. The user selects information node from the list as per requirement. After selection of terminal node, message processing layer generates surrogated query which on confirmation is forwarded to Application Service Provider (ASP) end for processing. The solution has been developed for agriculture domain with crop, fertilizer, water management, crop protection, weather and agricultural implements as primary information area.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114457732","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098698
Mukulika Maity, B. Raman, Mythili Vutukuru
How does a dense WiFi network perform, specifically for the common case of TCP download? While the empirical answer to this question is `poor', analysis and experimentation in prior work has indicated that TCP clocks itself quite well, avoiding contention-driven WiFi overload in dense settings. This paper focuses on measurements from a real-life use of WiFi in a dense scenario: a classroom where several students use the network to download quizzes and instruction material. We find that the TCP download performance is poor, contrary to that suggested by prior work. Through careful analysis, we explain the complex interaction of various phenomena which leads to this poor performance. Specifically, we observe that a small amount of upload traffic generated when downloading data upsets the TCP clocking, and increases contention on the channel. Further, contention losses lead to a vicious cycle of poor interaction with autorate adaptation and TCP's timeout mechanism. To reduce channel contention and improve performance, we propose a modification to the AP scheduling policy to improve the performance of large TCP downloads. Our solution, WiFiRR, picks only a subset of clients to be served by the AP during any instant, and varies this set of “active” clients periodically in a round-robin fashion over all clients to ensure that no client starves. By reducing the number of contending nodes at any point of time, WiFiRR improves the download time of large TCP flows by 3.2× in a simulation of our classroom scenario.
{"title":"TCP download performance in dense WiFi scenarios","authors":"Mukulika Maity, B. Raman, Mythili Vutukuru","doi":"10.1109/COMSNETS.2015.7098698","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098698","url":null,"abstract":"How does a dense WiFi network perform, specifically for the common case of TCP download? While the empirical answer to this question is `poor', analysis and experimentation in prior work has indicated that TCP clocks itself quite well, avoiding contention-driven WiFi overload in dense settings. This paper focuses on measurements from a real-life use of WiFi in a dense scenario: a classroom where several students use the network to download quizzes and instruction material. We find that the TCP download performance is poor, contrary to that suggested by prior work. Through careful analysis, we explain the complex interaction of various phenomena which leads to this poor performance. Specifically, we observe that a small amount of upload traffic generated when downloading data upsets the TCP clocking, and increases contention on the channel. Further, contention losses lead to a vicious cycle of poor interaction with autorate adaptation and TCP's timeout mechanism. To reduce channel contention and improve performance, we propose a modification to the AP scheduling policy to improve the performance of large TCP downloads. Our solution, WiFiRR, picks only a subset of clients to be served by the AP during any instant, and varies this set of “active” clients periodically in a round-robin fashion over all clients to ensure that no client starves. By reducing the number of contending nodes at any point of time, WiFiRR improves the download time of large TCP flows by 3.2× in a simulation of our classroom scenario.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124776755","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 : 1900-01-01DOI: 10.1109/COMSNETS.2015.7098669
HyunYong Lee, A. Nakao
Various named data networking (NDN) functions facilitate P2P content distribution, but the user incentive mechanism is missing. In this paper, we study the user incentive mechanism in NDN, particularly the information gathering, i.e., collecting user contribution information to be used to evaluate and reciprocate users, through simulations based on real Bit-Torrent trace. We found that two specific users are matched repeatedly even though the user matching is driven by NDN because the name-based routing naturally realizes the communication localization. As a result, even based only on their personal experiences, users can handle around 81% of content requests with the contribution information about content requesters. Due to the same reason, simple opportunistic exchange (that allows users to share their experiences when they upload a requested content) enables users to handle around 97% of content requests with the contribution information about content requesters. The publish/subscribe paradigm of NDN can also be exploited to enable users to share their experiences, i.e., by publishing their transaction histories. However, considering a huge number of P2P users and contents, this approach is likely to burden NDN routers with high processing and storage overheads.
{"title":"A study of user incentive mechanism in named data networking","authors":"HyunYong Lee, A. Nakao","doi":"10.1109/COMSNETS.2015.7098669","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098669","url":null,"abstract":"Various named data networking (NDN) functions facilitate P2P content distribution, but the user incentive mechanism is missing. In this paper, we study the user incentive mechanism in NDN, particularly the information gathering, i.e., collecting user contribution information to be used to evaluate and reciprocate users, through simulations based on real Bit-Torrent trace. We found that two specific users are matched repeatedly even though the user matching is driven by NDN because the name-based routing naturally realizes the communication localization. As a result, even based only on their personal experiences, users can handle around 81% of content requests with the contribution information about content requesters. Due to the same reason, simple opportunistic exchange (that allows users to share their experiences when they upload a requested content) enables users to handle around 97% of content requests with the contribution information about content requesters. The publish/subscribe paradigm of NDN can also be exploited to enable users to share their experiences, i.e., by publishing their transaction histories. However, considering a huge number of P2P users and contents, this approach is likely to burden NDN routers with high processing and storage overheads.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127460774","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
扫码关注我们
求助内容：
应助结果提醒方式：