Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost....
详细信息
ISBN:
(纸本)0769524052
Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost. In this paper, a ring removal movement-based location update scheme with a selective paging is proposed this location update scheme reduces the location updates by removing the ring formed in terminal's movement path. Numerical results show that the proposed movement-based update scheme provides a better performance than the improved movement-based registration (IMBR) scheme [1] when the terminal's callto-mobility (CMR) ratio [2] is small.
LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, Simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and clus...
详细信息
ISBN:
(纸本)0769524052
LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, Simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and cluster members generated by LEACH are important parameters for achieving better performance. this paper presents a simulation analysis of the statistical characteristics of the numbers of cluster heads and cluster members for LEACH protocol by means of Monte Carlo method. the simulation results have been compared withthe analytical results, and coincidence between them has been observed the results indicate that the numbers of cluster head,;and cluster members vary in a not narrow ranged, and the probability that there is only one cluster head or there is no cluster head is high when the desired value of cluster heads is small.
作者：
Xu, YFFudan Univ
Dept Comp & Informat Technol Shanghai 200433 Peoples R China
the function of digital library is not limited to information management now, hut also has more relationship with community. P2P networks are highly scalable platforms, which should be suitable for personal digital li...
详细信息
ISBN:
(纸本)0769524052
the function of digital library is not limited to information management now, hut also has more relationship with community. P2P networks are highly scalable platforms, which should be suitable for personal digital library, but the contradiction between efficiency and autonomy holds back their progress in applying them to DL. In this paper, we propose an autonomous flexible content addressable network (Flexible CAN), in which nodes can change their position freel. Flexible CAN has the advantages of both efficiency and autonomy. It can be used not only for information managing and retrieving, but also autonomic detect group of users withthe same interest. thus the group becomes a community, and users can share their resources and experiences conveniently.
High-speed, large-scale networks present new challenges to an intrusion detection system. these challenges include: the volume of data that must be analyzed, the high-speed data stream that IDS must deal with. To adap...
详细信息
ISBN:
(纸本)0769524052
High-speed, large-scale networks present new challenges to an intrusion detection system. these challenges include: the volume of data that must be analyzed, the high-speed data stream that IDS must deal with. To adapt these new demands, this paper propose a novel architecture for Large-scale distributed Intrusion Detection Systems(LDIDS) that can be applied to large-scale networks. this architecture is based on hierarchy, which consists of a root node, several branch nodes and leaf nodes. In this architecture, each node is an independent IDS, all IDSs constituting the whole LDIDS. the main advantage of this architecture is scalability and collaboration. We describe the framework of the nodes in detail. We also present an implementation of LDIDS which is designed according to the architecture.
In this paper we propose a distributed broadcasting algorithm for wireb?ss ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exis...
详细信息
ISBN:
(纸本)0769524052
In this paper we propose a distributed broadcasting algorithm for wireb?ss ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. the proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures. that is, the size of the forwarding nodes found by our algorithm is smaller and the running time is faster than other broadcasting. algorithms. Reducing the number of forwarding nodes will decrease the probability of transmission collision, and hence improve the packet delivery ratio. the algorithm runs in O (d(2)) time, where d is the maximum node degree. the full coverage is not guaranteed but as shown by the simulation results, the probability of full coverages can be over 99 percent when the network contains 100 or more nodes.
this paper proposes a novel compile-time list-based task-scheduling algorithm for distributed heterogeneous computing (DHC) systems, called the imaginary Strict Bound Constraint task-scheduling algorithm List-Based Se...
详细信息
ISBN:
(纸本)9789806560567
this paper proposes a novel compile-time list-based task-scheduling algorithm for distributed heterogeneous computing (DHC) systems, called the imaginary Strict Bound Constraint task-scheduling algorithm List-Based Series: ISBC-LB-1. the ISBC-LB-1 task-scheduling algorithm uses an estimation methodology about the remaining time from every task to the exit task in the DHC system to set task priorities. the experimental results show the superiority of the proposed algorithm to those presented previously. therefore, the proposed task-scheduling algorithm may be used to raise the performance of the parallel program in the DHC system.
computing reversal distance of two signed permutations has gained increasing attention over the last decade withthe study of genome rearrangements in computational molecular biology. In this paper, we present a paral...
详细信息
Unstructured Peer-to-Peer networks support uncoupled data placements, elaborate semantic queries and highly dynamic scenario. these properties make such systems extraordinary suitable for applications of mass-market d...
详细信息
ISBN:
(纸本)0769524052
Unstructured Peer-to-Peer networks support uncoupled data placements, elaborate semantic queries and highly dynamic scenario. these properties make such systems extraordinary suitable for applications of mass-market decentralized file sharing, which is still the most dominant application currently in use on current P2P-powered systems. In this paper, we propose SSplus, a novel search algorithm extended from our previously developed Smart Search algorithm, focusing on improving the search efficiency and the network utilization in unstructured P2P file-sharing systems, We achieve these goals by introducing several novel techniques below as enhancements: (a) Load Balancing based on Free Availability, (b) Intelligent 2-Level Replication, and (c) Resources Booking and Reservation. Extensive simulations under realistic conditions substantiate significant performance gains of SSplus, compared withthe original Smart Search algorithm.
A Mobile Ad hoc NETwork (MANET) is an autonomous system of mobile nodes connected by wireless links there is no static infrastructure such as base station as that was in cell mobile communication. Due to the dynamic n...
详细信息
ISBN:
(纸本)0769524052
A Mobile Ad hoc NETwork (MANET) is an autonomous system of mobile nodes connected by wireless links there is no static infrastructure such as base station as that was in cell mobile communication. Due to the dynamic nature of the network topology and restricted resources, quality of service (QoS) and multicast routing in MANET is a challenging task In this paper, we present an entropy-based model to support QoS multicast routing optimization algorithm in mobile ad hoc networks (EQMOA). the basic motivations or the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad hoc wireless networks and the concept of entropy. the simulation results demonstrate that the proposed approach and parameters provide an accurate and efficient method of estimating and evaluating the route stability in dynamic mobile networks.
Usability of pervasive computing features along withthe detection of a meeting is very effective for the users. In this paper, we present the design of a Smart Meeting Room (SMR) that not only detect the starting and...
详细信息
ISBN:
(纸本)0769522947
Usability of pervasive computing features along withthe detection of a meeting is very effective for the users. In this paper, we present the design of a Smart Meeting Room (SMR) that not only detect the starting and ending of a meeting but also provide the support of participant's context information, knowledge usability and ephemeral group communication. Our approach will play a vital role for not only for meeting detection but other closely related applications of pervasive computing.
暂无评论