2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)最新文献_第6页

A system for audio signalling based NAT Traversal 一个基于NAT穿越的音频信令系统

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716432

Ashish Patro, Yadi Ma, S. Panahi, Jordan Walker, Suman Banerjee

{"title":"A system for audio signalling based NAT Traversal","authors":"Ashish Patro, Yadi Ma, S. Panahi, Jordan Walker, Suman Banerjee","doi":"10.1109/COMSNETS.2011.5716432","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716432","url":null,"abstract":"Mobile users often connect through WiFi access points and frequently find themselves behind NATs that are built into common off-the-shelf home access points or enterprise wireless deployments. Punching a hole through the NATs to establish a P2P connection can be a challenging task for lay users. We present our system, ANT, that utilizes Audio signaling for NAT Traversal. With ANT, unlike other NAT traversal approaches, two mobile clients can establish a direct connection with minimal user intervention and without connecting to an intermediate server. ANT uses UPnP to obtain configuration information for NAT traversal which is then encoded using different audio frequencies and converted to audio sounds that are transmitted through the users' phones. Upon receiving the audio samples through the phone, the remote client converts them back into NAT traversal configuration data. Error correction is added to enhance the reliability of ANT and eliminate the need for retransmissions. Experimental results show that a TCP connection can be swiftly established between mobile clients behind NATs with no manual configuration, even in existence of heavy noise. We believe that ANT can be proved to be a simple, yet practical scheme for NAT traversal, which is as simple as dialing a phone number.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132525626","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}

引用次数: 11

Hierarchical networks with Byzantine Robustness 具有拜占庭鲁棒性的分层网络

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716503

R. Perlman, C. Kaufman

引用次数: 4

‘Control plane’ properties for signaling in loss-feedback based video rate adaptation over shared multicast paths 在共享多播路径上基于损失反馈的视频速率适应信令的“控制平面”属性

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716490

M. Rabby, K. Ravindran, S. Mukhopadhyay, Ramesh Bharadwaj, Gaurav Mangukiya

{"title":"‘Control plane’ properties for signaling in loss-feedback based video rate adaptation over shared multicast paths","authors":"M. Rabby, K. Ravindran, S. Mukhopadhyay, Ramesh Bharadwaj, Gaurav Mangukiya","doi":"10.1109/COMSNETS.2011.5716490","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716490","url":null,"abstract":"In wide-area video conferencing, the rate control of video sources to relieve network congestion along the multicast data path occurs in a distributed manner. In this paper, we study the desirable properties of signaling channels that carry the ‘packet loss report’ (ELR) from a receiver to the sources as a short control message. A signaling channel provides for loss-free and time-ordered flow of ELRs from receivers, so that the rate adjustments of sources triggered by the signaling messages are executed correctly. For instance, the loss of a ELR may delay the source-level response to relieve congestion. Our goal is to improve the quality of rate adaptation when relieving congestion along the video data paths, with a suitably constructed ELR-signaling channel. For this purpose, we employ a group communication substrate, SINS, that provides loss-free and time-ordered message flows based on Lamport's concept of global virtual time. The paper demonstrates improvements in the quality of adaptation during congestion relief: faster convergence to final send rates and lower rate oscillations.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115689072","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

Data hiding scheme for medical images using lossless code for mobile HIMS 移动HIMS中使用无损代码的医学图像数据隐藏方案

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716516

V. N. Kumar, Mrigank Rochan, S. Hariharan, K. Rajamani

{"title":"Data hiding scheme for medical images using lossless code for mobile HIMS","authors":"V. N. Kumar, Mrigank Rochan, S. Hariharan, K. Rajamani","doi":"10.1109/COMSNETS.2011.5716516","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716516","url":null,"abstract":"Information Technology advances have bought forth new challenges in healthcare information management, due to the vast amount of medical data that needs to efficiently stored, retrieved and distributed, and the increased security threats that explicitly have to be addressed. In particular, embedding patient information into a medical image through data hiding could improve the level of security and confidentiality that is essential for diffusion of medical information system. Such security provides integrity of medical images and corresponding documentations, along with protection of confidential information. The scheme imperceptibly embeds in medical images patient's personal information like name and unique identification number. Our objective was to have a simple model which uses minimal resources and hence a strong candidate for use in mobile healthcare applications where the resources of memory, computation and connectivity are extremely limited. To meet these requirements, this paper presents a powerful yet simple lossless scheme for the medical image processing. The method is distortion-tolerant in application. The original image can be recovered with almost no distortion. The scheme has been implemented for images of various sizes and a comparative study is presented.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116351196","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}

引用次数: 11

Wireless across road: RF based road traffic congestion detection 无线跨路:基于射频的道路交通拥堵检测

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716525

Swaroop Roy, Rijurekha Sen, Swanand Kulkarni, Purushottam Kulkarni, B. Raman, Lokendra K. Singh

{"title":"Wireless across road: RF based road traffic congestion detection","authors":"Swaroop Roy, Rijurekha Sen, Swanand Kulkarni, Purushottam Kulkarni, B. Raman, Lokendra K. Singh","doi":"10.1109/COMSNETS.2011.5716525","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716525","url":null,"abstract":"Road congestion is a common problem worldwide. Intelligent Transport Systems (ITS) seek to alleviate this problem using technology. But most ITS techniques, currently used in developed countries, are inapplicable in developing regions due to high cost and assumptions of orderly traffic. Efforts in developing regions have been few. In this paper, we seek to develop a low-cost ITS technique to detect congestion in disorderly road conditions. We take Indian traffic conditions as an example for our analysis. But we believe that most of our claims and experimental results can be extended to other developing countries too. Our technique is based on exploiting the variation in wireless link characteristics when line of sight conditions between a wireless sender and receiver vary. Our system comprises of a wireless sender-receiver pair across a road. The sender continuously sends packets. The receiver measures metrics like signal strength, link quality and packet reception. These metrics show a marked change in values depending on whether the road in between has free-flowing or congested traffic. We have experimented with off-theshelf IEEE 802.15.4 compliant CROSSBOW Telosb motes. From about 15 hours of experimental data on two different roads in Mumbai, we show that we can classify traffic states as free-flowing and congested using a decision tree based classifier with 97% accuracy.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123464595","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}

引用次数: 48

Study of enhanced VoIP performance under congested wireless network scenarios 拥塞无线网络场景下增强VoIP性能的研究

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716509

A. Mukhopadhyay, T. Chakraborty, S. Bhunia, I. S. Misra, S. Sanyal

{"title":"Study of enhanced VoIP performance under congested wireless network scenarios","authors":"A. Mukhopadhyay, T. Chakraborty, S. Bhunia, I. S. Misra, S. Sanyal","doi":"10.1109/COMSNETS.2011.5716509","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716509","url":null,"abstract":"Stringent QoS maintenance in a wireless environment for VoIP communication is a major challenge. VoIP inherently generates constant bit rate traffic and is highly sensitive to network delay. However, unpredictable network congestion makes a VoIP session so degraded that its QoS goes below a tolerable limit. Accordingly, a suitable solution is needed to adapt varying network conditions satisfying minimum QoS while maintaining transparency to the end user. We have extensively studied the effect of variable voice packet payload size with changing number of voice sample frames in the payload of the RTP packets. For this, we have used OPNET Modeler 14.5.A to observe the performance in terms of MOS, End-to-end delay through extensive simulations. Results are provided with valid discussions. Based on the observation, we propose an Adaptive VoIP (AdVoIP) algorithm that may be used in any real life VoIP network for further enhancement of the performance. The adaptive algorithm may use RTCP Receiver Reports to assess the network conditions in real wireless scenarios.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122060177","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}

引用次数: 11

A new code allocation algorithm for multirate CI/MC-CDMA system 一种新的多速率CI/MC-CDMA系统码分配算法

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716522

M. Mukherjee, Preetam Kumar

{"title":"A new code allocation algorithm for multirate CI/MC-CDMA system","authors":"M. Mukherjee, Preetam Kumar","doi":"10.1109/COMSNETS.2011.5716522","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716522","url":null,"abstract":"This paper introduces an efficient code allocation algorithm for multirate carrier interferometry/multicarrier code division multiple access (CI/CM-CDMA) system through simultaneous support of high and low data rate transmission. High priority users are assigned all subcarriers to transmit at high data rate, while low data rate users are gradually increased through alternate allocation of odd-even subcarriers. The cross-correlation between different code pattern is reduced through phase shift of even (odd) CI code using odd (even) sub-carriers by an amount of π/2 and odd (even) CI code using odd (even) sub-carriers by −π/2, all measured with respect to orthogonal CI codes assigned to support high data rate transmission. This algorithm ensures addition of extra users with improved bit error rate (BER) performance by reducing of multiple access interference (MAI). Simulation results show that new code allocation scheme allows more users at a low signal-to-noise ratio (SNR) compared to scheme proposed in [9]. Simulation results also show that new code allocation reduces PAPR by 1.9 dB for 3N system compared to fixed allocation [9].","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124528355","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

Efficient target tracking through binary-detection in sparsely deployed WSN 稀疏部署WSN中基于二值检测的有效目标跟踪

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716476

Deepak Jeswani, Ankit Kesharwani, Sneha S. Chaudhari, V. Sadaphal, R. Ghosh

{"title":"Efficient target tracking through binary-detection in sparsely deployed WSN","authors":"Deepak Jeswani, Ankit Kesharwani, Sneha S. Chaudhari, V. Sadaphal, R. Ghosh","doi":"10.1109/COMSNETS.2011.5716476","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716476","url":null,"abstract":"The problem of tracking moving objects with help of wireless sensor network (WSN) has been studied in past. Most of the solutions rely on the use of specialized and expensive sensors, and on dense deployment of sensors. These techniques are infeasible for applications in low budget domains. In this paper, we propose two novel techniques to track targets using binary sensing that does not need overlapping sensing regions. These techniques can track a target, and estimate the distance it has traversed on the basis of the time that target spends in the vicinity of sensors. In the first technique, the path traced by a moving target is approximated by tangent estimations to three circles, each representing range of a sensor. It allows us to convert the original problem into a semi definite program. The other tracking scheme identifies a band of small width where the target is guaranteed to lie. The band is first approximated using the distance travelled after coming out of vicinity of one sensor and before entering the vicinity of second sensor. This band is then reduced using the distance travelled inside the vicinity of the sensors. We simulated the two methods in NS2 and evaluate both the methods.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132050812","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}

引用次数: 10

Genetic Algorithm techniques to solve Routing and Wavelength Assignment problem in Wavelength Division Multiplexing all-optical networks 遗传算法解决波分复用全光网络中路由和波长分配问题

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716507

Ravi Sankar Barpanda, A. K. Turuk, B. Sahoo, B. Majhi

{"title":"Genetic Algorithm techniques to solve Routing and Wavelength Assignment problem in Wavelength Division Multiplexing all-optical networks","authors":"Ravi Sankar Barpanda, A. K. Turuk, B. Sahoo, B. Majhi","doi":"10.1109/COMSNETS.2011.5716507","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716507","url":null,"abstract":"Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexed (WDM) optical networks assumes assigning the routes and wavelengths to be used to create the lightpaths on behalf of the connection requests. The RWA problem belongs to the class of combinatorial optimization problems. The optimal solution to the RWA problem is found to be NP-hard and thus suited to heuristic approaches. We formulate an Integer Linear Programming (ILP) problem to model the RWA problem as an optimization problem and solve the formulated ILP using Genetic Algorithm (GA) heuristic to obtain a near optimal solution in polynomial time. Our primary optimization objective is the establishment of connection requests with minimum congestion among the individuals. The secondary targets are to minimize the hop count, route length, the number of fiber links utilized to honor all the lightpath requests. The GA based heuristic approach is simulated on ARPANET (Advanced Research Project Agency NETwork) and the results obtained for the multi objective GA are compared with the single objective GA. The results show that multi objective GA performs better than single objective GA while optimizing different network parameters.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125795553","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}

引用次数: 16

Guiding P2P control traffic using DHTS 使用DHTS引导P2P控制流量

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716418

J. Gralak, A. Wierzbicki

引用次数: 0