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.
A Wireless Sensor Network (WSN) plays a very important role within the future wireless communication domain due to its intelligence, low cost and small size. With the wireless interfaces, these will communicate with one another just in case of cooperative communication in single or multiple hops. Multiple nodes are required for co-operative communication where the Stable Enable Protocol (SEP) and...
With the ability to work under critical environments where human interception is difficult, wireless sensor networks serves as a useful communication means for data transmission and collection. But like other wireless networks WSN is also prone to adversary interventions. So the researchers are addressing this issue to make routing protocols secure for communication. But due to the severe resource...
Ad hoc networking provides movable devices to establish communication independent of a main infrastructure. However, the fact that there is no main infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this system, path routing and protocol selection are the primary strategies to design any wireless network. In mobile Adhoc network...
Wireless sensor networks consist of nodes among which beaconing of data occurs through routing. There are a number of routing protocols and algorithms existing based on different criteria. There are a number of shortest path algorithms available, some of which are applicable in case of shortest path routing in wireless sensor networks. Shortest path routing algorithms aim at consumption of minimum...
In networks like the Internet, it is desirable to reduce both power consumption and delays. In this paper, we propose an ant-colony heuristic algorithm which aims to minimize the product of the following two measures: consumed-power to available-bandwidth (PWR) and delay. Our current study is conducted using simulations on a topology which represents a 2-dimensional torus. We also compare the ant-colony...
This paper proposes a parallel shortest path-searching algorithm and implements it on a newly structured parallel reconfigurable processor, DAPDNA-2 (IPFlex Inc). Routing determines the shortest paths from the source to the ultimate destination through intermediate nodes. In open shortest path first (OSPF), Dijkstra's shortest path algorithm, which is the conventional one, finds the shortest paths...
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.