Pub Date : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010147
Natarajan Palaniappan, S. Ramasamy
Utilising mobile facilities with less energy and memory power is a major spotted research area. One of the techniques which resolve the problem is mobile offloading scheme. Various mobile offloading mechanisms are developed and analysed with the parameters energy, throughput, latency, security and deployment of application on virtual machines (VMs). Thus, the offloading mechanisms proved that mobile applications on cloud can save energy for mobile users through partition and migration of mobile applications. This paper has done detailed survey on various schemes of mobile offloading techniques that includes POMAC, cloudlet, and software defined networks (SDNs). The survey has been done on various procedures involved in mobile offloading schemes with the common similarities such as energy and cost optimisation, dynamic offloading and VM migration. This survey and analysis show that the cloud part in mobile offloading techniques need more attention for balancing the VMs and migration of applications dynamically towards energy and cost optimisation.
{"title":"A survey on procedures dealing with mobile offloading schemes","authors":"Natarajan Palaniappan, S. Ramasamy","doi":"10.1504/IJMNDI.2017.10010147","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010147","url":null,"abstract":"Utilising mobile facilities with less energy and memory power is a major spotted research area. One of the techniques which resolve the problem is mobile offloading scheme. Various mobile offloading mechanisms are developed and analysed with the parameters energy, throughput, latency, security and deployment of application on virtual machines (VMs). Thus, the offloading mechanisms proved that mobile applications on cloud can save energy for mobile users through partition and migration of mobile applications. This paper has done detailed survey on various schemes of mobile offloading techniques that includes POMAC, cloudlet, and software defined networks (SDNs). The survey has been done on various procedures involved in mobile offloading schemes with the common similarities such as energy and cost optimisation, dynamic offloading and VM migration. This survey and analysis show that the cloud part in mobile offloading techniques need more attention for balancing the VMs and migration of applications dynamically towards energy and cost optimisation.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"6 1","pages":"178"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84592820","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 : 2017-01-01DOI: 10.1504/IJMNDI.2016.081661
N. Meghanathan
We propose an eigenvector centrality EVC-based tracking algorithm to trace the trajectory of a mobile radioactive dispersal device RDD in a wireless sensor network. We propose that the sensor nodes simply sum up the strengths of the signals sensed in the neighbourhood over a sampling time period and forward the sum of the signals to a control centre called sink. For every sampling time period, the sink constructs an adjacency matrix in which the entry for edge i, j is the sum of the signal strengths reported by sensor nodes i and j. The sink uses this adjacency matrix as the basis to determine the eigenvector centralities and uses the arithmetic mean calculated by the sink of the X and Y coordinates of the suspect sensor nodes those having larger EVC to predict the location of the RDD at a time instant corresponding to the middle of the sampling time period.
{"title":"An eigenvector centrality-based mobile target tracking algorithm for wireless sensor networks","authors":"N. Meghanathan","doi":"10.1504/IJMNDI.2016.081661","DOIUrl":"https://doi.org/10.1504/IJMNDI.2016.081661","url":null,"abstract":"We propose an eigenvector centrality EVC-based tracking algorithm to trace the trajectory of a mobile radioactive dispersal device RDD in a wireless sensor network. We propose that the sensor nodes simply sum up the strengths of the signals sensed in the neighbourhood over a sampling time period and forward the sum of the signals to a control centre called sink. For every sampling time period, the sink constructs an adjacency matrix in which the entry for edge i, j is the sum of the signal strengths reported by sensor nodes i and j. The sink uses this adjacency matrix as the basis to determine the eigenvector centralities and uses the arithmetic mean calculated by the sink of the X and Y coordinates of the suspect sensor nodes those having larger EVC to predict the location of the RDD at a time instant corresponding to the middle of the sampling time period.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"127 1","pages":"202-211"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86765813","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 : 2017-01-01DOI: 10.1504/IJMNDI.2016.081662
Sudha Nagamalai, K. Vijayalakshmi
In mobile ad hoc networks, most algorithms are lacking a self-organised grouping mechanism for ensuring the scalability and performance of key management. In this paper, we propose to establish self-healing key distribution to the self-organised group members. For this, a self-organised group establishing algorithm is proposed which requires users interacting with their neighbours. This algorithm locally elects the group manager who is responsible for the establishment, distribution, and management of group keys. After establishing the self-organised group and group manager, the collusion resistance threshold self-healing key distribution will be applied within each group for group key establishment. The elected group manager is responsible for distributing and updating the keys. Then using the established keys, secure communication among the mobile nodes will be performed to provide confidentiality.
{"title":"Self-healing key distribution for self-organised group management in MANET","authors":"Sudha Nagamalai, K. Vijayalakshmi","doi":"10.1504/IJMNDI.2016.081662","DOIUrl":"https://doi.org/10.1504/IJMNDI.2016.081662","url":null,"abstract":"In mobile ad hoc networks, most algorithms are lacking a self-organised grouping mechanism for ensuring the scalability and performance of key management. In this paper, we propose to establish self-healing key distribution to the self-organised group members. For this, a self-organised group establishing algorithm is proposed which requires users interacting with their neighbours. This algorithm locally elects the group manager who is responsible for the establishment, distribution, and management of group keys. After establishing the self-organised group and group manager, the collusion resistance threshold self-healing key distribution will be applied within each group for group key establishment. The elected group manager is responsible for distributing and updating the keys. Then using the established keys, secure communication among the mobile nodes will be performed to provide confidentiality.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"1 1","pages":"212-218"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89420623","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 : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010142
M. Kokilamani, E. Karthikeyan
Today, most ad hoc mobile devices operate on batteries. To maximise the lifetime of mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request must be minimised. But many proposed routing protocols do not consider energy as an important factor for selecting routes. This causes earliest exhaustion of nodes and network in trouble. Here, a new approach for path selection strategy is introduced by using energy factor is known as energy aware ad-hoc on-demand multipath distance vector (EA-AOMDV) routing protocol. The proposed scheme attempts to solve the above-mentioned problems in the way of selecting energy aware nodes on the path. During the route selection process, the node is considered only when the node is having above the minimum energy threshold value. The proposed model is tested with the NS2 simulator and the result we obtained is significant.
{"title":"A novel optimal path selection strategy in MANET using energy awareness","authors":"M. Kokilamani, E. Karthikeyan","doi":"10.1504/IJMNDI.2017.10010142","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010142","url":null,"abstract":"Today, most ad hoc mobile devices operate on batteries. To maximise the lifetime of mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request must be minimised. But many proposed routing protocols do not consider energy as an important factor for selecting routes. This causes earliest exhaustion of nodes and network in trouble. Here, a new approach for path selection strategy is introduced by using energy factor is known as energy aware ad-hoc on-demand multipath distance vector (EA-AOMDV) routing protocol. The proposed scheme attempts to solve the above-mentioned problems in the way of selecting energy aware nodes on the path. During the route selection process, the node is considered only when the node is having above the minimum energy threshold value. The proposed model is tested with the NS2 simulator and the result we obtained is significant.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"18 1","pages":"129"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81203454","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 : 2017-01-01DOI: 10.1504/IJMNDI.2016.081660
D. Madhavi, Y. Swamy
In this paper, we have designed MAC protocol with energy efficient relay selection algorithm. This relay node selection should minimise the energy consumption and MAC overhead, thereby increasing the lifetime of the networks. In this MAC protocol, relay nodes RN are selected based on the MAC overhead and relative energy usage REU parameters. The MAC overhead is incurred by handshake signalling, frame transmission time FTT and frame retransmissions due to transmission failures. The REU is the ratio of cost of generated and forwarded packets to the cost of generated packets. Thus the relay node selection algorithm is proposed based on the above parameters and the node with least MAC overhead and REU is selected as relay node.
{"title":"MAC protocol with energy efficient relay selection algorithm for mobile wireless sensor networks","authors":"D. Madhavi, Y. Swamy","doi":"10.1504/IJMNDI.2016.081660","DOIUrl":"https://doi.org/10.1504/IJMNDI.2016.081660","url":null,"abstract":"In this paper, we have designed MAC protocol with energy efficient relay selection algorithm. This relay node selection should minimise the energy consumption and MAC overhead, thereby increasing the lifetime of the networks. In this MAC protocol, relay nodes RN are selected based on the MAC overhead and relative energy usage REU parameters. The MAC overhead is incurred by handshake signalling, frame transmission time FTT and frame retransmissions due to transmission failures. The REU is the ratio of cost of generated and forwarded packets to the cost of generated packets. Thus the relay node selection algorithm is proposed based on the above parameters and the node with least MAC overhead and REU is selected as relay node.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"20 1","pages":"196-201"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81971400","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 : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010152
Aditi Paul, Somnath Sinha
Detection of Sybil attack in mobile ad hoc network (MANET) has been a serious issue. A legitimate node, in general, varies its transmission power within a threshold limit. A Sybil attacker can create multiple forged identities having transmission power higher than that of the legitimate nodes. This article focuses on the performance analysis of the Sybil detection technique based on received signal power. Here, we propose the concept of a Sybil detection method for a specific category of Sybil attack where the attacker changes its transmission power along with IDs time to time. To distinguish between a legitimate node and a Sybil node, we calculate received signal power (RSP) of some initially suspected nodes for a number of time instances and draw cubic Bezier curve with these values. By using tangent properties of Bezier curve, we finally trace out Sybil nodes from the suspected nodes and represent them both graphically and mathematically. We analyse the result of each step of the proposed method throug...
{"title":"Performance analysis of received signal power-based Sybil detection in MANET using spline curve","authors":"Aditi Paul, Somnath Sinha","doi":"10.1504/IJMNDI.2017.10010152","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010152","url":null,"abstract":"Detection of Sybil attack in mobile ad hoc network (MANET) has been a serious issue. A legitimate node, in general, varies its transmission power within a threshold limit. A Sybil attacker can create multiple forged identities having transmission power higher than that of the legitimate nodes. This article focuses on the performance analysis of the Sybil detection technique based on received signal power. Here, we propose the concept of a Sybil detection method for a specific category of Sybil attack where the attacker changes its transmission power along with IDs time to time. To distinguish between a legitimate node and a Sybil node, we calculate received signal power (RSP) of some initially suspected nodes for a number of time instances and draw cubic Bezier curve with these values. By using tangent properties of Bezier curve, we finally trace out Sybil nodes from the suspected nodes and represent them both graphically and mathematically. We analyse the result of each step of the proposed method throug...","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"7 1","pages":"222"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85371022","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 : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010153
Ankit Saxena, R. Sindal
Evolved UMTS terrestrial radio access network (EUTRAN) offers high uplink and downlink throughput. In this paper, we investigate the performance of five different schedulers of media access control for resource allocation, such as round robin (RB), proportional fair (PF), best channel quality indicator (CQI), max transmission point (TP) and resource fair (RF). On comparing the performance of resource allocation schedulers in the indistinguishable arrangement, we found the proportional fair (PF) offers balance in terms of individual metrics. Furthermore, we analyse the effect of feedback transmission time interval (TTI) delay on two typical EUTRAN networks referred to as long term evolution (LTE) and LTE-Advance (LTE-A). We evaluate the performance of the PF scheduler for both networks under varying feedback delay in TTI. Simulated results show that the delay in TTI affects the performance of resource allocation. Feedback delay improves network performance by compensating effect of imperfect channel.
{"title":"Comparative performance analysis of different resource scheduler and characterising the impact of proportional fair under different TTI feedback delay in EUTRA network","authors":"Ankit Saxena, R. Sindal","doi":"10.1504/IJMNDI.2017.10010153","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010153","url":null,"abstract":"Evolved UMTS terrestrial radio access network (EUTRAN) offers high uplink and downlink throughput. In this paper, we investigate the performance of five different schedulers of media access control for resource allocation, such as round robin (RB), proportional fair (PF), best channel quality indicator (CQI), max transmission point (TP) and resource fair (RF). On comparing the performance of resource allocation schedulers in the indistinguishable arrangement, we found the proportional fair (PF) offers balance in terms of individual metrics. Furthermore, we analyse the effect of feedback transmission time interval (TTI) delay on two typical EUTRAN networks referred to as long term evolution (LTE) and LTE-Advance (LTE-A). We evaluate the performance of the PF scheduler for both networks under varying feedback delay in TTI. Simulated results show that the delay in TTI affects the performance of resource allocation. Feedback delay improves network performance by compensating effect of imperfect channel.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"11 1","pages":"233"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88662003","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 : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010144
Shanti Chilukuri, K. Chilukuri, S. Korla
As the amount of data stored and retrieved in the internet increases, newer architectures that support high volumes of data become necessary. Content centric networking (CCN) architecture by PARC is an information centric architecture that focuses on the content to be retrieved, rather than the address from which it has to be retrieved. Data objects in CCN are assigned hierarchical names and requests for data are routed based on longest prefix matching. While CCN offers freedom from host addresses and improves data retrieval speeds by using in-network caching, mobility of content providers is a big challenge. In view of the rapidly growing number of mobile nodes and volume of data, we analyse the problems associated with provider mobility in CCN. We then explore the existing solutions to address these problems and compare their performance. Lastly, we discuss open issues in supporting provider mobility in CCN.
{"title":"Provider mobility in content centric networks - issues and challenges","authors":"Shanti Chilukuri, K. Chilukuri, S. Korla","doi":"10.1504/IJMNDI.2017.10010144","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010144","url":null,"abstract":"As the amount of data stored and retrieved in the internet increases, newer architectures that support high volumes of data become necessary. Content centric networking (CCN) architecture by PARC is an information centric architecture that focuses on the content to be retrieved, rather than the address from which it has to be retrieved. Data objects in CCN are assigned hierarchical names and requests for data are routed based on longest prefix matching. While CCN offers freedom from host addresses and improves data retrieval speeds by using in-network caching, mobility of content providers is a big challenge. In view of the rapidly growing number of mobile nodes and volume of data, we analyse the problems associated with provider mobility in CCN. We then explore the existing solutions to address these problems and compare their performance. Lastly, we discuss open issues in supporting provider mobility in CCN.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"46 1","pages":"150"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89103104","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 : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010151
Jian Zhang
Because of its small, flexibility, low cost and unattended, wireless sensor networks (WSNs) are widely used in environmental monitor, healthcare, smart home, military fields, and so on. The faults are common due to the bad environment and unattended. In order to ensure WSNs' service is normal, it is necessary to detect the faults and locate the faulty sensors. In this paper, the basic method of fault localisation using active probing is studied, the key problems of active probing are analysed, and some effective solutions to these problems are provided. Firstly, based on adjacent matrix, probe stations are selected, and designed a maximal greedy algorithm to minimise probe sets. Secondly, binary search method is used to locate the faulty sensor quickly. Lastly, an algorithm to identify the faulty sensors is proposed and evaluated. Fault detection precision is very high, and the implementation complexity of the algorithm is very low, easily implemented in hardware.
{"title":"Research of a low-cost localised fault algorithm for wireless sensor networks","authors":"Jian Zhang","doi":"10.1504/IJMNDI.2017.10010151","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010151","url":null,"abstract":"Because of its small, flexibility, low cost and unattended, wireless sensor networks (WSNs) are widely used in environmental monitor, healthcare, smart home, military fields, and so on. The faults are common due to the bad environment and unattended. In order to ensure WSNs' service is normal, it is necessary to detect the faults and locate the faulty sensors. In this paper, the basic method of fault localisation using active probing is studied, the key problems of active probing are analysed, and some effective solutions to these problems are provided. Firstly, based on adjacent matrix, probe stations are selected, and designed a maximal greedy algorithm to minimise probe sets. Secondly, binary search method is used to locate the faulty sensor quickly. Lastly, an algorithm to identify the faulty sensors is proposed and evaluated. Fault detection precision is very high, and the implementation complexity of the algorithm is very low, easily implemented in hardware.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"34 1","pages":"216"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86540748","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 : 2017-01-01DOI: 10.1504/IJMNDI.2017.10010143
L. J. Rubini, P. Eswaran
Several techniques were applied to healthcare datasets for the prediction of future healthcare utilisation such as predicting individual expenditures and disease risks for patients. In order to achieve promising results in medical data classification, we have planned to utilise orthogonal local preserving projection and optimal classifier. Initially, the pre-processing will be applied to extract useful data and to convert suitable samples from raw medical datasets. Feature dimension reduction method will be applied to reduce the features' space without losing the accuracy of prediction. Here, orthogonal local preserving projection (OLPP) will be used. Once the feature reduction is formed, the prediction will be carried out based on the optimal classifier. In the optimal classifier, group search optimiser algorithm will be used for fuzzy min-max neural network. Here, the experimentation is done by using various datasets from UCI machine learning repository.
{"title":"Optimal fuzzy min-max neural network for medical data classification using group search optimiser algorithm","authors":"L. J. Rubini, P. Eswaran","doi":"10.1504/IJMNDI.2017.10010143","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10010143","url":null,"abstract":"Several techniques were applied to healthcare datasets for the prediction of future healthcare utilisation such as predicting individual expenditures and disease risks for patients. In order to achieve promising results in medical data classification, we have planned to utilise orthogonal local preserving projection and optimal classifier. Initially, the pre-processing will be applied to extract useful data and to convert suitable samples from raw medical datasets. Feature dimension reduction method will be applied to reduce the features' space without losing the accuracy of prediction. Here, orthogonal local preserving projection (OLPP) will be used. Once the feature reduction is formed, the prediction will be carried out based on the optimal classifier. In the optimal classifier, group search optimiser algorithm will be used for fuzzy min-max neural network. Here, the experimentation is done by using various datasets from UCI machine learning repository.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"1 1","pages":"140"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91224604","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
扫码关注我们
求助内容：
应助结果提醒方式：