Search

Existing approaches for sensor networks suffer from a number of critical drawbacks. First, homogeneous deployments have been commonly assumed, but in practice multiple deployments of sensor nets and heterogeneity of sensor networks are a serious problem. Second, existing approaches are very application-dependent and engineering-oriented. Third, there has been little standard available for WSNs. These drawbacks have significantly limited the further development of sensor networks. To overcome these critical drawbacks, we propose an extensive framework: Semantic Sensor Net (SSN). In brief, a semantic sensor net is a heterogeneous sensor network which enables dynamic tagging of semantic information to sensory data to allow more efficient and systematic monitoring and handling of the environmental dynamics to provide demanded services. [ABSTRACT FROM AUTHOR]

Location information is crucial for many applications of sensor networks to fulfill their functions. A mobile sensor network is comprised of both mobile and stationary sensors. So far little work has been done to tackle the mobility of sensors in localization for sensor networks. In this paper, we propose the QoL-guided distributed refinements for anchor-free localization in wireless mobile sensor networks. Accuracy is the core concern for localization. We introduce the important concept of Quality of Localization (QoL) to indicate the accuracy of a computed location for a specific sensor node. Our approach is divided into two phases. In Phase one, we propose the algorithm QoL-guided spreading localization with refinements to compute locations for sensor nodes right after the deployment of the sensor network when the mobile sensors are required to stay static temporarily. In Phase two, the non-movement restriction is released and we propose the mobile location self-updating algorithm to update locations of mobile sensors regularly or on demand. Extensive simulations are conducted, which demonstrate that our approach is a promising technique for localization in wireless mobile sensor networks. [ABSTRACT FROM AUTHOR]

Mass customization production means to produce customized products to meet individual customer's need with the efficiency of mass production. It introduces challenges such as drastic increase of varieties, very small batch size and random arrival of orders, thus brings to the manufacturing control system requirements of flexibility and responsiveness which make mass customization production a fertile ground for intelligent agents. With RFID (Radio Frequency Identification) integration, an applicable agent-based heterogeneous coordination mechanism is developed to fulfill the requirements. In this paper, we propose a distributed system framework including a number of intelligent agents to collaborate in a virtual market-like environment. The proposed price mechanism in our system has the advantage of improving the production efficiency and total profit that the manufacturer will receive from a certain amount of jobs by utilizing a mechanism of both resource competition and job competition. Based on the simulation results, we compare the total profit, average delay and average waiting time of our agent-based price mechanism with those based on the widely exploit FIFO (First In First Out) and EDD (Earliest Due Date) scheduling mechanisms to show that when resources are with large queue length, the agent-based price mechanism significantly outperforms the other two. [ABSTRACT FROM AUTHOR]

The exponential growth of Internet traffic requires that routers be scalable. A generic scalable IP router is typically composed of a number of routing nodes (RNs) interconnected by a scalable switching fabric. A critical issue in the design of scalable IP routers is to provide a global and consistent routing table in such distributed-memory architectures. A parallel routing table computation approach is proposed in this paper. By dividing an OSPF area into a number of disjoint Within-Area-Routing-Regions (WARRs), the computation required to calculate the routing table can be divided into multiple independent portions and done by different RNs in parallel. Compared to conventional approaches, this approach can have a speedup between n and n2 for within-area link state updates and n for outside-area link state updates, where n is the number of RNs in the router. This parallel routing table computation approach requires no modification of OSPF. [ABSTRACT FROM AUTHOR]