That is, CB-S uses a low number of nodes to disseminate the data packets as quickly as probabilistically possible. This perfect coverage is achieved with minimal overhead. Our simulation results indicate that messages always reach all nodes in the wireless network. This characteristic allows CB-S to achieve an efficient performance. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. CB-S has the following desirable property. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. In this paper, we introduce an efficient broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks with occlusions such as skyscrapers. Ç 1Ībstract-Vehicular networks are a promising application of mobile ad hoc networks. Index Terms-Self-stabilization, flood sequencing protocol, sequence numbers, sensor networks. We conclude that the differentiated sequencing protocol has better stabilization property and provides better performance than those of the other three protocols.
We also compare the performance of these flood sequencing protocols, using simulation, over various settings of sensor networks. We analyze the self-stabilization properties of these four flood sequencing protocols.
These four protocols are: a sequencing free protocol, a linear sequencing protocol, a circular sequencing protocol, and a differentiated sequencing protocol. In this paper, we discuss a family of four flood sequencing protocols that use sequence numbers to distinguish between fresh and redundant flood messages. When a sensor receives a flood message, the sensor needs to check whether it has received this message for the first time and so this message is fresh, or it has received the same message earlier and so the message is redundant. As a result, the link delay of communication between the super-node and the peer-node in node clustering can be limited, which will improve the overall performance of P2P networks.Ībstract-Flood is a communication primitive that can be used by the base station of a sensor network to send a copy of a message to every sensor in the network. We explore the node connectivity together with the connection quality. In this approach, we propose two distributed algorithms: T-closure algorithm and hierarchical node clustering algorithm to find node clusters automatically in a P2P network. This approach is completely distributed, in which each node only depends on its neighbors to implement node clustering. This paper describes an approach to implement node clustering based on link delay of node communications in the P2P network. Node clustering is a mechanism that aims to provide an optimal infrastructure to organize the nodes in a P2P network.
But efficient organization of the nodes in P2P networks is still a challenge needs to be addressed. Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc.