Open AccessEfficient mechanism to exchange group membership identities among nodes in wireless sensor networks
Author(s) -
Mishra Alekha Kumar,
Turuk Ashok Kumar
Publication year - 2013
Publication title -
iet wireless sensor systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.433
H-Index - 27
eISSN - 2043-6394
pISSN - 2043-6386
DOI - 10.1049/iet-wss.2013.0028
Subject(s) - bloom filter , computer science , coding (social sciences) , computer network , linear network coding , overhead (engineering) , filter (signal processing) , information exchange , wireless sensor network , theoretical computer science , distributed computing , network packet , mathematics , telecommunications , statistics , computer vision , operating system
It is necessary for nodes in wireless sensor networks to exchange their group membership identities in certain applications such as cluster formation and clone detection. The communication cost associated with exchanging group membership identities is higher especially in a dense network. Existing schemes make use of Bloom filter in exchanging membership information. Although the Bloom filter is an efficient mechanism for exchanging membership information, yet it suffers from higher probability of false positive, that is, a node may be detected to be a member of a group, when it is not. In this study, the authors propose two schemes called transpose bit‐pair coding (TBC), and sub‐mat coding (SMC) for exchanging group membership information. The proposed schemes do not generate false positive, and have lower communication and storage overhead. The authors have compared TBC and SMC with Bloom filter. Parameters considered for the comparison are: (i) communication overhead in terms of number of bits required to exchange the group membership information and (ii) probability of false positive. It is observed that the communication overhead in TBC and SMC is significantly lower in comparison with Bloom filter and the schemes have no cases of false positive.