• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.149-155
• /
• 2003

This paper generally relates to the field of wireless local area networks(WLANs), and more particularly, to AP selection and association methods for the performance of a station. In these days, IEEE 802.11 Wireless LAN network is widely deployed and used as an emerging service to connect high-speed Internet in the public wireless environment. But, if there are many users in hot spot area, they suffer a severe decrease of performance. Thus it needs an association and access control mechanism especially when it is used in the public environment. In this paper, we suggest a selection and association method using Beacon or Probe Response frames based IEEE 802.11. Station selects AP using the information of the capacity area in a Beacon or a Probe Response frame. According to the present paper, an association method for a public WLAN service, which includes a WLAN user terminal and an AP for relaying WLAN communications to and from the user terminal, includes the steps of the user terminal asking the AP's states for access to a radio channel; and the station selects and associates with the AP. According to the above-described selection in a high speed wireless Internet service based on public WLAN technologies that are currently in operations. Further, it is possible to improve the efficiency of network management.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.