Priority-Based Energy Aware and Coverage Preserving Routing for Wireless Sensor Network

Dong, Yunquan; Quan, Qingyi; Jian, Zhang

doi:10.1109/vetecs.2008.41

Cited by 6 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ruan et.al. [5] also fix length of strings in order to obtain a decidable fragment, but don't consider increasing the size of strings in the search of models. Shannon et.al.…”

Section: Resultsmentioning

confidence: 99%

Path Feasibility Analysis for String-Manipulating Programs

Bjørner

Tillmann

Воронков

2009

Tools and Algorithms for the Construction and Analysis of Systems

142

169

View full text Add to dashboard Cite

Abstract. We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this problem, including its undecidability in the general case and decidability of some special cases. In the context of test-case generation, we are interested in an efficient finite model finding method for string constraints. To this end we develop a two-tier finite model finding procedure. First, an integer abstraction of string constraints are passed to an SMT (Satisfiability Modulo Theories) solver. The abstraction is either unsatisfiable, or the solver produces a model that fixes lengths of enough strings to reduce the entire problem to be finite domain. The resulting fixed-length string constraints are then solved in a second phase. We implemented the procedure in a symbolic execution framework, report on the encouraging results and discuss directions for improving the method further.

show abstract

“…Ruan et.al. [5] also fix length of strings in order to obtain a decidable fragment, but don't consider increasing the size of strings in the search of models. Shannon et.al.…”

Section: Resultsmentioning

confidence: 99%

Path Feasibility Analysis for String-Manipulating Programs

Bjørner

Tillmann

Воронков

2009

Tools and Algorithms for the Construction and Analysis of Systems

142

169

View full text Add to dashboard Cite

show abstract

“…Dakshayini et al [17] proposed an energy aware routing algorithm by assuming that nodes in a network are equipped with global positioning system (GPS). Dong et al [18] proposed Coverage Preserving routing for WSN. To maximize the life time of the energy limited WSN, energy efficient routing algorithms are needed.…”

Section: IImentioning

confidence: 99%

Modified LEACH protocol for sensor network

Upadhyay

Kumar

Tiwari

2015

2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE)

View full text Add to dashboard Cite

Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Prolonged network lifetime, scalability, and load balancing are important requirement for many sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. The primary objectives of the wireless sensor network routing protocol design are balancing network energy consumption and extending the entire network lifetime. Clustering is an effective technique that can greatly contribute to overall system scalability, lifetime, and energy efficiency in wireless sensor networks (WSNs). In this paper, we propose an energy efficient clustering algorithm for WSNs based on the LEACH algorithm. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the most well known energy efficient clustering algorithms for WSNs. The proposed algorithm solves the extra transmissions problem that can occurs in LEACH algorithm.

show abstract