Pub Date : 2012-12-01DOI: 10.1109/ANTS.2012.6524228
R. Ravindran, Guoqiang Wang, Xinwen Zhang, A. Chakraborti
Information-centric networking (ICN) aims to replace current host-centric IP architecture with one based on efficient, secure, and reliable dissemination of information. This paper extends content-centric networking (CCN), one of the ICN architectures, for dual-mode forwarding, wherein, the forwarding plane distinguishes sharable traffic from non-sharable traffic characterized by its global shareability. The proposed extensions allow sharable traffic to be forwarded in a non-expedite mode following the packet processing of CCN, while non-sharable traffic is forwarded in the proposed expedite mode subjected to fast-path forwarding only involving the FIB. We enable this dual-mode forwarding using a new header which optionally includes a source-object name. We support our proposal with simulation results where the benefit of separating these two types of traffic in the forwarding plane results in better utilization of content store, pending interest table, and improved user QoE for sharable applications in terms of content delivery latency.
{"title":"Supporting dual-mode forwarding in content-centric network","authors":"R. Ravindran, Guoqiang Wang, Xinwen Zhang, A. Chakraborti","doi":"10.1109/ANTS.2012.6524228","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524228","url":null,"abstract":"Information-centric networking (ICN) aims to replace current host-centric IP architecture with one based on efficient, secure, and reliable dissemination of information. This paper extends content-centric networking (CCN), one of the ICN architectures, for dual-mode forwarding, wherein, the forwarding plane distinguishes sharable traffic from non-sharable traffic characterized by its global shareability. The proposed extensions allow sharable traffic to be forwarded in a non-expedite mode following the packet processing of CCN, while non-sharable traffic is forwarded in the proposed expedite mode subjected to fast-path forwarding only involving the FIB. We enable this dual-mode forwarding using a new header which optionally includes a source-object name. We support our proposal with simulation results where the benefit of separating these two types of traffic in the forwarding plane results in better utilization of content store, pending interest table, and improved user QoE for sharable applications in terms of content delivery latency.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"19 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":"115502711","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.6524230
Ayan Paul, S. Mandal, M. Maitra, S. Sadhukhan, U. Tiwari, V. Agrawal
Today's rapid change in demands of wireless services is compelling wireless service providers (WSPs) to deploy most recent wireless technologies (such as 3G, LTE) in the market. In India, there are many WSPs that hold only 2G license in a particular service area. Naturally, their business prospect is affected as they cannot provide the cutting edge services. In this work, we have suggested an efficient strategy for these WSPs to enable them to provide new age services to their own customers. We envisage a scenario where, unlicensed WSP provides services to its users by buying bulk services from any licensed WSP. In reality, similar kind of arrangement exists where some WSPs collaborate with each other by entering into a long term static agreement. However, in this work, we have proposed an agent based dynamic agreement framework as an alternative solution. In our model, agents of the licensed and unlicensed WSPs try to reach an agreement for short term by negotiating on different service attributes (such as bandwidth, quality of service, price and credit limit etc.) of any particular service e.g. high speed internet (HSI). Initially, we have proved the existence of Nash equilibrium where, utilities of both buyer and seller maximize in case of HSI service. Subsequently, we have presented a novel genetic algorithm (GA) based negotiation mechanism for the agents. We have chosen joint utility of buyer and seller as the performance measure of our trading mechanism. Our simulation result shows that our negotiation mechanism provides better joint utility compared to the current static agreement strategy.
{"title":"A dynamic agreement framework for trading of wireless services","authors":"Ayan Paul, S. Mandal, M. Maitra, S. Sadhukhan, U. Tiwari, V. Agrawal","doi":"10.1109/ANTS.2012.6524230","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524230","url":null,"abstract":"Today's rapid change in demands of wireless services is compelling wireless service providers (WSPs) to deploy most recent wireless technologies (such as 3G, LTE) in the market. In India, there are many WSPs that hold only 2G license in a particular service area. Naturally, their business prospect is affected as they cannot provide the cutting edge services. In this work, we have suggested an efficient strategy for these WSPs to enable them to provide new age services to their own customers. We envisage a scenario where, unlicensed WSP provides services to its users by buying bulk services from any licensed WSP. In reality, similar kind of arrangement exists where some WSPs collaborate with each other by entering into a long term static agreement. However, in this work, we have proposed an agent based dynamic agreement framework as an alternative solution. In our model, agents of the licensed and unlicensed WSPs try to reach an agreement for short term by negotiating on different service attributes (such as bandwidth, quality of service, price and credit limit etc.) of any particular service e.g. high speed internet (HSI). Initially, we have proved the existence of Nash equilibrium where, utilities of both buyer and seller maximize in case of HSI service. Subsequently, we have presented a novel genetic algorithm (GA) based negotiation mechanism for the agents. We have chosen joint utility of buyer and seller as the performance measure of our trading mechanism. Our simulation result shows that our negotiation mechanism provides better joint utility compared to the current static agreement strategy.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"38 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":"125505455","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.6524235
Vishal Rajyaguru, T. B. Reddy, B. S. Manoj, M. Sarkar
IEEE 802.11 based Wireless LAN (WLAN) standard has been one of the most successful wireless technology standards with total expected sales rising to a staggering $6.1Billion by 2015. The proliferation of 802.11 based WLANs highlights the need to focus on development of new solutions for security as enterprises and campuses increasingly being covered by WLANs. Denial of Service (DoS) is one of the popular attacks that prevents WLAN users from accessing the wireless network resources. Most DoS attacks such as the Clear-to-Send (CTS) duration attack is easy to carry out by an attacker. This work focuses on the use of clustering techniques on wireless traffic datasets for detecting CTS-based DoS attacks on 802.11 WLANs. Performance evaluation shows that, under the cases of naïve CTS duration attacker as well as the sophisticated CTS duration attacker, the k-means clustering technique is able to achieve high detection rates and low false positive rates with relatively small values of k (i.e., number of clusters).
{"title":"On detecting CTS duration attacks using K-means clustering in WLANs","authors":"Vishal Rajyaguru, T. B. Reddy, B. S. Manoj, M. Sarkar","doi":"10.1109/ANTS.2012.6524235","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524235","url":null,"abstract":"IEEE 802.11 based Wireless LAN (WLAN) standard has been one of the most successful wireless technology standards with total expected sales rising to a staggering $6.1Billion by 2015. The proliferation of 802.11 based WLANs highlights the need to focus on development of new solutions for security as enterprises and campuses increasingly being covered by WLANs. Denial of Service (DoS) is one of the popular attacks that prevents WLAN users from accessing the wireless network resources. Most DoS attacks such as the Clear-to-Send (CTS) duration attack is easy to carry out by an attacker. This work focuses on the use of clustering techniques on wireless traffic datasets for detecting CTS-based DoS attacks on 802.11 WLANs. Performance evaluation shows that, under the cases of naïve CTS duration attacker as well as the sophisticated CTS duration attacker, the k-means clustering technique is able to achieve high detection rates and low false positive rates with relatively small values of k (i.e., number of clusters).","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"269 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":"127546710","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.6524236
M. Faisal, M. H. Rahman
In this paper, the performance of differential phase modulation schemes for ultra-high speed long-haul fiber-optic communication system has been evaluated and compared. The quality factor Q is measured from the eye-pattern at the end of the dispersion-managed transmission line. Only self-phase modulation, dispersion effect and amplifier noise are considered here.
{"title":"Performance comparison of various PSK modulation schemes for ultra-high speed long-haul fiber-optic communication system","authors":"M. Faisal, M. H. Rahman","doi":"10.1109/ANTS.2012.6524236","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524236","url":null,"abstract":"In this paper, the performance of differential phase modulation schemes for ultra-high speed long-haul fiber-optic communication system has been evaluated and compared. The quality factor Q is measured from the eye-pattern at the end of the dispersion-managed transmission line. Only self-phase modulation, dispersion effect and amplifier noise are considered here.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"149 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":"116412326","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.6524218
A. Dixit, B. Lannoo, D. Colle, M. Pickavet, P. Demeester
We propose a dynamic bandwidth allocation (DBA) algorithm for Ethernet passive optical networks (EPON). The DBA algorithm exploits the sleep mode functionality, where the optical network unit (ONU) at the user premises is put to sleep in every cycle according to the traffic load of the ONU. The DBA algorithm achieves up to 93% power savings in comparison to traditional power-ignore DBAs.
{"title":"Energy efficient dynamic bandwidth allocation for Ethernet passive optical networks","authors":"A. Dixit, B. Lannoo, D. Colle, M. Pickavet, P. Demeester","doi":"10.1109/ANTS.2012.6524218","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524218","url":null,"abstract":"We propose a dynamic bandwidth allocation (DBA) algorithm for Ethernet passive optical networks (EPON). The DBA algorithm exploits the sleep mode functionality, where the optical network unit (ONU) at the user premises is put to sleep in every cycle according to the traffic load of the ONU. The DBA algorithm achieves up to 93% power savings in comparison to traditional power-ignore DBAs.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"41 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":"124144847","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.6524234
Saket Chawla, B. S. Manoj
Learning the network environment in a quick manner offers great operational rewards. Therefore, it is important for future network devices to share critical control information among them. In this paper, we propose a comprehensive framework for exchange of control information between nodes located in a local area. Our proposed framework enables hosts to quickly gather the operational parameters, such as the maximum supported congestion window or transmission rate and round-trip time supported by the network for a communication session, from its peers. We present results from a prototype framework and from the results we find that our framework allows key control information exchange between peer nodes in the local network, thereby, improving network performance.
{"title":"Knowledge sharing framework for cooperative networks","authors":"Saket Chawla, B. S. Manoj","doi":"10.1109/ANTS.2012.6524234","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524234","url":null,"abstract":"Learning the network environment in a quick manner offers great operational rewards. Therefore, it is important for future network devices to share critical control information among them. In this paper, we propose a comprehensive framework for exchange of control information between nodes located in a local area. Our proposed framework enables hosts to quickly gather the operational parameters, such as the maximum supported congestion window or transmission rate and round-trip time supported by the network for a communication session, from its peers. We present results from a prototype framework and from the results we find that our framework allows key control information exchange between peer nodes in the local network, thereby, improving network performance.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"42 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":"125582055","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.6524232
T. Moulahi, H. Guyennet, S. Nasri, Rjab Hajlaoui
Connected Dominating Sets (CDS) are selected to construct a virtual backbone in Wireless Sensor Networks (WSNs). Indeed, CDS are used for fault tolerant broadcasting, routing and even efficient gathering of data. On the other hand, r-hop connected k-dominating sets ((k, r)-CDS) are introduced to reduce the size of CDS and the total amount of information to be transmitted. Unfortunately, no work considers the load-balance factor of (k, r)-CDS. Recently, there is a proposition of constructing load-balanced CDS for WSNs. In this paper we reuse the same concept of selecting load-balanced CDS to construct a Load-Balanced (k, r)-CDS (LB(k, r)-CDS). Then, the allocation of dominatees to the appropriate dominators is done. Through simulations, the proposed method of constructing LB(k, r)-CDS extends network lifetime by an important rate compared with the most recent (k, r)-CDS construction method.
{"title":"On the construction of load-balanced (k, r-hop)-connected dominating set for WSNs","authors":"T. Moulahi, H. Guyennet, S. Nasri, Rjab Hajlaoui","doi":"10.1109/ANTS.2012.6524232","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524232","url":null,"abstract":"Connected Dominating Sets (CDS) are selected to construct a virtual backbone in Wireless Sensor Networks (WSNs). Indeed, CDS are used for fault tolerant broadcasting, routing and even efficient gathering of data. On the other hand, r-hop connected k-dominating sets ((k, r)-CDS) are introduced to reduce the size of CDS and the total amount of information to be transmitted. Unfortunately, no work considers the load-balance factor of (k, r)-CDS. Recently, there is a proposition of constructing load-balanced CDS for WSNs. In this paper we reuse the same concept of selecting load-balanced CDS to construct a Load-Balanced (k, r)-CDS (LB(k, r)-CDS). Then, the allocation of dominatees to the appropriate dominators is done. Through simulations, the proposed method of constructing LB(k, r)-CDS extends network lifetime by an important rate compared with the most recent (k, r)-CDS construction method.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"31 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":"133984451","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.6524221
H. Çukurtepe, M. Tornatore, Aysegul Yayimli, B. Mukherjee
In mixed line rate (MLR) networks, different line rates can coexist on the same fiber, on different wavelengths. Each lightpath can be established end-to-end, with requested line rate. Advanced modulation techniques are required for high line rates. Signals being propagated over transparent paths are exposed to detrimental effects of physical layer impairments (PLI). Advanced modulation techniques are more susceptible to impairments, especially to the cross-phase modulation (XPM) induced by intensity-modulated channels. In this study, we investigate the impairment-aware lightpath provisioning problem for MLR networks. We consider a transparent optical network where we aim to maximize the number of established connections, while avoiding disruption of existing lightpaths. We propose a weighted approach for impairment-aware lightpath provisioning in MLR networks. We employ an auxiliary graph to capture the PLIs on differently modulated channels with a weight assignment scheme. Simulation results show that the performance of our approach is noteworthy, in terms of blocking probability, bandwidth blocking ratio, and resource consumption.
{"title":"Impairment-aware lightpath provisioning in mixed line rate networks","authors":"H. Çukurtepe, M. Tornatore, Aysegul Yayimli, B. Mukherjee","doi":"10.1109/ANTS.2012.6524221","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524221","url":null,"abstract":"In mixed line rate (MLR) networks, different line rates can coexist on the same fiber, on different wavelengths. Each lightpath can be established end-to-end, with requested line rate. Advanced modulation techniques are required for high line rates. Signals being propagated over transparent paths are exposed to detrimental effects of physical layer impairments (PLI). Advanced modulation techniques are more susceptible to impairments, especially to the cross-phase modulation (XPM) induced by intensity-modulated channels. In this study, we investigate the impairment-aware lightpath provisioning problem for MLR networks. We consider a transparent optical network where we aim to maximize the number of established connections, while avoiding disruption of existing lightpaths. We propose a weighted approach for impairment-aware lightpath provisioning in MLR networks. We employ an auxiliary graph to capture the PLIs on differently modulated channels with a weight assignment scheme. Simulation results show that the performance of our approach is noteworthy, in terms of blocking probability, bandwidth blocking ratio, and resource consumption.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"57 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":"122555514","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.6524239
Siddharth Srivastava, B. S. Manoj
Robot formation and motion planning is a challenging area in mesh networked robots (MNRs). The accuracy and speed with which two or more robots can align them so as to serve a purpose is very important. This paper reports results from our study of the characteristics of robots operating in a real world wireless network environment where robots plan their motion based on the position determined using a Wi-Fi based positioning algorithm. Further we propose and study three methods of formation planning for a leader follower system and evaluate their accuracy and efficiency. First, the followers decide their own path based on the leader's position. In the second algorithm, the motion command for the follower was decided by the leader based on the follower's position and in the third, the followers predict the leader's next position using its current position and direction of motion and moved accordingly. These methods were studied in different working environments and the effect of disturbances on the accuracy of formation was determined using a prototype MNR we built. RSSI fingerprinting was used to calculate the position of the robots and based on which, the path was planned by the leader as well as the followers. Results from the comparison of path planning algorithms are provided.
{"title":"Path planning algorithms for mesh networked robots based on WiFi geo-location","authors":"Siddharth Srivastava, B. S. Manoj","doi":"10.1109/ANTS.2012.6524239","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524239","url":null,"abstract":"Robot formation and motion planning is a challenging area in mesh networked robots (MNRs). The accuracy and speed with which two or more robots can align them so as to serve a purpose is very important. This paper reports results from our study of the characteristics of robots operating in a real world wireless network environment where robots plan their motion based on the position determined using a Wi-Fi based positioning algorithm. Further we propose and study three methods of formation planning for a leader follower system and evaluate their accuracy and efficiency. First, the followers decide their own path based on the leader's position. In the second algorithm, the motion command for the follower was decided by the leader based on the follower's position and in the third, the followers predict the leader's next position using its current position and direction of motion and moved accordingly. These methods were studied in different working environments and the effect of disturbances on the accuracy of formation was determined using a prototype MNR we built. RSSI fingerprinting was used to calculate the position of the robots and based on which, the path was planned by the leader as well as the followers. Results from the comparison of path planning algorithms are provided.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"22 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":"132744922","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.6524245
P. Gupta, Parul Saraswat, C. Kumar, S. Chakrabarti, Ratnam V. Raja Kumar
Due to the explosive growth in mobile communication, energy efficiency in mobile networks has become an important factor for future design. In this context battery power in user equipment (UE) is always a concern; requirement of high data demand with high QoS led to further increase in power consumption. A lot of computation is due to excess processing of signalling messages which UE performs during calling and/or before call. The earlier measurement studies on mobile phones does not show the power consumption during signalling activities. This paper provides a detailed measurement study of power consumption during various signalling events, whose increase in frequency leads to unwanted battery consumption and increased load in rest of the network. Network activities, namely, network access, call initiation, call termination, and mobility in a coverage hole has been considered for the measurement. It also provides a comparative energy distribution for voice and signalling traffic, and observed significant impact of later in a particular scenario with low duration of call.
{"title":"Measurement of power consumption in multimedia mobiles for various network activities in 2G/3G networks","authors":"P. Gupta, Parul Saraswat, C. Kumar, S. Chakrabarti, Ratnam V. Raja Kumar","doi":"10.1109/ANTS.2012.6524245","DOIUrl":"https://doi.org/10.1109/ANTS.2012.6524245","url":null,"abstract":"Due to the explosive growth in mobile communication, energy efficiency in mobile networks has become an important factor for future design. In this context battery power in user equipment (UE) is always a concern; requirement of high data demand with high QoS led to further increase in power consumption. A lot of computation is due to excess processing of signalling messages which UE performs during calling and/or before call. The earlier measurement studies on mobile phones does not show the power consumption during signalling activities. This paper provides a detailed measurement study of power consumption during various signalling events, whose increase in frequency leads to unwanted battery consumption and increased load in rest of the network. Network activities, namely, network access, call initiation, call termination, and mobility in a coverage hole has been considered for the measurement. It also provides a comparative energy distribution for voice and signalling traffic, and observed significant impact of later in a particular scenario with low duration of call.","PeriodicalId":340711,"journal":{"name":"2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS)","volume":"34 13 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":"123148565","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
扫码关注我们
求助内容：
应助结果提醒方式：