{"title":"Mitigate Funnel Effect in Sensor Networks with Multi-interface Relay Nodes","authors":"Jorge Mena, M. Gerla, V. Kalogeraki","doi":"10.1109/DCOSS.2012.41","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.41","url":null,"abstract":"Overlay network architectures that use orthogonal channels have been known to provide effective additional resources to underlying networks in high demand. Overlays are composed of relay nodes provided with rich computational resources and multiple wireless interfaces that make them capable of establishing several non-interfering networks. These networks can be used to move traffic around in a non-interfering manner. It is possible to deploy such overlays in sensor networks where sensors suffer from the funnel effect caused by excess traffic flows, to help mitigate this effect. In this paper we address the geographical placement of relay nodes in the region to mitigate the funnel effect in sensor networks. We provide an O (mlog (h) ) algorithm of congested region size m and computed Convex Hull size h that finds the placement of the minimum number of relay nodes to cover the entire congested region. In a greedy fashion, we place a relay node given the following placement conditions: the closest position such that it covers the largest amount of peers up to an extent parameter bounded by its transmission range, and that is closest to the sink. Our simulated results show that using a minimum number of relays, we could save up to 43% of nodes compared to a simple placement strategy, the underlying network increases its delivery ratio and throughput, improves its jitter, and opens the possibility of load balancing and fairness advantages.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130062348","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":"In-Network Computation of the Transition Matrix for Distributed Subspace Projection","authors":"Xabier Insausti, P. Crespo, B. Beferull-Lozano","doi":"10.1109/DCOSS.2012.11","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.11","url":null,"abstract":"In this paper, we develop a novel strategy to compute the transition matrix for the projection problem in a distributed fashion through gossiping in Wireless Sensor Networks. So far, the transition matrix had to be computed off-line by a third party and then provided to the network. The Subspace Projection Problem is useful in various application scenarios (e.g. spectral spatial maps in cognitive radios) and consists of projecting the observed sampled spatial field into a subspace of interest with lower dimension. Although the actual exact computation of the optimal transition matrix is not feasible in a distributed way, we develop an algorithm that is based on well known results from linear algebra and a distributed genetic algorithm in order to compute an approximation of the optimal matrix to a desired precision.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131915845","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":"Controlled Straight Mobility and Energy-Aware Routing in Robotic Wireless Sensor Networks","authors":"R. Falcon, Hai Liu, A. Nayak, I. Stojmenovic","doi":"10.1109/DCOSS.2012.23","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.23","url":null,"abstract":"Power-aware routing and controlled mobility schemes are two commonly used mechanisms for improving communications in a wireless sensor network. While the former actively consider the transmission costs when selecting the next hop on the route, the latter instruct mobile relay nodes (either sensors or actuators) to pursue more promising locations so as to optimize end-to-end transmission power. Rarely, if ever, the two methodologies are exploited together for achieving relevant energy savings and prolonging network lifetime. In this paper, we introduce a hybrid routing-mobility model for the optimization of network communications. First, we find a multi-hop path between a source and its destination in an energy-efficient fashion and then we move all hop nodes in an uninterrupted, straight manner to some predefined spots with optimal energy-saving properties, fully preserving the path connectivity as they move. Such synergetic approach allowed us to: (1) seamlessly guarantee message delivery regardless of the network density (average number of neighbors per node), (2) easily incorporate any power-related optimization criterion to the routing protocol and (3) even target scenarios where both end nodes are actually disconnected from each other. Results gathered from extensive simulations argue for the introduction of the proposed hybrid framework.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122235388","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":"Bin-MAC: A Hybrid MAC for Ultra-compact Wireless Sensor Nodes","authors":"V. Salmani, P. Chou","doi":"10.1109/DCOSS.2012.42","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.42","url":null,"abstract":"This paper presents a light-weight hybrid protocol called Bin-MAC (Binary Medium Access Control) for highly resource-constrained wireless sensor nodes. In addition to simplicity and low footprint, a distinguishing feature of Bin-MAC is its deterministic contention resolution mechanism, which enables it to achieve bounded latency on data transmissions. As a result, Bin-MAC can be applied to delay-sensitive applications with real-time constraints, a feature not provide by most of the existing hybrid protocols. Another feature of the proposed protocol is that it requires carrier-sensing hardware only on the base station side, and sensor nodes do not have to possess such capability. Bin-MAC does not require clock synchronization, and thus clock drifts have no impact on its performance. Experimental results show Bin-MAC to be scalable and able to handle large network sizes without noticeable performance degradation.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428376","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}
Jing Bai, Peng Cheng, Jiming Chen, A. Guenard, Yeqiong Song
{"title":"Target Tracking with Limited Sensing Range in Autonomous Mobile Sensor Networks","authors":"Jing Bai, Peng Cheng, Jiming Chen, A. Guenard, Yeqiong Song","doi":"10.1109/DCOSS.2012.44","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.44","url":null,"abstract":"As technology advancements in robotics and wireless communication, tracking mobile targets using mobile sensors has aroused widespread concern in recent years. In this paper, we propose a novel coordinative moving strategy for autonomous mobile sensor networks to guarantee the target can be detected in each observed step while minimizing the amount of moving sensors. The proposed scheme consists of obtaining the current position of the target, which is then used to predict the next time-step location of the target. Once the uncertainty region of the target's position is defined, the proposed method allows the mobile sensors to cover it in an optimal way. Therefore, we can assign each mobile sensor to an optimal location to cover the uncertainty region while minimizing the total traveled distance of sensors. Extensive simulations are given to evaluated performance and demonstrate the efficiency of the proposed strategy.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115620798","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":"Coverage Estimation in Heterogeneous Visual Sensor Networks","authors":"M. Karakaya, H. Qi","doi":"10.1109/DCOSS.2012.61","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.61","url":null,"abstract":"Coverage estimation is one of the fundamental issues in many applications of sensor networks. Coverage estimation in visual sensor networks (VSNs) is more challenging than in conventional 1-D scalar sensor networks (SSNs) due to the directional sensing characteristic of cameras and the existence of visual occlusions in crowded environments. Moreover, deployment of heterogeneous visual sensors and existence of heterogeneous targets in the sensing field makes the coverage estimation problem even more challenging. In this paper, we study the coverage estimation problem in heterogeneous VSNs. We first investigate into a new target detection model, referred to as the \"certainty-based target detection\" as compared to the traditional \"occupancy-based target detection\" to facilitate the formulation of the visual coverage estimation. By adopting the new target detection model, we then derive the closed-form solution for the visual coverage estimation problem in heterogeneous VSNs. Our formulation also allows us to take both the presence of visual occlusions and boundary effect into consideration. Results from simulation validate the theoretical formulation, especially when the boundary effect is considered.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122776194","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":"A Mobile Terminal Based Trajectory Preserving Strategy for Continuous Querying LBS Users","authors":"Yunxia Feng, Peng Liu, Jianhui Zhang","doi":"10.1109/DCOSS.2012.33","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.33","url":null,"abstract":"Location privacy is one critical factor concerned by mobile users of Location Based Service (LBS). Location privacy of mobile users includes two parts: current position information and trajectory information. The problem of position anonymity in Ad Hoc & sensor networks has been widely studied during past years. Nevertheless, most of existing privacy preserving solutions either need a third part server or require a large number of users. This paper proposes a simple and distributed trajectory preserving strategy, called Virtual Avatar (VAvatar). VAvater adopts a virtual path programming resolution, which does not need any third-part server (agent), to achieve trajectory information anonymity for continuous querying users of LBS. On the other hand, attackers may have strong ability to make mobility predictions by analyzing spatio-temporal relation of historical communication data. In order to prevent users from such threatening, VAvatar takes following two strategies: noisy location selecting strategy and query scheduling strategy to interrupt spacial and temporal relationships between position data. Theoretical analysis and experiments show that VAvatar provides efficient protection of trajectory privacy for mobile users with tolerable energy cost.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132480817","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":"MOB-TOSSIM: An Extension Framework for TOSSIM Simulator to Support Mobility in Wireless Sensor and Actuator Networks","authors":"A. Derhab, Fatma Ounini, Badis Remli","doi":"10.1109/DCOSS.2012.34","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.34","url":null,"abstract":"Recently, there has been considerable research on using mobility in wireless sensor and actor networks (WSANs) to assist in the deployment of nodes and meet the sensing, communication, and actuation coverage requirements. One of the well-know simulators used to evaluate the performance of wireless sensor networks is TOSSIM. It has the advantage that its code can also run in real systems, and hence it allows better comparison between experimental and simulation results. However, it is designed to simulate only static sensor networks. In this paper, we propose a classification scheme that categorizes the mobility models in WSANs. Based on this classification, we design and implement MOB-TOSSIM, the first extension framework to TOSSIM that supports mobility in WSNs and WSANs. MOB-TOSSIM implements three components: (1) a set of probabilistic and controlled mobility models, (2) an extended and modified version of Power TOSSIM that includes the energy consumption due to mobility and radio transmission, and (3) a radio component based on a realistic propagation model. Experiment results show that MOB-TOSSIM is scalable with respect to network size and node speed, as it incurs an acceptable additional execution time compared to TOSSIM.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124358974","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":"ADEN: Adaptive Energy Efficient Network of Flying Robots Monitoring over Disaster Hit Area","authors":"T. Abishek, K. Chithra, M. Ramesh","doi":"10.1109/DCOSS.2012.50","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.50","url":null,"abstract":"The post disaster mitigation is the immediate task to be carried out in disaster affected areas in order to reduce the extent of damage and for early rehabilitation and reconstruction. This paper proposes a design framework for an optimal control strategy to efficiently perform surveillance over a wide disaster hit area using a network of flying robots to determine the extent of damage promptly so that the rescue operation can be carried out efficiently. The main focus of the paper is to develop a low cost and an adaptive energy efficient strategy with less power dissipation and delay compared to traditional methods. The routing protocol proposed in the paper efficiently determines the best route by taking account of the residual energy, signal strength and various environmental factors. Simulation results show that the proposed routing scheme achieves much higher performance than the classical routing protocols.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115390247","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":"Power-Efficient Algorithms for Fourier Analysis over Random Wireless Sensor Network","authors":"Xi Xu, R. Ansari, A. Khokhar","doi":"10.1109/DCOSS.2012.40","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.40","url":null,"abstract":"Reduced execution time and increased power efficiency are important objectives in the distributed execution of collaborative signal processing tasks over wireless sensor networks. The power-efficient implementation of the Fourier transform computation is an exemplar of distributed data communication and processing task widely used in the signal processing field. Past work has presented some energy-efficient in-network Fourier transform computation algorithms devised only for uniformly sampled one-dimensional (1D) sensor data. However the circumstance that sensors are randomly distributed over a 2D plane may be more practical, therefore the conventional two-dimensional Fast Fourier Transform (2D FFT) defined for data sampled on uniform grids is not directly applicable in such environments. We address this problem by designing a distributed hybrid structure consisting of local Nonequispaced Discrete Fourier Transform (NDFT) and global FFT computation. Firstly, NDFT method is applied in a suitable choice of clusters to get the initial uniform Fourier coefficients with allowable estimation error bounds. We experiment with classical linear as well as generalized interpolation methods to compute NDFT coefficients within each cluster. A separable 2D FFT is then performed over all these clusters by employing our proposed energy-efficient 1D FFT computation that reduces communication costs using a novel bit index mapping strategy for data exchanges between sensors. The proposed techniques are implemented in a SID net-SWANS platform to investigate the communication costs, execution time, and energy consumption. Our results show reduced execution time and improved energy consumption when compared with existing work.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127592827","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}