This paper addresses the existing research and adds another aspect of functionality by incorporating pertinent sensor nodes to provide a dynamic location discovery and estimation. The software used provides an easy graphical user interface to visualize a particular location in accordance with geographical latitude and longitude. A simple real time location estimation technique is worked out for wireless sensor networks based on manual deployment of sensors. The proposed scheme finds more efficient solutions with less quantity of sensors as compared to existing deployment schemes. The set up is evaluated exclusively in real environments using IRIS sensor nodes supported by a global positioning system module to provide visualization of an outdoor location. The results are offered by Google Earth application.
{"title":"A Practical Solution for Location Estimation in Manually Deployed Wireless Sensor Networks","authors":"O. P. Sahu, Tarun Dubey","doi":"10.4236/wsn.2011.34013","DOIUrl":"https://doi.org/10.4236/wsn.2011.34013","url":null,"abstract":"This paper addresses the existing research and adds another aspect of functionality by incorporating pertinent sensor nodes to provide a dynamic location discovery and estimation. The software used provides an easy graphical user interface to visualize a particular location in accordance with geographical latitude and longitude. A simple real time location estimation technique is worked out for wireless sensor networks based on manual deployment of sensors. The proposed scheme finds more efficient solutions with less quantity of sensors as compared to existing deployment schemes. The set up is evaluated exclusively in real environments using IRIS sensor nodes supported by a global positioning system module to provide visualization of an outdoor location. The results are offered by Google Earth application.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117196416","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}
A. Zouinkhi, E. Bajic, É. Rondeau, M. B. Gayed, M. Abdelkrim
WSNs are designed to efficiently collect data and monitor environments, among other applications. This article describes the concept and realization of an Active Security System for security management of warehousing of chemical substances using WSNs. We present an approach to modeling and simulating cooperation between intelligent products that are equipped with a platform of sensor networks and ambient communication capabilities to increase their security, in a context of ambient intelligence of a deposit for chemical substances. Behavior evolution of every intelligent product is modeled by hierarchical Petri Nets. The simulation of the model is implemented in the Castalia-OMNET++ Tools language.
{"title":"Ambient Intelligence: Awareness Context Application in Industrial Storage","authors":"A. Zouinkhi, E. Bajic, É. Rondeau, M. B. Gayed, M. Abdelkrim","doi":"10.4236/wsn.2011.34016","DOIUrl":"https://doi.org/10.4236/wsn.2011.34016","url":null,"abstract":"WSNs are designed to efficiently collect data and monitor environments, among other applications. This article describes the concept and realization of an Active Security System for security management of warehousing of chemical substances using WSNs. We present an approach to modeling and simulating cooperation between intelligent products that are equipped with a platform of sensor networks and ambient communication capabilities to increase their security, in a context of ambient intelligence of a deposit for chemical substances. Behavior evolution of every intelligent product is modeled by hierarchical Petri Nets. The simulation of the model is implemented in the Castalia-OMNET++ Tools language.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820789","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}
Object tracking is one of the killer applications for wireless sensor networks (WSN) in which the network of wireless sensors is assigned the task of tracking a particular object. The network employs the object tracking techniques to continuously report the position of the object in terms of Cartesian coordinates to a sink node or to a central base station. A family tree of object tracking techniques has been prepared.In this paper we have summarized the object tracking techniques available so far in wireless sensor networks.
{"title":"Classification of Object Tracking Techniques in Wireless Sensor Networks","authors":"Mohsin Fayyaz","doi":"10.4236/wsn.2011.34014","DOIUrl":"https://doi.org/10.4236/wsn.2011.34014","url":null,"abstract":"Object tracking is one of the killer applications for wireless sensor networks (WSN) in which the network of wireless sensors is assigned the task of tracking a particular object. The network employs the object tracking techniques to continuously report the position of the object in terms of Cartesian coordinates to a sink node or to a central base station. A family tree of object tracking techniques has been prepared.In this paper we have summarized the object tracking techniques available so far in wireless sensor networks.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121342677","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}
The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth. It is not economic and feasible because, depending on the application, WSN nodes are high-volume in number (hence, limited resources at each node), deployment area may be hazardous, unattended and/or hostile and sometimes dangerous. As WSNs are characterized by severely constrained resources and requirement to operate in an ad-hoc manner, security functionality implementation to protect nodes from adversary forces and secure routing of message from source node to base station has become a challenging task. In this paper, we present a direct trust dependent link state routing using route trusts which protects WSNs against routing attacks by eliminating the un-trusted nodes before making routes and finding best trustworthy route among them. We compare our work with the most prevalent routing protocols and show its benefits over them.
{"title":"A Direct Trust dependent Link State Routing Protocol Using Route Trusts for WSNs (DTLSRP)","authors":"Shaik Sahil Babu, Arnab Raha, M. K. Naskar","doi":"10.4236/wsn.2011.34015","DOIUrl":"https://doi.org/10.4236/wsn.2011.34015","url":null,"abstract":"The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth. It is not economic and feasible because, depending on the application, WSN nodes are high-volume in number (hence, limited resources at each node), deployment area may be hazardous, unattended and/or hostile and sometimes dangerous. As WSNs are characterized by severely constrained resources and requirement to operate in an ad-hoc manner, security functionality implementation to protect nodes from adversary forces and secure routing of message from source node to base station has become a challenging task. In this paper, we present a direct trust dependent link state routing using route trusts which protects WSNs against routing attacks by eliminating the un-trusted nodes before making routes and finding best trustworthy route among them. We compare our work with the most prevalent routing protocols and show its benefits over them.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129480341","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}
New wireless sensor network applications (e.g., military surveillance) require higher reliability than a simple best effort service could provide. Classical reliable transport protocols like Transmission Control Protocol (TCP) are not well suited for wireless sensor networks due to both the characteristics of the network nodes (low computing power, strong energy constraints) and those of the main applications running on those nodes (low data rates). Recent researches present new transport protocols for wireless sensor networks providing various type of reliability and using new mechanisms for loss detection and recovery, and congestion control. This paper presents a survey on reliable transport protocol for WSNs.
{"title":"Energy-Efficient and Reliable Transport Protocols for Wireless Sensor Networks: State-of-Art","authors":"Ahmed Ayadi","doi":"10.4236/wsn.2011.33011","DOIUrl":"https://doi.org/10.4236/wsn.2011.33011","url":null,"abstract":"New wireless sensor network applications (e.g., military surveillance) require higher reliability than a simple best effort service could provide. Classical reliable transport protocols like Transmission Control Protocol (TCP) are not well suited for wireless sensor networks due to both the characteristics of the network nodes (low computing power, strong energy constraints) and those of the main applications running on those nodes (low data rates). Recent researches present new transport protocols for wireless sensor networks providing various type of reliability and using new mechanisms for loss detection and recovery, and congestion control. This paper presents a survey on reliable transport protocol for WSNs.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438354","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}
A serious threat to cognitive radio networks that sense the spectrum in a cooperative manner is the transmission of false spectrum sensing data by malicious sensor nodes. SNR fluctuations due to wireless channel effects complicate handling such attackers even further. This enforces the system to acquire authentication. Actually, the decision maker needs to determine the reliability or trustworthiness of the shared data. In this paper, the evaluation process is considered as an estimation dilemma on a set of evidences obtained through sensor nodes that are coordinated in an underlying wireless sensor network. Then, a likelihood-based computational trust evaluation algorithm is proposed to determine the trustworthiness of each sensor node's data. The proposed procedure just uses the information which is obtained from the sensor nodes without any presumptions about node’s reliability. Numerical results confirm the effectiveness of the algorithm in eliminating malicious nodes or faulty nodes which are not necessarily conscious attackers.
{"title":"A Fault-Tolerant Cooperative Spectrum Sensing Algorithm over Cognitive Radio Network Based on Wireless Sensor Network","authors":"M. Akbari, A. Falahati","doi":"10.4236/wsn.2011.33009","DOIUrl":"https://doi.org/10.4236/wsn.2011.33009","url":null,"abstract":"A serious threat to cognitive radio networks that sense the spectrum in a cooperative manner is the transmission of false spectrum sensing data by malicious sensor nodes. SNR fluctuations due to wireless channel effects complicate handling such attackers even further. This enforces the system to acquire authentication. Actually, the decision maker needs to determine the reliability or trustworthiness of the shared data. In this paper, the evaluation process is considered as an estimation dilemma on a set of evidences obtained through sensor nodes that are coordinated in an underlying wireless sensor network. Then, a likelihood-based computational trust evaluation algorithm is proposed to determine the trustworthiness of each sensor node's data. The proposed procedure just uses the information which is obtained from the sensor nodes without any presumptions about node’s reliability. Numerical results confirm the effectiveness of the algorithm in eliminating malicious nodes or faulty nodes which are not necessarily conscious attackers.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130875350","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}
This paper is a supplementary document for “Link Dynamics and Protocol Design in a Multi-Hop Mobile Environment” (ref. [1]), which presents an analytic model to obtain link lifetime in mobile wireless networks. The model outcome is used as groundwork for several mobility-related evaluations. Here, it is discussed how an improper assumption in the probabilistic model led to some errors in the resultant expressions. After a detailed description of the erratic assumption, a modification is proposed to correct the derivations. The results of the new model are verified by the simulation results provided at the original paper.
{"title":"A Comment on Link Dynamics and Protocol Design in a Multi-Hop Mobile Environment","authors":"A. Nayebi","doi":"10.4236/wsn.2011.33012","DOIUrl":"https://doi.org/10.4236/wsn.2011.33012","url":null,"abstract":"This paper is a supplementary document for “Link Dynamics and Protocol Design in a Multi-Hop Mobile Environment” (ref. [1]), which presents an analytic model to obtain link lifetime in mobile wireless networks. The model outcome is used as groundwork for several mobility-related evaluations. Here, it is discussed how an improper assumption in the probabilistic model led to some errors in the resultant expressions. After a detailed description of the erratic assumption, a modification is proposed to correct the derivations. The results of the new model are verified by the simulation results provided at the original paper.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763537","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}
Group mobility is prevalent in many mobile ad hoc network (MANET) applications, such as disaster recovery, military operations, searching and rescue activities. Group partition, as an inherent phenomenon in group mobility, may occur when mobile nodes move in diverse mobility patterns and it causes the network to be partitioned into disconnected components. It may result in severe link disconnections, which interrupts network communications. To address this concern, we proposed a novel group mobility model in this paper, namely the Reference Region Group Mobility model, which can be used to mimic group operations in MANETs, i.e. group partitions and mergers. Based on this model, a comprehensive study on the impact of group partitions to the performance of network routing protocols are carried out by evaluating two well-known routing protocols, namely the Ad Hoc On-demand Distance Vector Routing protocol (AODV) and the Dynamic Source Routing protocol (DSR). The simulation results reflect that group partitions have a significant impact to the performance of network routing protocols.
{"title":"Performance Evaluation of Routing Protocols on the Reference Region Group Mobility Model for MANET","authors":"Yan Zhang, C. Low, J. M. Ng","doi":"10.4236/wsn.2011.33010","DOIUrl":"https://doi.org/10.4236/wsn.2011.33010","url":null,"abstract":"Group mobility is prevalent in many mobile ad hoc network (MANET) applications, such as disaster recovery, military operations, searching and rescue activities. Group partition, as an inherent phenomenon in group mobility, may occur when mobile nodes move in diverse mobility patterns and it causes the network to be partitioned into disconnected components. It may result in severe link disconnections, which interrupts network communications. To address this concern, we proposed a novel group mobility model in this paper, namely the Reference Region Group Mobility model, which can be used to mimic group operations in MANETs, i.e. group partitions and mergers. Based on this model, a comprehensive study on the impact of group partitions to the performance of network routing protocols are carried out by evaluating two well-known routing protocols, namely the Ad Hoc On-demand Distance Vector Routing protocol (AODV) and the Dynamic Source Routing protocol (DSR). The simulation results reflect that group partitions have a significant impact to the performance of network routing protocols.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117243666","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}
N. Chauhan, L. Awasthi, N. Chand, V. Katiyar, Ankit Chugh
Mobile ad-hoc networks (MANETs) are a form of wireless networks which do not require a base station for providing network connectivity. Many MANETs’ characteristics that distinguish MANETs from other wireless networks also make routing a challenging task. Cluster based routing is a MANET routing schemes in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which is responsible for routing among clusters. In this paper we propose and implement a distributed weighted clustering algorithm for MANETs. This approach is based on combined weight metric that takes into account several system parameters like the node degree, transmission range, energy and mobility of the nodes. We have evaluated the performance of the proposed scheme through simulation in various network situations. Simulation results show that improved distributed weighted clustering algorithm (DWCAIMP) outperforms the original distributed weighted clustering algorithm (DWCA).
{"title":"A Distributed Weighted Cluster Based Routing Protocol for MANETs","authors":"N. Chauhan, L. Awasthi, N. Chand, V. Katiyar, Ankit Chugh","doi":"10.4236/wsn.2011.32006","DOIUrl":"https://doi.org/10.4236/wsn.2011.32006","url":null,"abstract":"Mobile ad-hoc networks (MANETs) are a form of wireless networks which do not require a base station for providing network connectivity. Many MANETs’ characteristics that distinguish MANETs from other wireless networks also make routing a challenging task. Cluster based routing is a MANET routing schemes in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which is responsible for routing among clusters. In this paper we propose and implement a distributed weighted clustering algorithm for MANETs. This approach is based on combined weight metric that takes into account several system parameters like the node degree, transmission range, energy and mobility of the nodes. We have evaluated the performance of the proposed scheme through simulation in various network situations. Simulation results show that improved distributed weighted clustering algorithm (DWCAIMP) outperforms the original distributed weighted clustering algorithm (DWCA).","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131127257","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}
Target tracking is a well studied topic in wireless sensor networks. It is a procedure that nodes in the network collaborate in detecting targets and transmitting their information to the base-station continuously, which leads to data implosion and redundancy. To reduce traffic load of the network, a data compressing based target tracking protocol is proposed in this work. It first incorporates a clustering based data gather method to group sensor nodes into clusters. Then a novel threshold technique with bounded error is proposed to exploit the spatial correlation of sensed data and compress the data in the same cluster. Finally, the compact data presentations are transmitted to the base-station for targets localization. We evaluate our approach with a comprehensive set of simulations. It can be concluded that the proposed method yields excellent performance in energy savings and tracking quality.
{"title":"Compressing Information of Target Tracking in Wireless Sensor Networks","authors":"Jianzhong Li, Qianqian Ren","doi":"10.4236/wsn.2011.32008","DOIUrl":"https://doi.org/10.4236/wsn.2011.32008","url":null,"abstract":"Target tracking is a well studied topic in wireless sensor networks. It is a procedure that nodes in the network collaborate in detecting targets and transmitting their information to the base-station continuously, which leads to data implosion and redundancy. To reduce traffic load of the network, a data compressing based target tracking protocol is proposed in this work. It first incorporates a clustering based data gather method to group sensor nodes into clusters. Then a novel threshold technique with bounded error is proposed to exploit the spatial correlation of sensed data and compress the data in the same cluster. Finally, the compact data presentations are transmitted to the base-station for targets localization. We evaluate our approach with a comprehensive set of simulations. It can be concluded that the proposed method yields excellent performance in energy savings and tracking quality.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126048515","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
扫码关注我们
求助内容：
应助结果提醒方式：