bullet Sensors & Transducers Journal

    (ISSN: 2306-8515, e-ISSN 1726-5479)

0.705

2013 Global Impact Factor

205.767

2008 e-Impact Factor

25 Top Downloaded Articles

Best Selling Articles 2012

Journal Subscription 2014

Editorial Calendar

Submit an Article

Editorial Board

Current Issue

S&T journal's cover

Sensors & Transducers Journal 2011

Sensors & Transducers Journal 2010

Sensors & Transducers Journal 2009

Sensors & Transducers Journal 2008

Sensors & Transducers Journal 2007

2000-2002 S&T e-Digest Contents

2003 S&T e-Digest Contents

2004 S&T e-Digest Contents

2005 S&T e-Digest Contents

2006 S&T e-Digest Contents

 

Best Articles 2011

 

 

 

Vol. 174, Issue 7, July 2014, pp. 60-66

 

Bullet

 

An Intuitive Dominant Test Algorithm of CP-nets Applied on Wireless Sensor Network
 

1 Liu Zhaowei, 2 Zhang Chenghui, 3 Liu Jinglei

1, 2 Shandong University, No. 17923, Jingshi Road of Jinan, 250061, China
1, 3 Yantai University, No. 30, Qingquan Road of Yantai, 264005, China
1 Tel.: +13792500980

1 E-mail: lzw@ytu.edu.cn

 

Received: 12 May 2014 /Accepted: 30 June 2014 /Published: 31 July 2014

Digital Sensors and Sensor Sysstems

 

Abstract: A wireless sensor network is of spatially distributed with autonomous sensors, just like a multi-Agent system with single Agent. Conditional Preference networks is a qualitative tool for representing ceteris paribus (all other things being equal) preference statements, it has been a research hotspot in artificial intelligence recently. But the algorithm and complexity of strong dominant test with respect to binary-valued structure CP-nets have not been solved, and few researchers address the application to other domain. In this paper, strong dominant test and application of CP-nets are studied in detail. Firstly, by constructing induced graph of CP-nets and studying its properties, we make a conclusion that the problem of strong dominant test on binary-valued CP-nets is single source shortest path problem essentially, so strong dominant test problem can be solved by improved Dijkstra’s algorithm. Secondly, we apply the algorithm above mentioned to the completeness of wireless sensor network, and design a completeness judging algorithm based on strong dominant test. Thirdly, we apply the algorithm on wireless sensor network to solve routing problem. In the end, we point out some interesting work in the future.

 

Keywords: CP-Nets, WSN, Strong dominant test, Improved Dijkstra’s algorithm, Completeness.

 

Acrobat reader logo Click <here> or title of paper to download the full pages article in pdf format

 

 

Subscribe the full-page Sensors & Transducers journal in print (paper) or pdf formats

(shipping cost by standard mail for paper version is included)

(25 % discount for IFSA Members)

 

 

 

Alternatively we accept a money transfer to our bank account. Please contact for details: sales@sensorsportal.com

 

 

Download <here> the Library Journal Recommendation Form

 

 

Read more about Wireless Sensor Networks

 

 

 

 

 


1999 - 2014 Copyright ©, International Frequency Sensor Association (IFSA) Publishing, S.L. All Rights Reserved.


Home - News - Links - Archives - Tools - Voltage-to-Frequency Converters - Standardization - Patents - Marketplace - Projects - Wish List - e-Shop - Sensor Jobs - Membership - Videos - Publishing - Site Map - Subscribe - Search

 Members Area -Sensors Portal -Training Courses - S&T Digest - For advertisers - Bookstore - Forums - Polls - Submit Press Release - Submit White Paper - Testimonies - Twitter - Facebook - LinkedIn