Pub Date : 2017-05-04DOI: 10.1109/C-CODE.2017.7918914
M. Raza, H. Le‐Minh, N. Aslam, S. Hussain, W. Ellahi
For time critical applications in industrial environments, failure in communication or unwanted delay can have devastating effects. It is therefore, important that Industrial Wireless Sensor Networks (IWSNs) offer reliable communication platform for time critical applications without violating the hard deadlines. In this paper, a MAC protocol for time critical and emergency communications is proposed. The proposed protocol, EE-MAC incorporates emergency communication and allows immediate channel access for such data. The paper presents mathematical model of the proposed protocol. For evaluation purposes, the performance of EE-MAC is compared to IEEE 802.15.4e LLDN. The results show that the proposed protocol offers up to 92% reduction in channel access delay of emergency communication at the cost of 5% to 15% increase in delay of non-critical and less time-sensitive data.
{"title":"A control channel based MAC protocol for time critical and emergency communications in Industrial Wireless Sensor Networks","authors":"M. Raza, H. Le‐Minh, N. Aslam, S. Hussain, W. Ellahi","doi":"10.1109/C-CODE.2017.7918914","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918914","url":null,"abstract":"For time critical applications in industrial environments, failure in communication or unwanted delay can have devastating effects. It is therefore, important that Industrial Wireless Sensor Networks (IWSNs) offer reliable communication platform for time critical applications without violating the hard deadlines. In this paper, a MAC protocol for time critical and emergency communications is proposed. The proposed protocol, EE-MAC incorporates emergency communication and allows immediate channel access for such data. The paper presents mathematical model of the proposed protocol. For evaluation purposes, the performance of EE-MAC is compared to IEEE 802.15.4e LLDN. The results show that the proposed protocol offers up to 92% reduction in channel access delay of emergency communication at the cost of 5% to 15% increase in delay of non-critical and less time-sensitive data.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124761555","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-03-08DOI: 10.1109/C-CODE.2017.7918952
Malik Imran, M. Rashid
In elliptic curve cryptography (ECC), hardware architectures of finite field (FF) multipliers are frequently proposed for polynomial as well as for normal bases representations over GF(2m). Although the polynomial bases provide efficient FF multiplication as compared to normal bases, the performance of the entire elliptic cryptosystem mainly depends upon its FF multiplier. Consequently, this paper provides a comparative overview of the recent hardware architectures of FF multipliers for polynomial bases over GF(2m). This is achieved by classifying the most recent state-of-the-art research practices into three categories: bit-serial, bit-parallel and digit-serial multipliers. The comparison of multiple techniques in this article enables the designer to select a suitable multiplier according to different application requirements such as high speed/performance, constrained environments and high throughput/area applications.
{"title":"Architectural review of polynomial bases finite field multipliers over GF(2m)","authors":"Malik Imran, M. Rashid","doi":"10.1109/C-CODE.2017.7918952","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918952","url":null,"abstract":"In elliptic curve cryptography (ECC), hardware architectures of finite field (FF) multipliers are frequently proposed for polynomial as well as for normal bases representations over GF(2m). Although the polynomial bases provide efficient FF multiplication as compared to normal bases, the performance of the entire elliptic cryptosystem mainly depends upon its FF multiplier. Consequently, this paper provides a comparative overview of the recent hardware architectures of FF multipliers for polynomial bases over GF(2m). This is achieved by classifying the most recent state-of-the-art research practices into three categories: bit-serial, bit-parallel and digit-serial multipliers. The comparison of multiple techniques in this article enables the designer to select a suitable multiplier according to different application requirements such as high speed/performance, constrained environments and high throughput/area applications.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126807507","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-03-08DOI: 10.1109/C-CODE.2017.7918964
S. Zaman, N. Haq, Muhammad Ibtisam Gul, Arslan Habib
Logic and Planning are interesting artificial intelligence problems in the context of robotic systems, i.e., robotic navigation. For such an autonomous system one of the requisites is that the goal has to be achieved without intervention of human being. We present a practical implementation of autonomous robotic navigation based on logic-based planning. We achieve this by using strength of PROLOG in order to generate plan to reach goal position from an initial. We utilize First Order Logic (FOL) that automatically asserts and retracts facts at runtime dynamically. All possible plans are computed using local search strategies (e.g., Depth and Breadth First) on state space representing a real, dynamic, and unpredictable environment. In order to navigate in the environment following optimized plan - one with fewest states, a balanced size 4-wheel differential drive robot has been carefully constructed. It can turn 90° and actuate forward by controlling linear (νt = 0.25m/s) and angular (ωt = Π/8 rad/s) velocities of two rear motorized wheels. It is also equipped with an Ultrasonic sensor to avoid collision with obstacles. The system is evaluated in an environment comprising of corridors with adjacent rooms. Graphical User Interface (GUI) is developed in .Net (C#) to map situation in Prolog and transmit plan to hardware for execution. Average time calculated for a plan to generate is 0.065 seconds. The robot moves block by block where each block in the state space represents 2m2 area. In addition to minors, our major contribution is that we offer a unified scheme for robotic navigation without calculating odometry data with the assumption the robot cannot be kidnapped nor slipped.
{"title":"Robotic navigation based on logic-based planning","authors":"S. Zaman, N. Haq, Muhammad Ibtisam Gul, Arslan Habib","doi":"10.1109/C-CODE.2017.7918964","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918964","url":null,"abstract":"Logic and Planning are interesting artificial intelligence problems in the context of robotic systems, i.e., robotic navigation. For such an autonomous system one of the requisites is that the goal has to be achieved without intervention of human being. We present a practical implementation of autonomous robotic navigation based on logic-based planning. We achieve this by using strength of PROLOG in order to generate plan to reach goal position from an initial. We utilize First Order Logic (FOL) that automatically asserts and retracts facts at runtime dynamically. All possible plans are computed using local search strategies (e.g., Depth and Breadth First) on state space representing a real, dynamic, and unpredictable environment. In order to navigate in the environment following optimized plan - one with fewest states, a balanced size 4-wheel differential drive robot has been carefully constructed. It can turn 90° and actuate forward by controlling linear (νt = 0.25m/s) and angular (ωt = Π/8 rad/s) velocities of two rear motorized wheels. It is also equipped with an Ultrasonic sensor to avoid collision with obstacles. The system is evaluated in an environment comprising of corridors with adjacent rooms. Graphical User Interface (GUI) is developed in .Net (C#) to map situation in Prolog and transmit plan to hardware for execution. Average time calculated for a plan to generate is 0.065 seconds. The robot moves block by block where each block in the state space represents 2m2 area. In addition to minors, our major contribution is that we offer a unified scheme for robotic navigation without calculating odometry data with the assumption the robot cannot be kidnapped nor slipped.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133437903","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-03-08DOI: 10.1109/C-CODE.2017.7918893
Khizar Hameed, Junaid Haseeb, M. Tayyab, M. Junaid, Talal Bin Maqsood, Mustahsan Hammad Naqvi
Data in wireless sensor networks are produced at sensor nodes and it is processed by multiple intermediate nodes until reaches at the base station. The diverse nature of data also highlights its associated security concerns. So, it is very important to assess trustworthiness of data to ensure that only reliable information is used in decision making process. Provenance is the effective technique to assess the trustworthiness of data, since it considers a detailed history of the ownership of data and operations performed on data. Many secure provenance schemes have been proposed in the domain of database, cloud, and workflow systems. A very few such schemes have been proposed in the wireless sensor networks. To best of our knowledge, this is the very first survey that explores the secure provenance schemes in context of addressed challenges, security properties, and detected attacks.
{"title":"Secure provenance in Wireless Sensor Networks - a survey of provenance schemes","authors":"Khizar Hameed, Junaid Haseeb, M. Tayyab, M. Junaid, Talal Bin Maqsood, Mustahsan Hammad Naqvi","doi":"10.1109/C-CODE.2017.7918893","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918893","url":null,"abstract":"Data in wireless sensor networks are produced at sensor nodes and it is processed by multiple intermediate nodes until reaches at the base station. The diverse nature of data also highlights its associated security concerns. So, it is very important to assess trustworthiness of data to ensure that only reliable information is used in decision making process. Provenance is the effective technique to assess the trustworthiness of data, since it considers a detailed history of the ownership of data and operations performed on data. Many secure provenance schemes have been proposed in the domain of database, cloud, and workflow systems. A very few such schemes have been proposed in the wireless sensor networks. To best of our knowledge, this is the very first survey that explores the secure provenance schemes in context of addressed challenges, security properties, and detected attacks.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053450","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-03-08DOI: 10.1109/C-CODE.2017.7918900
Sahrish Khan Tayyaba, M. A. Shah
The tremendous growth in communication technology is shaping a hyper-connected network where billions or connected devices are producing a huge volume of data. Cellular and mobile network is a major contributor towards this technology shift and require new architectural paradigm to provide low latency, high performance in a resource constrained environment. 5G technology deployment with fully IP-based connectivity is anticipated by 2020. However, there is no standard established for 5G technology and many efforts are being made to establish a unified 5G stander. In this context, variant technology such as Software Defined Network (SDN) and Network Function virtualization (NFV) are the best candidate. SDN dissociate control plane from data plane and network management is done on the centralized control plane. In this paper, a survey on state of the art on the 5G integration with the SDN is presented. A comprehensive review is presented for the different integrated architectures of 5G wireless network and the generalized solutions over the period 2010–2016. This comparative analysis of the existing solutions of SDN-based cellular network (5G) implementations provides an easy and concise view of the emerging trends by 2020.
{"title":"5G cellular network integration with SDN: Challenges, issues and beyond","authors":"Sahrish Khan Tayyaba, M. A. Shah","doi":"10.1109/C-CODE.2017.7918900","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918900","url":null,"abstract":"The tremendous growth in communication technology is shaping a hyper-connected network where billions or connected devices are producing a huge volume of data. Cellular and mobile network is a major contributor towards this technology shift and require new architectural paradigm to provide low latency, high performance in a resource constrained environment. 5G technology deployment with fully IP-based connectivity is anticipated by 2020. However, there is no standard established for 5G technology and many efforts are being made to establish a unified 5G stander. In this context, variant technology such as Software Defined Network (SDN) and Network Function virtualization (NFV) are the best candidate. SDN dissociate control plane from data plane and network management is done on the centralized control plane. In this paper, a survey on state of the art on the 5G integration with the SDN is presented. A comprehensive review is presented for the different integrated architectures of 5G wireless network and the generalized solutions over the period 2010–2016. This comparative analysis of the existing solutions of SDN-based cellular network (5G) implementations provides an easy and concise view of the emerging trends by 2020.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125118919","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-03-08DOI: 10.1109/C-CODE.2017.7918896
Madiha Khalid, U. Mujahid
RFID is one of the rapidly growing identification schemes. Unique identification, non-line of sight capability and functional haste result its massive deployment in many supply chain applications. Because of limited computational capabilities at tag side Ultra lightweight protocols are the only solution to ensure secure communication in RFID systems. In this paper we have presented a detailed working of three eminent UMAPs. Further, a generic desynchronization attack model on these UMAPs has been discussed. Then finally, a novel security framework for low cost UMAPs has been presented to avoid all possible desynchronization attacks. The proposed security model is generic in nature therefore can be implemented to all upcoming UMAPs as well.
{"title":"Security framework of Ultralightweight Mutual Authentication Protocols for low cost RFID tags","authors":"Madiha Khalid, U. Mujahid","doi":"10.1109/C-CODE.2017.7918896","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918896","url":null,"abstract":"RFID is one of the rapidly growing identification schemes. Unique identification, non-line of sight capability and functional haste result its massive deployment in many supply chain applications. Because of limited computational capabilities at tag side Ultra lightweight protocols are the only solution to ensure secure communication in RFID systems. In this paper we have presented a detailed working of three eminent UMAPs. Further, a generic desynchronization attack model on these UMAPs has been discussed. Then finally, a novel security framework for low cost UMAPs has been presented to avoid all possible desynchronization attacks. The proposed security model is generic in nature therefore can be implemented to all upcoming UMAPs as well.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073479","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-03-08DOI: 10.1109/C-CODE.2017.7918894
A. A. Awan, Irfanullah, S. Khattak, A. Malik
Much attention has been paid to the design and implementation of adaptive antenna arrays (also called smart antennas), intended for use in current and future wireless communication systems. The motivation is that employment of such array antennas can significantly increase the range and capacity of wireless systems by orienting the main beam towards the desired direction while simultaneously placing nulls toward the interferers (thereby increasing the signal to interference SIR ratio). In this paper, various adaptive beamforming algorithms have been compared based on nulls location, gain and half-power beamwidth (HPBW). Performance comparisons of matrix inversion beamforming algorithm (used for fixed beamforming) and LMS, RLS (used for adaptive beamforming) are investigated in terms of their effects on main beam scanning, resolution and convergence. In particular, the effects of nulls location on the gain and half power beamwidth (HPBW) of main beam have been investigated for the fixed vs adaptive beamforming algorithms.
{"title":"Performance comparisons of fixed and adaptive beamforming techniques for 4G smart antennas","authors":"A. A. Awan, Irfanullah, S. Khattak, A. Malik","doi":"10.1109/C-CODE.2017.7918894","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918894","url":null,"abstract":"Much attention has been paid to the design and implementation of adaptive antenna arrays (also called smart antennas), intended for use in current and future wireless communication systems. The motivation is that employment of such array antennas can significantly increase the range and capacity of wireless systems by orienting the main beam towards the desired direction while simultaneously placing nulls toward the interferers (thereby increasing the signal to interference SIR ratio). In this paper, various adaptive beamforming algorithms have been compared based on nulls location, gain and half-power beamwidth (HPBW). Performance comparisons of matrix inversion beamforming algorithm (used for fixed beamforming) and LMS, RLS (used for adaptive beamforming) are investigated in terms of their effects on main beam scanning, resolution and convergence. In particular, the effects of nulls location on the gain and half power beamwidth (HPBW) of main beam have been investigated for the fixed vs adaptive beamforming algorithms.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126016855","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-03-08DOI: 10.1109/C-CODE.2017.7918911
M. Sarwar, M. Saleem, M. Haider, Junaid Imtiaz
Cognitive radio is an uprising technique designed to solve the problem of spectrum utilization effectively. In a cooperative cognitive radio mobile network (CRMN), battery-powered cognitive mobile node (CMN) frequently sense and report primary user's (PU's) existence to exploit a spectrum hole. The energy consumption increases when all CMN sense and report to centralized controller (CC) in order to make a final global decision. An appropriate strategy is needed to be developed in order to decrease the overall energy consumption, improving energy efficiency (EE). This paper proposes communication channel based activation (CCBA) for CMN in a CRMN. Numerical results shows that even with CCBA limiting some CMN to be activated, helps in increasing EE and global probability of false alarm (FA/W) for the CRMN.
{"title":"Increasing energy efficiency with channel condition based activation for a cognitive radio mobile network","authors":"M. Sarwar, M. Saleem, M. Haider, Junaid Imtiaz","doi":"10.1109/C-CODE.2017.7918911","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918911","url":null,"abstract":"Cognitive radio is an uprising technique designed to solve the problem of spectrum utilization effectively. In a cooperative cognitive radio mobile network (CRMN), battery-powered cognitive mobile node (CMN) frequently sense and report primary user's (PU's) existence to exploit a spectrum hole. The energy consumption increases when all CMN sense and report to centralized controller (CC) in order to make a final global decision. An appropriate strategy is needed to be developed in order to decrease the overall energy consumption, improving energy efficiency (EE). This paper proposes communication channel based activation (CCBA) for CMN in a CRMN. Numerical results shows that even with CCBA limiting some CMN to be activated, helps in increasing EE and global probability of false alarm (FA/W) for the CRMN.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132262988","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-03-08DOI: 10.1109/C-CODE.2017.7918937
Abdul Aziz, Anam Mushtaq, Misbahul Anwar
Enterprise games have an amazing ability to hold employee's attention, build loyalty, and increase motivation. The acceptance of game context in business applications is encouraging; also, it motivates employees to perform their tasks in an enjoyable manner. Enterprise gamification is growing at an impressive rate. This analysis focuses on how enterprises could use gamification for their benefits and discusses few implemented examples. The review concentrates on positive and negative aspects of gamification in business and discusses the mechanism that helps in implementing the games in an enterprise. Our findings revealed that, gamification has a fine line between being a positive tool to motivate employees and being a source of workplace pressure, which could affect the social and mental well-being.
{"title":"Usage of gamification in enterprise: A review","authors":"Abdul Aziz, Anam Mushtaq, Misbahul Anwar","doi":"10.1109/C-CODE.2017.7918937","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918937","url":null,"abstract":"Enterprise games have an amazing ability to hold employee's attention, build loyalty, and increase motivation. The acceptance of game context in business applications is encouraging; also, it motivates employees to perform their tasks in an enjoyable manner. Enterprise gamification is growing at an impressive rate. This analysis focuses on how enterprises could use gamification for their benefits and discusses few implemented examples. The review concentrates on positive and negative aspects of gamification in business and discusses the mechanism that helps in implementing the games in an enterprise. Our findings revealed that, gamification has a fine line between being a positive tool to motivate employees and being a source of workplace pressure, which could affect the social and mental well-being.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126412996","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-03-08DOI: 10.1109/C-CODE.2017.7918926
Saleh Habib, Mahgul Malik, Shams ur Rahman, Muhammad Adil Raja
Contemporary models of Unmanned Aerial Vehicles (UAVs) are largely developed using simulators. In a typical scheme, a flight simulator is dovetailed with a machine learning (ML) algorithm. A good simulator provides a realistic environment for simulated aircraft. It also provides the ability to invoke and fly various models of aircraft. The ML algorithm, in turn, allows to find an appropriate set of control inputs that can be useful in flying the aircraft autonomously. Creating UAVs in this way has certain obvious benefits. The process of development can be accelerated largely by employing a testbed that allows a seamless dovetailing between the flight simulator and an ML algorithm of choice. However, an extensive testbed is largely missing from the academic landscape both in terms of implementation and technical details. This papers proposes a new testbed for the development of fully autonomous UAVs. The proposed system allows researchers to simulate UAVs for various scenarios.
{"title":"NUAV - a testbed for developing autonomous Unmanned Aerial Vehicles","authors":"Saleh Habib, Mahgul Malik, Shams ur Rahman, Muhammad Adil Raja","doi":"10.1109/C-CODE.2017.7918926","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918926","url":null,"abstract":"Contemporary models of Unmanned Aerial Vehicles (UAVs) are largely developed using simulators. In a typical scheme, a flight simulator is dovetailed with a machine learning (ML) algorithm. A good simulator provides a realistic environment for simulated aircraft. It also provides the ability to invoke and fly various models of aircraft. The ML algorithm, in turn, allows to find an appropriate set of control inputs that can be useful in flying the aircraft autonomously. Creating UAVs in this way has certain obvious benefits. The process of development can be accelerated largely by employing a testbed that allows a seamless dovetailing between the flight simulator and an ML algorithm of choice. However, an extensive testbed is largely missing from the academic landscape both in terms of implementation and technical details. This papers proposes a new testbed for the development of fully autonomous UAVs. The proposed system allows researchers to simulate UAVs for various scenarios.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129921355","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
扫码关注我们
求助内容：
应助结果提醒方式：