Coverage, connectivity and communication (C3) protocol method for wireless sensor networks

• US 9,148,849 B2
• Filed: 06/03/2013
• Issued: 09/29/2015
• Est. Priority Date: 06/03/2013
• Status: Active Grant

• Current Assignee: King Abdul AZIZ City For Science and Technology, King Fahd University Of Petroleum And Minerals
• Original Assignee: King Abdul AZIZ City For Science and Technology, King Fahd University Of Petroleum And Minerals
• Inventors: Akhlaq, Muhammad, Sheltami, Tarek R.
• Primary Examiner(s): Rutkowski, Jeffrey M
• Assistant Examiner(s): WOOD, JONATHAN
• Application Number:
  US13/909,023
• Publication Number:
  US 20140355499A1
• Time in Patent Office: 848 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: H04W 4/38 for collecting sensor information
• CPC Class Codes: H04W 52/0203 in the radio access network or backbone network of wireless communication networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

The coverage, connectivity and communication (C3) protocol method for wireless sensor networks is an integrated and energy-efficient protocol for Coverage, Connectivity and Communication (C3) in WSNs. The C3 protocol uses RSSI to divide the network into virtual rings, defines clusters with clusterheads more probably at alternating rings, defines dings, which are rings inside a cluster, uses triangular tessellation to identify redundant nodes, and communicates data to sink through clusterheads and gateways. The protocol strives for near-optimal deployment, load balancing, and energy-efficient communication. Simulation results show that the C3 protocol ensures partial coverage of more than 90% of the total deployment area, ensures 1-connected network, and facilitates energy-efficient communication, while expending only ¼th of the energy compared to other related protocols.

Claims

1. A computer-implemented coverage, connectivity and communication (C3) protocol method for a wireless sensor network (WSN), comprising the steps of:

establishing a plurality of nodes, including a sink node;

measuring received signal strength indication (RSSI) of the nodes relative to the sink node and relative to each other;

designating ring membership status to the nodes based on predetermined RSSI thresholds determined from the measuring step, the ring membership status designating step assigning each node to one of a plurality of rings extending from a first node ring to an Nth node ring based on the relative RSSI measurements;

determining required distances between said rings using said predetermined RSSI thresholds;

determining an optimal width u of said rings by using a communication range R_c of said nodes and by computing said optimal width u as being 40% of the communication range R_c;

setting said communication range R_c=√

{square root over (3)}R_S where R_S is a sensing range of said sensors;

forming a ring inside of said cluster based on said communication range R_c;

increasing the probability of a node to be selected as a clusterhead in odd-number rings during a given round of network formation and alternatively increasing the probability of said node to be selected as a clusterhead in even-numbered rings during a subsequent round of network formation, wherein neighboring nodes in a lower numbered ring join a cluster associated with said clusterhead; and

establishing wireless communication links between neighboring nodes and gateways of the WSN.

2. The computer-implemented C3 protocol method for wireless sensor networks according to claim 1, further comprising the steps of:

using triangular tessellation inside said cluster to identify a redundant node; and

scheduling said redundant node to sleep for a predetermined time period T.

3. The computer-implemented C3 protocol method for wireless sensor networks according to claim 2, further comprising the step of establishing communication links between neighboring clusterheads.

4. The computer-implemented C3 protocol method for wireless sensor networks according to claim 3, further comprising the step of connecting said network based on a total number of said nodes present in an area defined by circumferential intersection of a sensing range of a target node and a communication range of said sink to all said nodes belonging to an inner adjacent ring to the ring of said target node, wherein a total number of potential forwarders K_N=2.721pu² where p is a density of said network.

5. A computer software product, comprising a non-transitory medium readable by a processor, the non-transitory medium having stored thereon a set of instructions for performing a coverage, connectivity and communication (C3) protocol method for a wireless sensor network (WSN), the set of instructions including:

(a) a first sequence of instructions which, when executed by the processor, causes said processor to establish a plurality of nodes including a sink node;

(b) a second sequence of instructions which, when executed by the processor, causes said processor to measure received signal strength indication (RSSI) of said nodes relative to said sink node and relative to each other;

(c) a third sequence of instructions which, when executed by the processor, causes said processor to designate ring membership status to said nodes based on predetermined RSSI thresholds determined from said measuring step, wherein said ring membership status designating step assigns each node to one of a plurality of rings extending from a 1st node ring to an Nth node ring based on said relative RSSI measurements; and

(d) a fourth sequence of instructions which, when executed by the processor, causes said processor to determine required distances between said rings using said predetermined RSSI thresholds;

(e) a fifth sequence of instructions which, when executed by the processor, causes said processor to determine an optimal width u of said rings by using a communication range R_c of said nodes and by computing said optimal width u as being 40% of the communication range R_c;

(f) a sixth sequence of instructions which, when executed by the processor, causes said processor to set said communication range R_c =√

{square root over (3)}R_S where R_S is a sensing range of said sensors;

(g) a seventh sequence of instructions which, when executed by the processor, causes said processor to form a ring inside of said cluster based on said communication range R_c;

(h) an eighth sequence of instructions which, when executed by the processor, causes said processor to increase the probability of a node to be selected as a clusterhead in odd- number rings during a given round of network formation and alternatively increase the probability of said node to be selected as a clusterhead in even-numbered rings during a subsequent round of network formation, wherein neighboring nodes in a lower numbered ring join a cluster associated with said clusterhead;

(i) a ninth sequence of instructions which, when executed by the processor, causes said processor to establish wireless communication links between neighboring said nodes and gateways of said WSN.

6. The computer software product according to claim 5, further comprising:

a tenth sequence of instructions which, when executed by the processor, causes said processor to use triangular tessellation inside said cluster to identify a redundant node; and

an eleventh sequence of instructions which, when executed by the processor, causes said processor to schedule said redundant node to sleep for a predetermined time period T.

7. The computer software product according to claim 6, further comprising a twelfth sequence of instructions which, when executed by the processor, causes said processor to establish communication links between neighboring clusterheads.

8. The computer software product according to claim 7, further comprising a thirteenth sequence of instructions which, when executed by the processor, causes said processor to connect said network based on a total number of said nodes present in an area defined by circumferential intersection of a sensing range of a target node and a communication range of said sink to all said nodes belonging to an inner adjacent ring to the ring of said target node, wherein a total number of potential forwarding nodes K_N=2.721pu² where p is a density of said network.