<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Write what I think</title>
	<atom:link href="http://tianke.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://tianke.wordpress.com</link>
	<description>Just Do It Without Worry!</description>
	<lastBuildDate>Wed, 31 Oct 2007 14:28:43 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='tianke.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Write what I think</title>
		<link>http://tianke.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://tianke.wordpress.com/osd.xml" title="Write what I think" />
	<atom:link rel='hub' href='http://tianke.wordpress.com/?pushpress=hub'/>
		<item>
		<title>AODV-BR (WCNC2000_185)</title>
		<link>http://tianke.wordpress.com/2007/10/31/aodv-br-wcnc2000_185/</link>
		<comments>http://tianke.wordpress.com/2007/10/31/aodv-br-wcnc2000_185/#comments</comments>
		<pubDate>Wed, 31 Oct 2007 13:54:54 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[ad hoc]]></category>
		<category><![CDATA[aodv]]></category>
		<category><![CDATA[multipath]]></category>
		<category><![CDATA[routing]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/10/31/aodv-br-wcnc2000_185/</guid>
		<description><![CDATA[&#160; AODV-BR (WCNC2000_185) AODV-BR: Backup Routing in Ad hoc Networks 使用AODV路由协议，在回送RREP分组的阶段，建立与主路由（AODV建立的路由）紧密相联的辅助路由。当主路由断路时（由二层协议得到）使用备用路由，既向备用路由下一跳发送数据。 没有增加路由建立的开销，但备用路由的跳数比主路由的跳数增加了，数据传输时增加的开销远大于路由建立的开销。 &#160; (a) 目的节点D向C发送RREP，Y、Z听到后，记录有到D的link &#160;&#160;&#160; &#160; &#160; &#160; &#160; (b) C继续转发RREP包，Y、Z听到，记录有到C的link，W、X同理 &#160;&#160;&#160;&#160; &#160; &#160; &#160; (c)备用路由建立, 一般情况下比主路由跳数多 &#160;&#160;&#160;&#160;&#160; &#160; &#160; &#160; (d)当B离开原来位置致使到C的link失效，则向备用路由下一跳W发送数据<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=29&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/10/31/aodv-br-wcnc2000_185/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/image0141-thumb.png" medium="image" />
	</item>
		<item>
		<title>SMR(ICC2001_322)</title>
		<link>http://tianke.wordpress.com/2007/10/31/smricc2001_322-2/</link>
		<comments>http://tianke.wordpress.com/2007/10/31/smricc2001_322-2/#comments</comments>
		<pubDate>Wed, 31 Oct 2007 13:46:25 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[ad hoc]]></category>
		<category><![CDATA[multipath]]></category>
		<category><![CDATA[routing]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/10/31/smricc2001_322-2/</guid>
		<description><![CDATA[SMR(ICC2001_322) Split multipath routing with maximally disjoint paths in ad hoc networks 特点：以建立最大不相交路径为目的。根据DSR更改，使用源路由方式（在源节点来决定使用什么样的路由，路由信息包涵在数据包的头部）。 协议： 路径寻找：I. RREQ分组的传播： 只转发收到的第一个RREQ，丢弃后面收到的 有选择的转发RREQ分组 源节点广播RREQ分组，中间节点收到后有选择的转发RREQ包的拷贝。 选择的标准： ①分组头部的路径节点不同于第一个路由链中的节点， ②跳数不大于第一个的转发跳数。<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=26&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/10/31/smricc2001_322-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/image-thumb1.png" medium="image">
			<media:title type="html">image</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/image-thumb2.png" medium="image">
			<media:title type="html">image</media:title>
		</media:content>
	</item>
		<item>
		<title>AODVM (INFOCOM2003_100)</title>
		<link>http://tianke.wordpress.com/2007/10/31/aodvm-infocom2003_100-2/</link>
		<comments>http://tianke.wordpress.com/2007/10/31/aodvm-infocom2003_100-2/#comments</comments>
		<pubDate>Wed, 31 Oct 2007 13:37:08 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[multipath]]></category>
		<category><![CDATA[routing]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/10/31/aodvm-infocom2003_100-2/</guid>
		<description><![CDATA[AODVM (INFOCOM2003_100) A Framework for Reliable Routing in Mobile Ad Hoc Networks 提出一种找node-disjoint的路径的方法（号称第一种）： 建立RREQ表来记录每一个RREQ包，而不是丢弃重复的RREQ。 中间节点不直接发送RREP包到源节点。 目的节点对每一个收到的RREQ包都回应一个RREP包，在RREP包中加入last_hop域。 保证每个节点只在一条路经上的方法： 当一个中间节点听到某个邻居节点发送的RREP分组时（这个节点听到的第一个RREP分组，可以认为这下一跳是到目的节点最短的路径上的下一跳），就从自己的RREQ table中删除这个邻居并转发这个RREP分组，同时加一个routing entry 到它的routing table。这样可以保证这个中间节点只在一个route上。 如果一个节点收到RREP包后不能转发下去（由于RREQ table空），则广播RDER(Route Discovery ERror message) 分组给他的邻居，在邻居中找RREQ table中源与该RREP的目的一致的table entry。 使用RRCM(Route Confirmation Message) 确认路由。原因： RREP在路径当中的转发方向是用中间节点决定的，目的节点不知有多少RREP回到源节点。（目的节点有知道这个的必要么？） 文中设计了一种R-nodes (reliable nodes) 的部署方案： 原因： Node-disjoint routing少，失效后引起断路。<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=21&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/10/31/aodvm-infocom2003_100-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/clip-image002-thumb1.gif" medium="image">
			<media:title type="html">AODVM</media:title>
		</media:content>
	</item>
		<item>
		<title>AOMDV （ICNP2001_236）</title>
		<link>http://tianke.wordpress.com/2007/10/31/aomdv-%ef%bc%88icnp2001_236%ef%bc%89/</link>
		<comments>http://tianke.wordpress.com/2007/10/31/aomdv-%ef%bc%88icnp2001_236%ef%bc%89/#comments</comments>
		<pubDate>Wed, 31 Oct 2007 13:01:25 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[aodv]]></category>
		<category><![CDATA[multipath]]></category>
		<category><![CDATA[routing]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/10/31/aomdv-%ef%bc%88icnp2001_236%ef%bc%89/</guid>
		<description><![CDATA[&#xA0; AOMDV （ICNP2001_236） On-demand Multipath Distance Vector Routing in Ad Hoc Networks 协议核心：更新路由表的规则： 当节点i收到节点j，发来的route advertisement时，根据以上规则更新路由表。其中(1)(9)保证没有loop。 如何保证like-disjoint：由flood的性质决定，在flood的过程中一个RREQ包只被转发一次。 在RREQ包中加入firsthop来标识路径的第一跳。这样就可以区分多个由S起始的路径。 每个中间节点为每个RREQ维护一个FirstHop_List。当中间节点收到RREQ包时，不是马上丢弃，而是将该RREQ包中的firsthop域与节点中firsthop_List做对比，看看是不是有新的路由产生。<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=12&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/10/31/aomdv-%ef%bc%88icnp2001_236%ef%bc%89/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/clip-image002-thumb.gif" medium="image">
			<media:title type="html">clip_image002</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/clip-image004-thumb.gif" medium="image">
			<media:title type="html">clip_image004</media:title>
		</media:content>
	</item>
		<item>
		<title>System Technology Conferences Rank</title>
		<link>http://tianke.wordpress.com/2007/10/31/system-technology-conferences-rank/</link>
		<comments>http://tianke.wordpress.com/2007/10/31/system-technology-conferences-rank/#comments</comments>
		<pubDate>Wed, 31 Oct 2007 12:54:11 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[conferences]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/10/31/system-technology-conferences-rank/</guid>
		<description><![CDATA[System Technology Conferences Rank (Including networking and security) The ranking of conferences are taken mostly from an informal external source. The detailed procedure behind the ranking is unknown to the author. These rankings do not necessarily represent my personal view either. There is a possibility that some of the rankings may not be accurate, may [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=7&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/10/31/system-technology-conferences-rank/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>
	</item>
		<item>
		<title>Acceptance Rate of Networking Conferences</title>
		<link>http://tianke.wordpress.com/2007/10/31/acceptance-rate-of-some-conference-proceeding/</link>
		<comments>http://tianke.wordpress.com/2007/10/31/acceptance-rate-of-some-conference-proceeding/#comments</comments>
		<pubDate>Wed, 31 Oct 2007 07:54:29 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[conferences]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/10/31/acceptance-rate-of-some-conference-proceeding/</guid>
		<description><![CDATA[http://www.cs.ucsb.edu/~almeroth/conf/stats/ A page is an attempt to gather year-over-year statistics for some of the major systems and networking conferences. It includes of URL of the Conference Papers Submitted Papers Accepted Acceptance Ratio Number of Tracks, and Number of Attendees For example: http://www.cs.ucsb.edu/~almeroth/conf/stats/ VERY WELL!<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=3&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/10/31/acceptance-rate-of-some-conference-proceeding/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>

		<media:content url="http://tianke.files.wordpress.com/2007/10/image-thumb.png" medium="image">
			<media:title type="html">image</media:title>
		</media:content>
	</item>
		<item>
		<title>DSR in ns-2</title>
		<link>http://tianke.wordpress.com/2007/08/08/dsr-in-ns-2/</link>
		<comments>http://tianke.wordpress.com/2007/08/08/dsr-in-ns-2/#comments</comments>
		<pubDate>Wed, 08 Aug 2007 08:21:00 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[ns2]]></category>
		<category><![CDATA[programing]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/08/08/dsr-in-ns-2/</guid>
		<description><![CDATA[Source code :        Not all flies in ./dsr/ directory are used by the ns-2. the routing agent is implemented as Agent/DSRAgent.     Thus, the source codes include: dsragent.cc (h):  DSR agent class. major state machine handling routings. Important variables; net_id, mac_id in ID type. (IP and MAC address), both of them [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=16&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/08/08/dsr-in-ns-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>
	</item>
		<item>
		<title>ExOR</title>
		<link>http://tianke.wordpress.com/2007/08/08/exor/</link>
		<comments>http://tianke.wordpress.com/2007/08/08/exor/#comments</comments>
		<pubDate>Wed, 08 Aug 2007 00:47:00 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[opportunistic]]></category>
		<category><![CDATA[routing]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/08/08/exor/</guid>
		<description><![CDATA[ExOR使用90%:10%的原因： 一批中的最后几个包的发送是消耗资源最多的几个包，因为这几个包的传输也需要消耗运行这个传输流程，而这个开销会被分配到相关的几个包。如果一个fragment太小，就会有较大的可能性节点设置转发定时器是发生冲突和不精确的现象。<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=15&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/08/08/exor/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>
	</item>
		<item>
		<title>nesC Text-Editor</title>
		<link>http://tianke.wordpress.com/2007/05/26/nesc-text-editor/</link>
		<comments>http://tianke.wordpress.com/2007/05/26/nesc-text-editor/#comments</comments>
		<pubDate>Sat, 26 May 2007 03:00:00 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[programing]]></category>
		<category><![CDATA[WSN]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/05/26/nesc-text-editor/</guid>
		<description><![CDATA[You also can use UltraEdit with a modified wordfile for nesC syntax highlighting.You&#8217;ll have to add the follow text into the UltraEdit directory &#8220;wordfile.txt&#8221; and restart the editor. /L20&#8243;nesC&#8221; Line Comment = // Block Comment On = /* Block Comment Off = */ Escape Char = \ String Chars = &#8220;&#8216; File Extensions = NC/Delimiters [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=14&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/05/26/nesc-text-editor/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>
	</item>
		<item>
		<title>Cluster-Based Opporistic Forwarding</title>
		<link>http://tianke.wordpress.com/2007/05/21/cluster-based-opporistic-forwarding/</link>
		<comments>http://tianke.wordpress.com/2007/05/21/cluster-based-opporistic-forwarding/#comments</comments>
		<pubDate>Mon, 21 May 2007 07:26:00 +0000</pubDate>
		<dc:creator>tianke999</dc:creator>
				<category><![CDATA[opportunistic]]></category>

		<guid isPermaLink="false">http://tianke.wordpress.com/2007/05/21/cluster-based-opporistic-forwarding/</guid>
		<description><![CDATA[A之所以选择B作为下一跳，是由于：first，A认为C在AB之间的某个位置，传给B可以传送更远的位置。second，对于A来说到D的链路是太weak了。 当在路由层上A把C和D忽略时，可能会出现以下两种情况，可以使C和D的起到增强链路可靠性的作用：First，C接到包，而B没有，这时可以不让A重传给B，而让C传给B。这样增加了成功的机率。(intermediate helper pattern)Second，当D收到包后直接转发，不管B是否接到包。(distant helper pattern) 对于A发出的包，B，C，D收到与否的组合有8种。有4种情况可以使用distant helper pattern，1种可以使用intermediate helper pattern。CBF就是设计来增强这5种情况的能量有效性。 问题：三个节点间如何知道相互之间的接收状态？ 发方，the address translation module receives packets from the network layer, and translates their addresses into cluster addresses.收方，由于多个helper和接收者会接收到同样的包，the forwarding resolution module removes 多余的packets and selects one unique receiver to forward the packet along the multi-hop delivery path.问题：如何协同去除多余的packets。 算法设计： intermediate helper的情况：每次C接收到一个B丢失的包，C就发送一个很短的RTS包给B。如果B同意，就回复一个CTS包，接收到CTS后，C重传丢失的数据包。这样就把原来的AB转发改为CB转发。C只发送RTS一次，如果没有接收到CTS包，就丢弃此数据包。 问题：C如何得知B有丢包？ distant helper的情况：与上面情况略有不同，D不必转发数据给B，但要通知B数据包已经直接发出。 问题：helper在系统部署是设定，还是每个节点均可以作为helper？<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=tianke.wordpress.com&amp;blog=2025680&amp;post=13&amp;subd=tianke&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://tianke.wordpress.com/2007/05/21/cluster-based-opporistic-forwarding/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0629a1ff6ee5d25342aec8bfd911c8f1?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">tianke</media:title>
		</media:content>

		<media:content url="http://bp0.blogger.com/_2D7Bv8nNDRY/RlJlvxTtLxI/AAAAAAAAAEY/Wd52VoIlSpc/s320/hop-wise+transmission.bmp" medium="image" />

		<media:content url="http://bp3.blogger.com/_2D7Bv8nNDRY/RlJ3vhTtLyI/AAAAAAAAAEg/n1De4nKGXMM/s320/hop-wise+transmission+outcomes.bmp" medium="image" />

		<media:content url="http://bp0.blogger.com/_2D7Bv8nNDRY/RlKVTxTtL0I/AAAAAAAAAE0/WASCASEPCNA/s320/cbf+architecture.bmp" medium="image" />
	</item>
	</channel>
</rss>
