<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns="http://purl.org/rss/1.0/">
<channel rdf:about="http://www.inderscience.com/current_issue_rss/index.php?journal=ijsnet">
<title>Most recent issue published online for the International Journal of Sensor Networks.</title>
<description>International Journal of Sensor Networks</description>
<link>http://www.inderscience.com/browse/index.php?journalID=186&amp;year=2012&amp;vol=11&amp;issue=1</link>
<dc:publisher>Inderscience Publishers Ltd</dc:publisher>
<dc:language>en-uk</dc:language>
<prism:publicationName>International Journal of Sensor Networks</prism:publicationName>
<prism:issn>1748-1279</prism:issn>
<prism:eIssn>1748-1287</prism:eIssn>
<prism:copyright>&#169; 2012 Inderscience Publishers Ltd</prism:copyright>
<prism:rightsAgent>editor@inderscience.com</prism:rightsAgent>
<image rdf:resource="https://www.inderscience.com/images/files/coverImgs/ijsnet_scoverijsnet.jpg" />
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJSNET.2012.045035" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJSNET.2012.045036" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJSNET.2012.045037" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJSNET.2012.045033" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJSNET.2012.045038" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJSNET.2012.045034" />
</rdf:Seq>
</items>
</channel>
<image rdf:about="https://www.inderscience.com/images/files/coverImgs/ijsnet_scoverijsnet.jpg">
<title>International Journal of Sensor Networks</title>
<url>https://www.inderscience.com/images/files/coverImgs/ijsnet_scoverijsnet.jpg</url>
<link>http://www.inderscience.com/browse/index.php?journalID=186&amp;year=2012&amp;vol=11&amp;issue=1</link>
</image>
<item rdf:about="http://dx.doi.org/10.1504/IJSNET.2012.045035">
<title>Mobile multimedia in wireless sensor networks</title>
<link>http://www.inderscience.com/link.php?id=45035</link>
<description>One of the most referred and promising Wireless Sensor Network &#40;WSN&#41; applications is health monitoring. The small size and portability of nodes have made WSNs the perfect tool to easily monitor a person&#39;s health condition. In this type application, as well as in several other critical applications, reliability and mobility are paramount. In this paper we propose a method, based on WSNs and mobile intra&#45;body sensors, to accurately detect the fertile period of women on time and other applications based on intra&#45;vaginal temperature monitoring. In addition, our proposal also introduces the proposal of intra&#45;body micro&#45;cameras to monitor the women&#39;s cervix, capable to detect related pathologies. To efficiently support this mobile multimedia application, guaranteeing reliability in a continuous monitoring mode, we make use of a new WSN paradigm based on mobility proxies.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45035"><b>Mobile multimedia in wireless sensor networks</b></A><br />Ricardo Silva; Jorge S&#225; Silva; Jo&#227;o Manuel L.P. Caldeira; Joel J.P.C. Rodrigues<br /><i>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 3 - 9</i><br />One of the most referred and promising Wireless Sensor Network &#40;WSN&#41; applications is health monitoring. The small size and portability of nodes have made WSNs the perfect tool to easily monitor a person&#39;s health condition. In this type application, as well as in several other critical applications, reliability and mobility are paramount. In this paper we propose a method, based on WSNs and mobile intra&#45;body sensors, to accurately detect the fertile period of women on time and other applications based on intra&#45;vaginal temperature monitoring. In addition, our proposal also introduces the proposal of intra&#45;body micro&#45;cameras to monitor the women&#39;s cervix, capable to detect related pathologies. To efficiently support this mobile multimedia application, guaranteeing reliability in a continuous monitoring mode, we make use of a new WSN paradigm based on mobility proxies.</p>]]></content:encoded>
<dc:identifier>10.1504/IJSNET.2012.045035</dc:identifier>
<dc:source>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 3 - 9</dc:source>
<dc:creator>Ricardo Silva; Jorge S&#225; Silva; Jo&#227;o Manuel L.P. Caldeira; Joel J.P.C. Rodrigues</dc:creator>
<dc:contributor>Department of Informatics Engineering, University of Coimbra, P&#243;lo II &#150; Pinhal de Marrocos, 3030&#45;290 Coimbra, Portugal. &#39; Department of Informatics Engineering, University of Coimbra, P&#243;lo II &#150; Pinhal de Marrocos, 3030&#45;290 Coimbra, Portugal. &#39; Instituto de Telecomunica&#231;&#245;es, Department of Informatics, University of Beira Interior, Rua Marqu&#234;s D&#39;&#193;vila e Bolama, 6201&#45;001 Covilh&#227;, Portugal. &#39; Instituto de Telecomunica&#231;&#245;es, Department of Informatics, University of Beira Interior, Rua Marqu&#234;s D&#39;&#193;vila e Bolama, 6201&#45;001 Covilh&#227;, Portugal</dc:contributor>
<dc:subject>body sensors</dc:subject>
<dc:subject>mobility proxies</dc:subject>
<dc:subject>mobile multimedia</dc:subject>
<dc:subject>wireless sensor networks</dc:subject>
<dc:subject>WSNs</dc:subject>
<dc:subject>health monitoring</dc:subject>
<dc:subject>healthcare technology</dc:subject>
<dc:subject>fertile periods</dc:subject>
<dc:subject>female fertility</dc:subject>
<dc:subject>intra&#45;vaginal temperature monitoring</dc:subject>
<dc:subject>cervix monitoring.</dc:subject>
<dc:date>2012-01-22T23:20:50-05:00</dc:date>
<prism:volume>11</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>3</prism:startingPage>
<prism:endingPage>9</prism:endingPage>
<prism:publicationDate>2012-01-22T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJSNET.2012.045036">
<title>Streaming multimedia over WMSNs&#58; an online multipath routing protocol</title>
<link>http://www.inderscience.com/link.php?id=45036</link>
<description>Routing is a challenge to Wireless Multimedia Sensor Networks &#40;WMSNs&#41; for supporting multimedia applications due to nodes&#39; energy constraints and computational capabilities, and the ways sensor nodes obtain forwarding information. In this paper, we propose an online multipath routing protocol that uses nodes&#39; positions to make forwarding decisions at each hop. Real&#45;time decisions are made without any need to have the entire network topology knowledge. The protocol achieves load&#45;balancing and minimises nodes&#39; energy consumption by utilising&#58; &#40;a&#41; smart greedy forwarding scheme for selecting next hop, and &#40;b&#41; walking back forwarding scheme to bypass network holes. Performance comparisons of the proposed protocol &#40;schemes&#41; are made with TPGF and GPSR. The results show that our schemes&#58; &#40;a&#41; maximise the overall network lifespan by not draining energy from some specific nodes, &#40;b&#41; provide QoS delivery for video streams by using best nodes along the route, and &#40;c&#41; scale better in high&#45;density WMSN.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45036"><b>Streaming multimedia over WMSNs&#58; an online multipath routing protocol</b></A><br />Samir Medjiah; Toufik Ahmed; Abolghasem Hamid Asgari<br /><i>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 10 - 21</i><br />Routing is a challenge to Wireless Multimedia Sensor Networks &#40;WMSNs&#41; for supporting multimedia applications due to nodes&#39; energy constraints and computational capabilities, and the ways sensor nodes obtain forwarding information. In this paper, we propose an online multipath routing protocol that uses nodes&#39; positions to make forwarding decisions at each hop. Real&#45;time decisions are made without any need to have the entire network topology knowledge. The protocol achieves load&#45;balancing and minimises nodes&#39; energy consumption by utilising&#58; &#40;a&#41; smart greedy forwarding scheme for selecting next hop, and &#40;b&#41; walking back forwarding scheme to bypass network holes. Performance comparisons of the proposed protocol &#40;schemes&#41; are made with TPGF and GPSR. The results show that our schemes&#58; &#40;a&#41; maximise the overall network lifespan by not draining energy from some specific nodes, &#40;b&#41; provide QoS delivery for video streams by using best nodes along the route, and &#40;c&#41; scale better in high&#45;density WMSN.</p>]]></content:encoded>
<dc:identifier>10.1504/IJSNET.2012.045036</dc:identifier>
<dc:source>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 10 - 21</dc:source>
<dc:creator>Samir Medjiah; Toufik Ahmed; Abolghasem Hamid Asgari</dc:creator>
<dc:contributor>CNRS&#45;LaBRI&#47;Universit&#233; de Bordeaux&#45;1, 351, Cours de la Lib&#233;ration, 33405 &#150; Talence Cedex, France. &#39; CNRS&#45;LaBRI&#47;Universit&#233; de Bordeaux&#45;1, 351, Cours de la Lib&#233;ration, 33405 &#150; Talence Cedex, France. &#39; Thales Research and Technology &#40;UK&#41; Ltd., Worton Drive, Worton Grange Business Park, Berkshire, RG2 0SB, UK</dc:contributor>
<dc:subject>WSNs</dc:subject>
<dc:subject>WMSN</dc:subject>
<dc:subject>online multipath routing</dc:subject>
<dc:subject>geographic routing</dc:subject>
<dc:subject>angle routing</dc:subject>
<dc:subject>multipath routing</dc:subject>
<dc:subject>energy aware routing</dc:subject>
<dc:subject>QoS</dc:subject>
<dc:subject>quality of service</dc:subject>
<dc:subject>streaming multimedia</dc:subject>
<dc:subject>wireless sensor networks</dc:subject>
<dc:subject>load balancing</dc:subject>
<dc:subject>energy consumption</dc:subject>
<dc:subject>wireless multimedia sensor networks.</dc:subject>
<dc:date>2012-01-22T23:20:50-05:00</dc:date>
<prism:volume>11</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>10</prism:startingPage>
<prism:endingPage>21</prism:endingPage>
<prism:publicationDate>2012-01-22T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJSNET.2012.045037">
<title>Low memory image stitching and compression for WMSN using strip&#45;based processing</title>
<link>http://www.inderscience.com/link.php?id=45037</link>
<description>Due to the limited Field&#45;Of&#45;View &#40;FOV&#41; of a single camera, it is sometimes desired to extend the FOV using multiple cameras. Image stitching is one of the methods that can be used to exploit and remove the redundancy created by the overlapping FOV. However, the memory requirement and the amount of computation for conventional implementation of image stitching are very high. In this paper, this problem is resolved by performing the image stitching and compression in a strip&#45;by&#45;strip manner. First, the stitching parameters are determined by transmitting two reference images to an intermediate node to perform the processing. Then, these parameters are transmitted back to the visual node and stored in there. These parameters will be used to determine the way of stitching the incoming images in a strip&#45;by&#45;strip manner. After the stitching of a strip is done, it can be further compressed using a strip&#45;based compression technique.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45037"><b>Low memory image stitching and compression for WMSN using strip&#45;based processing</b></A><br />Wai Chong Chia; Li Wern Chew; Li&#45;Minn Ang; Kah Phooi Seng<br /><i>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 22 - 32</i><br />Due to the limited Field&#45;Of&#45;View &#40;FOV&#41; of a single camera, it is sometimes desired to extend the FOV using multiple cameras. Image stitching is one of the methods that can be used to exploit and remove the redundancy created by the overlapping FOV. However, the memory requirement and the amount of computation for conventional implementation of image stitching are very high. In this paper, this problem is resolved by performing the image stitching and compression in a strip&#45;by&#45;strip manner. First, the stitching parameters are determined by transmitting two reference images to an intermediate node to perform the processing. Then, these parameters are transmitted back to the visual node and stored in there. These parameters will be used to determine the way of stitching the incoming images in a strip&#45;by&#45;strip manner. After the stitching of a strip is done, it can be further compressed using a strip&#45;based compression technique.</p>]]></content:encoded>
<dc:identifier>10.1504/IJSNET.2012.045037</dc:identifier>
<dc:source>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 22 - 32</dc:source>
<dc:creator>Wai Chong Chia; Li Wern Chew; Li&#45;Minn Ang; Kah Phooi Seng</dc:creator>
<dc:contributor>Department of Electrical and Electronic Engineering, The University of Nottingham Malaysia Campus, Jalan Broga, 43500, Semenyih, Selangor Darul Ehsan, Malaysia. &#39; Department of Electrical and Electronic Engineering, The University of Nottingham Malaysia Campus, Jalan Broga, 43500, Semenyih, Selangor Darul Ehsan, Malaysia. &#39; Department of Electrical and Electronic Engineering, The University of Nottingham Malaysia Campus, Jalan Broga, 43500, Semenyih, Selangor Darul Ehsan, Malaysia. &#39; Department of Electrical and Electronic Engineering, The University of Nottingham Malaysia Campus, Jalan Broga, 43500, Semenyih, Selangor Darul Ehsan, Malaysia</dc:contributor>
<dc:subject>WMSNs</dc:subject>
<dc:subject>wireless multimedia sensor networks</dc:subject>
<dc:subject>low memory image stitching</dc:subject>
<dc:subject>image compression</dc:subject>
<dc:subject>strip&#45;based processing</dc:subject>
<dc:subject>multiple cameras</dc:subject>
<dc:subject>wireless sensor networks</dc:subject>
<dc:subject>WSNs</dc:subject>
<dc:subject>field of view</dc:subject>
<dc:subject>overlapping FOV.</dc:subject>
<dc:date>2012-01-22T23:20:50-05:00</dc:date>
<prism:volume>11</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>22</prism:startingPage>
<prism:endingPage>32</prism:endingPage>
<prism:publicationDate>2012-01-22T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJSNET.2012.045033">
<title>Low&#45;memory video compression architecture using strip&#45;based processing for implementation in wireless multimedia sensor networks</title>
<link>http://www.inderscience.com/link.php?id=45033</link>
<description>This paper presents a very low&#45;memory video compression architecture for implementation in a wireless multimedia sensor network. The approach employs a strip&#45;based processing technique where a group of image sequences is partitioned into strips, and each strip is encoded separately. A new one&#45;dimensional, memory&#45;addressing method is proposed to store the wavelet coefficients at predetermined locations in the strip buffer for ease of coding. To further reduce the memory requirements, the video&#45;coding scheme uses a modified set&#45;partitioning in hierarchical trees algorithm to give a high compression performance. The proposed work is implemented using a soft&#45;core microprocessor&#45;based approach. Simulation tests conducted have verified that even though the proposed video compression architecture using strip&#45;based processing requires a much less complex hardware implementation and its efficient memory organisation uses a lesser amount of embedded memory for processing and buffering, it can still achieve a very good compression performance.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45033"><b>Low&#45;memory video compression architecture using strip&#45;based processing for implementation in wireless multimedia sensor networks</b></A><br />Li Wern Chew; Wai Chong Chia; Li&#45;Minn Ang; Kah Phooi Seng<br /><i>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 33 - 47</i><br />This paper presents a very low&#45;memory video compression architecture for implementation in a wireless multimedia sensor network. The approach employs a strip&#45;based processing technique where a group of image sequences is partitioned into strips, and each strip is encoded separately. A new one&#45;dimensional, memory&#45;addressing method is proposed to store the wavelet coefficients at predetermined locations in the strip buffer for ease of coding. To further reduce the memory requirements, the video&#45;coding scheme uses a modified set&#45;partitioning in hierarchical trees algorithm to give a high compression performance. The proposed work is implemented using a soft&#45;core microprocessor&#45;based approach. Simulation tests conducted have verified that even though the proposed video compression architecture using strip&#45;based processing requires a much less complex hardware implementation and its efficient memory organisation uses a lesser amount of embedded memory for processing and buffering, it can still achieve a very good compression performance.</p>]]></content:encoded>
<dc:identifier>10.1504/IJSNET.2012.045033</dc:identifier>
<dc:source>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 33 - 47</dc:source>
<dc:creator>Li Wern Chew; Wai Chong Chia; Li&#45;Minn Ang; Kah Phooi Seng</dc:creator>
<dc:contributor>Department of Electrical and Electronic Engineering, University of Nottingham, 43500 Selangor, Malaysia. &#39; Department of Electrical and Electronic Engineering, University of Nottingham, 43500 Selangor, Malaysia. &#39; Department of Electrical and Electronic Engineering, University of Nottingham, 43500 Selangor, Malaysia. &#39; School of Computer Technology, Sunway University, 46150 Selangor, Malaysia</dc:contributor>
<dc:subject>low&#45;memory video compression</dc:subject>
<dc:subject>SPIHT</dc:subject>
<dc:subject>set partitioning</dc:subject>
<dc:subject>hierarchical trees</dc:subject>
<dc:subject>strip&#45;based coding</dc:subject>
<dc:subject>video compression architecture</dc:subject>
<dc:subject>wireless multimedia sensor networks</dc:subject>
<dc:subject>WMSNs</dc:subject>
<dc:subject>wireless sensor networks</dc:subject>
<dc:subject>WSNs</dc:subject>
<dc:subject>simulation.</dc:subject>
<dc:date>2012-01-22T23:20:50-05:00</dc:date>
<prism:volume>11</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>33</prism:startingPage>
<prism:endingPage>47</prism:endingPage>
<prism:publicationDate>2012-01-22T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJSNET.2012.045038">
<title>Low&#45;power sensor node with addressable wake&#45;up on&#45;demand capability</title>
<link>http://www.inderscience.com/link.php?id=45038</link>
<description>The ambition to equip more and more consumer products with sensor intelligence and communication capability entails two major demands for wireless sensor nodes. First, they have to operate for several years. Second, they must be permanently accessible for communication requests. These two demands are in contrast to each other. Regarding a transceiver in permanent receiving mode, the power consumption of a few milliwatts implicates a lifetime in the order of days for a common battery. Addressing the challenge to solve these conflicts, we present a new wake&#45;up receiver approach in this paper. Our solution consumes 5.6 &amp;mu;W of power while listening for a communication request. Furthermore, it possesses a 16&#45;bit address coding for specific WSN wake&#45;up. And moreover, an improved impedance matching with a high sensitivity improves the wake&#45;up distance significantly to 40 m at &#43;10 dBm output power. This approach empowers wireless sensor nodes for the first time to be usable for a wide range of applications.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45038"><b>Low&#45;power sensor node with addressable wake&#45;up on&#45;demand capability</b></A><br />G.U. Gamm; M. Kostic; M. Sippel; L.M. Reindl<br /><i>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 48 - 56</i><br />The ambition to equip more and more consumer products with sensor intelligence and communication capability entails two major demands for wireless sensor nodes. First, they have to operate for several years. Second, they must be permanently accessible for communication requests. These two demands are in contrast to each other. Regarding a transceiver in permanent receiving mode, the power consumption of a few milliwatts implicates a lifetime in the order of days for a common battery. Addressing the challenge to solve these conflicts, we present a new wake&#45;up receiver approach in this paper. Our solution consumes 5.6 &amp;mu;W of power while listening for a communication request. Furthermore, it possesses a 16&#45;bit address coding for specific WSN wake&#45;up. And moreover, an improved impedance matching with a high sensitivity improves the wake&#45;up distance significantly to 40 m at &#43;10 dBm output power. This approach empowers wireless sensor nodes for the first time to be usable for a wide range of applications.</p>]]></content:encoded>
<dc:identifier>10.1504/IJSNET.2012.045038</dc:identifier>
<dc:source>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 48 - 56</dc:source>
<dc:creator>G.U. Gamm; M. Kostic; M. Sippel; L.M. Reindl</dc:creator>
<dc:contributor>Laboratory for Electrical Instrumentation, Department of Microsystems Engineering, Institute of Microsystems Technology &#40;IMTEK&#41;, Georges&#45;Koehler&#45;Allee 103, 79110 Freiburg, Germany. &#39; Laboratory for Electrical Instrumentation, Department of Microsystems Engineering, Institute of Microsystems Technology &#40;IMTEK&#41;, Georges&#45;Koehler&#45;Allee 103, 79110 Freiburg, Germany. &#39; Laboratory for Electrical Instrumentation, Department of Microsystems Engineering, Institute of Microsystems Technology &#40;IMTEK&#41;, Georges&#45;Koehler&#45;Allee 103, 79110 Freiburg, Germany. &#39; Laboratory for Electrical Instrumentation, Department of Microsystems Engineering, Institute of Microsystems Technology &#40;IMTEK&#41;, Georges&#45;Koehler&#45;Allee 103, 79110 Freiburg, Germany</dc:contributor>
<dc:subject>wireless sensor nodes</dc:subject>
<dc:subject>WSNs</dc:subject>
<dc:subject>wireless sensor networks</dc:subject>
<dc:subject>wake&#45;up receiver</dc:subject>
<dc:subject>wake&#45;up radio</dc:subject>
<dc:subject>on&#45;demand wake&#45;up</dc:subject>
<dc:subject>low power sensor nodes.</dc:subject>
<dc:date>2012-01-22T23:20:50-05:00</dc:date>
<prism:volume>11</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>48</prism:startingPage>
<prism:endingPage>56</prism:endingPage>
<prism:publicationDate>2012-01-22T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJSNET.2012.045034">
<title>An approximation algorithm for dominating nodes selection in multi&#45;channel multi&#45;radio wireless sensor networks</title>
<link>http://www.inderscience.com/link.php?id=45034</link>
<description>In this paper, we study the dominating selection optimisation problem with multiple channels and multiple radios in wireless sensor networks. The objective is to maximise the number of targets covered while selecting at most k nodes and at most k&amp;lt;SUB align&#61;&#34;right&#34;&amp;gt;i channels with each selected node v&amp;lt;SUB align&#61;&#34;right&#34;&amp;gt;i. Our problem is a general case of the &amp;lt;em&amp;gt;maximum coverage&amp;lt;&#47;em&amp;gt; problem. We propose two algorithms&#58; the first one is based on linear programming and PIPAGE rounding, in which its approximation ratio is 1&#47;K&#40;1&amp;minus;&#40;1&amp;minus;1&#47;m&#41;&amp;lt;SUP align&#61;&#34;right&#34;&amp;gt;m&amp;lt;&#47;SUP&amp;gt;&#41;, where m is the number of the dominating nodes and K &#61; max k&amp;lt;SUB align&#61;&#34;right&#34;&amp;gt;i. The second algorithm is based on greedy strategy with low time complexity. The simulation shows that the both two algorithms have good performance.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45034"><b>An approximation algorithm for dominating nodes selection in multi&#45;channel multi&#45;radio wireless sensor networks</b></A><br />Deying Li; Lin Liu; Hongwei Du<br /><i>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 57 - 65</i><br />In this paper, we study the dominating selection optimisation problem with multiple channels and multiple radios in wireless sensor networks. The objective is to maximise the number of targets covered while selecting at most k nodes and at most k&amp;lt;SUB align&#61;&#34;right&#34;&amp;gt;i channels with each selected node v&amp;lt;SUB align&#61;&#34;right&#34;&amp;gt;i. Our problem is a general case of the &amp;lt;em&amp;gt;maximum coverage&amp;lt;&#47;em&amp;gt; problem. We propose two algorithms&#58; the first one is based on linear programming and PIPAGE rounding, in which its approximation ratio is 1&#47;K&#40;1&amp;minus;&#40;1&amp;minus;1&#47;m&#41;&amp;lt;SUP align&#61;&#34;right&#34;&amp;gt;m&amp;lt;&#47;SUP&amp;gt;&#41;, where m is the number of the dominating nodes and K &#61; max k&amp;lt;SUB align&#61;&#34;right&#34;&amp;gt;i. The second algorithm is based on greedy strategy with low time complexity. The simulation shows that the both two algorithms have good performance.</p>]]></content:encoded>
<dc:identifier>10.1504/IJSNET.2012.045034</dc:identifier>
<dc:source>International Journal of Sensor Networks, Vol. 11, No. 1 (2012) pp. 57 - 65</dc:source>
<dc:creator>Deying Li; Lin Liu; Hongwei Du</dc:creator>
<dc:contributor>Key Laboratory of Data Engineering and Knowledge Engineering, Ministry of Education, Renmin University of China, Beijing 100872, China; School of Information, Renmin University of China, Beijing 100872, China. &#39; School of Information, Renmin University of China, Beijing 100872, China. &#39; Department of Computer Science and Technology, Harbin Insitute of Technology Shenzhen Graduate School Shenzhen, Shenzen 518055, China</dc:contributor>
<dc:subject>dominant node selection</dc:subject>
<dc:subject>multi&#45;channel networks</dc:subject>
<dc:subject>multi&#45;radio networks</dc:subject>
<dc:subject>wireless sensor networks</dc:subject>
<dc:subject>WSNs</dc:subject>
<dc:subject>approximation algorithm</dc:subject>
<dc:subject>optimisation.</dc:subject>
<dc:date>2012-01-22T23:20:50-05:00</dc:date>
<prism:volume>11</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>57</prism:startingPage>
<prism:endingPage>65</prism:endingPage>
<prism:publicationDate>2012-01-22T23:20:50-05:00</prism:publicationDate>
</item>
</rdf:RDF>

