Complex Routing for Temporary Information Sharing in Wireless Mesh Networks

被引：0

作者：

Koga, Takeshi ^{[1
]}

Ohnishi, Kei ^{[1
]}

Tsukamoto, Kazuya ^{[1
]}

Oie, Yuji ^{[1
]}

机构：

[1] Kyushu Inst Technol, Grad Sch Comp Sci & Syst Engn, Iizuka, Fukuoka 8208502, Japan

来源：

2009 INTERNATIONAL CONFERENCE ON INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS (INCOS 2009) | 2009年

关键词：

wireless mesh network; routing; complex number; free identifier;

D O I：

10.1109/INCOS.2009.49

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper proposes Complex Routing for temporary information sharing in a wireless mesh network built in a geographically limited area. Complex Routing determines a route from a sender to a receiver based on the operations of the complex numbers held by each node. In addition, it provides an adaptation mechanism for changing the complex numbers. In temporary information sharing, senders and receivers freely appear in the network, and information forwarding from a sender to a receiver is conducted using freely assigned identifiers of information. In simulations, we consider several basic spatial patterns for the appearance of senders and receivers, and examine whether Complex Routing can provide reliable information forwarding capability. As a comparison, the simulation results show that Complex Routing is better than or equal to a random walk.

引用

页码：383 / 386

页数：4

共 4 条

[1] A SURVEY AND COMPARISON OF PEER-TO-PEER OVERLAY NETWORK SCHEMES [J].

Lua, Eng Keong ;

Crowcroft, Jon ;

Pias, Marcelo ;

Sharma, Ravi ;

Lim, Steven .

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2005, 7 (02) :72-93

[2]

Ohnishi K, 2004, LECT NOTES COMPUT SC, V3102, P1426

[3]

Perkins C., 1999, P WMCSA 99 2 IEEE WO

[4]

Ryan C., 2002, Genetic Programming. 5th European Conference, EuroGP 2002. Proceedings (Lecture Notes in Computer Science Vol.2278), P278

← 1 →