Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524231
Chirag Gupta, Deepanjan Biswas
This paper presents a cellular network based positioning algorithm in an urban environment characterized by multipath and severe non line of sight (NLOS) errors. The proposed algorithm mitigates localization error up to 75% as shown by the simulation results. The algorithm involves an initial averaging step followed by a prediction step for optimization, confining the estimated location close to the actual location. The proposed algorithm doesn't require additional hardware like sensors, accelerometers, gyroscopes etc. for localization as used in traditional cellular network based positioning methods. This approach can also be utilized in indoor positioning system (IPS) and global positioning systems (GPS) when at most three satellites are available. Low computational complexity of the algorithm is an added advantage. Utilization of orthogonal sources of information for improving accuracy is also explored.
{"title":"Pedestrian tracking algorithm in NLOS environments","authors":"Chirag Gupta, Deepanjan Biswas","doi":"10.1109/ANTS.2012.6524231","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524231","url":null,"abstract":"This paper presents a cellular network based positioning algorithm in an urban environment characterized by multipath and severe non line of sight (NLOS) errors. The proposed algorithm mitigates localization error up to 75% as shown by the simulation results. The algorithm involves an initial averaging step followed by a prediction step for optimization, confining the estimated location close to the actual location. The proposed algorithm doesn't require additional hardware like sensors, accelerometers, gyroscopes etc. for localization as used in traditional cellular network based positioning methods. This approach can also be utilized in indoor positioning system (IPS) and global positioning systems (GPS) when at most three satellites are available. Low computational complexity of the algorithm is an added advantage. Utilization of orthogonal sources of information for improving accuracy is also explored.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125216888","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}
Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524233
R. R. Rout, Saswati Ghosh, S. Ghosh
In wireless sensor networks (WSNs), with converge-cast, the data flow pattern forms a funnel structure and converges at the Sink. Reduction of traffic flow to the Sink cuts down the funneling effect and improves the efficiency of the network. This paper presents an energy Efficient Triangular (regular) Deployment strategy with Directional Antenna (ETD-DA) while analyzing the directivity of antenna beam in the network. A triangular deployment strategy, where nodes are placed at different layers, has been adopted in view of the funneling effect of traffic in a single Sink network. A particular layer of ETD-DA involves in sensing and generating data for an event in WSN. On the proposed pattern, ETD-DA, the inter-level communication has been analyzed. The 2-connectivity pattern of communication has been achieved by orienting the directional antenna beam of a sensor in a particular direction towards the Sink. For the improvement of reliability (protection of data against path failure) of the network, a network coding based forwarding strategy has also been proposed for inter level communication in the ETD-DA with 2-connectivity pattern. The energy consumption has been significantly reduced due to the combination of directional beam and network coding. A detailed theoretical analysis and simulation have been performed to show the efficacy of the proposed approach.
{"title":"Efficient data collection with directional antenna and network coding in wireless sensor networks","authors":"R. R. Rout, Saswati Ghosh, S. Ghosh","doi":"10.1109/ANTS.2012.6524233","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524233","url":null,"abstract":"In wireless sensor networks (WSNs), with converge-cast, the data flow pattern forms a funnel structure and converges at the Sink. Reduction of traffic flow to the Sink cuts down the funneling effect and improves the efficiency of the network. This paper presents an energy Efficient Triangular (regular) Deployment strategy with Directional Antenna (ETD-DA) while analyzing the directivity of antenna beam in the network. A triangular deployment strategy, where nodes are placed at different layers, has been adopted in view of the funneling effect of traffic in a single Sink network. A particular layer of ETD-DA involves in sensing and generating data for an event in WSN. On the proposed pattern, ETD-DA, the inter-level communication has been analyzed. The 2-connectivity pattern of communication has been achieved by orienting the directional antenna beam of a sensor in a particular direction towards the Sink. For the improvement of reliability (protection of data against path failure) of the network, a network coding based forwarding strategy has also been proposed for inter level communication in the ETD-DA with 2-connectivity pattern. The energy consumption has been significantly reduced due to the combination of directional beam and network coding. A detailed theoretical analysis and simulation have been performed to show the efficacy of the proposed approach.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126949114","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}
Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524220
Saigopal Thota, Raghu Anantharangachar, S. Dixit, B. Mukherjee
Today, we use smart mobile devices to browse content, stream media, etc., in addition to making voice calls. Most smart devices are equipped with IEEE 802.11 (WiFi) interface to connect to the Internet using wireless access points (APs), as WiFi provides cost-effective connectivity to users. Wireless interfaces in smart devices drain high energy while searching for network connectivity and transition into power saving mode (PSM) after connecting to an AP. Hence, we need intelligent and energy-efficient mechanisms to scan and connect to wireless networks. In this work, we propose and investigate the characteristics of intelliSENSE, a location-based WiFi sensing mechanism for energy efficiency in smart mobile devices. We also propose adaptive polling mechanisms to further reduce the energy spent in WiFi sensing.
{"title":"intelliSENSE: Location-based Wi-Fi sensing for energy efficiency in smart mobile devices","authors":"Saigopal Thota, Raghu Anantharangachar, S. Dixit, B. Mukherjee","doi":"10.1109/ANTS.2012.6524220","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524220","url":null,"abstract":"Today, we use smart mobile devices to browse content, stream media, etc., in addition to making voice calls. Most smart devices are equipped with IEEE 802.11 (WiFi) interface to connect to the Internet using wireless access points (APs), as WiFi provides cost-effective connectivity to users. Wireless interfaces in smart devices drain high energy while searching for network connectivity and transition into power saving mode (PSM) after connecting to an AP. Hence, we need intelligent and energy-efficient mechanisms to scan and connect to wireless networks. In this work, we propose and investigate the characteristics of intelliSENSE, a location-based WiFi sensing mechanism for energy efficiency in smart mobile devices. We also propose adaptive polling mechanisms to further reduce the energy spent in WiFi sensing.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131065199","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}
Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524229
S. Vivek, S. S. D. Selvi, Deepanshu Shukla, C. Rangan
This work presents the first scalable, efficient and generic compilers to construct group key exchange (GKE) protocols from two/three party key exchange (2-KE/3-KE) protocols. We propose three different compilers where the first one is a 2-KE to GKE compiler (2-TGKE) for tree topology, the second one is also for tree topology but from 3-KE to GKE (3-TGKE) and the third one is a compiler that constructs a GKE from 3-KE for circular topology. Our compilers 2-TGKE and 3-TGKE are first of their kind and are efficient due to the underlying tree topology. For the circular topology, we design a compiler called 3-CGKE. By extending the compilers 2-TGKE and 3-TGKE using the techniques in [?], scalable compilers for tree based authenticated group key exchange protocols (2-TAGKE/3-TAGKE), that are secure against active adversaries can be constructed. As an added advantage our compilers can be used in a setting where there is asymmetric distribution of computing power and hence applicable for low power devices such as PDA's, palmtops, sensor network nodes and mobile phones.
{"title":"Group key establishment (GKE): Two/three party key exchange to GKE","authors":"S. Vivek, S. S. D. Selvi, Deepanshu Shukla, C. Rangan","doi":"10.1109/ANTS.2012.6524229","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524229","url":null,"abstract":"This work presents the first scalable, efficient and generic compilers to construct group key exchange (GKE) protocols from two/three party key exchange (2-KE/3-KE) protocols. We propose three different compilers where the first one is a 2-KE to GKE compiler (2-TGKE) for tree topology, the second one is also for tree topology but from 3-KE to GKE (3-TGKE) and the third one is a compiler that constructs a GKE from 3-KE for circular topology. Our compilers 2-TGKE and 3-TGKE are first of their kind and are efficient due to the underlying tree topology. For the circular topology, we design a compiler called 3-CGKE. By extending the compilers 2-TGKE and 3-TGKE using the techniques in [?], scalable compilers for tree based authenticated group key exchange protocols (2-TAGKE/3-TAGKE), that are secure against active adversaries can be constructed. As an added advantage our compilers can be used in a setting where there is asymmetric distribution of computing power and hence applicable for low power devices such as PDA's, palmtops, sensor network nodes and mobile phones.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132878001","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}
Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524227
P. Mahalle, Bayu Anggorojati, N. Prasad, R. Prasad
Internet of Things (IoT) is becoming integral and mandatory part of everyday life. Scalability and manageability is intimidating due to unbounded number of devices and services. Access control and authorization in IoT with least privilege is important to establish secure communication between multiple devices and services. In this paper, the concept of capability for access control is introduced where the identities of the involved devices are entrenched in the access capabilities. Identity driven capability based access control (ICAC) scheme presented in this paper helps to alleviate issues related to the complexity and dynamics of device identities. ICAC is implemented for Wi-Fi and results shows that ICAC is scalable and performs better compared to other access control schemes. The ICAC evaluation by using security protocol verification tool shows that ICAC is secure against man-in-the-middle attack, especially eavesdropping and replay attacks.
{"title":"Identity driven capability based access control (ICAC) scheme for the Internet of Things","authors":"P. Mahalle, Bayu Anggorojati, N. Prasad, R. Prasad","doi":"10.1109/ANTS.2012.6524227","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524227","url":null,"abstract":"Internet of Things (IoT) is becoming integral and mandatory part of everyday life. Scalability and manageability is intimidating due to unbounded number of devices and services. Access control and authorization in IoT with least privilege is important to establish secure communication between multiple devices and services. In this paper, the concept of capability for access control is introduced where the identities of the involved devices are entrenched in the access capabilities. Identity driven capability based access control (ICAC) scheme presented in this paper helps to alleviate issues related to the complexity and dynamics of device identities. ICAC is implemented for Wi-Fi and results shows that ICAC is scalable and performs better compared to other access control schemes. The ICAC evaluation by using security protocol verification tool shows that ICAC is secure against man-in-the-middle attack, especially eavesdropping and replay attacks.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"105 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898106","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}
Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524238
Hema R. Kale, C. Dethe, M. Mushrif
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. In this paper an adaptive sub channel grouping (ASG) scheme is proposed. In this scheme channels are allocated to the users according to the CSI obtained, a channel will be allocated to that user who experiences least fading on that channel. In similar way all the channels are allocated to users and total number of channels allocated to one user forms one group. The total number of groups is equal to number of users and number of channels per group are different. The proposed algorithm reduces the required transmit power and yields a solution that maximizes the throughput. Simulations results are presented for 4G environment and it is found that the proposed ASG algorithm can significantly improve the system throughput as compared to conventional schemes of group formation where neighboring channels forms groups and number of channels per groups are same.
{"title":"Adaptive sub channel grouping in MC-CDMA systems for 4G networks","authors":"Hema R. Kale, C. Dethe, M. Mushrif","doi":"10.1109/ANTS.2012.6524238","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524238","url":null,"abstract":"The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. In this paper an adaptive sub channel grouping (ASG) scheme is proposed. In this scheme channels are allocated to the users according to the CSI obtained, a channel will be allocated to that user who experiences least fading on that channel. In similar way all the channels are allocated to users and total number of channels allocated to one user forms one group. The total number of groups is equal to number of users and number of channels per group are different. The proposed algorithm reduces the required transmit power and yields a solution that maximizes the throughput. Simulations results are presented for 4G environment and it is found that the proposed ASG algorithm can significantly improve the system throughput as compared to conventional schemes of group formation where neighboring channels forms groups and number of channels per groups are same.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128195066","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}
Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524225
K. Narendran, R. Karthik, K. Sivalingam
This paper presents a link data-rate based admission control mechanism for a wireless network using a transmit power allocation algorithm. The admission control mechanism uses the nodes' link datarate requirements as an input parameter. Transmit power control enables the nodes to set their power levels such that the required link datarate requirements are met while minimizing the interference caused to other transmissions. The link datarate requirement of a node is converted to its signal strength requirement that is subsequently used for admission control. We establish the relationship between key parameters in admission control such as signal strength requirement, link datarate requirement, number of nodes in the system etc. The proposed algorithm is studied using analytic and simulation techniques to show that it enables the nodes to meet their respective link datarate requirements.
{"title":"Link datarate based admission control in wireless networks","authors":"K. Narendran, R. Karthik, K. Sivalingam","doi":"10.1109/ANTS.2012.6524225","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524225","url":null,"abstract":"This paper presents a link data-rate based admission control mechanism for a wireless network using a transmit power allocation algorithm. The admission control mechanism uses the nodes' link datarate requirements as an input parameter. Transmit power control enables the nodes to set their power levels such that the required link datarate requirements are met while minimizing the interference caused to other transmissions. The link datarate requirement of a node is converted to its signal strength requirement that is subsequently used for admission control. We establish the relationship between key parameters in admission control such as signal strength requirement, link datarate requirement, number of nodes in the system etc. The proposed algorithm is studied using analytic and simulation techniques to show that it enables the nodes to meet their respective link datarate requirements.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121647146","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：