期刊文献+

物联网中对带有时间标记数据收集的一种方法

A METHOD OF COLLECTING DATA WITH TIMESTAMP IN INTERNET OF THINGS
下载PDF
导出
摘要 随着物联网的发展,提出一种时间窗口的方法。该算法通过新建时间窗口、时间窗口插入数据、销毁时间窗口这几种操作,尽可能多地收集到符合要求的数据,根据实际情况决定维护的时间窗口的数量。每次新的数据到来,根据它的时间标记和来源标记尝试插入到已存在的时间窗口中,若无法成功插入,则销毁某个时间窗口并新建一个盛放该数据,在销毁之前,把其中的数据尝试插入到其他时间窗口中。对时间窗口的销毁和新建也保证了时间窗口随着时间移动。 With the development of the Internet of Things, this article introduces a method of time window. This algorithm can be used to collect as much legit data as possible via creating new time windows, inserting data into the time windows and destroying time windows. The number of time window maintained depends on the practical applications. The new coming data will be tried to insert into existed time windows according to its timestamp and source mark. If fail to insert, then destroying some of the time windows and creating new time windows to hold the new comers. Before destruction, all the data in the time window should be inserted into other time windows. The process of destroying and creating makes sure the time window is kept moving forward.
出处 《计算机应用与软件》 CSCD 北大核心 2012年第12期201-202,243,共3页 Computer Applications and Software
关键词 物联网 时间窗口 时间标记 Internet of Things Time window Timestamp
  • 相关文献

参考文献4

二级参考文献20

  • 1Yen Y S, Chang H C, Chang R. Routing with adaptive path and limited flooding for mobile ad hoc networks [ C ]//Proceedings of Computers and Electrical Engineering,2010,36:280 - 290.
  • 2Cheng R H,Wu T K,Yu C W. A highly topology adaptable ad hoc rou- ting protocol with complementary preemptive link breaking avoidance and path shortening mechanisms [ J ]. Wireless Networks,2010,16 ( 5 ) : 1289 - 1311.
  • 3Perkins C E, Watson T J. Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers [ C ]//Proceedings of ACM SIGCOMM'94 Conference on Communications Architectures, 1994.
  • 4Johnson D B, Maltz D A, Broch J. DSR : the dynamic source routing protocol for multihop wireless ad hoc networks [ M ]//Ad Hoc Networking. Boston : Addison-Wesley Longman, c2001: 139 - 172.
  • 5Perkins C, Das S. Ad hoc On-demand Distance Vector(AODV) Routing [S/OL]. RFC 3561 ,July 2003. http ://www. ieff. org/rfc/rfc3561, txt.
  • 6NAVSTAR GPS Operations [S/OL]. http://tycho, usno. navy. rail/ gpsinfo. html.
  • 7Wu K,Harms J. Location trace aided(LAR) routing in mobile ad hoc networks[ C ]//Proceedings of Ninth International Conference on Computer Communications and Networks,2000:354 - 359.
  • 8Karp B, Kung H T. Greedy perimeter stateless routing (GPSR) for wireless networks [C]//Proceedings of Sixth Annum ACM/IEEE International Conference on Mobile Computing and Networking ,2000:243 - 254.
  • 9Basagni S, Chlamtac I, Syrotiuk V R, et al. A distance routing effect algorithm for mobility (DREAM) [ C ]//Proceedings of Fourth Annual ACM/IEEE International Conference in Mobile Computing and Networking, 1998:76 - 84.
  • 10Haas Z ,Pearlman M. The zone routing protocol(ZRP) for ad hoc networks [ S ]. Internet Draft,2002.

共引文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部