The spread of wireless communications has led electronic equipment to include one or more wireless interfaces. If it were possible to use some generic hardware and implement those different interfaces in software, design and cost would be drastically reduced. This is the idea behind Software Defined Radio (SDR). Cognitive radio attempts to make a more efficient use of a crowded specturm by using licensed bands when licensees are idle. SDR and cognitive radio triggered the research work reported in this paper: to provide a fully functional SDR-based wireless network, developed on top of an open source framework, and able to provide data link and upper layers functionalities. This framework was called GNUWiNetwork, is licensed under GNU, and can be extended by others. Prototyping balanced by architectural design led this framework to be structured as a library of independent blocks which implement different functionalities. These blocks can be interconnected to implement existing or experimental protocols. Blocks interchange different types of events, and act accordingly. A graphical user interface makes it easy to put the blocks together, set the required parameters, and make the set run either in simulation mode or through some simple wireless device controlled by GNU Radio. Several types of blocks have been coded and tried in simulation mode. Some real wireless connection were established between two computers equiped with USRP devices, over which remote sessions such as SSH were successfully established. Work done and the results obtained so far show this framework very valuable for teaching and experimenting, but also promising for industrial prototype testing.
{"title":"GNUWiNetwork, a software framework to build wireless networks","authors":"V. González-Barbone, G. Sena, P. Belzarena","doi":"10.1145/2684083.2684087","DOIUrl":"https://doi.org/10.1145/2684083.2684087","url":null,"abstract":"The spread of wireless communications has led electronic equipment to include one or more wireless interfaces. If it were possible to use some generic hardware and implement those different interfaces in software, design and cost would be drastically reduced. This is the idea behind Software Defined Radio (SDR). Cognitive radio attempts to make a more efficient use of a crowded specturm by using licensed bands when licensees are idle. SDR and cognitive radio triggered the research work reported in this paper: to provide a fully functional SDR-based wireless network, developed on top of an open source framework, and able to provide data link and upper layers functionalities. This framework was called GNUWiNetwork, is licensed under GNU, and can be extended by others. Prototyping balanced by architectural design led this framework to be structured as a library of independent blocks which implement different functionalities. These blocks can be interconnected to implement existing or experimental protocols. Blocks interchange different types of events, and act accordingly. A graphical user interface makes it easy to put the blocks together, set the required parameters, and make the set run either in simulation mode or through some simple wireless device controlled by GNU Radio. Several types of blocks have been coded and tried in simulation mode. Some real wireless connection were established between two computers equiped with USRP devices, over which remote sessions such as SSH were successfully established. Work done and the results obtained so far show this framework very valuable for teaching and experimenting, but also promising for industrial prototype testing.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129936411","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}
Efficient 1-to-N and N-to-1 communication benefits numerous data center applications that require group communication by reducing network traffic and improving application throughput. Meanwhile, optical interconnection networks are emerging as a key enabling technology for future data center networking. Optical networks not only support higher bit-rates through optical links, but can also dynamically reconfigure the network topology and link capacities through the optical switch, providing substantial flexibility to various traffic patterns. Currently, there exists limited support for efficient 1-to-N and N-to-1 routing that leverages the advanced features of optical networks. In this paper, we propose a set of algorithms to support 1-to-N and N-to-1 traffic flows in optical networks. We base our work on top of the Optical Switching Architecture (OSA). Through extensive analytical simulations, we show that the proposed algorithms are effective in minimizing the number of optical links used for 1-to-N traffic, while eliminating link bottlenecks for N-to-1 traffic.
{"title":"1-to-N and N-to-1 Communication for Optical Networks","authors":"Tuan Le, M. Gerla","doi":"10.1145/2684083.2684093","DOIUrl":"https://doi.org/10.1145/2684083.2684093","url":null,"abstract":"Efficient 1-to-N and N-to-1 communication benefits numerous data center applications that require group communication by reducing network traffic and improving application throughput. Meanwhile, optical interconnection networks are emerging as a key enabling technology for future data center networking. Optical networks not only support higher bit-rates through optical links, but can also dynamically reconfigure the network topology and link capacities through the optical switch, providing substantial flexibility to various traffic patterns. Currently, there exists limited support for efficient 1-to-N and N-to-1 routing that leverages the advanced features of optical networks.\u0000 In this paper, we propose a set of algorithms to support 1-to-N and N-to-1 traffic flows in optical networks. We base our work on top of the Optical Switching Architecture (OSA). Through extensive analytical simulations, we show that the proposed algorithms are effective in minimizing the number of optical links used for 1-to-N traffic, while eliminating link bottlenecks for N-to-1 traffic.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133937002","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}
The popularity of IEEE 802.11 wireless networks, its simplicity of deployment and affordability has leaded to the existence of high density networks with many APs, owned and configured by the same or different providers, covering the same physical space and potentially interfering with each other. The interference caused by the co-channel and adjacent channel interference driven by co-located devices is one of the main issues to address to improve network performance. It is natural to think of solving this problem letting the APs to sense the medium and change the working radio channel accordingly to reduce interference. However, if this approach is used in an uncoordinated manner can cause to an unstable network re-configuration process. This paper briefly presents an un-coordinated solution to optimize channel configuration between participating Access Points and shows how the channel configuration oscillates. Then, we study the problem from a control-theoretical point of view and provide a feedback control-based solution to bound the oscillations of the solution. Finally, we present a simulation-based evaluation that shows how the proposed mechanism behaves.
{"title":"On the Stability of an Un-Coordinated Solution for Channel Allocation in Dense Wireless Networks","authors":"Guillermo Apollonia, J. Baliosian","doi":"10.1145/2684083.2684091","DOIUrl":"https://doi.org/10.1145/2684083.2684091","url":null,"abstract":"The popularity of IEEE 802.11 wireless networks, its simplicity of deployment and affordability has leaded to the existence of high density networks with many APs, owned and configured by the same or different providers, covering the same physical space and potentially interfering with each other. The interference caused by the co-channel and adjacent channel interference driven by co-located devices is one of the main issues to address to improve network performance. It is natural to think of solving this problem letting the APs to sense the medium and change the working radio channel accordingly to reduce interference. However, if this approach is used in an uncoordinated manner can cause to an unstable network re-configuration process. This paper briefly presents an un-coordinated solution to optimize channel configuration between participating Access Points and shows how the channel configuration oscillates. Then, we study the problem from a control-theoretical point of view and provide a feedback control-based solution to bound the oscillations of the solution. Finally, we present a simulation-based evaluation that shows how the proposed mechanism behaves.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115658480","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}
J. A. Macedo, Guilherme Tebaldi Meira, Roberta Lima-Gomes, M. Martinello, A. Vieira
Peer-to-Peer (P2P) technology has been used as a mean to deliver video streaming services over the Internet. Although mobile devices have been increasingly used to access multimedia content, P2P video streaming applications are still in early stage regarding these devices. The P2P protocol needs to be adapted to meet specific characteristics of mobile devices. In this paper, we propose a novel peer selection approach named Energy and Stability Aware (ES-Aware) which aims to reduce the impact of peers instability and the rapid battery drain. Our approach is implemented in a real P2P video streaming system called RapidStream [4]. Experiments are performed in a Internet-wide environment, PlanetLab [2] integrated with mobile devices, providing a comprehensive and purely experimental methodology to compare different techniques into a P2P video streaming protocol. Results suggest that (i) only the peer connected time is not sufficient as criterion for node stability; (ii) ES-Aware is more effective, saving around 57% of energy, for P2P networks with small percentage of mobile nodes.
{"title":"ES-Aware: Energy and Stability Support for P2P Video Streaming on Mobile Devices","authors":"J. A. Macedo, Guilherme Tebaldi Meira, Roberta Lima-Gomes, M. Martinello, A. Vieira","doi":"10.1145/2684083.2684086","DOIUrl":"https://doi.org/10.1145/2684083.2684086","url":null,"abstract":"Peer-to-Peer (P2P) technology has been used as a mean to deliver video streaming services over the Internet. Although mobile devices have been increasingly used to access multimedia content, P2P video streaming applications are still in early stage regarding these devices. The P2P protocol needs to be adapted to meet specific characteristics of mobile devices. In this paper, we propose a novel peer selection approach named Energy and Stability Aware (ES-Aware) which aims to reduce the impact of peers instability and the rapid battery drain. Our approach is implemented in a real P2P video streaming system called RapidStream [4]. Experiments are performed in a Internet-wide environment, PlanetLab [2] integrated with mobile devices, providing a comprehensive and purely experimental methodology to compare different techniques into a P2P video streaming protocol. Results suggest that (i) only the peer connected time is not sufficient as criterion for node stability; (ii) ES-Aware is more effective, saving around 57% of energy, for P2P networks with small percentage of mobile nodes.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127637135","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}
J. Visca, Matías Richart, Juan Saavedra, J. Baliosian, E. Grampín
Opportunistic Networks are a powerful tool for deploying a class of delay tolerant network applications in zones with scarce communications infrastructure. Unfortunately, these networks are highly stochastic and very sensible to changes in the nodes movement patters, as well as to changes in the data-flow patterns. On the other hand, opportunistic algorithms, while conceptually simple, are highly configurable and plastic but, for the same reason, many examples of such networks are notoriously hard to model and simulate. Thus, the algorithm's calibration is a challenging task. In this paper, we show how a combination of a synthetic mobility pattern, combined with simulation and a careful implementation permits to identify potentially disruptive behaviors and find solutions. In particular we show how a quite probable mobility pattern (i.e., data-carrying nodes converging to a data receiver simultaneously) has very bad performance when using a wide family of buffer management policies, FIFO among them. Furthermore, we propose and test an alternative buffer management policy which shows very encouraging results.
{"title":"Buffer Management in Opportunistic Networking","authors":"J. Visca, Matías Richart, Juan Saavedra, J. Baliosian, E. Grampín","doi":"10.1145/2684083.2684085","DOIUrl":"https://doi.org/10.1145/2684083.2684085","url":null,"abstract":"Opportunistic Networks are a powerful tool for deploying a class of delay tolerant network applications in zones with scarce communications infrastructure. Unfortunately, these networks are highly stochastic and very sensible to changes in the nodes movement patters, as well as to changes in the data-flow patterns. On the other hand, opportunistic algorithms, while conceptually simple, are highly configurable and plastic but, for the same reason, many examples of such networks are notoriously hard to model and simulate. Thus, the algorithm's calibration is a challenging task. In this paper, we show how a combination of a synthetic mobility pattern, combined with simulation and a careful implementation permits to identify potentially disruptive behaviors and find solutions. In particular we show how a quite probable mobility pattern (i.e., data-carrying nodes converging to a data receiver simultaneously) has very bad performance when using a wide family of buffer management policies, FIFO among them. Furthermore, we propose and test an alternative buffer management policy which shows very encouraging results.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115578919","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}
Over the last years the 1:1 educational model has been gaining importance within different regions of the world. In this respect, the Uruguayan Plan Ceibal has been a pioneer, beginning its deployment in 2007 and being the only one so far with national scope. Within this context, the present work describes the wireless network deployed by Plan Ceibal. The paper also presents a usage analysis based on measurements collected from the wired side in this novel 1:1 scenario.
{"title":"Plan Ceibal's Wireless Network for the Implementation of the 1:1 Educational Model","authors":"G. Capdehourat, Gonzalo Marín, Ana Inés Rodríguez","doi":"10.1145/2684083.2684092","DOIUrl":"https://doi.org/10.1145/2684083.2684092","url":null,"abstract":"Over the last years the 1:1 educational model has been gaining importance within different regions of the world. In this respect, the Uruguayan Plan Ceibal has been a pioneer, beginning its deployment in 2007 and being the only one so far with national scope. Within this context, the present work describes the wireless network deployed by Plan Ceibal. The paper also presents a usage analysis based on measurements collected from the wired side in this novel 1:1 scenario.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115703149","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}
In this article we present Adkintun, the national infrastructure demanded by the Chilean National Secretary of Telecommunications (SUBTEL) in order to monitor the fulfilling of the Net Neutrality Law. The infrastructure consists in a set of probes located next to the users' devices. These probes gather and process the data in our servers to finally presenting it in an understandable way to the users. We show three examples of how Adkintun has been a useful tool for empowering users in order to protect their rights. First, using this tool to study the provisioning of Chilean Internet Provider compared with what they offer. Second, how Adkintun has been used as a tool for complaints against the poor quality of service provided by ISPs. Third, how Adkintun was used as evidence in a lawsuit presented against SUBTEL for not taking actions against the Chilean ISPs, despite the data presented by the infrastructure in our studies. Finally, we conclude that our infrastructure generated an impact on both government and empowering users to protect their rights.
{"title":"All packets are equal, but some are more equal than others","authors":"Javier Bustos-Jiménez, C. Fuenzalida","doi":"10.1145/2684083.2684088","DOIUrl":"https://doi.org/10.1145/2684083.2684088","url":null,"abstract":"In this article we present Adkintun, the national infrastructure demanded by the Chilean National Secretary of Telecommunications (SUBTEL) in order to monitor the fulfilling of the Net Neutrality Law. The infrastructure consists in a set of probes located next to the users' devices. These probes gather and process the data in our servers to finally presenting it in an understandable way to the users.\u0000 We show three examples of how Adkintun has been a useful tool for empowering users in order to protect their rights. First, using this tool to study the provisioning of Chilean Internet Provider compared with what they offer. Second, how Adkintun has been used as a tool for complaints against the poor quality of service provided by ISPs. Third, how Adkintun was used as evidence in a lawsuit presented against SUBTEL for not taking actions against the Chilean ISPs, despite the data presented by the infrastructure in our studies.\u0000 Finally, we conclude that our infrastructure generated an impact on both government and empowering users to protect their rights.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131456829","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}
The emergence of Network Service Provider Alliances (NSPs) to provide end-to-end, quality-assured services, promises new business and service opportunities for NSPs and customers respectively. This new marketplace requires a suitable pricing mechanism that allows price fixation, control access and customer trust in the new -and thus without reputation-seller. To work in this scenario, we propose a pricing scheme based on First-price auctions and where a pre-announced percentage of the price paid for the service is reimbursed if the quality is not satisfied. An optimal percentage of reimbursement can be analytically computed in simplified scenarios, where all buyers are equally modelled [1]. In more realistic scenarios, customers and services are asymmetric, e.g. buyers value the service on sale in a different way, and no analytical results can be derived. As a remedy, we propose a simulative approach in order to approximate buyers' willingness to pay, and subsequently compute the optimal percentage of reimbursement. We apply our simulator to different case studies, finding in all of them that the optimal percentage of reimbursement is 100% and this value prevents problems such as the market for lemons.
{"title":"First-Price Auctions with Reimbursement in NSP Alliances with Asymmetric Buyers","authors":"Isabel Amigo, Sandrine Vaton, P. Belzarena","doi":"10.1145/2684083.2684084","DOIUrl":"https://doi.org/10.1145/2684083.2684084","url":null,"abstract":"The emergence of Network Service Provider Alliances (NSPs) to provide end-to-end, quality-assured services, promises new business and service opportunities for NSPs and customers respectively. This new marketplace requires a suitable pricing mechanism that allows price fixation, control access and customer trust in the new -and thus without reputation-seller. To work in this scenario, we propose a pricing scheme based on First-price auctions and where a pre-announced percentage of the price paid for the service is reimbursed if the quality is not satisfied. An optimal percentage of reimbursement can be analytically computed in simplified scenarios, where all buyers are equally modelled [1]. In more realistic scenarios, customers and services are asymmetric, e.g. buyers value the service on sale in a different way, and no analytical results can be derived. As a remedy, we propose a simulative approach in order to approximate buyers' willingness to pay, and subsequently compute the optimal percentage of reimbursement. We apply our simulator to different case studies, finding in all of them that the optimal percentage of reimbursement is 100% and this value prevents problems such as the market for lemons.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679394","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}
In this paper we address a problem from the field of network reliability, called diameter-constrained reliability. Specifically, we are given a simple graph G = (V, E) with [V] = n nodes and [E] = m links, a subset K ⊆ V of terminals, a vector p = (p1,...,pm) &epsis; [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 --- pi. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by RdK,G(p). The general DCR computation is inside the class of NP-Hard problems, since is subsumes the complexity that a random graph is connected. In this paper the computational complexity of DCR-subproblems is discussed in terms of the number of terminal nodes k = [K] and diameter d. A factorization formula for exact DCR computation is provided, that runs in exponential time in the worst case. Finally, a revision of graph-classes that accept DCR computation in polynomial time is then included. In this class we have graphs with bounded co-rank, graphs with bounded genus, planar graphs, and, in particular, Monma graphs, which are relevant in robust network design. We extend this class adding arborescence graphs. A discussion of trends for future work is offered in the conclusions.
{"title":"Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs","authors":"E. Canale, J. Piccini, F. Robledo, P. Romero","doi":"10.1145/2684083.2684095","DOIUrl":"https://doi.org/10.1145/2684083.2684095","url":null,"abstract":"In this paper we address a problem from the field of network reliability, called diameter-constrained reliability. Specifically, we are given a simple graph G = (V, E) with [V] = n nodes and [E] = m links, a subset K ⊆ V of terminals, a vector p = (p1,...,pm) &epsis; [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 --- pi. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by RdK,G(p).\u0000 The general DCR computation is inside the class of NP-Hard problems, since is subsumes the complexity that a random graph is connected. In this paper the computational complexity of DCR-subproblems is discussed in terms of the number of terminal nodes k = [K] and diameter d. A factorization formula for exact DCR computation is provided, that runs in exponential time in the worst case. Finally, a revision of graph-classes that accept DCR computation in polynomial time is then included. In this class we have graphs with bounded co-rank, graphs with bounded genus, planar graphs, and, in particular, Monma graphs, which are relevant in robust network design. We extend this class adding arborescence graphs. A discussion of trends for future work is offered in the conclusions.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125474230","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}
C. Souza, Edjair Mota, L. Galvao, P. Manzoni, Juan-Carlos Cano
Certain kinds of delay and disruption tolerant networks need the human support to send data between users without a contemporaneous end-to-end path between them. However, humans are socially selfish and tend to cooperate with whom they have a social relationship, fact that affects the overall performance. Memory space is a critical resource on mobile devices, and since the intermediate nodes have to store the messages, buffer management strategy becomes a crucial factor to achieve a satisfactory network performance. Very little attention has been directed towards applying the social characteristics of the users to mitigate the congestion in DTN. This paper presents a buffer management strategy for DTNs that takes into account a value associated with the social relationship strength among the users. We evaluated this policy in conjunction with the Epidemic and PRoPHET routing algorithms. By means of a thoroughly planned set of steady-state simulation experiments, we found that the proposed scheme can increase the delivery rate besides decreasing the average delay.
{"title":"Drop Less Known strategy for buffer management in DTN Nodes","authors":"C. Souza, Edjair Mota, L. Galvao, P. Manzoni, Juan-Carlos Cano","doi":"10.1145/2684083.2684089","DOIUrl":"https://doi.org/10.1145/2684083.2684089","url":null,"abstract":"Certain kinds of delay and disruption tolerant networks need the human support to send data between users without a contemporaneous end-to-end path between them. However, humans are socially selfish and tend to cooperate with whom they have a social relationship, fact that affects the overall performance. Memory space is a critical resource on mobile devices, and since the intermediate nodes have to store the messages, buffer management strategy becomes a crucial factor to achieve a satisfactory network performance. Very little attention has been directed towards applying the social characteristics of the users to mitigate the congestion in DTN. This paper presents a buffer management strategy for DTNs that takes into account a value associated with the social relationship strength among the users. We evaluated this policy in conjunction with the Epidemic and PRoPHET routing algorithms. By means of a thoroughly planned set of steady-state simulation experiments, we found that the proposed scheme can increase the delivery rate besides decreasing the average delay.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115058656","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
扫码关注我们
求助内容：
应助结果提醒方式：