In most applications involving wireless sensor networks, each sensor collects data in the surrounding area, and sends to a central node for processing. To extend network lifetime in such cases, the sensors could be partitioned into groups which are successively scheduled to be active for sensing and delivering data. Each group covers (almost) the entire area, and only one group is active at a given time. These groups of sensors are known as disjoint dominating sets in network and graph theory where it has been shown that the problem of computing the maximum number of disjoint dominating sets in graphs is NP-complete [6]. In this paper, we strengthen this result [3] by showing that this problem remains NP-complete for planar unit disk graphs. We introduce several heuristics for the disjoint dominating sets problem and discuss their performance through some simulation results.
{"title":"Extending Sensor Networks Lifetime Through Energy Efficient Organization","authors":"T. Nguyen, D. Huynh","doi":"10.1109/WASA.2007.21","DOIUrl":"https://doi.org/10.1109/WASA.2007.21","url":null,"abstract":"In most applications involving wireless sensor networks, each sensor collects data in the surrounding area, and sends to a central node for processing. To extend network lifetime in such cases, the sensors could be partitioned into groups which are successively scheduled to be active for sensing and delivering data. Each group covers (almost) the entire area, and only one group is active at a given time. These groups of sensors are known as disjoint dominating sets in network and graph theory where it has been shown that the problem of computing the maximum number of disjoint dominating sets in graphs is NP-complete [6]. In this paper, we strengthen this result [3] by showing that this problem remains NP-complete for planar unit disk graphs. We introduce several heuristics for the disjoint dominating sets problem and discuss their performance through some simulation results.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123283832","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}
In wireless networks, due to the lack of fixed infrastructure or centralized management, a connected dominating set (CDS) of the graph representing the network is an optimum candidate to serve as the virtual backbone of a wireless network. However, constructing a minimum CDS is NP-hard. Furthermore, almost all of the existing CDS construction algorithms neglect the diameter of a CDS, which is an important factor. In this paper, we investigate the problem of constructing a CDS with a bounded diameter in wireless networks and propose a heuristic algorithm, connected dominating sets with bounded diameters (CDS-BD), with constant performance ratios for both the size and diameter of the constructed CDS.
{"title":"Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks","authors":"Yingshu Li, Donghyun Kim, Feng Zou, D. Du","doi":"10.1109/WASA.2007.148","DOIUrl":"https://doi.org/10.1109/WASA.2007.148","url":null,"abstract":"In wireless networks, due to the lack of fixed infrastructure or centralized management, a connected dominating set (CDS) of the graph representing the network is an optimum candidate to serve as the virtual backbone of a wireless network. However, constructing a minimum CDS is NP-hard. Furthermore, almost all of the existing CDS construction algorithms neglect the diameter of a CDS, which is an important factor. In this paper, we investigate the problem of constructing a CDS with a bounded diameter in wireless networks and propose a heuristic algorithm, connected dominating sets with bounded diameters (CDS-BD), with constant performance ratios for both the size and diameter of the constructed CDS.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127073682","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}
R. Tiwari, Tusar Kanti Mishra, Yingshu Li, My T. Thai
Since there is no fixed infrastructure or centralized management in wireless ad hoc networks (WANs), virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem. Because the virtual backbone nodes need to carry other node's traffic and subject to failure, it is desirable to construct a fault tolerant virtual backbone. Most recent research has studied this problem in homogeneous networks. In this paper, we propose solutions for efficient construction of a fault-tolerant virtual backbone where the wireless nodes have different transmission ranges. Such a network can be modeled as a disk graph where any link between two nodes is either unidirectional or bidirectional. Since the graph is directed, we formulate the fault tolerant virtual backbone problem as a k- strongly connected m-dominating and absorbing set problem (k-m-SCDAS). We first propose two heuristics, one to construct a 1-m-SCDAS and the other one to obtain a k-1-SCDAS in a directed graph. We next combine these two approaches to develop a general construction of k-m-SCDAS. Through extensive simulations, we compare the performance of these proposed algorithms.
{"title":"k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links","authors":"R. Tiwari, Tusar Kanti Mishra, Yingshu Li, My T. Thai","doi":"10.1109/WASA.2007.72","DOIUrl":"https://doi.org/10.1109/WASA.2007.72","url":null,"abstract":"Since there is no fixed infrastructure or centralized management in wireless ad hoc networks (WANs), virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem. Because the virtual backbone nodes need to carry other node's traffic and subject to failure, it is desirable to construct a fault tolerant virtual backbone. Most recent research has studied this problem in homogeneous networks. In this paper, we propose solutions for efficient construction of a fault-tolerant virtual backbone where the wireless nodes have different transmission ranges. Such a network can be modeled as a disk graph where any link between two nodes is either unidirectional or bidirectional. Since the graph is directed, we formulate the fault tolerant virtual backbone problem as a k- strongly connected m-dominating and absorbing set problem (k-m-SCDAS). We first propose two heuristics, one to construct a 1-m-SCDAS and the other one to obtain a k-1-SCDAS in a directed graph. We next combine these two approaches to develop a general construction of k-m-SCDAS. Through extensive simulations, we compare the performance of these proposed algorithms.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130270597","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}
In this paper, we discuss energy balancing routing algorithms for wireless sensor networks connected as grids. The scarcest resource in a sensor network is the energy in each sensor. We deploy the sensors in a grid where environment allows to maximize the lifetime, robustness and fault tolerance of the sensor network by taking advantage of the topology. To the best of our knowledge, no other paper has addressed this so far. We design several routing algorithms to achieve energy balance in the network, which directly influences the lifetime of sensor networks. Through simulations, we discover that the best algorithm takes dynamic traffic into account and uses local information for routing guidance.
{"title":"Energy Balancing Routing Algorithms in Wireless Sensor Networks Connected as Grids","authors":"Xiao Chen, Xingde Jia","doi":"10.1109/WASA.2007.152","DOIUrl":"https://doi.org/10.1109/WASA.2007.152","url":null,"abstract":"In this paper, we discuss energy balancing routing algorithms for wireless sensor networks connected as grids. The scarcest resource in a sensor network is the energy in each sensor. We deploy the sensors in a grid where environment allows to maximize the lifetime, robustness and fault tolerance of the sensor network by taking advantage of the topology. To the best of our knowledge, no other paper has addressed this so far. We design several routing algorithms to achieve energy balance in the network, which directly influences the lifetime of sensor networks. Through simulations, we discover that the best algorithm takes dynamic traffic into account and uses local information for routing guidance.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130544091","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}
Wireless sensor networks are often divided into clusters to gain high-performance and prolong network lifetime. In this paper we analyze the network capacity of two different architectures, named flat sensor network and clustered sensor network. For each network, we first define the network model and then analyze the network capacity and the factors that affect the capacity. Numerical results suggest that clustering can significantly improve the network capacity. We also found that the capacity of a clustered network is saturated after the number of clusters is above a certain value. For clustered network architecture, we further study the capacity difference with or without the distributed coordination function. It is found that there is a critical value of the number of cluster heads beyond which the network capacity of two clustered models approaches the same. Results from this research will provide guidance in deploying high-performance wireless sensor networks.
{"title":"Capacity Analysis for Flat and Clustered Wireless Sensor Networks","authors":"Min Song, Bei He","doi":"10.1109/WASA.2007.145","DOIUrl":"https://doi.org/10.1109/WASA.2007.145","url":null,"abstract":"Wireless sensor networks are often divided into clusters to gain high-performance and prolong network lifetime. In this paper we analyze the network capacity of two different architectures, named flat sensor network and clustered sensor network. For each network, we first define the network model and then analyze the network capacity and the factors that affect the capacity. Numerical results suggest that clustering can significantly improve the network capacity. We also found that the capacity of a clustered network is saturated after the number of clusters is above a certain value. For clustered network architecture, we further study the capacity difference with or without the distributed coordination function. It is found that there is a critical value of the number of cluster heads beyond which the network capacity of two clustered models approaches the same. Results from this research will provide guidance in deploying high-performance wireless sensor networks.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114625886","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}
Data storage has become an important issue in sensor networks as a large amount of collected data needs to be archived for future information retrieval. This paper proposes to introduce storage nodes that can store data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all the data to a central place for archiving and reduce the communication cost induced by the network query. This paper considers the storage node placement problem to minimize the total power consumption for data funneling to the storage nodes and data query. We formulate it as an integer linear programming problem and present an approximation algorithm based on a rounding technique. Our simulation shows that our approximation algorithm performs well in practice.
{"title":"An Approximation Algorithm for Data Storage Placement in Sensor Networks","authors":"Bo Sheng, C. C. Tan, Qun A. Li, W. Mao","doi":"10.1109/WASA.2007.141","DOIUrl":"https://doi.org/10.1109/WASA.2007.141","url":null,"abstract":"Data storage has become an important issue in sensor networks as a large amount of collected data needs to be archived for future information retrieval. This paper proposes to introduce storage nodes that can store data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all the data to a central place for archiving and reduce the communication cost induced by the network query. This paper considers the storage node placement problem to minimize the total power consumption for data funneling to the storage nodes and data query. We formulate it as an integer linear programming problem and present an approximation algorithm based on a rounding technique. Our simulation shows that our approximation algorithm performs well in practice.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211972","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}
Energy-aware routing in mobile wireless ad hoc networks has been investigated extensively in the framework of reactive routing. In this paper we present an energy preserving mechanism suitable to be integrated with a proactive MANET routing scheme. We use a compositive energy cost, which considers both transmission power consumption and residual energy of the nodes, as the routing metric. Our energy cost calculation is based on prediction of node energy consumption using ARIMA model. The formulation of our energy cost is tailored to heterogeneous MANET in terms of power consumptions. We extended OLSR with our energy preserving mechanism. Our power-aware version of OLSR is proven by simulation to be able to prolong network lifetime significantly in both homogeneous and heterogeneous scenarios in terms of power consumptions.
{"title":"Energy Aware Proactive MANET Routing with Prediction on Energy Consumption","authors":"Zhihao Guo, B. Malakooti","doi":"10.1109/WASA.2007.151","DOIUrl":"https://doi.org/10.1109/WASA.2007.151","url":null,"abstract":"Energy-aware routing in mobile wireless ad hoc networks has been investigated extensively in the framework of reactive routing. In this paper we present an energy preserving mechanism suitable to be integrated with a proactive MANET routing scheme. We use a compositive energy cost, which considers both transmission power consumption and residual energy of the nodes, as the routing metric. Our energy cost calculation is based on prediction of node energy consumption using ARIMA model. The formulation of our energy cost is tailored to heterogeneous MANET in terms of power consumptions. We extended OLSR with our energy preserving mechanism. Our power-aware version of OLSR is proven by simulation to be able to prolong network lifetime significantly in both homogeneous and heterogeneous scenarios in terms of power consumptions.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123328220","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
扫码关注我们
求助内容：
应助结果提醒方式：