Pub Date : 2016-07-01DOI: 10.1109/WOCN.2016.7759886
Vaibhav Kathuria, Ankit Yadav, Aquib Malik, U. Kumar, M. Tripathy
Flower shaped antenna along with a rectangular resonator is reported in this paper for THz applications. The dimension of antenna is 20×30×1.6 mm3. FR4 material is used as substrate. Return loss, radiation pattern and gain of the antenna are presented and analyzed to study the performance of the antenna for THz applications. The frequency band is obtained at 0.92 THz with the impedance bandwidth of 710 GHz. The peak gain of this antenna is obtained as 12.786 dB at 1.01 THz.
{"title":"Flower shaped antenna for terahertz applications","authors":"Vaibhav Kathuria, Ankit Yadav, Aquib Malik, U. Kumar, M. Tripathy","doi":"10.1109/WOCN.2016.7759886","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759886","url":null,"abstract":"Flower shaped antenna along with a rectangular resonator is reported in this paper for THz applications. The dimension of antenna is 20×30×1.6 mm3. FR4 material is used as substrate. Return loss, radiation pattern and gain of the antenna are presented and analyzed to study the performance of the antenna for THz applications. The frequency band is obtained at 0.92 THz with the impedance bandwidth of 710 GHz. The peak gain of this antenna is obtained as 12.786 dB at 1.01 THz.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615131","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759894
Roshni Shende, D. Ambawade
Hardware Trojan (HT) is an intentional and the undesired modification of the integrated circuit (IC) and major security issue for the semiconductor industry. HT alters the normal working of IC, can leak the secret information or may damage the IC permanently. Due to the small size of the devices on IC, detection of trojan is very difficult by normal testing methods. In this paper, a side channel based trojan detection technique using power analysis is used to detect the trojan infected IC. Here a trust-hub test bench circuit is used to validate trojan detection technique in which the Trojan is inserted on AES-128 bit crypto core. The trojan detection is improved by analyzing the power of IC without trojan (Golden model) and IC with trojan (Trojan model) and by comparing the mean of power traces of both the IC. Statistical data analysis is performed and statistical parameters of power are calculated which are then used as feature vectors. These feature vectors are reduced by using Principal Component Analysis (PCA) algorithm and then classified using Linear Discriminant Analysis (LDA) which discriminates between the Golden and Trojan model and detects the trojan infected IC from the IC under test with 100% accuracy.
{"title":"A side channel based power analysis technique for hardware trojan detection using statistical learning approach","authors":"Roshni Shende, D. Ambawade","doi":"10.1109/WOCN.2016.7759894","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759894","url":null,"abstract":"Hardware Trojan (HT) is an intentional and the undesired modification of the integrated circuit (IC) and major security issue for the semiconductor industry. HT alters the normal working of IC, can leak the secret information or may damage the IC permanently. Due to the small size of the devices on IC, detection of trojan is very difficult by normal testing methods. In this paper, a side channel based trojan detection technique using power analysis is used to detect the trojan infected IC. Here a trust-hub test bench circuit is used to validate trojan detection technique in which the Trojan is inserted on AES-128 bit crypto core. The trojan detection is improved by analyzing the power of IC without trojan (Golden model) and IC with trojan (Trojan model) and by comparing the mean of power traces of both the IC. Statistical data analysis is performed and statistical parameters of power are calculated which are then used as feature vectors. These feature vectors are reduced by using Principal Component Analysis (PCA) algorithm and then classified using Linear Discriminant Analysis (LDA) which discriminates between the Golden and Trojan model and detects the trojan infected IC from the IC under test with 100% accuracy.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133349242","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759892
Sujeet Kumar, R. Chaudhary, A. Deepak, D. Dash
Nowadays wireless sensor network (WSN) plays an important role in every field of technology. Data collection is a major issue in WSN because the data has to be collected in a way that maximizes life time of WSN, minimizes the energy consumption and gives shortest path in case of mobile sinks. In this paper we divide the whole network into grids. Certain grids are critical (e.g., during a terror strike) in the sense that (a) it may not be possible for mobile elements to enter those grids, and (b) the sensor nodes in those grids are required to sense data at a higher rate due to the critically in the their surrounding environment. A subset of sensor nodes are designated as cache points such that each sensor node must deliver its sensed data to one of the cache points. Now the mobile movable sink has to make a tour schedule and visit each cache point exactly once such that it is able to collect data from all cache points in due time without causing buffer overflow at any of the cache points. We divide the problem into two parts. In the first part, we find cache points such that no cache point is also a critical sensor node and the energy consumption by critical nodes is minimized. In the second part, we find the shortest path among the caches points from the first step. Both problems are known to be NP-Complete and here we give ILP formulations for them.
{"title":"An integer linear formulation scheme for data collection in wireless sensor network using mobile element (ME)","authors":"Sujeet Kumar, R. Chaudhary, A. Deepak, D. Dash","doi":"10.1109/WOCN.2016.7759892","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759892","url":null,"abstract":"Nowadays wireless sensor network (WSN) plays an important role in every field of technology. Data collection is a major issue in WSN because the data has to be collected in a way that maximizes life time of WSN, minimizes the energy consumption and gives shortest path in case of mobile sinks. In this paper we divide the whole network into grids. Certain grids are critical (e.g., during a terror strike) in the sense that (a) it may not be possible for mobile elements to enter those grids, and (b) the sensor nodes in those grids are required to sense data at a higher rate due to the critically in the their surrounding environment. A subset of sensor nodes are designated as cache points such that each sensor node must deliver its sensed data to one of the cache points. Now the mobile movable sink has to make a tour schedule and visit each cache point exactly once such that it is able to collect data from all cache points in due time without causing buffer overflow at any of the cache points. We divide the problem into two parts. In the first part, we find cache points such that no cache point is also a critical sensor node and the energy consumption by critical nodes is minimized. In the second part, we find the shortest path among the caches points from the first step. Both problems are known to be NP-Complete and here we give ILP formulations for them.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134456933","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759030
A. M. Ahmed, S. Sardar, Mohammed Zafar Ali Khan
In this paper we implement a turbo based Overlay Cognitive radio Z-channel with Trellis shaping, where the primary and cognitive users transmits and receives concurrently, utilizing the same spectrum. We ensure that bit error rate (BER) performance of the Primary does not degrade even in the presence of cognitive user. We derive bit error rate BER curves for both users, and show significant improvement in the performance of primary even in the presence of cognitive user by implementing turbo decoding instead of Viterbi decoder. Simulation results show that turbo decoder provides a coding gain of 9.6dB for Primary and 8.7dB for cognitive user with out trellis shaping and 11.2dB total gain with Trellis shaping for cognitive user, where as conventional Viterbi decoder provides 1.8dB coding gain only.
{"title":"Performance of cognitive radio Overlay Z-channel with trellis shaping and turbo decoding","authors":"A. M. Ahmed, S. Sardar, Mohammed Zafar Ali Khan","doi":"10.1109/WOCN.2016.7759030","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759030","url":null,"abstract":"In this paper we implement a turbo based Overlay Cognitive radio Z-channel with Trellis shaping, where the primary and cognitive users transmits and receives concurrently, utilizing the same spectrum. We ensure that bit error rate (BER) performance of the Primary does not degrade even in the presence of cognitive user. We derive bit error rate BER curves for both users, and show significant improvement in the performance of primary even in the presence of cognitive user by implementing turbo decoding instead of Viterbi decoder. Simulation results show that turbo decoder provides a coding gain of 9.6dB for Primary and 8.7dB for cognitive user with out trellis shaping and 11.2dB total gain with Trellis shaping for cognitive user, where as conventional Viterbi decoder provides 1.8dB coding gain only.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122771770","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759897
K. Krishna, T. Kumar, Y. Sureshbabu, N. Sainath, R. Madanmohan, J. Jeny
For Remote sensor systems, there is an advancement criteria for the system sway on the lifetime can be maintained with the vitality and it can be non-renewable of sensor hubs. Streamlining should be possible for the present and existing strategies taking into account three instrument and they are versatile radio transmission power, abusing hub repetition and topology control. My work depends on sensor hubs particularly frail and solid hubs which can be execute on leftover vitality and propose a topology called Bunching based topology control convention. This convention augments system lifetime of which the availability might be upgraded. Our proposed convention assesses Java Simulator-different measurements measures the execution criteria particularly normal postponement, system lifetime and vitality usage least.
{"title":"Diverse execution dimensions for information conveyance in distant sensor systems","authors":"K. Krishna, T. Kumar, Y. Sureshbabu, N. Sainath, R. Madanmohan, J. Jeny","doi":"10.1109/WOCN.2016.7759897","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759897","url":null,"abstract":"For Remote sensor systems, there is an advancement criteria for the system sway on the lifetime can be maintained with the vitality and it can be non-renewable of sensor hubs. Streamlining should be possible for the present and existing strategies taking into account three instrument and they are versatile radio transmission power, abusing hub repetition and topology control. My work depends on sensor hubs particularly frail and solid hubs which can be execute on leftover vitality and propose a topology called Bunching based topology control convention. This convention augments system lifetime of which the availability might be upgraded. Our proposed convention assesses Java Simulator-different measurements measures the execution criteria particularly normal postponement, system lifetime and vitality usage least.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116076470","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759890
Jayashree S. Patil, Dr. K. V. N. Sunitha
Mobile Adhoc Network (MANET) is extremely susceptible to more attacks owing to its characteristics such as mobility and dynamic topology changes. In particular, routing process in MANET is aimed by more adversaries for various attacks to ruin the data transmission. In this paper, we introduce a combined technique for attack monitoring and risk assessment in MANET routing. The proposed solution chooses some nodes as monitoring nodes using Gittins index. The monitoring nodes are responsible for observing and discovering risks among nodes. Once risk in a node is detected considering reliability and reputation values, a warning message is forwarded to the node to invoke the risk assessment process. Efficiency of the proposed technique is proved through simulation results. It shows the combined technique increases packet delivery ratio and it achieves the risk assessment process with low computation cost and overhead.
{"title":"A combined technique for attack monitoring and risk assessment in MANET routing","authors":"Jayashree S. Patil, Dr. K. V. N. Sunitha","doi":"10.1109/WOCN.2016.7759890","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759890","url":null,"abstract":"Mobile Adhoc Network (MANET) is extremely susceptible to more attacks owing to its characteristics such as mobility and dynamic topology changes. In particular, routing process in MANET is aimed by more adversaries for various attacks to ruin the data transmission. In this paper, we introduce a combined technique for attack monitoring and risk assessment in MANET routing. The proposed solution chooses some nodes as monitoring nodes using Gittins index. The monitoring nodes are responsible for observing and discovering risks among nodes. Once risk in a node is detected considering reliability and reputation values, a warning message is forwarded to the node to invoke the risk assessment process. Efficiency of the proposed technique is proved through simulation results. It shows the combined technique increases packet delivery ratio and it achieves the risk assessment process with low computation cost and overhead.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129186764","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759873
Mohammed Zafar Ali Khan, Dr Shaik A. Qadeer
Rader abd Brenner's `real-factor' FFT can be applied to Radix-4 FFT to fetch saving in the multiplication counts. However in turn the number of addition count increases which results in increase in total flop count. For this in this paper two levels of saving ideas are proposed. First is a slight modification to Rader and Brenner's `real-factor' FFT for Radix-4, which not only reduces the multiplication but also makes the total flop count equals to standard Radix-4 FFT. Second is to apply the scaling operation to the Twidlle Factors(TF) similar to Tangent FFT like one proposed by Frigo for split radix so that the net computational complexity is of the order of 4Nlog2N computation, where N is the size of FFT. As such the complexity order is same as Standard Split Radix FFT.
{"title":"A new variant of Radix-4 FFT","authors":"Mohammed Zafar Ali Khan, Dr Shaik A. Qadeer","doi":"10.1109/WOCN.2016.7759873","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759873","url":null,"abstract":"Rader abd Brenner's `real-factor' FFT can be applied to Radix-4 FFT to fetch saving in the multiplication counts. However in turn the number of addition count increases which results in increase in total flop count. For this in this paper two levels of saving ideas are proposed. First is a slight modification to Rader and Brenner's `real-factor' FFT for Radix-4, which not only reduces the multiplication but also makes the total flop count equals to standard Radix-4 FFT. Second is to apply the scaling operation to the Twidlle Factors(TF) similar to Tangent FFT like one proposed by Frigo for split radix so that the net computational complexity is of the order of 4Nlog2N computation, where N is the size of FFT. As such the complexity order is same as Standard Split Radix FFT.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448235","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759889
S. L Aruna Rao, K. V. N. Sunitha
MANET is a dynamic network which is used extensively today due to its diverse applications in several fields like military battlefield, disaster relief operations, etc. Since MANET has a mobile topology, the position of every node keeps changing from time to time. Hence, during data transmission, several nodes enter and leave the network. As a result, MANETs are vulnerable to several attacks in which the attackers get access to the network through malicious nodes entering the network in disguise of valid nodes. So, in MANETs, it is necessary to verify the nodes before using them to forward data packets/messages. In this paper, position verification technique for secure geographical routing has been proposed in MANET. In this technique, we estimate the position of the nodes before using them as forwarding nodes. Once the location is estimated, then it is verified for authenticity and then used for transmitting data packets.
{"title":"Position verification technique for secure geographical routing in MANET","authors":"S. L Aruna Rao, K. V. N. Sunitha","doi":"10.1109/WOCN.2016.7759889","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759889","url":null,"abstract":"MANET is a dynamic network which is used extensively today due to its diverse applications in several fields like military battlefield, disaster relief operations, etc. Since MANET has a mobile topology, the position of every node keeps changing from time to time. Hence, during data transmission, several nodes enter and leave the network. As a result, MANETs are vulnerable to several attacks in which the attackers get access to the network through malicious nodes entering the network in disguise of valid nodes. So, in MANETs, it is necessary to verify the nodes before using them to forward data packets/messages. In this paper, position verification technique for secure geographical routing has been proposed in MANET. In this technique, we estimate the position of the nodes before using them as forwarding nodes. Once the location is estimated, then it is verified for authenticity and then used for transmitting data packets.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114295525","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759896
Sonam Mahajan, Nidhi Dahiya, Devesh Kumar
Every author seeks to optimize the QOS in MANET network through routing. Essentially, Qos optimization is used to enhance the life time so that less energy can be consumed, additional packets should be distributed with less Bit Error Ratio and less routing overhead. In this research, the performance analysis of DSR routing protocol is evaluated. Firstly the optimization technique i.e. Bacterial Foraging optimization is applied individually on DSR routing protocol and then compare the performance analysis of DSR routing protocol through BFO approach and without BFO approach that performs better to increase the lifetime of the MANET network so that packets will be transferred in an efficient manner and with less error rate so that the chance of node failure will be less and prolong the lifetime of the network for the realization of routing optimization.
{"title":"A mechanism of preventing sybil attack in MANET using bacterial foraging optimization","authors":"Sonam Mahajan, Nidhi Dahiya, Devesh Kumar","doi":"10.1109/WOCN.2016.7759896","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759896","url":null,"abstract":"Every author seeks to optimize the QOS in MANET network through routing. Essentially, Qos optimization is used to enhance the life time so that less energy can be consumed, additional packets should be distributed with less Bit Error Ratio and less routing overhead. In this research, the performance analysis of DSR routing protocol is evaluated. Firstly the optimization technique i.e. Bacterial Foraging optimization is applied individually on DSR routing protocol and then compare the performance analysis of DSR routing protocol through BFO approach and without BFO approach that performs better to increase the lifetime of the MANET network so that packets will be transferred in an efficient manner and with less error rate so that the chance of node failure will be less and prolong the lifetime of the network for the realization of routing optimization.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130577711","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 : 2016-07-01DOI: 10.1109/WOCN.2016.7759887
G. Rajesh, Praveenraj Pattar, M. N. Divya, Vara Prasad
One of the conventional ways of dispersing information in a university or corporate office is through the Notice Board. Notice boards are an ideal platform that allows one to put up information so that it can be seen by everyone. Whenever there is a new circular to be dispersed among the students or employees, it will be immediately put up on the notice board where everyone has to manually gather at the board and look into the notice. In the busy and fast moving world today, this will lead to wastage of time. Instead, this paper provides a solution to the above problem using NFC application. The idea that has been proposed in this paper is to display the notice board through NFC tags. Each NFC tag is programmed to contain the notice information to display. Whenever it is required for a circular to be displayed just program (Update the Notice) the NFC tag. The students, employees etc., can scan the NFC tag through their NFC enabled smart phones which downloads the notice in the document format online into their handheld devices. This solution is user-friendly as the end-user can read the notices at their own convenient time in turn leads no wastage of time.
{"title":"Near field application: NFC smart notice board","authors":"G. Rajesh, Praveenraj Pattar, M. N. Divya, Vara Prasad","doi":"10.1109/WOCN.2016.7759887","DOIUrl":"https://doi.org/10.1109/WOCN.2016.7759887","url":null,"abstract":"One of the conventional ways of dispersing information in a university or corporate office is through the Notice Board. Notice boards are an ideal platform that allows one to put up information so that it can be seen by everyone. Whenever there is a new circular to be dispersed among the students or employees, it will be immediately put up on the notice board where everyone has to manually gather at the board and look into the notice. In the busy and fast moving world today, this will lead to wastage of time. Instead, this paper provides a solution to the above problem using NFC application. The idea that has been proposed in this paper is to display the notice board through NFC tags. Each NFC tag is programmed to contain the notice information to display. Whenever it is required for a circular to be displayed just program (Update the Notice) the NFC tag. The students, employees etc., can scan the NFC tag through their NFC enabled smart phones which downloads the notice in the document format online into their handheld devices. This solution is user-friendly as the end-user can read the notices at their own convenient time in turn leads no wastage of time.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115220635","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
扫码关注我们
求助内容：
应助结果提醒方式：