Let G = (V, E) be a finite, simple and undirected graph having v = |V (G)| and e = |E(G)|. A graph G with q edges is said to be odd-graceful if there is an injection f : V (G) → {0, 1, 2, . . . , 2q−1} such that, when each edge xy is assigned the label |f(x)−f(y)|, the resulting edge labels are {1, 3, 5, . . . , 2q−1}. Motivated by the work of Z. Gao [6], we have defined odd graceful labeling f...

In distributed sensor networks, the researches for authentication in sensor network have been focused on broadcast authentication. In this paper, we propose a message and its origin authentication protocol for data aggregation in sensor networks, based on one way hash chain and Merkle tree authentication with pre-deployment knowledge. Proposed protocol provides not only for downstream messages ...

This paper presents a robust transmission strategy for wavelet based scalable bit stream over packet erasure channel. By taking the advantage of the bit plane coding and the multiple description coding, the proposed strategy adopts layered multiple description coding (LMDC) for the embedded wavelet coders to improve the error resistant capability of the important bit planes in the meaning of D(...

A novel method is developed to merge and disband groups in IP Multicast while retaining the original setup of their groups. It extends the semantic ofjoining or leaving a membershipfrom discrete members to group members in IP network. It has minimal impact on existing multicast trees and does not affect the operations of multicast routing protocols and the Internet Group Management (IGMP). It i...