{"title":"A new optimal delay and energy efficient coordination algorithm for WSAN","authors":"Jagadeesh Kakarla, B. Majhi","doi":"10.1109/ANTS.2013.6802871","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802871","url":null,"abstract":"Wireless sensor and actor networks require efficient coordination mechanisms to perform reliable actions in the physical world. In this paper, an energy and delay aware three-level coordination mechanism is proposed for wireless sensor and actor networks using two-level hierarchical k-hop clustering algorithm. An optimal number of actors are calculated based on the network area and number of sensors. In the first level, sensors form a k-hop cluster by placing actor nodes as a cluster heads. In the second level, sink acts as the cluster head and forms a cluster among actors. A coordination mechanism among sensors and actors is also proposed based on their characteristics. To evaluate the performance of the proposed algorithm, it is simulated in NS2 and compared with existing algorithms. Simulation results reveal that the proposed algorithm outperforms the existing algorithms in various QoS parameters such as energy, delay and packet delivery ratio.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121492944","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":"Hybrid trie based partitioning of TCAM based openflow switches","authors":"S. Veeramani, Manas Kumar, S. Mahammad","doi":"10.1109/ANTS.2013.6802844","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802844","url":null,"abstract":"The packet forwarding mechanism in the open flow network switch is based on the IP lookup in the forwarding table, which consist of the destination IP address of the incoming packet. In general, these forwarding tables are Content Addressable Memory (CAM), where the desire key will be searched in the table to know out going port. Ternary content addressable memory (TCAM) is one of the efficient mechanism to store the forwarding table, where values are stored in sorted order. Search of any key is done by using longest prefix matching technique. It uses 0, 1 and x (don't care) to represent the data, rather using 0 and 1 in case of CAM. The major drawback of TCAM is that it is a power hungry circuit. Today's high-density TCAMs consumes 12 to 15 Watts of power per chip, when the entire memory is enabled. This paper proposes an efficient representation of data in the forwarding tables and search algorithm which takes the algorithmic time complexity is O(loglog n). This paper also proposes an efficient way to reduce the index TCAM size by using y-Fast trie-partitioning algorithm.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124618774","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":"Intelligent management of misbehaving nodes in wireless sensor networks: Using blackhole and selective forwarding node detection algorithm","authors":"S. Mukherjee, Koustabh Dolui, S. K. Datta","doi":"10.1109/ANTS.2013.6802887","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802887","url":null,"abstract":"Misbehaving nodes in wireless sensor networks and ad hoc networks often disrupt the operation of the networks in more ways than one. Presence of such nodes results in congestion in paths, unreliable packet delivery and erroneous data outputs for wireless sensor networks. Existing literatures have addressed this problem using protocols with mechanisms to detect the presence of these misbehaving nodes and ignoring them altogether while delivering a packet. However, design and deployments costs are on the higher side for sensor nodes and ignoring a node entirely blocks a relay node for multiple paths passing through it resulting in inefficient use of resources. In this paper we introduce a protocol named as MMP (Misbehavior Management Protocol) to differentiate between a black hole node and a selective forwarding node. By differentiating between these two types of misbehaving nodes, paths can be chosen intelligently for the packets which might be blocked or might be allowed to pass through a node. Hence our protocol presents a misbehaving selective forwarding node as an operational node to sensors nodes whose packets are not being blocked by the node. This allows higher throughput, multiple options for selecting paths as well as more accurate data collection from the sensor nodes in wireless sensor networks.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116440474","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}
Guillaume Habault, P. Maillé, L. Toutain, A. Pelov, N. Montavont, P. Bertin
{"title":"Lightweight service announcement: The case for Wi-Fi M2M service providers","authors":"Guillaume Habault, P. Maillé, L. Toutain, A. Pelov, N. Montavont, P. Bertin","doi":"10.1109/ANTS.2013.6802884","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802884","url":null,"abstract":"Machine-to-Machine (M2M) technology enables to interconnect machines with the least possible human intervention. The nature of M2M traffic, small and periodic, is different from the traditional traffic originating from computers or mobile phones, big and bursty. However, the number of nodes involved in such technology impacts the network as it has mainly been designed for Human-to-Machine (H2M) communications. Due to the number of involved M2M nodes and their intrinsic constraints, the retrieval of M2M traffic with existing networks is a real challenge. In order to do so, the authors propose a lightweight service announcement architecture, re-using already deployed Wi-Fi networks. This solution extends information announced in the IEEE 802.11 beacon frame. It enables M2M devices to automatically detect the most appropriate network among the one discovered, reduces the amount of signaling messages exchanged to do so and consequently, the delay needed to collect this traffic. The feasibility study, based on real-world data, shows that the frequency of announcement, the amount of data to send and the available density of Access Points, have to be taken into account in order to use Wi-Fi networks to retrieve M2M traffic.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134432622","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}
S. Nallagonda, Sanjay Dhar Roy, S. Kundu, G. Ferrari, R. Raheli
{"title":"Cooperative spectrum sensing with censoring of cognitive radios with majority logic fusion in Hoyt fading","authors":"S. Nallagonda, Sanjay Dhar Roy, S. Kundu, G. Ferrari, R. Raheli","doi":"10.1109/ANTS.2013.6802864","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802864","url":null,"abstract":"In this paper, the performance of cooperative spectrum sensing (CSS) is assessed in the presence of Hoyt fading. A cognitive radio (CR) user, which senses the primary users (PUs) using an energy detector (ED) in sensing channel (S-channel), is censored on the basis of the quality of the reporting channel (R-channel). A threshold-based censoring scheme is used: CR users, whose estimated R-channel fading coefficients towards the fusion center (FC) exceed a predefined threshold (denoted as censoring threshold), are allowed to transmit. Majority logic fusion is considered at the FC to estimate the performance in terms of average missed detection and total error probabilities for various values of the censoring threshold, the number of CRs, the false alarm probability, the average S-channel and R-channel signal-to-noise ratios (SNRs), under both perfect and imperfect channel coefficient estimations. The impact of the Hoyt fading parameter on the average missed detection probability is highlighted. Furthermore, an analytical expression for the probability of selection of CRs, in terms of the censoring threshold, is derived and validated with simulations.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133090684","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":"An efficient technique for detecting Skype flows in UDP media streams","authors":"Tejmani Sinam, Irengbam Tilokchan Singh, Pradeep Lamabam, Nandarani Ngasham","doi":"10.1109/ANTS.2013.6802872","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802872","url":null,"abstract":"As the use and popularity of VoIP applications grows, more and more Internet traffic are being generated by them. Many VoIP applications uses RTP to carry media traffic. Notable examples includes Gtalk, Google+ Hangouts, Asterisk based VoIP and Apple's FaceTime. On the other hand, Skype uses a proprietary protocol based on P2P architecture. It uses encryption for end to end communications and adopts obfuscation and anti reverse engineering techniques to prevent reverse engineering of the Skype protocol. This makes the detection of Skype flows a challenging task. Although Skype encrypts all communications, still a portion of Skype payload header known as Start of Message (SoM) is left unencrypted. In this paper, we develop an efficient technique for detection of Skype flows in UDP media streams. Our detection techniques relies on heuristics based on the information contained in Skype SoM and RTP headers.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134526333","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}
D. Papadimitriou, D. Colle, P. Audenaert, P. Demeester
{"title":"Geometric information routing","authors":"D. Papadimitriou, D. Colle, P. Audenaert, P. Demeester","doi":"10.1109/ANTS.2013.6802893","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802893","url":null,"abstract":"In response to the increasing traffic volume in the Internet for applications such as (mobile) video and cloud computing, various proprietary technologies enabling content distribution have been developed that rely on caching and replication. Being deployed in silos, it is not possible to uniquely and securely identify named information independently of the distribution channel; moreover, these different content distribution technologies are typically implemented as an overlay, leading to unnecessary inefficiency. By introducing uniquely named data and name-based data access, Information-Centric Networking (ICN) enables data to become independent from their network location, application, storage support but also means of content exchanges enabling in turn in-network caching and replication. However, content name spaces have not been designed to sustain forwarding performance and forwarders scaling contrary to IP addresses which can be efficiently aggregated, summarized and translated. Consequently, alternatives such as name-based routing, which aim at better accommodating information/ content routing in the Internet, would also become the scaling and performance bottleneck. To address these problems, this paper proposes a third alternative: geometric information routing on universal content locators. This technique operates by associating to content identifiers (names) a content locator taken out of a geometric coordinate space from which a routing path (more precisely, a geodesic) can be derived without requiring non-local information. Upon querying specific content multiple locators can be received enabling the receiver to select the (geometrically) closest locator. Since it is based on local information only, routing on such locator space is less memory consuming than non-local information dependent routing. We analyze the performance (in terms of memory space required to locally store routing states and the resulting routing path stretch) and compare them against path-vector routing.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133311556","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":"Trade-off between latency and coverage in cooperative radio access networks","authors":"T. Hohenberger, Matthias Herlich, H. Karl","doi":"10.1109/ANTS.2013.6802869","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802869","url":null,"abstract":"To cope with higher demands, future radio access networks will consist of densely deployed base stations (BSs). As the BS ranges in such deployments will often overlap, areas exists that could be served individually by one of several BSs or cooperatively by all members of a group of BSs (using techniques like CoMP). One BS typically serves several such areas. Each BS has to decide, which area to serve when. This problem is compounded by the need to coordinate cooperative transmissions across several BSs. We model this as a queuing problem where each queue represents one particular area that is served by a specific combination of BSs; each BS has to decide which queue(s) to serve when. For three decision strategies, we derive a Markov model and solve it numerically to obtain steady-state solutions. These solutions let us quantify average latency and trade-offs between latency and number of BSs per area for both direct and cooperative scenarios. We show that cooperation reduces the number of BSs needed to cover an area but that a latency price has to be payed.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115459696","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":"Network coding based reliable and efficient data transfer for Smart Grid monitoring","authors":"M. Karthick, K. Sivalingam","doi":"10.1109/ANTS.2013.6802886","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802886","url":null,"abstract":"In this paper, we present a bandwidth-efficient data reliability mechanism for Smart Grid Wide-Area Monitoring communication networks. Reliable transmission of data packets, especially feedback control packets, is deemed a critical requirement. By sending multiple copies of data packets on node or edge disjoint paths, reliability can be achieved. However, this is inefficient in terms of bandwidth usage. We present a network-coding based algorithm that can reduce the bandwidth requirement while improving data reliability by combining multi-path transmissions and network-coding techniques. The performance of the mechanisms has been studied using discrete-event simulation models. The simulation results show that the proposed mechanism reduces the bandwidth requirement by 65-82% while achieving nearly 100% reliability, compared to existing multi-path redundancy mechanism.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123581512","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":"Mitigating Uplink interference in femtocell networks with Physical Layer Network coding","authors":"W. Oduola, Lijun Qian, Xiangfang Li, D. Kataria","doi":"10.1109/ANTS.2013.6802849","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802849","url":null,"abstract":"The challenge of mitigating the Uplink (UL) interference in a two-tier heterogeneous network could be significantly improved by employing Physical-Layer Network coding (PNC) at a Home NodeB (HNB). This paper makes a case for a macrocell femtocell overlay network that utilizes PNC to mitigate the UL interference at the HNB. In closed subscriber group (CSG) UL information exchange, a Macrocell User Equipment (MUE), especially situated at coverage area's edge of a macrocell nodeB (MNB), creates interference that could make the received signal-to-interference-plus-noise-ratios (SINR) of the neighboring HNB to fall below the acceptable threshold. In a bid to ensure that the Service Quality (QoS) of femtocell and macrocell users are guaranteed, we propose to use PNC at the HNB by taking advantage of both the signals from the MUE and the Home User Equipment (HUE), rather than considering the signal from the MUE as interference. The paper develops the analytical expression of outage probability in closed-form, or equivalently the cummulative distribution function (CDF) for the received SINR of the proposed system is provided. Our results show that PNC is suitable for interference mitigation in femtocell network and it provides significant gain over the traditional scheme.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124836546","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}