{"title":"An Energy Efficient Data Gathering in Dense Mobile Wireless Sensor Networks","authors":"R. Velmani, B. Kaarthick","doi":"10.1155/2014/518268","DOIUrl":"https://doi.org/10.1155/2014/518268","url":null,"abstract":"Amidst of the growing impact of wireless sensor networks (WSNs) on real world applications, numerous schemes have been proposed for collecting data on multipath routing, tree, clustering, and cluster tree. Effectiveness of WSNs only depends on the data collection schemes. Existing methods cannot provide a guaranteed reliable network about mobility, traffic, and end-to-end connection, respectively. To mitigate such kind of problems, a simple and effective scheme is proposed, which is named as cluster independent data collection tree (CIDT). After the cluster head election and cluster formation, CIDT constructs a data collection tree (DCT) based on the cluster head location. In DCT, data collection node (DCN) does not participate in sensing, which is simply collecting the data packet from the cluster head and delivering it into sink. CIDT minimizes the energy exploitation, end-to-end delay and traffic of cluster head due to transfer of data with DCT. CIDT provides less complexity involved in creating a tree structure, which maintains the energy consumption of cluster head that helps to reduce the frequent cluster formation and maintain a cluster for considerable amount of time. The simulation results show that CIDT provides better QoS in terms of energy consumption, throughput, end-to-end delay, and network lifetime for mobility-based WSNs.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121793944","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}
{"title":"Capacity of Data Collection in Wireless Sensor Networks Based on Mutual Information and MMSE Estimation","authors":"A. S. Arifin, T. Ohtsuki","doi":"10.1155/2014/389451","DOIUrl":"https://doi.org/10.1155/2014/389451","url":null,"abstract":"We investigate the properties of data collection in wireless sensor networks, in terms of both capacity and power allocation strategy. We consider a scenario in which a number of sensors observe a target being estimated at fusion center (FC) using minimum mean-square error (MMSE) estimator. Based on the relationship between mutual information and MMSE (I-MMSE), the capacity of data collection in coherent and orthogonal multiple access channel (MAC) models is derived. Considering power constraint, the capacity is derived under two scenarios: equal power allocation and optimal power allocation of both models. We provide the upper bound of capacity as a benchmark. In particular, we show that the capacity of data collection scales as Θ((1/2)log) when the number of sensors L grows to infinity. We show through simulation results that for both coherent and orthogonal MAC models, the capacity of the optimal power is larger than that of the equal power. We also show that the capacity of coherent MAC is larger than that of orthogonal MAC, particularly when the number of sensors L is large and the total power P is fixed.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132204562","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}
{"title":"Balancing Energy Consumption in Clustered Wireless Sensor Networks","authors":"T. Ducrocq, M. Hauspie, N. Mitton","doi":"10.1155/2013/314732","DOIUrl":"https://doi.org/10.1155/2013/314732","url":null,"abstract":"Clustering in wireless sensor networks is an efficient way to structure and organize the network. It aims at identifying a subset of nodes within the network and binding it to a leader (i.e., cluster head). The leader becomes in charge of specific additional tasks like gathering data from all nodes in its cluster and sending them using a longer range communication to a sink. As a consequence, a cluster head exhausts its battery more quickly than regular nodes. In this paper, we present four variants of BLAC, a novel battery level aware clustering family of schemes. BLAC considers the battery level combined with another metric to elect the cluster-head. The cluster-head role is taken alternately by each node to balance energy consumption. Due to the local nature of the algorithms, keeping the network stable is easier. BLAC aims at maximizing the time with all nodes alive to satisfy the application requirements. Simulation results show that BLAC improves the full network lifetime three times more than the traditional clustering schemes by balancing energy consumption over nodes and still deliveres high data ratio.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130882101","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}
E. Lattanzi, Matteo Dromedari, Valerio Freschi, A. Bogliolo
{"title":"A Sub-A Ultrasonic Wake-Up Trigger with Addressing Capability for Wireless Sensor Nodes","authors":"E. Lattanzi, Matteo Dromedari, Valerio Freschi, A. Bogliolo","doi":"10.1155/2013/720817","DOIUrl":"https://doi.org/10.1155/2013/720817","url":null,"abstract":"Wireless sensor nodes spend most of the time waiting either for sensed data or for packets to be routed to the sink. While on board, sensors can raise hardware interrupts to trigger the wake-up of the processor, incoming packets require the radio module to be turned on in order to be properly received and processed; thus, reducing the effectiveness of dynamic power management and exposing the node to unintended packets cause energy waste. The capability of triggering the wake-up of a node over the air would makes it possible to keep the entire network asleep and to wake up the nodes along a path to the sink whenever there is a packet to transmit. This paper presents an ultrasonic wake-up trigger for ultra-low-power wireless sensor nodes developed as a plug-in module for VirtualSense motes. The module supports a simple out-of-band addressing scheme to enable the selective wake-up of a target node. In addition, it makes it possible to exploit the propagation speed of ultrasonic signals to perform distance measurements. The paper outlines the design choices, reports the results of extensive measurements, and discusses the additional degrees of freedom introduced by ultrasonic triggering in the power-state diagram of VirtualSense.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128557063","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}
{"title":"Borel Cayley Graph-Based Topology Control for Consensus Protocol in Wireless Sensor Networks","authors":"Junghun Ryu, Jaewook Yu, E. Noel, K. Tang","doi":"10.1155/2013/805635","DOIUrl":"https://doi.org/10.1155/2013/805635","url":null,"abstract":"Borel Cayley graphs have been shown to be an efficient candidate topology in interconnection networks due to their small diameter, short path length, and low degree. In this paper, we propose topology control algorithms based on Borel Cayley graphs. In particular, we propose two methods to assign node IDs of Borel Cayley graphs as logical topologies in wireless sensor networks. The first one aims at minimizing communication distance between nodes, while the entire graph is imposed as a logical topology; while the second one aims at maximizing the number of edges of the graph to be used, while the network nodes are constrained with a finite radio transmission range. In the latter case, due to the finite transmission range, the resultant topology is an “incomplete” version of the original BCG. In both cases, we apply our algorithms in consensus protocol and compare its performance with that of the random node ID assignment and other existing topology control algorithms. Our simulation indicates that the proposed ID assignments have better performance when consensus protocols are used as a benchmark application.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129781896","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}
{"title":"MQoSR: A Multiobjective QoS Routing Protocol for Wireless Sensor Networks","authors":"Hind Alwan, A. Agarwal","doi":"10.1155/2013/495803","DOIUrl":"https://doi.org/10.1155/2013/495803","url":null,"abstract":"With the growing demand for quality-of-service (QoS) aware routing protocol in wireless networks, QoS-based routing has emerged as an interesting research topic. Quality of service guarantee in wireless sensor networks (WSNs) is difficult and more challenging due to the fact that the available resources of sensors and the various applications running over these networks have different constraints in their nature and requirements. In this paper, we present a heuristic neighbor selection mechanism in WSNs that uses the geographic routing mechanism combined with the QoS requirements to provide multiobjective QoS routing (MQoSR) for different application requirements. The problem of providing QoS routing is formulated as link, and path-based metrics. The link-based metrics are partitioned in terms of reliability, delay, distance to sink, and energy, and the path-based metrics are presented in terms of end-to-end delay, reliability of data transmission, and network lifetime. The simulation results demonstrate that MQoSR protocol is able to achieve the delay requirements, and due to optimum path selection process, the achieved data delivery ratio is always above the required one. MQoSR protocol outperforms the existing model in the literature remarkably in terms of reliable data transmission, time data delivery, and routing overhead and underlines the importance of energy-efficient solution to enhance network lifetime.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124067709","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}
{"title":"Robust Data Compression for Irregular Wireless Sensor Networks Using Logical Mapping","authors":"T. Dang, N. Bulusu, W. Feng","doi":"10.1155/2013/253257","DOIUrl":"https://doi.org/10.1155/2013/253257","url":null,"abstract":"We propose RIDA, a novel robust information-driven data compression architecture for distributed wireless sensor networks. The key idea is to determine the data correlation among a group of sensors based on the data values to significantly improve compression performance rather than relying solely on spatial data correlation. A logical mapping approach assigns virtual indices to nodes based on the data content, which enables simple implementation of data transformation on resource-constrained nodes without any other information. We evaluate RIDA with both discrete cosine transform (DCT) and discrete wavelet transform (DWT) on publicly available real-world data sets. Our experiments show that 30% of energy and 80–95% of bandwidth can be saved for typical multihop data networks. Moreover, the original data can be retrieved after decompression with a low error of about 3%. In particular, for one state-of-the-art distributed data compression algorithm for sensor networks, we show that the compression ratio is doubled by using logical mapping while maintaining comparable mean square error. Furthermore, we also propose a mechanism to detect and classify missing or faulty nodes, showing accuracy and recall of 95% when half of the nodes in the network are missing or faulty.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130738320","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}
{"title":"Real-World Deployments of Participatory Sensing Applications: Current Trends and Future Directions","authors":"S. Tilak","doi":"10.1155/2013/583165","DOIUrl":"https://doi.org/10.1155/2013/583165","url":null,"abstract":"With the advent of participatory sensing (sensors integrated with consumer electronics such as cell phones and carried by people), exciting new opportunities arise. Mobile sensors (e.g., those mounted on cars or carried by people) can provide spatial sampling diversity not possible with traditional static sensor networks. Recently, participatory sensing has attracted considerable attention of research community. In this paper, we survey existing participatory sensing deployments and discuss current trends and few possible future directions.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123412392","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}
{"title":"QC2: A QoS Control Scheme with Quick Convergence in Wireless Sensor Networks","authors":"Hao-Li Wang, Weimin Hung","doi":"10.1155/2013/185719","DOIUrl":"https://doi.org/10.1155/2013/185719","url":null,"abstract":"In wireless sensor networks, too many or too few power-on sensors may cause the waste of resources or poor sensing efficiency; thus, controlling the number of active sensors to meet the predicted target number is the purpose of this research. However, the total number of sensors may be unstable because of the increment and damage to the sensors. It is difficult to control the number of active sensors to meet the predicted target in this condition. Previous studies proposed the Gur Game algorithm to solve this problem. However, the convergence time of the Gur Game algorithm is too long, which causes sensors to consume excessive power and waste resources. Therefore, this paper proposed the QoS Control with Quick Convergence (QC2). This method utilizes total virtual value to accelerate the convergence operation from the number of sensors to the target number. The experiment result shows that the QC2 method can cause the number of sensors to converge rapidly with the target value and that QC2 can be over a hundred times faster than the Gur Game algorithm with regard to convergence.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133218555","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}
{"title":"Wireless Sensor Network and RFID Fusion Approach for Mobile Robot Navigation","authors":"G. Enriquez, Sunhong Park, S. Hashimoto","doi":"10.1155/2013/157409","DOIUrl":"https://doi.org/10.1155/2013/157409","url":null,"abstract":"There are numerous applications for mobile robots that require relatively high levels of speed and precision. For many systems, these two properties are a tradeoff, as oftentimes increasing the movement speed can mean failing to detect some sensors. This research attempts to create a useful and practical system by combining a wireless sensor network with a passive \u0000radio frequency identification system. The sensor network provides fast general navigation in open areas and the radio frequency identification system provides precision navigation near static obstacles. By fusing the data from both systems, we are able to provide fast and accurate navigation for a mobile robot. Additionally, with WSN nodes and passive RFID tag mats, the system infrastructure can be easily installed in existing environments.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130968675","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}