International Scholarly Research Notices

Research Article

𝑀-Connected Coverage Problem in Wireless Sensor Networks

Algorithm 4

𝑀 -connected cover optimization.
1: Input: 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ
2: Output: 𝑂 𝑝 𝑑 . 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 _ 𝐢 π‘œ 𝑣
3: Initialize 𝑂 𝑝 𝑑 β‹… 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 _ 𝐢 π‘œ 𝑣 = πœ™
4: for   𝑖 = 𝑙 𝑒 𝑛 𝑔 𝑑 β„Ž ( 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ ) down to 1 do
5:  if   𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ βˆ’ { 𝑆 𝑖 β‹… 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ }
  meets π‘˜ / 𝑄 coverage requirement and is 𝑀 -connected
  then
6:    𝐼 𝑔 𝑛 π‘œ π‘Ÿ 𝑒    𝑆 𝑖 β‹… 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ
7:    𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ = 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ βˆ’ { 𝑆 𝑖 β‹… 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ }
8:  else
9:    𝑂 𝑝 𝑑 . 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 _ 𝐢 π‘œ 𝑣 = 𝑂 𝑝 𝑑 . 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 _ 𝐢 π‘œ 𝑣 βˆͺ { 𝑆 𝑖 β‹… 𝑀 _ 𝐢 π‘œ 𝑛 𝑛 𝑒 𝑐 𝑑 𝑒 𝑑 _ 𝐢 π‘œ 𝑣 𝑒 π‘Ÿ }
10:  end if
11: end for