Wireless sensor networks (WSNs) have been used to monitor, control and automate different applications on local scale. Early research therefore, focused on designing MAC, network and transport layer protocols dedicated to meet the specifications of these local WSN applications. However, the idea of integrating sensor networks with the Internet to make the local sensor data accessible on a global scale has gained popularity in recent years. Integrating IP (Internet Protocol) and WSNs pose many challenges due to the different characteristics of these heterogeneous networks. Two integration architectures, proxy-based and network-overlay based have emerged in parallel. This paper surveys the protocols implementing these two integration architectures, their limitations and the extent to which they achieve seamless interoperability of IP and wireless sensor networks. We classify the reviewed protocols at transport and network layers and compare them in terms of relevant performance matrices. Our study shows that there are many limitations in the existing techniques and protocols and the idea of achieving seamless integration is only in its initial stages
{"title":"A Comparative Analysis of Protocols for Integrating IP and Wireless Sensor Networks","authors":"H. Ali, S. Ghani","doi":"10.4304/jnw.11.01.1-10","DOIUrl":"https://doi.org/10.4304/jnw.11.01.1-10","url":null,"abstract":"Wireless sensor networks (WSNs) have been used to monitor, control and automate different applications on local scale. Early research therefore, focused on designing MAC, network and transport layer protocols dedicated to meet the specifications of these local WSN applications. However, the idea of integrating sensor networks with the Internet to make the local sensor data accessible on a global scale has gained popularity in recent years. Integrating IP (Internet Protocol) and WSNs pose many challenges due to the different characteristics of these heterogeneous networks. Two integration architectures, proxy-based and network-overlay based have emerged in parallel. This paper surveys the protocols implementing these two integration architectures, their limitations and the extent to which they achieve seamless interoperability of IP and wireless sensor networks. We classify the reviewed protocols at transport and network layers and compare them in terms of relevant performance matrices. Our study shows that there are many limitations in the existing techniques and protocols and the idea of achieving seamless integration is only in its initial stages","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"5 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81940784","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}
Z. Jadidi, V. Muthukkumarasamy, E. Sithirasenan, Kalvinder Singh
Modern Internet has enabled wider usage, resulting in increased network traffic. Due to the high volume of data packets in networking, sampling techniques are widely used in flow-based network management software to manage traffic load. However, sampling processes reduce the likelihood of anomaly detection. Many studies have been carried out at improving the accuracy of anomaly detection. However, only a few studies have considered it with sampled flow traffic. In our study, we investigate the use of an artificial neural network (ANN)-based classifier to improve the accuracy of flow-based anomaly detection in sampled traffic. A feedback from the ANN-based anomaly detector determines the type of the flow sampling method that should be used. Our proposed technique handles malicious flows and benign flows with different sampling methods. To evaluate the proposed sampling technique, a number of flow-based datasets are generated. Our experiments confirm that the proposed technique improves the percentage of the sampled malicious flows by about 7% and it can preserve the majority of traffic information
{"title":"Intelligent Sampling Using an Optimized Neural Network","authors":"Z. Jadidi, V. Muthukkumarasamy, E. Sithirasenan, Kalvinder Singh","doi":"10.4304/jnw.11.01.16-27","DOIUrl":"https://doi.org/10.4304/jnw.11.01.16-27","url":null,"abstract":"Modern Internet has enabled wider usage, resulting in increased network traffic. Due to the high volume of data packets in networking, sampling techniques are widely used in flow-based network management software to manage traffic load. However, sampling processes reduce the likelihood of anomaly detection. Many studies have been carried out at improving the accuracy of anomaly detection. However, only a few studies have considered it with sampled flow traffic. In our study, we investigate the use of an artificial neural network (ANN)-based classifier to improve the accuracy of flow-based anomaly detection in sampled traffic. A feedback from the ANN-based anomaly detector determines the type of the flow sampling method that should be used. Our proposed technique handles malicious flows and benign flows with different sampling methods. To evaluate the proposed sampling technique, a number of flow-based datasets are generated. Our experiments confirm that the proposed technique improves the percentage of the sampled malicious flows by about 7% and it can preserve the majority of traffic information","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"81 1","pages":"16-27"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83880269","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-01-28DOI: 10.4304/jnw.10.11.587-596
Saja Al-Mamoori, A. Jaekel, S. Bandyopadhyay, Sriharsha Varanasi
The high data transfer capacities of current wavelength division multiplexing optical networks put large amounts of data at risk of getting corrupted in the presence of faults and attacks. A wide range of techniques for handling component failures in transparent optical networks are already available in the literature. In recent years, there is growing recognition of the need to develop suitable mechanisms for reducing the adverse effects of malicious attacks such as high-power jamming and tapping attacks. A number of recent papers have proposed static lightpath allocation approaches that take such security issues into consideration. However, most of these approaches consider the routing problem separately from the wavelength assignment problem. In this paper we propose a new security-aware scheme for the complete dynamic routing and wavelength assignment (RWA) problem. Unlike previous approaches, we consider both in-band and out-of-band attacks under dynamic traffic scenario and present an integer linear program (ILP) formulation with two possible objectives for solving the security-aware dynamic RWA problem. For larger networks we present an efficient heuristic algorithm SA-DRWA (Security-Aware Dynamic Routing and Wavelength Assignment) that aims to minimize both in-band and out-of-band attacks. To the best of our knowledge, this is the first such formulation to jointly consider in-band and out-of-band attacks, for dynamic traffic
{"title":"Security-Aware Dynamic RWA for Reducing In-band and Out-of-band Jamming Attacks in WDM Optical Networks","authors":"Saja Al-Mamoori, A. Jaekel, S. Bandyopadhyay, Sriharsha Varanasi","doi":"10.4304/jnw.10.11.587-596","DOIUrl":"https://doi.org/10.4304/jnw.10.11.587-596","url":null,"abstract":"The high data transfer capacities of current wavelength division multiplexing optical networks put large amounts of data at risk of getting corrupted in the presence of faults and attacks. A wide range of techniques for handling component failures in transparent optical networks are already available in the literature. In recent years, there is growing recognition of the need to develop suitable mechanisms for reducing the adverse effects of malicious attacks such as high-power jamming and tapping attacks. A number of recent papers have proposed static lightpath allocation approaches that take such security issues into consideration. However, most of these approaches consider the routing problem separately from the wavelength assignment problem. In this paper we propose a new security-aware scheme for the complete dynamic routing and wavelength assignment (RWA) problem. Unlike previous approaches, we consider both in-band and out-of-band attacks under dynamic traffic scenario and present an integer linear program (ILP) formulation with two possible objectives for solving the security-aware dynamic RWA problem. For larger networks we present an efficient heuristic algorithm SA-DRWA (Security-Aware Dynamic Routing and Wavelength Assignment) that aims to minimize both in-band and out-of-band attacks. To the best of our knowledge, this is the first such formulation to jointly consider in-band and out-of-band attacks, for dynamic traffic","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"73 1","pages":"587-596"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78690783","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-01-28DOI: 10.4304/jnw.10.11.616-624
Kamanashis Biswas, V. Muthukkumarasamy, Xin-Wen Wu, Kalvinder Singh
Wireless Home Automation Networks consist of battery powered sensors and actuators that communicate with each other over wireless channels. The sensor nodes collect environmental information such as temperature, light intensity, humidity, and pressure to provide context-aware services and to facilitate smart home control. However, resource limitations, unpredictable topology changes, and interference introduce a number of challenges to the design of home automation protocols. One of the challenging tasks is developing energy efficient routing protocols to prolong the network lifetime. This paper proposes an interference aware heuristic routing protocol which determines the forwarding path between sensors and the base station using a heuristic function and a heuristic search algorithm. On the basis of local and global distance, longevity factor (LF), and link quality (LQ), the heuristic function generates a heuristic value for each node and this value is used in A_ search algorithm to determine the efficient route. Simulation results show that the proposed routing scheme outperforms GAHR and AODVjr protocols in terms of network lifetime, energy consumption, and message throughput. Furthermore, it achieves up to 15% increase in packet delivery ratio over GAHR protocol in a noisy environment
{"title":"An Interference Aware Heuristic Routing Protocol for Wireless Home Automation Networks","authors":"Kamanashis Biswas, V. Muthukkumarasamy, Xin-Wen Wu, Kalvinder Singh","doi":"10.4304/jnw.10.11.616-624","DOIUrl":"https://doi.org/10.4304/jnw.10.11.616-624","url":null,"abstract":"Wireless Home Automation Networks consist of battery powered sensors and actuators that communicate with each other over wireless channels. The sensor nodes collect environmental information such as temperature, light intensity, humidity, and pressure to provide context-aware services and to facilitate smart home control. However, resource limitations, unpredictable topology changes, and interference introduce a number of challenges to the design of home automation protocols. One of the challenging tasks is developing energy efficient routing protocols to prolong the network lifetime. This paper proposes an interference aware heuristic routing protocol which determines the forwarding path between sensors and the base station using a heuristic function and a heuristic search algorithm. On the basis of local and global distance, longevity factor (LF), and link quality (LQ), the heuristic function generates a heuristic value for each node and this value is used in A_ search algorithm to determine the efficient route. Simulation results show that the proposed routing scheme outperforms GAHR and AODVjr protocols in terms of network lifetime, energy consumption, and message throughput. Furthermore, it achieves up to 15% increase in packet delivery ratio over GAHR protocol in a noisy environment","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"187 1","pages":"616-624"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75403416","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-01-28DOI: 10.4304/jnw.10.11.606-615
T. Alhmiedat
Air pollution is considered as crucial for people’s comfort, health, and safety. Monitoring the air pollution is crucial in both environments (indoors and outdoors), and can be accomplished using a small number of inexpensive sensing unities, distributed over an area of interest to measure the level of various critical gases including CO , H 2 S , and NO 2 . The deployment of Wireless Sensor Network offers an alternative solution through scattering a large number of disposable sensor nodes over an area of interest. Scientists may directly retrieve the sensed data from sensor field through a web server application. This paper provides a comprehensive review on the available solutions that support the wireless sensor network environmental monitoring. The existing systems are intensively studied and categorized into: indoor, outdoor, and greenhouse environmental monitoring systems
{"title":"A Survey on Environmental Monitoring Systems using Wireless Sensor Networks","authors":"T. Alhmiedat","doi":"10.4304/jnw.10.11.606-615","DOIUrl":"https://doi.org/10.4304/jnw.10.11.606-615","url":null,"abstract":"Air pollution is considered as crucial for people’s comfort, health, and safety. Monitoring the air pollution is crucial in both environments (indoors and outdoors), and can be accomplished using a small number of inexpensive sensing unities, distributed over an area of interest to measure the level of various critical gases including CO , H 2 S , and NO 2 . The deployment of Wireless Sensor Network offers an alternative solution through scattering a large number of disposable sensor nodes over an area of interest. Scientists may directly retrieve the sensed data from sensor field through a web server application. This paper provides a comprehensive review on the available solutions that support the wireless sensor network environmental monitoring. The existing systems are intensively studied and categorized into: indoor, outdoor, and greenhouse environmental monitoring systems","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"51 1","pages":"606-615"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85105522","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-01-28DOI: 10.4304/jnw.10.12.668-674
C. Troussas, M. Virvou, K. Espinosa
Social networks are addressed to a very large and heterogeneous audience of people. When trying to incorporate an intelligent language learning system in social networks, a problem of user diversity emerges and thus, user clustering based on their characteristics is necessary. In view of this compelling need, this paper concerns the pattern discovery of user clusters in social networks. In this research, we have modeled the Facebook user characteristics that determine the clustering process. An unsupervised clustering algorithm was used so that coherent groups of users with the same learning styles and capabilities are generated. This algorithm clusters users by taking as input their several fundamental characteristics, such as their age, educational level, number of languages spoken and computer knowledge level. The general objective of this data mining process is to extract important information and to gain knowledge from the user data set and transform it into a manageable and intelligible structure with a view to ameliorating the learning process. These experimental results show that the Facebook user characteristics, which were chosen at the clustering process, seem to be significant determinants for the clusters and the whole learning experience of each user.
{"title":"Using Visualization Algorithms for Discovering Patterns in Groups of Users for Tutoring Multiple Languages through Social Networking","authors":"C. Troussas, M. Virvou, K. Espinosa","doi":"10.4304/jnw.10.12.668-674","DOIUrl":"https://doi.org/10.4304/jnw.10.12.668-674","url":null,"abstract":"Social networks are addressed to a very large and heterogeneous audience of people. When trying to incorporate an intelligent language learning system in social networks, a problem of user diversity emerges and thus, user clustering based on their characteristics is necessary. In view of this compelling need, this paper concerns the pattern discovery of user clusters in social networks. In this research, we have modeled the Facebook user characteristics that determine the clustering process. An unsupervised clustering algorithm was used so that coherent groups of users with the same learning styles and capabilities are generated. This algorithm clusters users by taking as input their several fundamental characteristics, such as their age, educational level, number of languages spoken and computer knowledge level. The general objective of this data mining process is to extract important information and to gain knowledge from the user data set and transform it into a manageable and intelligible structure with a view to ameliorating the learning process. These experimental results show that the Facebook user characteristics, which were chosen at the clustering process, seem to be significant determinants for the clusters and the whole learning experience of each user.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"53 1","pages":"668-674"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74417516","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 : 2015-09-22DOI: 10.4304/jnw.10.8.477-485
Raniyah Wazirali, Z. Chaczko
Recently, image steganography has received a lot of attention as it enables for secure multimedia communication. Payload capacity and stego image imperceptibility are a critical factors of any steganographic technique. In order to receive maximum embedding capacity with a minimum degradation of stego images, secret data should be embedded carefully in a specific regions. In this paper, data hiding is considered as an optimization problem related to achieving optimum embedding level of the cover image. Embedding data in edge area provide high imperceptibility. However, the embedding capacity of edge region is very limited. The work attempt to improve the edge based steganography by incorporates edge detection and vision science research. Genetic Algorithm that uses human visual system characteristics approach for data hiding is presented. Primarily, the approach applies Differences of Gaussian detector which closely resembles the human visual behavior. Secondly, the edge profusion indicates the level of threshold visibility with the help of Genetic Algorithm training. The suggested solution uses Contrast Sensitivity Function (CSF) which produces the edges based on the size of the embedding information. The authors of this paper compared their technique with other classical and recent works. The quality of the steganography is measured based on various quality metrics such as PSNR, wPSNR, SSIM and UIQI. These metrics declare the stability between imperceptibility and large embedding capacity.
{"title":"Data Hiding Based on Intelligent Optimized Edges for Secure Multimedia Communication","authors":"Raniyah Wazirali, Z. Chaczko","doi":"10.4304/jnw.10.8.477-485","DOIUrl":"https://doi.org/10.4304/jnw.10.8.477-485","url":null,"abstract":"Recently, image steganography has received a lot of attention as it enables for secure multimedia communication. Payload capacity and stego image imperceptibility are a critical factors of any steganographic technique. In order to receive maximum embedding capacity with a minimum degradation of stego images, secret data should be embedded carefully in a specific regions. In this paper, data hiding is considered as an optimization problem related to achieving optimum embedding level of the cover image. Embedding data in edge area provide high imperceptibility. However, the embedding capacity of edge region is very limited. The work attempt to improve the edge based steganography by incorporates edge detection and vision science research. Genetic Algorithm that uses human visual system characteristics approach for data hiding is presented. Primarily, the approach applies Differences of Gaussian detector which closely resembles the human visual behavior. Secondly, the edge profusion indicates the level of threshold visibility with the help of Genetic Algorithm training. The suggested solution uses Contrast Sensitivity Function (CSF) which produces the edges based on the size of the embedding information. The authors of this paper compared their technique with other classical and recent works. The quality of the steganography is measured based on various quality metrics such as PSNR, wPSNR, SSIM and UIQI. These metrics declare the stability between imperceptibility and large embedding capacity.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"46 1","pages":"477-485"},"PeriodicalIF":0.0,"publicationDate":"2015-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79958924","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 : 2015-09-22DOI: 10.4304/jnw.10.8.448-461
K. Oida
Currently popular HTTP-based video delivery services generate highly variable video traffic over small time scales. This paper confirms that with sufficient transmission bandwidth available to the video traffic, small time scale variations can be reduced to a level approaching the Poisson arrivals without experiencing degradation in the video quality. The primary result in this paper is that upon establishment of a low variability state, this state shows stable behavior. The state remains intact even under a high network load, a high packet loss rate, or a long propagation delay. Furthermore, the state traverses wired/wireless LANs and the Internet. This attractive feature can facilitate the development of more basic and efficient traffic control schemes. The feasibility of this approach to reducing video traffic variability is discussed from the viewpoint of the perceived video quality
{"title":"Propagation of Low Variability in Video Traffic","authors":"K. Oida","doi":"10.4304/jnw.10.8.448-461","DOIUrl":"https://doi.org/10.4304/jnw.10.8.448-461","url":null,"abstract":"Currently popular HTTP-based video delivery services generate highly variable video traffic over small time scales. This paper confirms that with sufficient transmission bandwidth available to the video traffic, small time scale variations can be reduced to a level approaching the Poisson arrivals without experiencing degradation in the video quality. The primary result in this paper is that upon establishment of a low variability state, this state shows stable behavior. The state remains intact even under a high network load, a high packet loss rate, or a long propagation delay. Furthermore, the state traverses wired/wireless LANs and the Internet. This attractive feature can facilitate the development of more basic and efficient traffic control schemes. The feasibility of this approach to reducing video traffic variability is discussed from the viewpoint of the perceived video quality","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"25 1","pages":"448-461"},"PeriodicalIF":0.0,"publicationDate":"2015-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86952245","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 : 2015-09-22DOI: 10.4304/jnw.10.8.443-447
Shiwei Chen, Chenhui Jin
How to construct the parity-check equations is an open problem in the topic of fast correlation attack. In this paper, we present an improved method to construct the parity-check equations used in the fast correlation attacks. By utilizing the idea of multi-layer match-and-sort combined with the exhaustive searching, we construct the parity-check equations to be used in the decoding, which is not relevant to the number of the LFSR’s feedback taps. Finally, we analyze the time complexity and memory complexity of our method, which are about and respectively (where is the weight of the parity-checks), and the memory complexity is the square root of the Chose et al.’s
{"title":"An Improved Way to Construct the Parity-check Equations in Fast Correlation Attacks","authors":"Shiwei Chen, Chenhui Jin","doi":"10.4304/jnw.10.8.443-447","DOIUrl":"https://doi.org/10.4304/jnw.10.8.443-447","url":null,"abstract":"How to construct the parity-check equations is an open problem in the topic of fast correlation attack. In this paper, we present an improved method to construct the parity-check equations used in the fast correlation attacks. By utilizing the idea of multi-layer match-and-sort combined with the exhaustive searching, we construct the parity-check equations to be used in the decoding, which is not relevant to the number of the LFSR’s feedback taps. Finally, we analyze the time complexity and memory complexity of our method, which are about and respectively (where is the weight of the parity-checks), and the memory complexity is the square root of the Chose et al.’s","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"443-447"},"PeriodicalIF":0.0,"publicationDate":"2015-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83880684","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 : 2015-09-22DOI: 10.4304/jnw.10.8.462-469
Anisur Rahman, V. Muthukkumarasamy, Xin-Wen Wu
This paper investigates the problem of localizing submerged sensors and provides a new mechanism to determine the coordinates and bearing of those sensors using only one beacon node. In underwater wireless sensor networks (UWSN), precise coordinates of the sensors that actuate or collect data is vital, as data without the knowledge of its actual origin has limited value. Mostly, the multilateration technique is used to determine the location of the sensors with respect to three or more known beacon nodes, besidesincorporated nonlinear distance equations are solved in conventional method whereby degree-of-freedom does not guarantee a unique solution. In this study, a new method of determining the coordinates of submerged sensors with a single mobile beacon has been devised which requires no preinstalled infrastructure or reference point. Moreover, Cayley-Menger determinant and linearized trilateration are used to determine the coordinates of the nodes where none of the nodes have a priori knowledge about its location. Simulation results validate the proposed mathematical model by computing coordinates of sensor nodes with bearing information generating negligible errors
{"title":"Coordinates and Bearing of Submerged Sensors Using a Single Mobile Beacon (CSMB)","authors":"Anisur Rahman, V. Muthukkumarasamy, Xin-Wen Wu","doi":"10.4304/jnw.10.8.462-469","DOIUrl":"https://doi.org/10.4304/jnw.10.8.462-469","url":null,"abstract":"This paper investigates the problem of localizing submerged sensors and provides a new mechanism to determine the coordinates and bearing of those sensors using only one beacon node. In underwater wireless sensor networks (UWSN), precise coordinates of the sensors that actuate or collect data is vital, as data without the knowledge of its actual origin has limited value. Mostly, the multilateration technique is used to determine the location of the sensors with respect to three or more known beacon nodes, besidesincorporated nonlinear distance equations are solved in conventional method whereby degree-of-freedom does not guarantee a unique solution. In this study, a new method of determining the coordinates of submerged sensors with a single mobile beacon has been devised which requires no preinstalled infrastructure or reference point. Moreover, Cayley-Menger determinant and linearized trilateration are used to determine the coordinates of the nodes where none of the nodes have a priori knowledge about its location. Simulation results validate the proposed mathematical model by computing coordinates of sensor nodes with bearing information generating negligible errors","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"6 1","pages":"462-469"},"PeriodicalIF":0.0,"publicationDate":"2015-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80368636","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
扫码关注我们
求助内容：
应助结果提醒方式：