2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)最新文献

The Stratified Shortest-Paths Problem (invited paper) 分层最短路径问题(特邀论文)

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-03-18 DOI: 10.1109/COMSNETS.2010.5432000

Timothy G. Griffin

引用次数: 10

On the robustness of wireless opportunistic routing toward inaccurate link-level measurements 关于无线机会路由对不准确链路电平测量的鲁棒性

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431992

P. Lee, V. Misra, D. Rubenstein

{"title":"On the robustness of wireless opportunistic routing toward inaccurate link-level measurements","authors":"P. Lee, V. Misra, D. Rubenstein","doi":"10.1109/COMSNETS.2010.5431992","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431992","url":null,"abstract":"The quality of wireless links is inherently dynamic, and this often makes the measurements of link delivery probabilities inaccurate over short timescales. We present Stable Opportunistic Routing (SOR), which improves unicast throughput for wireless mesh routing in the presence of inaccurate link-level measurements. In essence, SOR integrates two key features of prior approaches: (i) nodes trigger or suppress transmissions by inferring the actual reception of packets by neighboring nodes through channel overhearing, and (ii) nodes use network coding to avoid redundant transmissions. In addition, SOR is less dependent on accurate timing estimates or measured loss rates than prior approaches. Our stance is to argue that by carefully incorporating prior approaches into the design space of SOR, we can make opportunistic routing more robust toward link-level measurement errors, a practical issue in wireless mesh routing. Using nsclick simulation, we show that SOR has higher throughput than existing shortest-path and opportunistic routing protocols in large-scale networks, and the performance gain is more prominent when link-level measurements are erroneous.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115245257","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

MTorrent: A multicast enabled BitTorrent protocol MTorrent:一种支持多播的BitTorrent协议

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431979

P. Agrawal, Hitesh Khandelwal, R. Ghosh

引用次数: 1

An end-to-end QoS aware greedy distributed scheduling framework for WiMAX mesh networks 面向WiMAX网状网络的端到端QoS感知贪婪分布式调度框架

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431964

A. Kapoor, V. Ribeiro

{"title":"An end-to-end QoS aware greedy distributed scheduling framework for WiMAX mesh networks","authors":"A. Kapoor, V. Ribeiro","doi":"10.1109/COMSNETS.2010.5431964","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431964","url":null,"abstract":"In this paper, we propose a greedy framework for distributed scheduling in the IEEE 802.16 MeSH mode, which uses a novel “End-to-end QoS aware bandwidth Reservation Protocol” (EQRP) to provide end-to-end QoS guarantee to intramesh flows. The proposed framework provides an efficient and integrated solution to QoS aware routing and call admission control in distributed WiMAX mesh networks. The framework does not rely on any special node for resource management which makes it more scalable and robust to node failures. To save expensive control overheads, EQRP learns from previous bandwidth reservation failures to maintain a rank list of next hops for every destination and uses the “Greedy Forwarding” algorithm to do bandwidth reservation using slot information from only two hop neighbor routers'. We compare EQRP with Race Free Protocol (RFP) and evaluate its performance with extensive simulations in ns2. Simulations show that for static WiMAX mesh network, the “Greedy Forwarding” algorithm used by EQRP admits approximately 10% more VOIP calls. For a random topology of 25 mesh routers, the aggregate signaling overhead generated by EQRP at a high call arrival rate of 1/2000 (calls/milli-seconds) is 76% less than that generated by RFP. In comparison with RFP, EQRP took 200 milli-seconds less average call setup time.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037927","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}

引用次数: 15

Network bandwidth configuration tool for Xen virtual machines 用于Xen虚拟机的网络带宽配置工具

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431965

K. Mathew, Purushottam Kulkarni, V. Apte

引用次数: 9

An energy efficient and Fault-Tolerant Clock Synchronization Protocol for wireless sensor networks 一种用于无线传感器网络的节能容错时钟同步协议

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432009

Amulya Ratna Swain, R. Hansdah

{"title":"An energy efficient and Fault-Tolerant Clock Synchronization Protocol for wireless sensor networks","authors":"Amulya Ratna Swain, R. Hansdah","doi":"10.1109/COMSNETS.2010.5432009","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432009","url":null,"abstract":"Recent advances in the development of wireless sensor networks(WSNs) have considerably increased the interest in their applications for a wide range of problems such as environmental monitoring, target tracking, habitat monitoring etc. Many of these applications and the wireless sensor network(WSN) itself require that the clocks of the sensor nodes are synchronized with certain accuracy. Existing approaches to clock synchronization in WSNs are mostly hierarchical in nature. A hierarchical structure is usually difficult to maintain, and it results in longer synchronization phase and reduced synchronization accuracy for large WSNs. Traditional internal clock synchronization protocols that have been proposed for distributed systems assume that the network is complete, i.e., every node can communicate with every other node directly. But WSNs, in general, are not a complete network, and hence, traditional internal clock synchronization protocols are not directly suitable for WSNs. In this paper, we propose a novel peer-to-peer based fully distributed internal clock synchronization protocol for wireless sensor networks which are not a complete network. We have analyzed our protocol for bounds on synchronization error, and shown that the synchronization error is always upper bounded. We have carried out extensive simulation studies using Castalia simulator (up to 1000 nodes) to evaluate the performance of our protocol and also compared its performance with that of TPSN. The accuracy achieved is consistently better than that of TPSN, and the energy consumption per node is considerably less than that of TPSN except for small WSNs requiring higher accuracy. We have also implemented our protocol using TinyOS in a WSN consisting of a few TelosB motes. The experimental results from the above implementation of our protocol show that the synchronization error is bounded and the accuracy is within a few tics of the external clock.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131905676","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}

引用次数: 18

StrandCast: Peer-to-peer content distribution for latency tolerant applications StrandCast:用于容忍延迟应用程序的点对点内容分发

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431998

Ketan Mayer-Patel, Andrew Jones

{"title":"StrandCast: Peer-to-peer content distribution for latency tolerant applications","authors":"Ketan Mayer-Patel, Andrew Jones","doi":"10.1109/COMSNETS.2010.5431998","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431998","url":null,"abstract":"Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124303105","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

P2P content sharing in spontaneous multi-hop wireless networks 自发多跳无线网络中的P2P内容共享

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432005

M. Sbai, Emna Salhi, C. Barakat

{"title":"P2P content sharing in spontaneous multi-hop wireless networks","authors":"M. Sbai, Emna Salhi, C. Barakat","doi":"10.1109/COMSNETS.2010.5432005","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432005","url":null,"abstract":"Spontaneous multi-hop wireless networks provide a new environment for sharing content among communities of end users. Nodes interested in some content can share it on a multi-hop basis by relying on the collaboration of intermediate nodes. Organizing the communication overlay in such an environment is then a challenging task especially given the mobility of the nodes, the interference, and the scarcity of resources. In this work, we propose and implement a general, stand-alone and efficient P2P content sharing protocol for wireless ad hoc networks. We consider general and realistic scenarios ranging from a single overlay to multiple overlays coexisting in the same network, and for every single overlay, we consider different peer densities in the network. The main challenges are overlay disconnections, routing overhead, low sharing opportunities and instability of distant paths. Our protocol proposes efficient solutions for these problems leading to the best download times while guaranteeing the maximum sharing opportunities among the peers. We validate our protocol through extensive simulations and experimentations on the ORBIT platform.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114829306","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}

引用次数: 15

Adaptive Power Control with Overhearing Avoidance for wireless sensor networks 无线传感器网络的自适应抗干扰功率控制

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432002

M. Ramakrishnan, P. Ranjan

引用次数: 3

A channel-based hypothesis testing approach to enhance user authentication in wireless networks 一种基于信道假设检验的无线网络用户认证方法

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432018

Jitendra Tugnait, Hyosung Kim

{"title":"A channel-based hypothesis testing approach to enhance user authentication in wireless networks","authors":"Jitendra Tugnait, Hyosung Kim","doi":"10.1109/COMSNETS.2010.5432018","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432018","url":null,"abstract":"We consider a physical layer approach to enhance wireless security by using the unique wireless channel state information (CSI) of a legitimate user to authenticate subsequent transmissions from this user, thereby denying access to any spoofer whose CSI would significantly differ from that of the legitimate user by virtue of a different spatial location. In some existing approaches, multicarrier systems have been considered where the channel frequency response at distinct frequencies is used to devise a hypothesis testing approach: is the CSI of the current transmission (packet) the same as that of the previous transmission? In this paper we investigate a single-carrier timedomain approach via either residual testing or time-domain CSI comparison. A hypothesis testing approach is formulated to test whiteness of residuals from current transmission where the residuals are generated using the estimated channel from the previous transmission. We also consider a hypothesis testing approach where the time-domain CSI of the current transmission is compared with that of the previous transmission. Two binary hypothesis testing approaches are formulated and illustrated via simulations.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127361820","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}

引用次数: 60