The Experts below are selected from a list of 51642 Experts worldwide ranked by ideXlab platform
Weifa Liang - One of the best experts on this subject based on the ideXlab platform.
-
Network Lifetime maximization in delay tolerant sensor Networks with a mobile sink
Distributed Computing in Sensor Systems, 2012Co-Authors: Weifa LiangAbstract:In this paper we investigate the Network Lifetime maximization problem in a delay-tolerant wireless sensor Network with a mobile sink by exploiting a nontrivial tradeoff between the Network Lifetime and the data delivery delay. We formulate the problem as a joint optimization problem that consists of finding a trajectory for the mobile sink and designing an energy-efficient routing protocol to route sensing data to the sink, subject to the bounded delay on data delivery and the given potential sink location space. Due to NP-hardness of the problem, we then propose a novel optimization framework, which not only prolongs the Network Lifetime but also improves the other performance metrics including the Network scalability, robustness, and the average delivery delay. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm against other heuristics. The experimental results demonstrate that the proposed algorithm outperforms the others significantly in terms of Network Lifetime prolongation.
-
DCOSS - Network Lifetime Maximization in Delay-Tolerant Sensor Networks with a Mobile Sink
2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012Co-Authors: Weifa LiangAbstract:In this paper we investigate the Network Lifetime maximization problem in a delay-tolerant wireless sensor Network with a mobile sink by exploiting a nontrivial tradeoff between the Network Lifetime and the data delivery delay. We formulate the problem as a joint optimization problem that consists of finding a trajectory for the mobile sink and designing an energy-efficient routing protocol to route sensing data to the sink, subject to the bounded delay on data delivery and the given potential sink location space. Due to NP-hardness of the problem, we then propose a novel optimization framework, which not only prolongs the Network Lifetime but also improves the other performance metrics including the Network scalability, robustness, and the average delivery delay. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm against other heuristics. The experimental results demonstrate that the proposed algorithm outperforms the others significantly in terms of Network Lifetime prolongation.
-
Network Lifetime maximization in sensor Networks with multiple mobile sinks
Local Computer Networks, 2011Co-Authors: Weifa Liang, Jun LuoAbstract:In this paper we deal with the Network Lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor Network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h ≥ 1, the problem is to find an optimal trajectory for each mobile sink and determine the sojourn time at each sojourn location in the trajectory such that the Network Lifetime is maximized. We first formulate this problem as a joint optimization problem consisting of finding an optimal trajectory and determining the sojourn time at each chosen location. We then show that the problem is NP-hard. We instead devise a novel three-stage heuristic, which consists of calculating the sojourn time profile at each potential sojourn location, finding a high-quality trajectory for each mobile sink, and determining the actual sojourn time at each sojourn location. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of Network Lifetime. We also investigate the impact of constraint parameters on the Network Lifetime. The experimental results demonstrate that the performance of the proposed heuristic is highly comparable to the optimal one, and the ratios of Network Lifetime of the proposed algorithm to the optimal Network Lifetime are ranged from 56% to 93%.
-
LCN - Network Lifetime maximization in sensor Networks with multiple mobile sinks
2011 IEEE 36th Conference on Local Computer Networks, 2011Co-Authors: Weifa Liang, Jun LuoAbstract:In this paper we deal with the Network Lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor Network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h ≥ 1, the problem is to find an optimal trajectory for each mobile sink and determine the sojourn time at each sojourn location in the trajectory such that the Network Lifetime is maximized. We first formulate this problem as a joint optimization problem consisting of finding an optimal trajectory and determining the sojourn time at each chosen location. We then show that the problem is NP-hard. We instead devise a novel three-stage heuristic, which consists of calculating the sojourn time profile at each potential sojourn location, finding a high-quality trajectory for each mobile sink, and determining the actual sojourn time at each sojourn location. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of Network Lifetime. We also investigate the impact of constraint parameters on the Network Lifetime. The experimental results demonstrate that the performance of the proposed heuristic is highly comparable to the optimal one, and the ratios of Network Lifetime of the proposed algorithm to the optimal Network Lifetime are ranged from 56% to 93%.
-
WASA - Prolonging Network Lifetime for Target Coverage in Sensor Networks
Wireless Algorithms Systems and Applications, 2008Co-Authors: Yuzhen Liu, Weifa LiangAbstract:Target coverage is a fundamental problem in sensor Networks for environment monitoring and surveillance purposes. To prolong the Network Lifetime, a typical approach is to partition the sensors in a Network for target monitoring into several disjoint subsets such that each subset can cover all the targets. Thus, each time only the sensors in one of such subsets are activated. It recently has been shown that the Network Lifetime can be further extended through the overlapping among these subsets. Unlike most of the existing work in which either the subsets were disjoint or the sensors in a subset were disconnected, in this paper we consider both target coverage and sensor connectivity by partitioning an entire Lifetime of a sensor into several equal intervals and allowing the sensor to be contained by several subsets to maximize the Network Lifetime. We first analyze the energy consumption of sensors in a Steiner tree rooted at the base station and spanning the sensors in a subset. We then propose a novel heuristic algorithm for the target coverage problem, which takes into account both residual energy and coverage ability of sensors. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithm by varying the number of intervals of sensor Lifetime and Network connectivity. The experimental results show that the Network Lifetime delivered by the proposed algorithm is further prolonged with the increase of the number of intervals and improvement of Network connectivity.
Jun Luo - One of the best experts on this subject based on the ideXlab platform.
-
Network Lifetime maximization in sensor Networks with multiple mobile sinks
Local Computer Networks, 2011Co-Authors: Weifa Liang, Jun LuoAbstract:In this paper we deal with the Network Lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor Network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h ≥ 1, the problem is to find an optimal trajectory for each mobile sink and determine the sojourn time at each sojourn location in the trajectory such that the Network Lifetime is maximized. We first formulate this problem as a joint optimization problem consisting of finding an optimal trajectory and determining the sojourn time at each chosen location. We then show that the problem is NP-hard. We instead devise a novel three-stage heuristic, which consists of calculating the sojourn time profile at each potential sojourn location, finding a high-quality trajectory for each mobile sink, and determining the actual sojourn time at each sojourn location. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of Network Lifetime. We also investigate the impact of constraint parameters on the Network Lifetime. The experimental results demonstrate that the performance of the proposed heuristic is highly comparable to the optimal one, and the ratios of Network Lifetime of the proposed algorithm to the optimal Network Lifetime are ranged from 56% to 93%.
-
LCN - Network Lifetime maximization in sensor Networks with multiple mobile sinks
2011 IEEE 36th Conference on Local Computer Networks, 2011Co-Authors: Weifa Liang, Jun LuoAbstract:In this paper we deal with the Network Lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor Network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h ≥ 1, the problem is to find an optimal trajectory for each mobile sink and determine the sojourn time at each sojourn location in the trajectory such that the Network Lifetime is maximized. We first formulate this problem as a joint optimization problem consisting of finding an optimal trajectory and determining the sojourn time at each chosen location. We then show that the problem is NP-hard. We instead devise a novel three-stage heuristic, which consists of calculating the sojourn time profile at each potential sojourn location, finding a high-quality trajectory for each mobile sink, and determining the actual sojourn time at each sojourn location. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of Network Lifetime. We also investigate the impact of constraint parameters on the Network Lifetime. The experimental results demonstrate that the performance of the proposed heuristic is highly comparable to the optimal one, and the ratios of Network Lifetime of the proposed algorithm to the optimal Network Lifetime are ranged from 56% to 93%.
Ling Guan - One of the best experts on this subject based on the ideXlab platform.
-
Distributed Algorithms for Network Lifetime Maximization in Wireless Visual Sensor Networks
IEEE Transactions on Circuits and Systems for Video Technology, 2009Co-Authors: Ivan Lee, Ling GuanAbstract:Network Lifetime maximization is a critical issue in wireless sensor Networks since each sensor has a limited energy supply. In contrast with conventional sensor Networks, video sensor nodes compress the video before transmission. The encoding process demands a high power consumption, and thus raises a great challenge to the maintenance of a long Network Lifetime. In this paper, we examine a strategy for maximizing the Network Lifetime in wireless visual sensor Networks by jointly optimizing the source rates, the encoding powers, and the routing scheme. Fully distributed algorithms are developed using the Lagrangian duality to solve the Lifetime maximization problem. We also examine the relationship between the collected video quality and the maximal Network Lifetime. Through extensive numerical simulations, we demonstrate that the proposed algorithm can achieve a much longer Network Lifetime compared to the scheme optimized for the conventional wireless sensor Networks.
-
ICME - Network Lifetime Maximization in Wireless Visual Sensor Networks using a Distributed Algorithm
Multimedia and Expo 2007 IEEE International Conference on, 2007Co-Authors: Ivan Lee, Ling GuanAbstract:Network Lifetime maximization is a critical issue in wireless sensor Networks since each sensor has a limited energy supply. Different from conventional sensors, video sensors compress the captured video before transmission. The encoding processing demands high power consumption, thus raises challenges to maintain a long Network Lifetime. In this paper, we formulate the Network Lifetime maximization problem in wireless visual sensor Networks, and propose a fully distributed algorithm to solve this problem. The proposed algorithm maximizes the Network Lifetime by jointly optimizing the encoding powers, the source rates, and the link rates.
Abdelhamid Mellouk - One of the best experts on this subject based on the ideXlab platform.
-
On enhancing Network-Lifetime in opportunistic Wireless Sensor Networks
IEEE Wireless Communications and Networking Conference, WCNC, 2014Co-Authors: Nouha Sghaier, Brice Augustin, Abdelhamid MelloukAbstract:Network Lifetime has become the key characteristic for evaluating sensor Networks in an application-specific way. In this paper, we focus on Mobile Wireless Sensor Networks, which are specific opportunistic Networks because of their poor connectivity among the mobile sensors, and thus it is difficult to form a well connected mesh Network for transmitting data through end-to-end connections from the sensors to the sink. We propose EXLIOSE (Novel approach to EXtending Network Lifetime in Opportunistic SEnsor Networks), a routing protocol that focuses on maximizing Network Lifetime while keeping high delivery statistics. EXLIOSE is based on a novel routing metric that uses the history of encounters between nodes, and the nodal residual energy. Simulation results show that our approach is able to extend Network Lifetime and achieve good delivery statistics, as compared to state-of-the-art solutions. © 2014 IEEE.
-
WCNC - On enhancing Network-Lifetime in opportunistic Wireless Sensor Networks
2014 IEEE Wireless Communications and Networking Conference (WCNC), 2014Co-Authors: Nouha Sghaier, Brice Augustin, Abdelhamid MelloukAbstract:Network Lifetime has become the key characteristic for evaluating sensor Networks in an application-specific way. In this paper, we focus on Mobile Wireless Sensor Networks, which are specific opportunistic Networks because of their poor connectivity among the mobile sensors, and thus it is difficult to form a well connected mesh Network for transmitting data through end-to-end connections from the sensors to the sink. We propose EXLIOSE (Novel approach to EXtending Network Lifetime in Opportunistic SEnsor Networks), a routing protocol that focuses on maximizing Network Lifetime while keeping high delivery statistics. EXLIOSE is based on a novel routing metric that uses the history of encounters between nodes, and the nodal residual energy. Simulation results show that our approach is able to extend Network Lifetime and achieve good delivery statistics, as compared to state-of-the-art solutions.
Ivan Lee - One of the best experts on this subject based on the ideXlab platform.
-
Distributed Algorithms for Network Lifetime Maximization in Wireless Visual Sensor Networks
IEEE Transactions on Circuits and Systems for Video Technology, 2009Co-Authors: Ivan Lee, Ling GuanAbstract:Network Lifetime maximization is a critical issue in wireless sensor Networks since each sensor has a limited energy supply. In contrast with conventional sensor Networks, video sensor nodes compress the video before transmission. The encoding process demands a high power consumption, and thus raises a great challenge to the maintenance of a long Network Lifetime. In this paper, we examine a strategy for maximizing the Network Lifetime in wireless visual sensor Networks by jointly optimizing the source rates, the encoding powers, and the routing scheme. Fully distributed algorithms are developed using the Lagrangian duality to solve the Lifetime maximization problem. We also examine the relationship between the collected video quality and the maximal Network Lifetime. Through extensive numerical simulations, we demonstrate that the proposed algorithm can achieve a much longer Network Lifetime compared to the scheme optimized for the conventional wireless sensor Networks.
-
ICME - Network Lifetime Maximization in Wireless Visual Sensor Networks using a Distributed Algorithm
Multimedia and Expo 2007 IEEE International Conference on, 2007Co-Authors: Ivan Lee, Ling GuanAbstract:Network Lifetime maximization is a critical issue in wireless sensor Networks since each sensor has a limited energy supply. Different from conventional sensors, video sensors compress the captured video before transmission. The encoding processing demands high power consumption, thus raises challenges to maintain a long Network Lifetime. In this paper, we formulate the Network Lifetime maximization problem in wireless visual sensor Networks, and propose a fully distributed algorithm to solve this problem. The proposed algorithm maximizes the Network Lifetime by jointly optimizing the encoding powers, the source rates, and the link rates.
