Named Data Networking (NDN), aka Content Centric Networking (CCN), excels in content distribution especially multimedia distribution, which can consume significant network bandwidth. With the market penetration of mobile devices and advancement of wireless technologies, media streaming over Wi-Fi becomes increasingly popular but it does not scale well in today's IP based networking. A natural question therefore is how to leverage NDN to improve and optimize media streaming over Wi-Fi. As a first step towards this problem, we set up a 5-node Wi-Fi media streaming test bed based on Wi-Fi Direct technology and use it to collect the bandwidth and CPU usage data when streaming media in NDN as well as in IP networking. We test 4 streaming scenarios in which a live video is streamed from one publisher to multiple consumers over Wi-Fi Direct and present our measurement results in this paper. Our experimental results indicate that the bandwidth consumption between a content publisher and its forwarder (i.e., Access point) over Wi-Fi can be effectively and dramatically reduced by NDN, offering much better scalability than IP. However, CPU usage can become much higher in NDN than in IP, which deserves further investigation and optimization.
{"title":"A Measurement Study on Media Streaming over Wi-Fi in Named Data Networking","authors":"Samiuddin Mohammed, Mengjun Xie","doi":"10.1109/MASS.2015.56","DOIUrl":"https://doi.org/10.1109/MASS.2015.56","url":null,"abstract":"Named Data Networking (NDN), aka Content Centric Networking (CCN), excels in content distribution especially multimedia distribution, which can consume significant network bandwidth. With the market penetration of mobile devices and advancement of wireless technologies, media streaming over Wi-Fi becomes increasingly popular but it does not scale well in today's IP based networking. A natural question therefore is how to leverage NDN to improve and optimize media streaming over Wi-Fi. As a first step towards this problem, we set up a 5-node Wi-Fi media streaming test bed based on Wi-Fi Direct technology and use it to collect the bandwidth and CPU usage data when streaming media in NDN as well as in IP networking. We test 4 streaming scenarios in which a live video is streamed from one publisher to multiple consumers over Wi-Fi Direct and present our measurement results in this paper. Our experimental results indicate that the bandwidth consumption between a content publisher and its forwarder (i.e., Access point) over Wi-Fi can be effectively and dramatically reduced by NDN, offering much better scalability than IP. However, CPU usage can become much higher in NDN than in IP, which deserves further investigation and optimization.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"49 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995476","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 the research of content-centric networking (CCN), there have been investigated several fragmentation methods of CCN messages in order to implement CCN as an L3 protocol. The latest version of the CCN protocol (CCN 1.0) adopts the end-to-end fragmentation method that fragments CCN messages only at the content publisher. This allows intermediate routers to simply forward fragmentation packets, and hence this can solve the problem of the processing delay at routers in the existing fragmentation methods for the CCN. However, the end-to-end fragmentation has not been well-analyzed and well-evaluated yet. In this paper, we analyze the end-to-end fragmentation and clarify its important parameter for the efficient transmission. Moreover, we evaluate fragmentation methods for the cache-hit ratio and the header overhead, and we clarify advantages and disadvantages of the methods in terms of the transmission efficiency.
{"title":"A Performance Analysis of End-to-End Fragmentation in Content-Centric Networking","authors":"Kazuaki Ueda, K. Yokota, Jun Kurihara, A. Tagami","doi":"10.1109/MASS.2015.24","DOIUrl":"https://doi.org/10.1109/MASS.2015.24","url":null,"abstract":"In the research of content-centric networking (CCN), there have been investigated several fragmentation methods of CCN messages in order to implement CCN as an L3 protocol. The latest version of the CCN protocol (CCN 1.0) adopts the end-to-end fragmentation method that fragments CCN messages only at the content publisher. This allows intermediate routers to simply forward fragmentation packets, and hence this can solve the problem of the processing delay at routers in the existing fragmentation methods for the CCN. However, the end-to-end fragmentation has not been well-analyzed and well-evaluated yet. In this paper, we analyze the end-to-end fragmentation and clarify its important parameter for the efficient transmission. Moreover, we evaluate fragmentation methods for the cache-hit ratio and the header overhead, and we clarify advantages and disadvantages of the methods in terms of the transmission efficiency.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127673694","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}
De-gan Zhang, Zhen Ma, Dexin Zhao, J. Song, Si Liu
With the development of Internet, various kinds of new applications appear constantly. They all have high requirements to the time delay, throughput, especially strong real-time applications such as mobile monitoring, video calls. This is a new challenge to the existing congestion control method. In order to solve this problem, we propose novel adaptive queue management intelligent algorithm in this paper. New active queue management algorithm adopts a new formula to calculate the discard packet rate. The discard packet rate can be calculated according to the changes of average queue and the nonlinear function. This new algorithm named ASRED (Adaptive Sigmoid RED) is based on the framework of RED (Random Early Detection). ASRED uses a new function to calculate the discarding probability. In addition, the adaptive adjustment of maxp mechanism is added into the algorithm.
{"title":"Novel Adaptive Queue Intelligent Management Algorithm","authors":"De-gan Zhang, Zhen Ma, Dexin Zhao, J. Song, Si Liu","doi":"10.1109/MASS.2015.98","DOIUrl":"https://doi.org/10.1109/MASS.2015.98","url":null,"abstract":"With the development of Internet, various kinds of new applications appear constantly. They all have high requirements to the time delay, throughput, especially strong real-time applications such as mobile monitoring, video calls. This is a new challenge to the existing congestion control method. In order to solve this problem, we propose novel adaptive queue management intelligent algorithm in this paper. New active queue management algorithm adopts a new formula to calculate the discard packet rate. The discard packet rate can be calculated according to the changes of average queue and the nonlinear function. This new algorithm named ASRED (Adaptive Sigmoid RED) is based on the framework of RED (Random Early Detection). ASRED uses a new function to calculate the discarding probability. In addition, the adaptive adjustment of maxp mechanism is added into the algorithm.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080826","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}
A. Sayakkara, C. Suduwella, Charith Shalitha, Rumesh Hapuarachchi, C. Keppitiyagama, K. Zoysa
We argue that, a wireless sensor does not have to implement a full networking stack in order to be a part of an energy efficient sensing application as long as it can deliver its sensed data to an Internet connected device over a single hop. Current hardware industry trends indicate the possibility of implementing wireless sensors for a low cost with simple capabilities. This poster highlights our preliminary work aligned with this trend and aims to open a discussion on this topic.
{"title":"Wireless Sensing: What Simplicity Has to Offer?","authors":"A. Sayakkara, C. Suduwella, Charith Shalitha, Rumesh Hapuarachchi, C. Keppitiyagama, K. Zoysa","doi":"10.1109/MASS.2015.79","DOIUrl":"https://doi.org/10.1109/MASS.2015.79","url":null,"abstract":"We argue that, a wireless sensor does not have to implement a full networking stack in order to be a part of an energy efficient sensing application as long as it can deliver its sensed data to an Internet connected device over a single hop. Current hardware industry trends indicate the possibility of implementing wireless sensors for a low cost with simple capabilities. This poster highlights our preliminary work aligned with this trend and aims to open a discussion on this topic.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115539594","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}
Current Distributed Radio Access Network (DRAN) architectures, which are characterized by a static configuration and deployment of Base Stations (BSs), have exposed their limitations in handling the temporal and geographical fluctuations of capacity demand as well as the electromagnetic interference caused by the high band reuse, making them inadequate to support the ever-increasing users' data-rate requests. Cloud Radio Access Network (C-RAN) is a new centralized paradigm based on virtualization that has emerged as a promising architecture to address efficiently such fluctuations. C-RAN provides high energy efficiency and resource utilization across Software Defined Wireless Networks (SDWNs). A novel reconfigurable solution based on C-RAN is proposed to adapt dynamically and efficiently to fluctuations in per-user capacity demand. A real-time test bed is used to compare the proposed dynamic provisioning solution against the traditional static approach.
{"title":"Dynamic Provisioning for High Energy Efficiency and Resource Utilization in Cloud RANs","authors":"Abolfazl Hajisami, Tuyen X. Tran, D. Pompili","doi":"10.1109/MASS.2015.71","DOIUrl":"https://doi.org/10.1109/MASS.2015.71","url":null,"abstract":"Current Distributed Radio Access Network (DRAN) architectures, which are characterized by a static configuration and deployment of Base Stations (BSs), have exposed their limitations in handling the temporal and geographical fluctuations of capacity demand as well as the electromagnetic interference caused by the high band reuse, making them inadequate to support the ever-increasing users' data-rate requests. Cloud Radio Access Network (C-RAN) is a new centralized paradigm based on virtualization that has emerged as a promising architecture to address efficiently such fluctuations. C-RAN provides high energy efficiency and resource utilization across Software Defined Wireless Networks (SDWNs). A novel reconfigurable solution based on C-RAN is proposed to adapt dynamically and efficiently to fluctuations in per-user capacity demand. A real-time test bed is used to compare the proposed dynamic provisioning solution against the traditional static approach.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114102755","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}
Beaconless topology control algorithms reduce message overhead of local topology constructions compared to conventional (beacon-based) local approaches by avoiding maintenance of neighborhood tables. Moreover, they construct a node's adjacency in the desired topology on demand and only locally, i.e., Do not require network-wide operation. In this work, we present a beaconless topology control algorithm which enables a node to reactively construct a planar backbone graph in its geographic vicinity. This backbone graph is a constant node degree, constant stretch hop-spanner for the input quasi unit disk graph. Our contribution is novel, since all known algorithms with comparable outputs require maintenance of neighborhood tables and are designed for network-wide operation. In addition, it is of significance since there are several applications of it, e.g., In the context of geographic unicast and multicast routing with guaranteed delivery.
{"title":"On Demand Beaconless Planar Backbone Construction for Quasi Unit Disk Graphs","authors":"Florentin Neumann, Hannes Frey","doi":"10.1109/MASS.2015.63","DOIUrl":"https://doi.org/10.1109/MASS.2015.63","url":null,"abstract":"Beaconless topology control algorithms reduce message overhead of local topology constructions compared to conventional (beacon-based) local approaches by avoiding maintenance of neighborhood tables. Moreover, they construct a node's adjacency in the desired topology on demand and only locally, i.e., Do not require network-wide operation. In this work, we present a beaconless topology control algorithm which enables a node to reactively construct a planar backbone graph in its geographic vicinity. This backbone graph is a constant node degree, constant stretch hop-spanner for the input quasi unit disk graph. Our contribution is novel, since all known algorithms with comparable outputs require maintenance of neighborhood tables and are designed for network-wide operation. In addition, it is of significance since there are several applications of it, e.g., In the context of geographic unicast and multicast routing with guaranteed delivery.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115299404","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}
Despite the growing deployment of 4G networks, the capacity of cellular networks is still insufficient to satisfy the ever-increasing bandwidth demand of mobile applications. Given the common interest of mobile users, Device-to-Device (D2D) communication has emerged as a promising solution to offload cellular traffic and enable proximity-based services. One of the main detriments for D2D communication is the lack of incentive for mobile users to share their content, since such sharing inevitably consumes limited resources and potentially jeopardizes user privacy. In this paper, we study the incentive problem in D2D communications. Specifically, we model the incentive in offloading scenario as an auction game. A trading network is constructed between an eNB and users, in which auctions are conducted to group offloading users and determine proper rewards. We further design a randomized auction mechanism to guarantee system efficiency and truthfulness. Extensive experiments verify the effectiveness of our mechanism in that it achieves a significant performance gain in comparison with baseline methods.
{"title":"Rado: A Randomized Auction Approach for Data Offloading via D2D Communication","authors":"Yifei Zhu, Jingjie Jiang, Bo Li, Baochun Li","doi":"10.1109/MASS.2015.83","DOIUrl":"https://doi.org/10.1109/MASS.2015.83","url":null,"abstract":"Despite the growing deployment of 4G networks, the capacity of cellular networks is still insufficient to satisfy the ever-increasing bandwidth demand of mobile applications. Given the common interest of mobile users, Device-to-Device (D2D) communication has emerged as a promising solution to offload cellular traffic and enable proximity-based services. One of the main detriments for D2D communication is the lack of incentive for mobile users to share their content, since such sharing inevitably consumes limited resources and potentially jeopardizes user privacy. In this paper, we study the incentive problem in D2D communications. Specifically, we model the incentive in offloading scenario as an auction game. A trading network is constructed between an eNB and users, in which auctions are conducted to group offloading users and determine proper rewards. We further design a randomized auction mechanism to guarantee system efficiency and truthfulness. Extensive experiments verify the effectiveness of our mechanism in that it achieves a significant performance gain in comparison with baseline methods.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123164761","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}
Hua Huang, Shan Lin, Lin Chen, Jie Gao, A. Mamat, Jie Wu
Recent advances in energy transfer technology is boosting the development of renewable sensor networks. To sustain such a network, a mobile robot travels from node to node to recharge each sensor before its battery runs out. Consider each node's recharge as a real-time task, the robot needs to serve these tasks by their deadlines. This represents a class of challenging mobility scheduling problems, where the nodes' deadlines and spatial distribution are often at odds with each other. In this paper, we focus on the scenario where nodes have heterogeneous energy consumption rates, and our goal is to maximize the percentage of nodes alive. We formulate this scheduling problem and prove its NP-completeness. To solve this problem, we propose a spatial dependent task scheduling algorithm, which quantifies the impact of scheduling proximate tasks on the other tasks. With extensive simulations, we reveal the trade-offs of existing solutions under a wide range of network scenarios. Our evaluation results show that our algorithms out-perform classical TSP scheduler by up to 10% and 85% in terms of coverage ratio and average tardiness, respectively.
{"title":"Dynamic Mobile Charger Scheduling in Heterogeneous Wireless Sensor Networks","authors":"Hua Huang, Shan Lin, Lin Chen, Jie Gao, A. Mamat, Jie Wu","doi":"10.1109/MASS.2015.99","DOIUrl":"https://doi.org/10.1109/MASS.2015.99","url":null,"abstract":"Recent advances in energy transfer technology is boosting the development of renewable sensor networks. To sustain such a network, a mobile robot travels from node to node to recharge each sensor before its battery runs out. Consider each node's recharge as a real-time task, the robot needs to serve these tasks by their deadlines. This represents a class of challenging mobility scheduling problems, where the nodes' deadlines and spatial distribution are often at odds with each other. In this paper, we focus on the scenario where nodes have heterogeneous energy consumption rates, and our goal is to maximize the percentage of nodes alive. We formulate this scheduling problem and prove its NP-completeness. To solve this problem, we propose a spatial dependent task scheduling algorithm, which quantifies the impact of scheduling proximate tasks on the other tasks. With extensive simulations, we reveal the trade-offs of existing solutions under a wide range of network scenarios. Our evaluation results show that our algorithms out-perform classical TSP scheduler by up to 10% and 85% in terms of coverage ratio and average tardiness, respectively.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121783813","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 propose a novel modeling framework to study congestion in delay- and disruption tolerant networks (DTNs). The proposed model is based on directed site-bond percolation where sites represent space-time positions of DTN nodes, and bonds are contact opportunities, i.e. Communication links that can be established whenever nodes come in range of each other. To the best of our knowledge, this is the first model of DTN congestion using percolation theory. The proposed modeling framework is simple yet general and can be used to evaluate different DTN congestion control mechanisms in a variety of scenarios and conditions. We validate our model by showing that its results match quite well results obtained from the ONE DTN simulation platform. We also show that our model can be used to understand how parameters like buffer management policy, buffer size, routing mechanism, and message time-to-live affect network congestion.
{"title":"A Percolation-Based Approach to Model DTN Congestion Control","authors":"A. P. Silva, M. Hilario, C. Hirata, K. Obraczka","doi":"10.1109/MASS.2015.91","DOIUrl":"https://doi.org/10.1109/MASS.2015.91","url":null,"abstract":"In this paper, we propose a novel modeling framework to study congestion in delay- and disruption tolerant networks (DTNs). The proposed model is based on directed site-bond percolation where sites represent space-time positions of DTN nodes, and bonds are contact opportunities, i.e. Communication links that can be established whenever nodes come in range of each other. To the best of our knowledge, this is the first model of DTN congestion using percolation theory. The proposed modeling framework is simple yet general and can be used to evaluate different DTN congestion control mechanisms in a variety of scenarios and conditions. We validate our model by showing that its results match quite well results obtained from the ONE DTN simulation platform. We also show that our model can be used to understand how parameters like buffer management policy, buffer size, routing mechanism, and message time-to-live affect network congestion.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122487834","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}
Mobile multicast has been deployed in telecommunication networks for information dissemination applications such as IPTV and video conferencing. Recent studies of mobile multicast focused on fast handover protocols, and algorithms for multicast tree management have witnessed little improvement over the years. Shortest path trees represent the status quo of multicast topology in real-world systems. Steiner trees were investigated extensively in the theory community and are known to be bandwidth efficient, but come with an associated complexity. Recent developments in the Software Defined Networking (SDN) paradigm have shed light on implementing more sophisticated protocols for better routing performance. We propose an SDN-based design to combat the complexity vs. Performance dilemma in mobile multicast. We construct low-cost Steiner trees for multicastin a mobile network, employing an SDN controller for coordinating tree construction and morphing. Highlights of our design include a set of efficient online algorithms for tree adjustment when nodes arrive and depart on the fly, and an SDN rule update framework based on constraints expressed by boolean logic to ensure loop free rule updates. The algorithms are proven to achieve a constant competitive ratio against the offline optimal Steiner tree, with an amortized constant number of edge swaps per adjustment. Mininet-based implementation and evaluation further validate the efficacy of our design.
{"title":"Software Defined Mobile Multicast","authors":"Shunyi Xu, Chuan Wu, Zongpeng Li","doi":"10.1109/MASS.2015.87","DOIUrl":"https://doi.org/10.1109/MASS.2015.87","url":null,"abstract":"Mobile multicast has been deployed in telecommunication networks for information dissemination applications such as IPTV and video conferencing. Recent studies of mobile multicast focused on fast handover protocols, and algorithms for multicast tree management have witnessed little improvement over the years. Shortest path trees represent the status quo of multicast topology in real-world systems. Steiner trees were investigated extensively in the theory community and are known to be bandwidth efficient, but come with an associated complexity. Recent developments in the Software Defined Networking (SDN) paradigm have shed light on implementing more sophisticated protocols for better routing performance. We propose an SDN-based design to combat the complexity vs. Performance dilemma in mobile multicast. We construct low-cost Steiner trees for multicastin a mobile network, employing an SDN controller for coordinating tree construction and morphing. Highlights of our design include a set of efficient online algorithms for tree adjustment when nodes arrive and depart on the fly, and an SDN rule update framework based on constraints expressed by boolean logic to ensure loop free rule updates. The algorithms are proven to achieve a constant competitive ratio against the offline optimal Steiner tree, with an amortized constant number of edge swaps per adjustment. Mininet-based implementation and evaluation further validate the efficacy of our design.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"457 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125850886","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
扫码关注我们
求助内容：
应助结果提醒方式：