Message Transmission In Networks Research Articles

Research of New Media Wireless Ad Hoc Network Broadcast Algorithm

The whole network broadcast is very important in the wireless ad hoc Network. It is more necessary in the routing establish processing. Simple flooding broadcast method is the most common broadcast algorithm. Although this method can cover most of the nodes ,the disadvantage is that it could lead to the broadcasting storm which would reduce the efficiency of the broadcast. According to the old methods which can not solve the broadcast storm effectively, I present the message divided and check together broadcast algorithm which is suitable for the large data packets. It can solve the large data packets sending crashing problem and maintain the integer of the message .Through the research of the low density nodes network message transmission ,I present the Adoption broadcast algorithm which based on the second jump node set. It could select the less first jump nodes to rebroadcast .This algorithm could not only increase the saving forward rate but also maintain the covering rate of broadcast .

The forwarding diameter of graphs

A routing R in a graph G is a set of paths { R xy : x, y ϵ V( G)} where, for each ordered pair of vertices ( x, y), R xy links x to y. The load ξ( G, R, x) of a vertex x in the routing R is the number of paths of R for which x is an interior vertex. We define the forwarding diameter μ( G, R) of the pair ( G, R) by μ(G, R)= max x,y ∑ zϵR xy−{x,y} ξ(G,R,Z) and the forwarding diameter μ( G) of G as the minimum of μ( G, R) taken over all possible routings. In this paper, the introduction of the parameter μ( G) is motivated by a natural model of message transmission in networks and we present several properties of μ( G). In particular, we study the value of μ for several families of graphs such as the hypercube and the de Bruijn graphs and we also study the connection of μ( G) with previously introduced transmission parameters.