<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
    xmlns:cc="http://web.resource.org/cc/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel rdf:about="http://www.mdpi.com/rss/special_issue/networked-sensors-actuators">
		<title>Future Internet: Networked Sensors and Actuators</title>
		<link>http://www.mdpi.com/journal/futureinternet/special_issues/networked-sensors-actuators/</link>
		<description>Submission Information
All manuscripts should be submitted to futureinternet@mdpi.com with a copy to the Guest Editor. Manuscripts can be submitted until the  deadline. Papers will be published continuously (as soon as accepted)  and will be listed together on the special issue website. Research  articles, review articles as well as communications are invited. For  planned papers, a title and short abstract (about 100 words) can be sent  to the Editorial Office for announcement on this website.   Submitted manuscripts should not have been published previously, nor be  under consideration for publication elsewhere (except conference  proceedings papers). All manuscripts are refereed through a peer-review  process. A guide for authors and other relevant information for  submission of manuscripts is available on the Instructions  for Authors page. Future  Internet is an international peer-reviewed Open Access  quarterly journal published by MDPI.    Please visit the Instructions  for Authors page before submitting a  manuscript. For the first few  issues, to be published in 2009 and 2010, the Article Processing Charges (APC) will be waived for well-prepared manuscripts. English  correction   and/or formatting fees of 250 CHF (Swiss Francs) will be  charged in   certain cases for those articles accepted for publication  that require   extensive additional formatting and/or English  corrections.</description>
								<items>
			<rdf:Seq>
							<rdf:li rdf:resource="http://www.mdpi.com/1999-5903/2/4/469/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/1999-5903/2/3/363/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/1999-5903/2/3/308/" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
	</channel>
	<item rdf:about="http://www.mdpi.com/1999-5903/2/4/469/">
	<title>Future Internet, Vol. 2, Pages 469-504: Node Coloring and Color Conflict Detection in Wireless Sensor Networks</title>
	<link>http://www.mdpi.com/1999-5903/2/4/469/</link>
	<description>In wireless sensor networks, energy efficiency is mainly achieved by making nodes sleep. In this paper, we present the combination of SERENA, a new node activity scheduling algorithm based on node coloring, with TDMA/CA, a collision avoidance MAC protocol. We show that the  combination of these two protocols enables substantial bandwidth and energy benefits for both general and data gathering applications. As a first contribution, we prove that the three-hop node coloring problem is NP-complete. As a second contribution, the overhead induced by SERENA during network coloring is reduced, making possible the use of these protocols even in dense networks with limited bandwidth. The third contribution of this paper is to show that applying any slot assignment algorithmwith spatial reuse based on node neighborhood without taking into account link quality can lead to poor performances because of collisions. The use of good quality links will prevent this phenomenon. The fourth contribution consists of optimizing end-to-end delays for data gathering applications, by means of cross-layering with the application. However, color conflicts resulting from topology changes, mobility and late node arrivals can give rise to collisions. As a fifth contribution, we show how the MAC layer can detect color conflicts, and cope with them at the cost of a slightly reduced throughput. Then, we discuss the tradeoffbetween requesting SERENA to solve the color conflicts and dealing with them at the MAC layer, our third contribution. The combination of SERENA and TDMA/CA is evaluated through simulations on realistic topologies.</description>
	
	<guid>http://www.mdpi.com/1999-5903/2/4/469/</guid>
	<pubDate>Wed, 13 Oct 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Future Internet</prism:publicationName>
	<prism:publicationDate>2010-10-13</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>469</prism:startingPage>
		<prism:endingPage>504</prism:endingPage>
		<prism:issn>1999-5903</prism:issn>
	
	<dc:title>Node Coloring and Color Conflict Detection in Wireless Sensor Networks</dc:title>
	<dc:date>2010-10-13</dc:date>
	<dc:identifier>doi: 10.3390/fi2040469</dc:identifier>
		<dc:creator>Saoucene Mahfoudh</dc:creator>
		<dc:creator>Gerard Chalhoub</dc:creator>
		<dc:creator>Pascale Minet</dc:creator>
		<dc:creator>Michel Misson</dc:creator>
		<dc:creator>Ichrak Amdouni</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/1999-5903/2/3/363/">
	<title>Future Internet, Vol. 2, Pages 363-387: Towards the Robotic “Avatar”: An Extensive Survey of the Cooperation between and within Networked Mobile Sensors</title>
	<link>http://www.mdpi.com/1999-5903/2/3/363/</link>
	<description>Cooperation between networked mobile sensors, wearable and sycophant sensor networks with parasitically sticking agents, and also having human beings involved in the loop is the “Avatarization” within the robotic research community, where all networks are connected and where you can connect/disconnect at any time to acquire data from a vast unstructured world. This paper extensively surveys the networked robotic foundations of this robotic biological “Avatar” that awaits us in the future. Cooperation between networked mobile sensors as well as cooperation of nodes within a network are becoming more robust, fault tolerant and enable adaptation of the networks to changing environment conditions. In this paper, we survey and comparatively discuss the current state of networked robotics via their critical application areas and their design characteristics. We conclude by discussing future challenges.</description>
	
	<guid>http://www.mdpi.com/1999-5903/2/3/363/</guid>
	<pubDate>Tue, 14 Sep 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Future Internet</prism:publicationName>
	<prism:publicationDate>2010-09-14</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>363</prism:startingPage>
		<prism:endingPage>387</prism:endingPage>
		<prism:issn>1999-5903</prism:issn>
	
	<dc:title>Towards the Robotic “Avatar”: An Extensive Survey of the Cooperation between and within Networked Mobile Sensors</dc:title>
	<dc:date>2010-09-14</dc:date>
	<dc:identifier>doi: 10.3390/fi2030363</dc:identifier>
		<dc:creator>Sebahattin Topal</dc:creator>
		<dc:creator>İsmet Erkmen</dc:creator>
		<dc:creator>Aydan M. Erkmen</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/1999-5903/2/3/308/">
	<title>Future Internet, Vol. 2, Pages 308-340: Energy Efficient Routing and Node Activity Scheduling in the
OCARI Wireless Sensor Network</title>
	<link>http://www.mdpi.com/1999-5903/2/3/308/</link>
	<description>Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.</description>
	
	<guid>http://www.mdpi.com/1999-5903/2/3/308/</guid>
	<pubDate>Tue, 17 Aug 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Future Internet</prism:publicationName>
	<prism:publicationDate>2010-08-17</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>308</prism:startingPage>
		<prism:endingPage>340</prism:endingPage>
		<prism:issn>1999-5903</prism:issn>
	
	<dc:title>Energy Efficient Routing and Node Activity Scheduling in the
OCARI Wireless Sensor Network</dc:title>
	<dc:date>2010-08-17</dc:date>
	<dc:identifier>doi: 10.3390/fi2030308</dc:identifier>
		<dc:creator>Saoucene Mahfoudh</dc:creator>
		<dc:creator>Pascale Minet</dc:creator>
		<dc:creator>Ichrak Amdouni</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>


<cc:License rdf:about="http://creativecommons.org/licenses/by/3.0/">
	<cc:permits rdf:resource="http://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="http://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="http://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
