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

{"title":"Alpha-beta filter based target tracking in clustered wireless sensor networks","authors":"Surendra Sharma, Sarang Deshpande, K. Sivalingam","doi":"10.1109/COMSNETS.2011.5716428","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716428","url":null,"abstract":"The emerging field of wireless sensor networks (WSNs) allows novel methods of designing surveillance and tracking systems. Tracking moving targets in WSNs is a canonical application of practical importance to military as well as civilian fields. Since WSNs are highly constrained in computation, communication and energy resources, the application is required to be designed with minimal resource consumption. The collaborative and distributed approach in WSN is suited for effective utilization of scarce resources. In this paper, a Hierarchical Clustered network architecture has been considered for target tracking. A computationally simple predictive target tracking approach using α-β filter is proposed, evaluated and compared against a Kalman filter based approach.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"50 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":"114199310","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}

{"title":"Distributed detection with censoring of sensors in Rayleigh faded channel","authors":"C. Kundu, S. Kundu, G. Ferrari, R. Raheli","doi":"10.1109/COMSNETS.2011.5716423","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716423","url":null,"abstract":"This paper considers the problem of fusing decisions in a distributed detection system when the local binary decisions made at the sensors, relative to observations of a common binary phenomenon, are transmitted over Rayleigh faded channel subject to additive noise. We use a training-based channel estimator at the fusion center (FC) to estimate the complex Gaussian fading coefficients characterizing the channels between the sensors and the FC. Channel state information (CSI) is used on the fading coefficients for censoring the sensors. Locally optimal decision threshold is considered for binary quantization at the sensors. The detection error probability is selected as a qualitative measure of system performance in the presence of majority logic fusion at the FC and is evaluated by means of simulations. We study the effects of the channel estimation error, the channel signal-to-noise ratio (SNR), the sensor SNR, and the number of selected sensors on the system performance.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"30 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":"114637208","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}

{"title":"Point-to-point scheduling over a wireless channel with costly channel state information","authors":"Nitin Salodkar, A. Karnik","doi":"10.1109/COMSNETS.2011.5716523","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716523","url":null,"abstract":"In this work, we are interested in understanding the trade-off between the cost of acquiring accurate information and the improvement in the system performance because of accuracy of information. Specifically, we consider the wireless scheduling scenario where a scheduler residing at the transmitter can acquire the channel state information (CSI) at various levels of accuracy, but at a cost which increases with accuracy. The scheduler is, therefore, required to make CSI acquisition as well as scheduling decisions to minimize the total cost over an infinite horizon. We pose this problem as a partially observable Markov decision problem. We analyze it by converting it into a perfect state Markov decision problem (MDP) with belief distribution as the state and provide structural properties of the optimal policy. Under a special case, where CSI is either known perfectly or is not known, we show that the problem can be simplified and posed as an MDP in which the policy determines a sampling interval for each channel state. We present a numerical technique to compute these sampling intervals and numerical results based on it.","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":"114711913","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}

{"title":"Sequencegram: n-gram modeling of system calls for program based anomaly detection","authors":"N. Hubballi, S. Biswas, Sukumar Nandi","doi":"10.1109/COMSNETS.2011.5716416","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716416","url":null,"abstract":"Our contribution in this paper is two fold. First we provide preliminary investigation results establishing program based anomaly detection is effective if short system call sequences are modeled along with their occurrence frequency. Second as a consequence of this, built normal program model can tolerate some level of contamination in the training dataset. We describe an experimental system Sequencegram, designed to validate the contributions. Sequencegram model short sequences of system calls in the form of n-grams and store in a tree (for the space efficiency) called as n-gram-tree. A score known as anomaly score is associated with every short sequence (based on its occurrence frequency) which represents the probability of short sequence being anomalous. As it is generally assumed that, there is a skewed distribution of normal and abnormal sequences, more frequently occurring sequences are given lower anomaly score and vice versa. Individual n-gram anomaly score contribute to the anomaly score of a program trace.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"39 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":"131964094","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}

{"title":"Error-resilient image transmission over multihop wireless networks","authors":"Pradipta De, N. Banerjee, S. De","doi":"10.1109/COMSNETS.2011.5716471","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716471","url":null,"abstract":"Guarding against channel errors in wireless networks has been a challenging research problem, specially when transmitting time-constrained contents, like streaming video or image. Source diversity in the form of Multiple Description Coding (MDC) has been studied for guarding against wireless channel errors. In MDC, an image is broken into several equally important descriptions which can be sent over multiple paths to the destination. In this work, we leverage the routing scheme to exploit the path diversity in such a way that multiple descriptions are sent over different paths in the network and are merged at the intermediate nodes for possible recovery of corrupted descriptions. The routing uses the idea that when multiple descriptions join at intermediate points it can help in partial recovery of lost or corrupted descriptions by using the link error information, thereby improving the overall image quality at the destination. In order to achieve high gain in terms of peak signal-to-noise ratio (PSNR) with minimum split into descriptions, we investigate an optimum spatial interleaving based MD coding scheme that maximizes the intermediate recovery possibility for a given recovery filter design. We also explore the choice of an optimum number of descriptions at an intermediate merging point that maximizes the PSNR gain. Our simulation study shows that it is possible to achieve a PSNR gain of around 5–6 dB using our coding and routing strategy.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"28 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":"127859594","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}

{"title":"Survivable network design using polyhedral approaches","authors":"Y. Agarwal","doi":"10.1109/COMSNETS.2011.5716411","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716411","url":null,"abstract":"We consider the problem of designing a survivable telecommunication network using facilities of a fixed capacity. Given a graph G = (V,E), the traffic demand among the nodes, and the cost of installing facilities on the edges of G, we wish to design the minimum cost network, so that under any single edge failure, the network permits the flow of all traffic using the remaining capacity. The problem is modeled as a mixed integer program, which can be converted into a pure integer program by applying the well-known Japanese Theorem on multi-commodity flows. Using a key theorem that characterizes the facet inequalities of this integer program, we derive several families of 3- and 4-partition facets, which help to achieve extremely tight lower bounds on the problem. Using these bounds, problems of up to 20 nodes and 40 edges have been solved optimally in a pervious work. Using heuristic approaches based on this framework, we solve problems of up to 40 nodes and 80 edges to obtain solutions that are approximately within 5% of optimal solutions.","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":"121189471","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}

{"title":"Downlink transmission mode selection and switching algorithm for LTE","authors":"Shubhodeep Adhikari","doi":"10.1109/COMSNETS.2011.5716434","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716434","url":null,"abstract":"Long Term Evolution (LTE) is an emerging 4G wireless access technology. Multiple-Input Multiple-Output (MIMO) systems are a primary enabler of the high data rate sought to be achieved by LTE. Closed-Loop-Spatial-Multiplexing and Open-Loop-Spatial-Multiplexing are the two primary MIMO transmission modes used in the LTE downlink. An LTE Base Station (eNodeB) is expected to select and switch transmission characteristics of these MIMO modes based on channel quality feedbacks: Channel Quality Indicator (CQI), Precoding Matrix Indicator (PMI) and Rank Indicator (RI) reported by the mobile. In this paper, we show analytically as well as through simulations, that is it not optimal to make MIMO transmission mode selection at the eNodeB based solely on mobile feedback. Doing so can result in significant throughput loss. We then describe an algorithm that can prevent such throughput reduction. The algorithm works by enabling the eNodeB to selectively override the mobile's channel feedback and make a better choice of transmission mode. We provide simulation data to show that such an algorithm can improve the downlink throughput by 110% in some cases and by 20–50% on an average. We also show that an eNodeB equipped with this algorithm is able to match a benchmarked “best case” downlink throughput for a wide range of signal quality and channel models. Existing transmission mode selection algorithms described in literature involve the estimation of additional parameters such as mobile speed, channel diversity etc along with the mobile's channel feedback. The algorithm proposed in this paper is computationally much simpler. It does not involve estimation of any of these additional channel parameters. It is also at par or better in performance. This algorithm has been implemented in the Motorola LTE product.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"52 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":"115717898","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}

{"title":"Application architecture considerations for cloud platforms","authors":"B. Sodhi, T. Prabhakar","doi":"10.1109/COMSNETS.2011.5716417","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716417","url":null,"abstract":"The adoption of cloud computing has steadily increased over the past few years, but still this field is young and lacks mature standards and accumulated experience. Developing applications targeted for cloud deployment is not quite same as a traditional application deployment scenario. Appearance of many different vendor-specific application development platforms and frameworks has made the task of designing applications for cloud difficult. In this work we introduce two primary application design approaches for the cloud: cloud-aware application design and cloud-agnostic application design. We compare these two approaches w.r.t the traditional non-cloud approach to determine the impact on various non-functional quality attributes of the applications.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"166 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":"115319701","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}

{"title":"On the game server network selection with delay and delay variation constraints","authors":"Yuh-Rong Chen, S. Radhakrishnan, S. Dhall, S. Karabuk","doi":"10.1109/COMSNETS.2011.5716473","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716473","url":null,"abstract":"Recent advances in multimedia software and hardware technologies and the availability of high-speed Internet service have been instrumental for growth in the online gaming industry. Multiple servers distributed across the network are commonly used to provide the desired quality-of-service (QoS) for the network game in order to achieve a higher quality-of-experience (QoE) to the players (clients). Each player in this distributed multi-player gaming environment connects to a particular server and it distributes each of the actions to all other players through the servers they are connected to. We imagine the server network to be an overlay network, wherein the latency on a link between two servers is the latency of the Internet path connecting them. We assume that we are given an overlay network of servers with link latencies and a set of players each with a different latency to each of the servers. Now our goal is to develop algorithms that perform the following actions in such a way that delay related QoS constraints are satisfied: (a) choose a subnetwork of the server network (server network selection) and (b) assign each player to a server in the subnetwork (client-assignment). More specifically, the QoS constraints that we address in this paper are a bound on the maximum delay in propagating a player's move to all other players (delay bound) and a bound on the maximum difference in the arrival times of a player's move at all other players (delay-variation bound). We have provided polynomial-time heuristics to determine a minimal cardinality server network and the corresponding client-assignment that satisfy both delay bound and that minimize delay-variation, if such a solution exists. We have considered cases in which the server network follows two communication models: client-server (CS) and peer-to-peer (P2P). Our extensive empirical studies indicate that our heuristic uses significantly less run-time in achieving the tightest delay variation for a given end-to-end delay bound while choosing a minimal number of servers.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"31 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":"130785101","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}

{"title":"Group key management scheme for simultaneous multiple groups with overlapped membership","authors":"B. Purushothama, B. B. Amberker","doi":"10.1109/COMSNETS.2011.5716429","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716429","url":null,"abstract":"Consider several groups engaged in a single project. Group members of one group happens to communicate with other group members. How might the communication among the members be carried out securely? How to ensure that a group member of one group communicate securely with its own group and with other group members as well?. We predict that secure group key management schemes for simultaneous multiple groups which allow inter-group communication become increasingly popular. We detail this problem under secure group communication model. Following the work of [1], we provide an efficient secure multiple groups key management scheme with overlapping membership based on the proposed Key-User Tree structure with following properties. a) Scheme handles multiple groups simultaneously. b) Group members within a group can communicate securely. c) Group members of one group can communicate with other group members securely. We analyze join and leave protocols of the scheme for storage, encryption and key changes upon membership change. Our scheme scales well as the overlapping memberships across the multiple groups increases rapidly. Our scheme achieves significant reduction in rekeying cost, storage and scales well in comparison with [1].","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"196 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":"128359034","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}