| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 101 === Following the shift development of World Wide Web, wireless network technology and its applications has risen dramatically. Especially, collaborative task management is an important issue among them. Basically, a collaborative task cannot be accomplished by only mobile device. However, with the help of several devices and sharing their resources with each other, the task can now be finished efficiently.
Researches in this field basically focus on clustering instead of the collaboration task in these decades. The number of group members in a task will be restricted quantitatively; and their execution time has to keep continuously awhile as well. However, under the dynamic mobile environment, the topology of mobile nodes will change over time and the members will be cut down probably; therefore, a maintenance mechanism to ensure the number of group members is required.
This thesis aims to develop an efficient mechanism for maintaining a dynamic group, which with less maintenance cost, and better group quality. Based on conditional probability , our method estimates the probability that a mobile node will stay within coordinator's transmission range. Using these values, we can decide how to choose the group members. We have proposed two strategies to achieve best expected group formation time or less maintenance cost in this thesis.
Last, we have built a simulation and compared our methods with naive one. Results show that our strategies are more effective and have different advantages in different network environments.
|
|---|
