TY - GEN
T1 - Improved dominating set indices for mobile peer-to-peer networks
AU - Li, Shanping
AU - Shi, Wei
AU - Lin, Xin
AU - Nizamuddin, Channa
PY - 2005
Y1 - 2005
N2 - According to 2-hop neighborhood information, Dynamic Dominant Index Set (DDIS) [10] is constructed to cache metadata of shared resources in mobile Ad Hoc network (MANET). However, DDIS presents poor performance on system overhead and user satisfaction. To adapt network mobility, peers in DDIS have to periodically advertise their shared resources over the entire network, which consumes more bandwidth. In this paper, an Improved Dominating Set Indexing Mechanism (IDSIM) for mobile peer-to-peer networks is proposed. In IDSIM, partial dominating sets automatically adjust themselves to the change of network topology in a distributed fashion. Metadata of identical resources belonged to deferent peers is clustered in one dominating set. This potentially increases in amount of query results with short latency to achieve considerable high user satisfaction. Based on random walk [4], query message roams in the network to maximize the number of results. Experiments indicate that besides greatly reducing the system overhead, IDSIM simplifies search process and, at the same time, improves user satisfaction without sacrifice of user response time.
AB - According to 2-hop neighborhood information, Dynamic Dominant Index Set (DDIS) [10] is constructed to cache metadata of shared resources in mobile Ad Hoc network (MANET). However, DDIS presents poor performance on system overhead and user satisfaction. To adapt network mobility, peers in DDIS have to periodically advertise their shared resources over the entire network, which consumes more bandwidth. In this paper, an Improved Dominating Set Indexing Mechanism (IDSIM) for mobile peer-to-peer networks is proposed. In IDSIM, partial dominating sets automatically adjust themselves to the change of network topology in a distributed fashion. Metadata of identical resources belonged to deferent peers is clustered in one dominating set. This potentially increases in amount of query results with short latency to achieve considerable high user satisfaction. Based on random walk [4], query message roams in the network to maximize the number of results. Experiments indicate that besides greatly reducing the system overhead, IDSIM simplifies search process and, at the same time, improves user satisfaction without sacrifice of user response time.
UR - https://www.scopus.com/pages/publications/33847726309
U2 - 10.1109/ICESS.2005.64
DO - 10.1109/ICESS.2005.64
M3 - 会议稿件
AN - SCOPUS:33847726309
SN - 0769525121
SN - 9780769525129
T3 - ICESS 2005 - Second International Conference on Embedded Software and Systems
SP - 466
EP - 470
BT - ICESS 2005 - Second International Conference on Embedded Software and Systems
T2 - ICESS 2005 - 2nd International Conference on Embedded Software and Systems
Y2 - 16 December 2005 through 18 December 2005
ER -