The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The function and structure and the architecture of sensor network based on ZigBee/802.15.4 standard for forest monitoring are designed in this paper. According to the features of forest monitoring, the sensor nodes based on CC2520 and low power consumption chip MSP430F5437 and the coordinator Combing with ARM are designed which realize the energy control in physical layer. With the wireless sensor...
In WSN, cluster heads deployment influences the performance of WSNs(Wireless Sensor Networks). Taking the relation between the position and load of cluster heads into account, this paper proposes the idea of common nodes are prior placed, cluster heads with more energy and communication capability are deployed according to the special relation of common nodes, and designs a cluster heads deployment...
Ant colony optimization (ACO) is a stochastic approach for solving combinatorial optimization problems like routing in computer networks. The idea of this optimization is based on the food accumulation methodology of the ant community. Zone based routing algorithms is build on the concept of individual node's position for routing of packets in mobile ad-hoc networks. Here the nodes' position can be...
Cluster algorithm is one of the hotspots for studying routing protocol in mobile Ad Hoc networks, which is benefit for enlarging the network topology and utilizing the capacity of channel efficiently. This thesis researches the cluster algorithm of maximum node degree and modifies the update mechanism of cluster header. When the changing of node degree is within a range, the state of header is not...
Wireless sensor networks (WSNs) is the next generation of sensor network and the research of network topology optimization has the important meaning for present and future. By making full use of the information about the node position and energy, the WSNs topology algorithm based on immune principle is proposed in this paper, and the simulation results show that this algorithm improves the performance...
The rapid expansion of wireless sensor networks technology has created an unprecedented opportunity to gather and extract information from wireless sensor networks. How to gather sensed information in energy efficient way is critical problems recently. Clustering technique has been proven to be an effective approach for data-gathering in wireless sensor networks. However, in a mobile environment,...
Energy conservation is a key issue in ad hoc wireless network operation. Placing relay nodes (routers) at appropriate locations can substantially lower the power requirements of communicating nodes, thereby reducing overall energy needs. We investigate router placement (RP) for energy-constrained wireless networks, and present RP algorithms that aim to minimize total energy consumption. We consider...
QoS routing has received significant attention from recent literature while developing on-demand routing algorithms in ad hoc networks due to the fact that the dynamic topology changes and geographic coverage of such algorithms poses technical challenges. Swarm intelligence couples complex behaviors that arise from simple interactions. Drawing the analogy from the ant's pheromone trail- laying-and-...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.