{"title":"Energy Efficient Transmission Scheme for Data-Gathering in Mobile Sensor Networks","authors":"Chao Wang, P. Ramanathan","doi":"10.1109/SAHCN.2006.288506","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288506","url":null,"abstract":"Mobile sensor networks are being envisioned for certain applications like habitat monitoring and environmental sensing. For instance, mobile sensor nodes are attached to selected animals to gather data about their behavior. These data are uploaded to stationary units for detailed analysis over wireless ad-hoc networks. Since the mobile sensor nodes are likely to operate on batteries, reducing energy consumption for such data gathering is an important issue. This paper proposes a transmission scheme for power-adjustable radio to optimize transmit energy efficiency subject to given overflow and delay constraints. The energy efficiency is defined as the expected transmit energy to deliver one unit of data from sensor node to stationary unit. An analytical model is developed to estimate the unit energy, data throughput and delay for a sensor node in the single-hop case. Simulation results show that the model achieves very good accuracy. The proposed transmission scheme is then adapted to the multi-hop scenario. Simulations based on radio parameters from a sensor board demonstrate that high energy efficiency can be achieved by the transmission scheme in both single-hop and multi-hop cases","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"2014 1","pages":"498-507"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86551267","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 Practical Approach to Landmark Deployment for Indoor Localization","authors":"Yingying Chen, J. Francisco, W. Trappe, R. Martin","doi":"10.1109/SAHCN.2006.288441","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288441","url":null,"abstract":"We investigate the impact of landmark placement on localization performance using a combination of analytic and experimental analysis. For our analysis, we have derived an upper bound for the localization error of the linear least squares algorithm. This bound reflects the placement of landmarks as well as measurement errors at the landmarks. We next develop a novel algorithm, maxL minE, that using our analysis, finds a pattern for landmark placement that minimizes the maximum localization error. To show our results are applicable to a variety of localization algorithms, we then conducted a series of localization experiments using both an 802.11 (WiFi) network as well as an 802.15.4 (ZigBee) network in a real building environment. We use both received signal strength (RSS) and time-of-arrival (ToA) as ranging modalities. Our experimental results show that our landmark placement algorithm is generic because the resulting placements improve localization performance across a diverse set of algorithms, networks, and ranging modalities","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":"365-373"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79173633","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":"Efficient Data Compression in Wireless Sensor Networks for Civil Infrastructure Health Monitoring","authors":"Shengpu Liu, Liang Cheng","doi":"10.1109/SAHCN.2006.288567","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288567","url":null,"abstract":"In this paper, we present an efficient sensor data compression process for civil infrastructure health monitoring applications. It integrates lifting scheme wavelet transform (LSWT) and distributed source coding (DSC), which can reduce the raw data size by 1:27 to 1:80 while having a minor effect on the modal parameters identified from the sensor data. We have compared our algorithms with other data compression algorithms for structural health monitoring. Results show that our algorithms can achieve 80% ~ 100% higher compression ratios with the same signal-restoration quality","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":"823-829"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79547890","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":"Robot-Assisted Localization Techniques for Wireless Image Sensor Networks","authors":"Huang Lee, Hattie Dong, H. Aghajan","doi":"10.1109/SAHCN.2006.288443","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288443","url":null,"abstract":"We present a vision-based solution to the problem of topology discovery and localization of wireless sensor networks. In the proposed model, a robot controlled by the network is introduced to assist with localization of a network of image sensors, which are assumed to have image planes parallel to the agent's motion plane. The localization algorithm for the scenario where the moving agent has knowledge of its global coordinates is first studied. This baseline scenario is then used to build more complex localization algorithms in which the robot has no knowledge of its global positions. Two cases where the sensors have overlapping and non-overlapping fields of view (FOVs) are investigated. In order to implement the discovery algorithms for these two different cases, a forest structure is introduced to represent the topology of the network. We consider the collection of sensors with overlapping FOVs as a tree in the forest. The robot searches for nodes in each tree through boundary patrolling, while it searches for other trees by a radial pattern motion. Numerical analyses are provided to verify the proposed algorithms. Finally, experiment results show that the sensor coordinates estimated by the proposed algorithms accurately reflect the results found by manual methods","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":"383-392"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88343229","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 Realistic Power Consumption Model for Wireless Sensor Network Devices","authors":"Qin Wang, Mark Hempstead, Woodward Yang","doi":"10.1109/SAHCN.2006.288433","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288433","url":null,"abstract":"A realistic power consumption model of wireless communication subsystems typically used in many sensor network node devices is presented. Simple power consumption models for major components are individually identified, and the effective transmission range of a sensor node is modeled by the output power of the transmitting power amplifier, sensitivity of the receiving low noise amplifier, and RF environment. Using this basic model, conditions for minimum sensor network power consumption are derived for communication of sensor data from a source device to a destination node. Power consumption model parameters are extracted for two types of wireless sensor nodes that are widely used and commercially available. For typical hardware configurations and RF environments, it is shown that whenever single hop routing is possible it is almost always more power efficient than multi-hop routing. Further consideration of communication protocol overhead also shows that single hop routing will be more power efficient compared to multi-hop routing under realistic circumstances. This power consumption model can be used to guide design choices at many different layers of the design space including, topology design, node placement, energy efficient routing schemes, power management and the hardware design of future wireless sensor network devices","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"8 1","pages":"286-295"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87673998","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 Statistical Model for the Evaluation of the Distribution of the Received Power in Ad Hoc and Wireless Sensor Networks","authors":"Enrica Salbaroli, A. Zanella","doi":"10.1109/SAHCN.2006.288557","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288557","url":null,"abstract":"In this paper we consider a scenario composed by nodes which are uniformly and randomly distributed in a given area and derive the distribution of the power received by a given terminal. The model, which takes a propagation environment characterized by distance-dependent loss and log-normally distributed shadowing into account, can be used to evaluate the distribution of the received power in wireless ad hoc and sensor networks. In particular, the model is suited to investigate the distribution of the received useful and the interference power in a scenario where all the terminals can communicate with each other using the same radio resource","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"28 1","pages":"756-760"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91014326","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}
Yang Wang, Wenzhan Song, Weizhao Wang, Xiangyang Li, T. Dahlberg
{"title":"LEARN: localized energy aware restricted neighborhood routing for ad hoc networks","authors":"Yang Wang, Wenzhan Song, Weizhao Wang, Xiangyang Li, T. Dahlberg","doi":"10.1109/SAHCN.2006.288507","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288507","url":null,"abstract":"In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware routing protocols were proposed to seek the power efficiency of routes. Among them, several geographical localized routing protocols were proposed to help making smarter routing decision using only local information and reduce the routing overhead. However, most of the proposed localized routing methods cannot theoretically guarantee the power efficiency of their routes. In this paper, we give the first localized routing algorithm, called localized energy aware restricted neighborhood routing (LEARN), which can guarantee the power efficiency of its route asymptotically almost sure. Given destination node t, an intermediate node v will only select a certain neighbor v such that < vut les alpha for a parameter alpha < pi/3 in our LEARN method. We theoretically prove that for a network, formed by nodes that are produced by a Poisson distribution with rate n over a compact and convex region O with unit area, when the transmission range rn = radicbetalnl/pin for some beta > pi/alpha, our LEARN routing protocol will find the route for any pair of nodes asymptotically almost sure. When the transmission range rn = radicbetalnl/pin for some beta < pi/alpha, the LEARN routing protocol will not be able to find the route for any pair of nodes asymptotically almost sure. We also conducted simulations to study the performance of LEARN and compare it with a typical localized routing protocol (GPSR) and a global ad hoc routing protocol (DSR)","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"70 1","pages":"508-517"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85048775","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":"Sensor Networks with Decentralized Binary Detection: Clustering and Lifetime","authors":"G. Ferrari, M. Martalò","doi":"10.1109/SAHCN.2006.288525","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288525","url":null,"abstract":"In this paper, we analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality of service (QoS) constraint, given by the maximum tolerable probability of decision error at the access point (AP). In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal) for the single sensors' lifetime. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"27 1","pages":"645-650"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88160426","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":"Mobility Metrics for Adaptive Routing","authors":"L. Qin, T. Kunz","doi":"10.1109/SAHCN.2006.288564","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288564","url":null,"abstract":"Most existing mobile ad hoc routing protocols preset the parameters for the nodes based on some assumed network conditions. Because of the dynamic characteristics of a MANET, network conditions are changing at different points of time. Adaptively adjusting routing behavior by individual nodes will improve the routing protocol performance. In this paper, we mainly focus on the node mobility, and show the correlation between overall performance and node mobility level with simulation results for three different mobility models. We also study the effect of the mobility from point of view of individual nodes. Finally we propose the number of link breakages as a mobility metric, which is mobility model independent, that nodes can use it to monitor the environment changes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"29 1","pages":"803-808"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82836151","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":"Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks","authors":"A. Zabian","doi":"10.1109/SAHCN.2006.288581","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288581","url":null,"abstract":"Power saving is an important issue in ad-hoc wireless networks, where no centralized communication is issued. Each node works as router to the others to allow the network connectivity. So, each node consumes parts of its energy in a forwarding others packets. In this paper we propose a self adjustment power saving mechanism for routing in ad-hoc wireless networks that results in significant power saving for all the network. Our mechanism is based on TDA (topology discovering algorithm) in which each node knows who are the active nodes in a fraction of the network. By determined simulation experiments, our simulation results show that in a topology like that constructed by TDA, the power consumption in routing is independent on the network size and is related only to the height of the tree built by the algorithm and to the packet size","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"33 1","pages":"910-915"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78809290","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}