Proceedings of the 16th International Conference on Distributed Computing and Networking最新文献_第3页

Multi Criteria Decision Analysis assisted Routing in Wireless Sensor Network using Fuzzy rules 基于模糊规则的多准则决策分析辅助无线传感器网络路由

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684499

S. Bhunia, Bijoy Das, N. Mukherjee

引用次数: 9

Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks 无线传感器网络强最小能量拓扑的boruvka -增量功率贪心启发式算法

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684490

B. S. Panda, B. K. Bhatta, Deepak Mishra, S. De

{"title":"Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks","authors":"B. S. Panda, B. K. Bhatta, Deepak Mishra, S. De","doi":"10.1145/2684464.2684490","DOIUrl":"https://doi.org/10.1145/2684464.2684490","url":null,"abstract":"Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmission range to each sensor node so that the sum of the transmission range for all the sensor is minimum subject to the constraint that the network is strongly connected (there is a directed path between every pair of nodes in the Network). This problem is known to be NP-hard. As this problem has lots of practical applications, several approximation algorithms and heuristics have been proposed. In this paper, we propose a new heuristic called Boruvka-incremental power greedy heuristic based on the Boruvka algorithm for the minimum spanning tree (MST) problem for solving the SMET problem. We compare the performance of the Boruvka-incremental power greedy heuristic with Kruskal-incremental power greedy heuristic and Prim-incremental power greedy heuristic. Extensive simulation results illustrate that Boruvka heuristic outperforms the Kruskal-incremental power greedy heuristic and Prim-incremental power greedy heuristic. We have also proved that apart from providing significant improvement in terms of average power savings, Boruvka incremental power greedy heuristic takes O(n) time for planar graphs as compared to O(n log n) time taken by Kruskal-incremental power greedy heuristic and O(n2) time taken by Prim-incremental power greedy heuristic, where n is the number of nodes in the network.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131621044","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}

引用次数: 2

An adaptive P2P overlay for MANETs 一个自适应的P2P覆盖的manet

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684496

M. Seddiki, Mahfoud Benchaïba

引用次数: 11

Controlling Unfairness due to Physical Layer Capture and Channel Bonding in 802.11n+s Wireless Mesh Networks 802.11n+s无线Mesh网络中物理层捕获和信道绑定导致的不公平控制

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684486

Sandip Chakraborty, Sukumar Nandi

{"title":"Controlling Unfairness due to Physical Layer Capture and Channel Bonding in 802.11n+s Wireless Mesh Networks","authors":"Sandip Chakraborty, Sukumar Nandi","doi":"10.1145/2684464.2684486","DOIUrl":"https://doi.org/10.1145/2684464.2684486","url":null,"abstract":"This paper analyzes the effect of physical layer capture (PLC) and channel bonding over high throughput wireless mesh backbone network built over IEEE 802.11n+s standard. With the help of PLC, a signal can be recovered from channel noise and interference if the difference between the received signal strengths is more than a predefined threshold. It is well known that PLC can affect fairness during channel access by biasing towards the link with better signal strength. In this paper, we show that in the presence of channel bonding, high throughput links always suffer due to PLC, that ensues severe unfairness in a mesh backbone network. As a consequence, the performance of the network drops significantly from its actual capacity. This paper presents an adaptive bonding opportunity and channel reservation scheme to mitigate from network unfairness in an IEEE 802.11n+s mesh network. The performance of the proposed scheme is analyzed and evaluated using a 13 node mesh networking testbed. It has been observed that the adaptive bonding opportunity and channel reservation performs significantly better in terms of fairness compared to the standard, and results in a notable performance improvement for end-to-end flow parameters.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124145999","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}

引用次数: 5

Mobility Aware Event Dissemination in VANET VANET中机动感知事件传播

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684498

J. Mukherjee, Arobinda Gupta

{"title":"Mobility Aware Event Dissemination in VANET","authors":"J. Mukherjee, Arobinda Gupta","doi":"10.1145/2684464.2684498","DOIUrl":"https://doi.org/10.1145/2684464.2684498","url":null,"abstract":"Many future VANET applications will be event-driven and will require events of different kinds to be delivered to vehicles en route in time. In this work, we propose a publish-subscribe based communication framework for a service provider (SP) that utilizes its roadside units (RSUs) to deliver relevant events to moving vehicles. Vehicles subscribe to a SP for specific types of events; the events are also reported to the SP. The SP delivers the events to the subscribed vehicles within the validity periods of both the subscriptions and the events through RSUs placed along the route of the vehicles. The problem is referred as the Minimum Cost Event Placement Problem [10] that schedules the placement of events in RSUs for different time intervals so that the events are delivered to the subscribed vehicles while incurring minimum cost of utilization of the RSUs. In this paper, we give a ln n approximation algorithm for the problem, where n is the number of subscriptions. We then propose a centralized online algorithm to solve the problem. A lower bound on the cost of utilization of the RSUs for a given set of subscriptions and events is presented next. Detailed simulation results in realistic city traffic scenarios are presented to show the performance of the algorithms.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123132052","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}

引用次数: 3

TADL: A Trust-Aware Dynamic Location-Based Protocol Suite For Discovering Multiple Paths in MANETs 一种基于信任感知的动态位置协议套件，用于发现manet中的多条路径

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684491

Helen Bakhsh, Ning Zhang, A. Carpenter

{"title":"TADL: A Trust-Aware Dynamic Location-Based Protocol Suite For Discovering Multiple Paths in MANETs","authors":"Helen Bakhsh, Ning Zhang, A. Carpenter","doi":"10.1145/2684464.2684491","DOIUrl":"https://doi.org/10.1145/2684464.2684491","url":null,"abstract":"This paper describes the design and evaluation of a multiple path discovery protocol suite aimed at finding a set of most trust-worthy paths for routing higher priority traffic towards a destination node with minimum overhead costs. The protocol suite, called a the Trust-Aware Dynamic Location-based (TADL) protocol suite, has taken three measures to optimize the path discovery outcome: (a) it uses a directional approach to broadcast route request packets to a destination, (b) it adjust the size of the searching area dynamically in response to the underlying network conditions, and (c) it uses trust values to govern the selection of neighbours in path formation and to reduce the overhead incurred in trust estimation, we have adopted a direct trust model. Measures (a) and (b) are take to minimise the level of broadcast traffic injected into the network in order to accomplish the path discovery task, and measure (c) is taken to ensure that the paths discovered are of best quality in terms of reliable packet deliveries. TADL is evaluated, using simulation, against the LAR protocol that has only implemented (a) (i.e. LAR only uses a location-based directional broadcast approach) under various network conditions. Our simulation study shows that TADL outperforms LAR in terms of reducing the routing overheads in the network. This overhead reduction can have a positive effect on QoS making the TADL more effective and efficient in providing QoS.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129906244","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}

引用次数: 1

A Universal Approach to Data Center Network Design 数据中心网络设计的通用方法

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684505

Aditya Akella, Theophilus A. Benson, B. Chandrasekaran, Cheng Huang, B. Maggs, D. Maltz

引用次数: 15

Analysis of Floating Index Caching Technique for P2P Overlay Index Propagation P2P覆盖索引传播的浮动索引缓存技术分析

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684489

K. Haribabu, C. Hota

引用次数: 1

Improving Energy Efficiency of IO-Intensive MapReduce Jobs 提高io密集型MapReduce作业的能效

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684484

Nidhi Tiwari, S. Sarkar, M. Indrawan, U. Bellur

{"title":"Improving Energy Efficiency of IO-Intensive MapReduce Jobs","authors":"Nidhi Tiwari, S. Sarkar, M. Indrawan, U. Bellur","doi":"10.1145/2684464.2684484","DOIUrl":"https://doi.org/10.1145/2684464.2684484","url":null,"abstract":"Map-Reduce is a popular data-parallel programming model for varied analysis of huge volumes of data. While a multicore and many CPU HPC infrastructure can be used to improve parallelism of map-reduce tasks, IO-bandwidth limitations may make them ineffective. IO-intensive activities are essential in any MapReduce cluster. In HPC nodes, IO-intensive jobs get queued at the IO-resources while the CPU remain underutilized, resulting in a poor performance, high power consumption and thus, energy inefficiency. In this paper, we investigate which power management setting can be used to improve the energy efficiency of IO-intensive MapReduce jobs by performing a thorough empirical study. Our analysis indicates that a constant CPU frequency can reduce the energy consumption of an IO-intensive job, while improving its performance. Consequently, we build a set of regression models to predict the energy consumption of IO-intensive jobs at a CPU frequency for a given input data volume. We obtained same set of models, with different coefficients, for two different types of IO-intensive jobs, which substantiates the suitability of identified models. These models predict respective outcomes with 80% accuracy for 80% of the new test cases.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854203","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}

引用次数: 4

Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks 匿名树网络的常空间自稳定中心查找

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684466

A. Datta, L. Larmore, T. Masuzawa

引用次数: 3