Username   Password       Forgot your password?  Forgot your username? 

ISSUES BY YEAR

Volume 8 - 2012

No.1 January 2012
No.2 March 2012
No.3 May 2012

Volume 7 - 2011

No.1 January 2011
No.2 March 2011
No.3 May 2011
No.4 July 2011
No.5 September 2011
No.6 November 2011

Volume 6 - 2010

No.1 January 2010
No.2 March 2010
No.3 May 2010
No.4 July 2010
No.5 September 2010
No.6 November 2010

Volume 5 - 2009

No.1 January 2009
No.2 January 2009
No.3 April 2009
No.4 July 2009
No.5 October 2009

Volume 4 - 2008

No.1 January 2008
No.2 April 2008
No.3 July 2008
No.4 October 2008

Volume 3 - 2007

No.1 January 2007
No.2 April 2007
No.3 July 2007
No.4 October 2007

Volume 2 - 2006

No.1 January 2006
No.2 April 2006
No.3 July 2006
No.4 October 2006

Volume 1 - 2005

No.1 July 2005
No.2 October 2005

Quantifying Application Communication Reliability of Wireless Sensor Networks

Volume 4, Number 1, January 2008 - Paper 4  - pp. 43 - 56

AKHILESH SHRESTHA and LIUDONG XING

Electrical and Computer Engineering Department, University of Massachusetts Dartmouth 285 Old Westport Road, North Dartmouth, MA 02747, USA

(Received on June 28, 2007)


Abstract:

In this paper, we consider the problem of modeling and analyzing the application communication reliability of wireless sensor networks (WSN) with different topologies, including star, tree, mesh, and hierarchical clustering. We propose reliability measures that integrate the conventional connectivity-based network reliability with the sensing coverage measure of WSN. We apply a reduced ordered binary decision diagram (ROBDD) based progressive approach for evaluating the proposed coverage-oriented application communication reliability of WSN. Our study will provide useful insights for the WSN designers in choosing the appropriate network topology. We illustrate the basics and advantages of our approach by working through the analysis of an example WSN.

 

References: 21

 

Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader