bluuebunny/crossref_metadata_2025_split huggingface dataset:
Anonymity Authentication and Measure in Ubiquitous Computing
Authors: Yajun Guo , Huifang Yan , Rong Li 
Published: January 2009

Authentication and anonymity usually are inconsistent. To obtain services, a user must be authenticated. Much of the sensitive information of the user will be exposed to service providers. In order to protect privacy, users must communicate with service providers in an anonymous way. But if the user does not show his true identity, how can the service provider believe that the user is true. This paper presents a secure anonymity authentication protocol for ubiquitous computing which allows service providers to authenticate anonymous users. Anonymity is achieved by separating the linkability of the user's identity information and the action of the user. By finding out objects linkability relationship, we also address an anonymity measure to analyze anonymity and detect the concealing security exposure. 1. Anonymity Authentication There exist three principals in the anonymity authentication protocol: the user, the service discoverer, and the service provider. The anonymity authentication protocol contains two authentication stages. First, the authentication between the user and the service discoverer which determines the user whether he has the right to access the requested resource. And then the service discoverer makes use of blind signature on the user's public key as a ticket. Second, the service provider authenticates the user, in which the service provider judges the user whether is the genuine user. 2. Anonymity Measure Linkability is the relation between objects (such as subjects, events, actions etc.) in a system before and after an action occurs. Unlinkability is the sufficient condition of anonymity. Definition 1 (function decision) Let R denote the object set, X and Y be subsets of R, and X≠ Y. If Y can be known from X with probability p, then say X function decision Y, recorded as: X→ Y( p). Definition 2 (function decision set) To the object set R, the function decision set is the set F of function decisions among the objects known by attackers. Definition 3 (function decision implication) If F is the function decision set known by attackers, let R denote the object set, X and Y be subsets of R, and X≠ Y. If X→ Y( p) can be deduced from F, then say F implication X→ Y( p). Definition 4 (function decision closure) All the function decision sets implicated by F are called the closure of F, written as F+. Whether user anonymity is protected can be judged by seeing if there are relations between users' location/actions and users' identity in F+.
Intersection-Aware Channel Assignment and Routing in Multi-Channel Multi-Hop Wireless Networks with a Single Transceiver
Authors: Chuanhe Huang , Yong Cheng , Ling Yang , Wenming Shi , Hao Zhou 
Published: January 2009

This article proposes an intersection-aware channel assignment and routing protocol for wireless ad hoc networks with a single transceiver. This protocol increases the network capacity of an IEEE 802.11 network by exploiting frequency diversity. Using the proposed protocol, multiple communications can simultaneously take place in a region without interfering with each other. However, it must avoid a multi-channel hidden terminal problem for designing channel assignment and routing protocol. This paper considers issues regarding multiple channels at the network layer, assuming a single channel MAC protocol such as IEEE 802.11 DCF. Also, the proposed protocol assumes that each node in the network is equipped with a single transceiver. This set of assumptions is very practical, because most devices have a single wireless card implementing the IEEE 802.11 DCF protocol. Each node uses modular exponentiation congruence to represent the channel schedule, which assures that each pair of nodes has common channels for communication in every cycle. Each node switches across channels in such a manner that each pair of nodes works on the same channel when they desire to communicate; otherwise they work on a different channel, and hence do not interfere with each other. However, for the intersecting node, there is no benefit in using single radio multiple channels since the capacity around the intersection node can at most be O (W), W is the link capacity, regardless of the number of channels. The protocol lets the intersecting node always work on the same channel whereas the nonintersecting node can work on different channels. The two states for every node in the network are the state of an intersecting node and the state of non-intersecting node. Using the proposed protocol, nodes discover multiple routes to the destination node; the node selects the path with most intersecting nodes to avoid more nodes become intersecting nodes when the number of flows increases greatly. Once a node becomes an intersecting node, it will work on the same channel in a cycle. Simulation results show that the proposed protocol significantly increases the aggregate end-to-end throughput and network capacity greatly over a single-channel protocol and some other channel assignment and routing protocols in several wireless networking scenarios.
The Research of Multiparty Application Modeling Supported Network Architecture Description Method
Authors: Yuan Huang , Jun Shen , Jinjing Song 
Published: January 2009

The multiparty applications pattern of network is going to definitely play an important role on the Internet. However, the traditional research of network architecture almost exclusively uses the “one to one” direct interaction model to describe various kinds of network interactions. The INSA (Interactive Network Services Architecture) reference model and network description language INSADL developed by the Laboratory of Computer Network and Information Integration (Southeast University) have introduced the component-based thought and interactive viewpoint to the research of network architecture. Moreover, INSADL has provided support for the modeling of network multiparty applications to some extent. Nevertheless the modeling requirements of the multiparty applications are much more complicated than those of traditional network applications. The description of complex network interactions involving a non-fixed number of participating entities needs to be supported. It also raised the problem of how to represent the composite entity components, and sometimes the dynamic joining and leaving of entities from interactions should be dealt with. Therefore, INSADL still has some limitations. So we established a new network architecture formal description method on the basis of INSADL's component-based thought to support the depiction of multiparty application. We discussed the detailed modeling schemas for different modeling elements. For entity components, we defined the inheritance relations between component classes by using the “extends” field and set rules for the overriding of grammar units in derived classes. We also introduced the “symbol transformation method” of CSP to simplify the definition of similar processes. Furthermore, the definition production of functions which describe the data processing of entities is given. For the modeling of the interaction connector, we improved the description used by INSADL. We adjusted the production of nonterminal <INSA_Role>, and add a new nonterminal <Multiplicity_Expression>. Thus an uncertain number of roles in an interaction connector can be explicitly denoted. Concerning the connection configuration, we took a similar measure as interaction connector to alternate the definition of nonterminals related with the instances of entity component classes, using multiplicity expressions within the brackets to specify the number of instances. This paper establishes a foundation for further research of the multiparty application network system's properties using the formal method.
Duty-Oriented Hybrid Peer-to-Peer Network Based on Metadata
Authors: Li Kan , Sun Xin , He Yue 
Published: January 2009

The topology structure of the peer-to-peer overlay network is a critical factor in dominating performance of resource discovery. In the paper, we consider that nodes have their duty or function in the real world, and we take full advantage of the characteristic of unstructured peer-to-peer network. According to these, a duty-oriented hybrid peer-to-peer network based on metadata (DHPM) is proposed. DHPM organizes nodes into a tree-structure hierarchical overlay network. Its nodes are divided into domains according to the duty or the function of these nodes, and into groups according to the semantic similarity in one domain. The DHPM overlay network consists of two types of nodes, super peers (SPs) and peers. A super peer is a node that acts as a centralized server submitting and answering requests on behalf of peers. A peer submits queries to its super peer, searches for the location of queries according to the metadata directory in the super peers and receives results from the real resource location. The super-peer architecture adopted in DHPM exploits the heterogeneity of nodes by assigning additional responsibilities to higher-capacity nodes. The classification of nodes helps to increase searching efficiency during routing messages in the network. In DHPM, peers query resources via metadata directory which is in the super peers. Metadata directory in the 1st level SPs manages the information of shared resources in their domains, while metadata directory in the 2nd level SPs manages the shared information in their groups. The metadata directory is a tree-like distributed infrastructure. In the first layer of the metadata directory there are all the 1st level SPs and replica directory. 1st level SPs manage all the metadata of shared resources in the domain. The metadata of shared resources include databases, files, monitoring information, and 2nd level SPs in the domain. In order to construct and maintain DHPM, node join algorithm, node departure algorithm, and query searching algorithm are presented to ensure running of the network. Duty or function is the important factor in selecting the super peers. In addition, high bandwidth, sufficient searching process power, longer online time etc. are the considered factors. In node departure algorithm, we describe two kinds of node departure cases: normal departure and abnormal departure. By means of metadata directory, query searching can be gotten in DHPM. Finally, experiments are made to show the performance of query searching with DHPM, Gnutella, and Freenet.
Study on Modeling of Container Terminal Logistics System Using Agent-Based Computing and Knowledge Discovery
Authors: Bin Li , Wen-Feng Li , Yu Zhang 
Published: January 2009

Container terminal is the transfer hinge of land-sea intermodal transportation. Container terminal logistics system (CTLS) is the central handling platform of container logistics in logistics network as the computer system is the core processing node to information flow in internet. Quay side is its “central processing unit (CPU)” of handling platform and storage yard is its “main memory.” CTLS is a highly complex system which includes parallel, negotiation, and competition relations etc. in operation so that this paper introduces agent based computing (ABC) and knowledge discovery in database (KDD) to model CTLS. Logistics, information flow, and decision flow are the kernel of transaction and operation of container terminals which are developing into professional third party logistics (TPL) and seized of enormous business data which are accumulated by the inner information infrastructure and the public electronic commerce (EC) platform. Through the analysis to the handling operation and container logistics of CTLS, we refer to the design thinking of computer organization and architecture and introduce the resource scheduling thinking of the operation system, and draw an analogy between CTLS and parallel computer architecture based on Harvard architecture, map and carve up the production, and scheduling system of CTLS into fourteen kinds of agents: berth allocation agent, quay crane allocation agent, storage yard management agent, yard crane allocation agent, container truck dispatch agent, tugboat dispatch agent, gate house management agent, berth agent, quay crane agent, yard agent, yard crane agent, container truck agent, tugboat agent, and gate house agent according to the entities and their mutual relations. We bring forward the modeling framework of CTLS based on multi-agent and KDD which provides the engine to drive the model accordingly. This modeling thinking and framework, which serves the turn to the queuing theory inherently and possesses the top-ranking flexibility and robustness to the computational intelligence (CI), can help to set down the production scheduling plan and support the important decision-making of the port. A simulation to the quay side is implemented by the AnyLogic 6.2 and SQL Server 2005 and berth allocation based on practical data is given emphasis to discuss. The simulation result precedes the quondam research and actual data to 5.14% and 26.82% through the dynamic priority scheduling. In addition, a series of similar simulations are executed to support the decision on the proportion between berth and quay crane. All verify the feasibility and creditability of the above idea and the effective scheduling strategy in the framework will be further discussed and studied when the container terminal is provided with the multifarious characteristics in the future.
An Efficient and Robust Self-Storage P2P Reputation System
Authors: Hao Liming , Lu Songnian , Tang Junhua , Yang Shutang 
Published: January 2009

For the large scale of the network and unreliable nature of peers in most P2P (Peer-to-Peer) systems, it is a challenging task to implement an efficient and robust P2P reputation system. Self-storage P2P reputation systems provide an efficient way to retrieve rating values. Since each peer locally stores its own rating values given by all other peers, it takes only one query message to collect all the rating values of a peer. However, it also gives the owner control over its rating values. One of the challenges of this type of system is to protect the rating values from being maliciously modified by their owners. In existing self-storage P2P reputation systems, other participants are involved in order to ensure the integrity and reliability of the rating values. However, because at least one participant must be contacted during the rating and rating values retrieval processes, they create a high message overhead when deployed in unstructured P2P systems. In this article, we address the efficiency and robustness of P2P reputation systems in fully distributed environments. We propose an innovative self-storage P2P reputation system. In our system, each peer locally stores its own positive rating values given and signed by other peers. On one hand, since it is not likely for a peer to discard any part of the positive rating values or forge the raters' signatures, the integrity and reliability of the self-storage rating values are preserved. On the other hand, based on the self-storage rating values and our reputation value computing algorithm, one step is enough to rate or obtain the whole positive rating values of a peer without other participants or broadcasting messages. Extensive simulations have been conducted to evaluate the performance of our system. Simulation results show that the message overhead of our system is reduced significantly (4 messages for each transaction) compared with existing self-storage P2P reputation systems, which makes our system a scalable reputation system for handling a large number of P2P services. Our system is also robust to malicious behaviors of peers. Simulation results show that the service selection success ratio is greater than 0.8 even when there are 70% malicious peers. Moreover, when those participants are not reachable in existing self-storage P2P reputation systems, the rating values verification process fails, while in our system, no other peer is involved and this type of threat can be totally avoided.
An Improved Ant Colony Broadcasting Algorithm for Wireless Sensor Networks
Authors: Jiang Nan , Zhou Rigui , Yang Shuqun , Ding Qiulin 
Published: January 2009

Recent advances in nano-technology have made it possible to develop a large variety of Micro Electro-Mechanical Systems (MEMS)-miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. A sensor network is a collection of many small devices, each with sensing, computation, and communication capability. It has many potential applications, such as building surveillance and environmental monitoring. Broadcasting is defined that communications between one source and all receiver in networks, and it is widely used in Wireless Sensor Networks. Therefore, how to design an efficient and scalable broadcast protocol is challenging and meaningful work. Ant Colony Algorithm is a bionic optimization algorithm which simulated insect behavior of ants swarm intelligence. It is robust, has excellent advantages of distributed computation mechanism, and it has been widely applied to the solution of TSP, production scheduling, Graph Coloring Problem, and other combinatorial optimization problems. Broadcasting in wireless sensor networks is very similar with the ants routing problem. The target nodes and source nodes for broadcasting can be respectively compared to food and ant nests, and broadcasting problem can be regarded as the issue that ants find the optimal path between food and nests. When using ant colony algorithm for broadcasting, ants pheromone is calculated to select the path in accordance with the transition probability, and each ant in the path does not need access to all the information before starting, thus this will avoid the calculation of overhead of the initialization of parameters information in all nodes and the paths, and achieve the goal of multi-path data broadcasting in large-scale sensor networks. In this paper, we describe the broadcasting problem in sensor networks and introduce a network model, and after considering energy efficient broadcast in such networks, combined the characteristic of Wireless Sensor Networks and the properties of ant algorithm to quickly identify an optimal path, we introduce and evaluate an improved ant colony broadcasting algorithm (IACBA), which can adaptively find the optimal broadcasting path without global network information. In our simulation, the notion of network density is introduced in order to identify classes of network topologies with similar characteristics. We mainly analyze energy depletion, minimum distance, and network lifetime, and the results show that out algorithm can reduce energy depletion dramatically and decrease communication distances in broadcasting, and our algorithms can prolong network lifetime by about 10%-20% compared with BIP, and about 30%-50% compared with flooding.
AAPP: An Anycast Based AODV Routing Protocol for Peer to Peer Services in MANET
Authors: Qi Meng , Hong Ji 
Published: January 2009

The study of Peer-to-Peer (P2P) network and Mobile Ad hoc Network (MANET) are currently two hotspots in distributed domain. We propose a novel anycast based AODV routing protocol which is a simple and efficient routing protocol designed especially for MANET for P2P applications called AAPP (an Anycast based AODV routing protocol for Peer to Peer services in MANET). AAPP integrate DHT protocol operating in a logical namespace and MANET routing protocol operating in a physical namespace. The key idea of the integration is to bring the Chord protocol to the network layer of MANETs via a one-to-one mapping between the service keys of the mobile nodes providing services and their anycast groupIDs in the namespace. The object of our design is to construct a new type of anycast based AODV model for P2P services, especially for discovery service, information administration service, file sharing service, and communication security. It is assumed that the number of anycast groups is steady in a MANET, so we consider the instance that a node joins or leaves an anycast group. When a mobile node attains a service, such as a file and a particular data, it can share its resource to other nodes and becomes a mobile peer. Whenever a mobile node joins or leaves an anycast group, it originates a request packet and sends it to the network layer. The anycast groupID is updated correspondingly, and broadcasts the information about updating information. In this paper, we have designed an anycast based protocol for P2P application in mobile wireless ad hoc networks based on on-demand routing protocols AODV. We have tested the packets' delivery fraction, average end-to end delay of data packets, and normalized the routing protocol performance of anycast protocols by simulation with OPNET on different traffic models, node mobility models, and connection models. With our novel anycast protocol AAPP, the traffic load can be balanced thus, reducing the transmission delay and increase the route utilization which is better for P2P application. That all the members in one anycast group share one anycast address enables them to take the same priority in the routing searching process. Therefore, this approach can provide the transmission path with the shortest length. With scattering of the anycast server in the geographical area, the traffic load is obviously distributed in the network. All these properties can help to improve the performance of the network.
A QoS Driven Web Service Composition Method Based on ESGA (Elitist Selection Genetic Algorithm) with an Improved Initial Population Selection Strategy
Authors: Dong Shuanyu , Dong Weiqing 
Published: January 2009

With more and more web services being applied, the quality of service (QoS) becomes an important criterion in a service selection. We propose a UDDI process with QoS extension to support quality requests. Service providers can send functional and QoS information to the UDDI registry. As a component of the UDDI registry, the QoS calculator calculates the QoS value of each service to decide the optimal service and send the information back to the UDDI registry. After receiving the requestor's feedback, the QoS calculator re-calculates QoS of the service. In a service composition, component services and the composed service should satisfy local and global restrictions respectively. The QoS of component services aggregate to QoS of the composed service according to an aggregation rule. The QoS parameters may conflict with each other, so this problem is actually a multi-objective optimization. A service selection can be seen as a path formation and each node of the path is a service class. A genetic algorithm can be used to solve complicated global optimization problems. It is proved that a simplex genetic algorithm cannot converge to optimal global solution but the elitist selection genetic algorithm (ESGA) can. So we use ESGA to solve this problem. We use integer encoding as the encoding rule. A composed service can be seen as a chromosome and a gene is an integer that represents a service number in its service class. We use an initial population selection strategy instead of the random initial population creation method. In the strategy, if the fitness of a new composed service is worse than the average fitness of the selected composed services, it should be abandoned, otherwise it should be kept. We coordinate these objectives by assigning a weight to each parameter and the fitness function is the weighted sum of QoS parameters. In the stage of genetic operation, the penalty function is subtracted from the fitness of the composed service if it does not satisfy the restrictions. We use the roulette wheel selection method, single point crossover operator, and uniform mutation operator as genetic operators. It is shown that this method has better performance than the method using ESGA through an experiment.