Search

In the current enterprise competition, the core of the management information system is the financial management information system. Building a more comprehensive and efficient financial management information system can effectively establish a more efficient innovative enterprise and promote the transformation and development of the enterprise. This paper first designs a set of financial management system templates, including general ledger, accounts receivable, and accounts payable. Second, according to the characteristics of wireless sensor network technology, this paper proposes a financial management system based on the wireless sensor network and designs a load balancing topology control algorithm (LHTCA algorithm), which balances the energy consumption of network nodes and helps to improve the network life cycle. Finally, the management system is tested and validated. The test results show that the financial management system can realize the electronicization of financial data and paperless vouchers, improve the efficiency of financial work, and promote the sharing and integration of resources. [ABSTRACT FROM AUTHOR]

Load balancing is of great significance to extend the longevity of wireless sensor networks, due to the inherent imbalanced energy overhead in such networks. However, existing solutions cannot balance the load distribution in partially disconnected wireless sensor networks. For example, if a network is partitioned into several segments with different area sizes, some areas have much more traffic load than other areas. In this article, we propose a load-balanced routing scheme, which aims to balance energy consumption within each segment and among different segments. First, we adopt unequal transmission distances to build initial routing for intrasegment load balancing. Second, we adopt the genetic algorithm to build extra routing between different segments for intersegment load balancing. The unique character of our work is twofold. On one hand, we investigate partitioned wireless sensor networks where there are several isolated segments. On the other hand, we pursue load balancing from a global perspective rather than from a local one. Some simulations verify the effectiveness and the advantages of our scheme in terms of extra deployment cost, system longevity, and load balancing degree. [ABSTRACT FROM AUTHOR]

Transmission links in wireless sensor networks (WSNs) are prone to failure because of breakdown, movement, and energy depletion of nodes. Aiming at node-intensive environment, this paper proposes a highly reliable forwarding model based on virtual nodes (HRVN) in tree-based topology networks. A virtual node (VN) consists of several neighboring physical sensor nodes, which have common parent node and children nodes. Normally, the physical sensor nodes in the same VN forward packets in a load-balancing scheme. When a sensor node in a VN is in failure, the others would take over its forwarding work immediately. Moreover, the internal changes of a VN are transparent to its parent and children nodes. The experiments prove the model can provide load-balance and fast recovery from failure with low cost. [ABSTRACT FROM AUTHOR]

Regarding the energy shortage problem of wireless sensor networks (WSNs), various schemes and protocols are proposed to prolong the network lifetime. Data communication is undoubtedly the most important determinant for this energy scarce network type. In this paper, we propose a sophisticated architecture comprising data reduction, load balance, and topology control. Data reduction is ensured by the parameter spatial correlation proximity range (SCPR) that can be adjusted statically at the setup phase or dynamically revised depending on the necessities in the network. Four-layer virtual architecture is applied for implementing topology control. Furthermore, network area is partitioned into fixed-size hexagonal clusters. Depending on the regions in which the clusters take place, cluster heads (CHs) are elected from the respective subregions of the clusters. Load balance is achieved by considering residual energies and distances to the sink during both CH election and data transmission stages. Aggregated data in each cluster is transmitted towards the sink by using a load balancing single-hop intercluster routing protocol instead of direct transmission as offered in LEACH. Simulation results demonstrate that the proposed architecture ECMTADR shows almost 50% better performance in terms of energy conservation and network lifetime when it is compared to LEACH and HEED. [ABSTRACT FROM AUTHOR]

The load balancing technology is widely used in current enterprise network to provide high quality and reliable service. Conventional load balancing technology is often achieved by specific hardware that is usually very expensive and lacks sufficient flexibility. Meanwhile, it is easy to become a single point of failure and would be restricted in virtualization environments. Thus, we propose a load balancing algorithm based on server running state, which can calculate comprehensive loading according to the CPU utilization, memory utilization, and network traffic of the servers. Furthermore, a load balancing solution based on software defined networks (SDN) technology is applied in this paper, and it is designed and implemented in OpenFlow network. We combine network management and server state monitor in this scheme, in which the OpenFlow switches forward the request to the least comprehensive loading server by modifying the packet. [ABSTRACT FROM AUTHOR]

Challenge of efficient protocol design for energy constrained wireless sensor networks is addressed through application specific cross-layer designs. This design approach along with strong design assumptions limits application of protocols in universal scenarios and affects their practicality. With proliferation of embedded mobile sensors in consumer devices, a changed application paradigm requires generic protocols capable of managing greater device heterogeneousness and mobility. In this paper, we propose a novel lifetime maximization protocol for mobile sensor networks with uncontrolled mobility considering residual energy, traffic load, and mobility of a node. The protocol being generic is equally applicable to heterogeneous, homogenous, static, and mobile sensor networks. It can handle event driven as well as continuous traffic flow applications. Simulation results show that proposed scheme outperforms minimum hop routing and greedy forwarding in terms of network lifetime, data packet latency, and load balance while maintaining comparable throughput. [ABSTRACT FROM AUTHOR]

A wireless network consists of a large number of nodes with limited resources. The large number of event data will be generated over a period of time in a wireless network. Also, faced with high resource demand variability and with misfit resource renting policies, the current practices is to overprovision for each game tens of owned data. In a wireless network, the agent node may become easily overloaded by the high demand from the players for updates. So, we propose a hybrid load balancing scheme for games in wireless networks which is based on allocating load on wireless mobile nodes proportionally to each of the agent's capacities. This proposed scheme is a combined dynamic provisioning algorithm based on greedy graph and user-oriented load balancing scheme for maintaining the performance and stability of distributed system in wireless networks. We address the key functions for our proposed scheme and simulate the efficiency of our proposed scheme using mathematical analyses. We then testify that the proposal has best performance compared with previous researches. [ABSTRACT FROM AUTHOR]

A wireless sensor network consisting of resources, size, and cost-limited sensors is used in many military and civil applications. This paper proposes an energy-efficient clustering algorithm that extends the lifetime of sensor networks. The proposed clustering algorithm is an extended hierarchical clustering protocol that minimizes the overall amount of consumed energy in the network. The proposed approach dynamically updates clusters and distributes the load on the heavily loaded cluster heads among different nodes. It also balances the remaining energy on nodes in the network, which leads to prolonged network lifetime. The performance is evaluated in terms of network lifetime, average energy consumption, and standard deviation of residual energy. [ABSTRACT FROM AUTHOR]

Wireless sensor networks are evolving with increasingly device heterogeneity, while the problem of effectively composing the platform-specific functionalities provided by heterogeneous sensor nodes to achieve specific goals still remains a challenge. Because of the constrained resources and unreliable communication in sensor networks, traditional service composition techniques in web services with adequate resources are insufficient. In this paper, focusing on the limited energy of sensor nodes, we propose an energy-aware service composition framework for developing various applications in heterogeneous wireless sensor networks. With both the energy-aware metrics: energy-aware load-balancing factor and overall energy consumption, we formulate the process of energy-aware sensor service composition into a combinatorial optimization problem; furthermore, an improved discrete particle swarm optimization (IDPSO) algorithm with inertia weights adjustment and extreme perturbation scheme is proposed to solve the combinatorial optimization problem. The experiment results have shown that the performance of the service route given by IDPSO is approximately equal to the best service route searched out by the exhaustive algorithm. Meanwhile, our proposed energy-aware service composition method is able to reduce the energy consumption and prolong the lifetime of the sensor network when providing stable service composition for various applications. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) consist of multiple, distributed nodes each with limited resources. With their strict resource constraints and application-specific characteristics, WSNs contain many challenging tradeoffs. This paper proposes a bioinspired load balancing approach, based on pheromone signalling mechanisms, to solve the tradeoff between service availability and energy consumption. We explore the performance consequences of the pheromone-based load balancing approach using (1) a system-level simulator, (2) deployment of real sensor testbeds to provide a competitive analysis of these evaluation methodologies. The effectiveness of the proposed algorithm is evaluated with different scenario parameters and the required performance evaluation techniques are investigated on case studies based on sound sensors. [ABSTRACT FROM AUTHOR]

In-network data storage and retrieval is one of the most important problems in wireless sensor networks. Many schemes have been proposed to solve this problem. However, most of them do not take the frequencies of event and query into consideration. In fact, the frequencies of event and query are very important factors in real applications of in-network data storage and retrieval. In this paper, we introduce a virtual-ring-based data storage and retrieval scheme, which is called VRS, to solve the problem. VRS divides the whole sensor network field into some virtual rings. According to the frequencies, one of the virtual rings is selected out as the rendezvous ring, which plays the role of a bridge between the information consumers and the information producers. Extensive experiments have been done to evaluate the performance of the proposed scheme, VRS. Simulation results show that VRS outperforms the existing work in load balance, delay of data storage and retrieval, and the lifetime of the sensor networks. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, clustering expedites many desirable functions such as load balancing, energy savings, and distributed key management. For secure clustering, it is very important to find compromised nodes and remove them during the initial cluster formation process. If some nodes are compromised and survive the censorship process, they can make some nodes have a different cluster view and can split a cluster into multiple clusters to deteriorate cluster quality as a whole. To resolve these problems, we propose a robust scheme against such attacks in this paper. First, our scheme generates large-sized clusters where any two nodes are at most two hops away from each other to raise the quality of clusters. Second, our scheme employs the verification of two-hop distant nodes to preserve the quality of the large-sized clusters and refrains from splitting the clusters. Last, our scheme prefers broadcast transmissions to save the energy of nodes. Security analysis proves that our scheme can identify compromised nodes and preserves the cluster membership agreement against the compromised nodes. In addition, simulation results prove that our scheme generates fewer clusters and is more secure and energy efficient than the scheme producing only small-sized clusters. [ABSTRACT FROM AUTHOR]

The energy consumption of nodes is strictly limited in wireless sensor networks. The traditional direct delivery routing protocol is employed in the paging network of high-rise building construction elevators, which results in the high energy consumption and low successful delivery rate. A load-balancing equal opportunity routing protocol for wireless paging network is proposed in this work. The load-balancing equal opportunity routing protocol is a data transfer technique which maintains the network survivability by selecting the optimal path with both the lower energy consumption and the balanced network load. A load-balancing scheme gives equal opportunities for package transmission. A pager node delivers the packages by selecting a neighbor node with higher energy. The neighbor nodes in the coverage of the source node have an equal opportunity for routing. The sink node in the paging network broadcasts routing messages when moving along the track during the path selecting. The proposed load-balancing equal opportunity routing protocol is implemented and evaluated in a high-rise building construction elevator. The experimental results show that the average energy consumption of nodes is lowered with a balanced network load. It is estimated that successful delivery rate is increased by 55% but with a higher latency, and the network lifetime is prolonged. [ABSTRACT FROM AUTHOR]

Wireless sensor networks have become integral components of modern and smart environments. The main challenge for such important data-acquisition tools is the limited amount of available energy. In integrated networks in which cloud systems act as a self-regulatory controller, distributing the computational load among available partitions with rich energy will positively influence the lifetime of the whole network. This article investigates the application of a modified version of multinomial logistic regression model that incorporates spatiotemporal aspects of data collected from smart environments. The contribution of this research is to propose an energy-efficient load balancing strategy based on the proposed prediction model for the purpose of enhancing the lifetime of wireless infrastructure. Our proposed algorithm grows linearly in terms of time complexity. Extensive experiments have been performed to measure the prediction error rate and the energy consumption. The results showed that the proposed model significantly reduces the error rate and distinctly maximizes the lifetime of wireless sensor networks. [ABSTRACT FROM AUTHOR]

Decision fusion has been adopted in a number of sensor systems to deal with sensing uncertainty and enable the sensors to collaborate with each other. It can distribute computation workload and significantly reduces the communication overhead. However, some variants of decision rules such as Voting, Bayes Criterion, and Neyman-Pearson require a priori knowledge on the probability of targets presence which is still an open issue in detection theory. In this paper, we propose a binary decision fusion scheme that reaches a global decision by integrating local decisions made by fusion members. The optimal local thresholds and global threshold are derived by using the Minimax criterion based analysis while they are ensuring false alarm rate constraint, without a preestimated target appearance probability. Simulation results show that our scheme can improve the system performance under certain constraints, which can guide the threshold selection for implementing WSN systems in mission-critical applications. [ABSTRACT FROM AUTHOR]

A wireless sensor network consisting of resources, size, and cost-limited sensors is used in many military and civil applications. This paper proposes an energy-efficient clustering algorithm that extends the lifetime of sensor networks. The proposed clustering algorithm is an extended hierarchical clustering protocol that minimizes the overall amount of consumed energy in the network. The proposed approach dynamically updates clusters and distributes the load on the heavily loaded cluster heads among different nodes. It also balances the remaining energy on nodes in the network, which leads to prolonged network lifetime. The performance is evaluated in terms of network lifetime, average energy consumption, and standard deviation of residual energy. [ABSTRACT FROM AUTHOR]