A message interchange protocol based on routing information protocol in a virtual world

[[abstract]]As the network transmission is prevailing in many applications, an entity in a network virtual environment (NVE) can deliver data to other entities under peer-to-peer architecture. This paper proposes a message interchange protocol based on routing information protocol (RIP). In this message interchange protocol, every entity can know that it is in some entities' area of interested (A 0/). In this way, every entity can deliver data to other entities without via server. Furthermore, according to the group in four quadrants, every entity can get the information of other entities' by interchanging data of each others'. Based on this message interchange protocol, every entity can still work in the NVE when the server is crashed. Even if there is an entity crashes, other entities can also work in the NVE.[[sponsorship]]IEEE Computer Society Technical Committee on Distributed Processing (TCDP); Tamkung University[[notice]]補正完畢[[conferencetype]]國際[[conferencetkucampus]]淡水校園[[conferencedate]]20050328~20050330[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]臺北縣, 臺

Bootstrapping opportunistic networks using social roles

Opportunistic routing protocols can enable message delivery in disconnected networks of mobile devices. To conserve energy in mobile environments, such routing protocols must minimise unnecessary message-forwarding. This paper presents an opportunistic routing protocol that leverages social role information. We compute node roles from a social network graph to identify nodes with similar contact relationships, and use these roles to determine routing decisions. By using pre-existing social network information, such as online social network friends, to determine roles, we show that our protocol can bootstrap a new opportunistic network without the delay incurred by encounter-history-based routing protocols such as SimbetTS. Simulations with four real-world datasets show improved performance over SimbetTS, with performance approaching Epidemic routing in some scenarios.Postprin

Macro-routing: a new hierarchical routing protocol

In a continually evolving Internet, tools such as quality of service routing must be used in order to accommodate user demands. QoS routing raises scalability issues within very large networks, which can he avoided by using hierarchical routing strategies. However, such strategies can lead to inaccurate path selection due to the aggregation process. To avoid such problems, we propose a hierarchical routing protocol, called macro-routing, which can distribute the route computation more efficiently throughout the network using mobile agents. It processes more detailed information than conventional hierarchical routing protocols, so is more likely to find the best path between source and destination. Also, by using mobile agents, more than one available path can be found. This provides a fast recovery mechanism, where no protocol restart is needed in a failure situation

Analysis of Inconsistent Routing Components in Reactive Routing Protocols

In reactive routing protocols, additional routing information is often collected to reduce the response time and the overhead of the future routing demands. However, these protocols do not have any mechanism to refresh this routing information and soon it become obsolete. Therefore, routing components based on this prior-to-demand collected information are not consistent with the reactive nature of the protocol. In this work, we have identified such inconsistent components in AODV routing protocol and have analyzed their effect. Our simulation based analysis has revealed that the presence and use of stale routing information degrades the protocol performance. However, if the dependency of protocol operations on this obsolete information is reduced, the protocol performs better in terms of overhead and packet delivery ratio