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.
Geometry-based localization algorithms come to the forefront with its unique superiority. This paper proposes a Delaunay triangulation based localization scheme (DBLS), which takes use of received signal strength indicator(RSSI) from anchor nodes. Based on RSSI, the Delaunay area is generated. The unknown node determines which Delaunay area it belongs to and then record it down. After several iteration,...
Appropriate cluster head selection process in hierarchical cluster based routing algorithms is vital to make the wireless sensor networks energy efficient. This paper suggests a hybrid cluster head selection method with the parameters Location centrality and Nodes' lingering energy on the fixed clusters. The simulation outcome illustrates that the proposed algorithm is good at load balancing with...
Recently, the major challenge in the design of wireless sensor networks is to enhance the network lifetime. Many researchers have studied the problem of constructing virtual backbones, which are the backbones used for different time periods, in order to prolong the network lifetime. In this paper, we study the problem of constructing virtual backbones in dual-radio wireless sensor networks to maximize...
The MAODV (Multicast Ad hoc On-demand Vector routing protocol)shows a smooth performance in light load ad hoc networks. However, packets transmission ratio will decrease continuously with the increasingly scale of multicast group. In this paper we discussed the impact of attacks on MAODV protocol. Based on these analyses, we proposed a routing protocol DMAODV (Distensible Multicast Ad Hoc On Demand)...
In this paper, we compare the performances of geographic DTN (Delay/Disruption-Tolerant Network) routing algorithms through simulation experiments. We compare message delivery times in five geographic DTN routing algorithms -- Random, Nearest, Farthest, Distant and AOD (Angle Of Deviation) -- while varying the number of mobile agents on the field and the capacity of wireless communication. Our finding...
Named Data Networking (NDN) is a data-centric architecture designed for the future Internet. Existing works show that NDN brings significant performance improvement for typical content-centric applications, and can also fit the mobile environment well. However, directly applying NDN to Vehicular Ad hoc NETworks (VANETs) is confronted with great challenges due to the high mobility of vehicles. Most...
This paper proposes an efficient network coding aware opportunistic routing mechanism (CoAOR) for wireless mesh networks (WMNs). A new coding gain function is proposed for forwarder selection, which takes into account the number of flows considered in an encoded packet, the link quality, and the number of nodes that are able to decode an encoded packet. The weights of the three parameters in the function...
Opportunistic networks are the manifestation of wireless ad-hoc networks where there is no continuous end-to-end path. The forwarding of messages takes place via any nodes that are encountered, and therefore the measurement of message passing efficiency between nodes becomes challenging if a number of different protocols are to be compared and evaluated. Prior work has identified an evaluation framework...
As an inexpensive, flexible, and scalable Internet-access network, we have studied architecture, protocols, and design optimizations of the Wireless Internet-access Mesh Network (WIMNET). WIMNET consists of multiple access-points (APs) as wireless routers that are connected through wireless links. One AP acts as a gateway (GW) to the Internet, where any host must reach there for the Internet access...
In this paper, data collection schemes with data aggregation for static sink are proposed in wireless sensor networks. According to the distribution of source nodes in whole sensor field, we use a block partition scheme and then each block selects a sensor node as local sink for the data collection of the local area. Furthermore, the local sink would transmit the data to the global sink after aggregating...
The wireless sensor network is one new hot spot for both research and industry. Currently several communication protocols have been developed for wireless sensor network, including Zigbee, wirelessHART, ISA100.11a, WIA-PA, and so on. Most of these protocols are developed based on IEEE 802.15.4. IEEE 802.15.4 was designed for low-cost and low-power wireless network which provides MAC layer and physical...
This paper proposes two joint routing and scheduling algorithms which minimize the data delivery latency while enhancing the energy efficiency in wireless sensor networks (WSNs). In our algorithms, we first model the network as a directed graph Ginit orientating to the sink node on the basis of the location and lossy behavior of the wireless links. Next, we introduce two directed graphs Gres and G...
Wireless sensor networks consist of small battery powered devices with limited energy resources. The energy efficiency is key design that needs to be enhanced in order to improve the life-time of the network. However, the conventional cluster constructions are difficult to control the geographical area of a cluster. The methods usually generate long-distance intra-cluster routing and can not keep...
Wireless Mesh Networks (WMNs) are considered as a sub directory of MANET which are consisted of Mesh Routers and Mesh Clients. The innovative ideas to conquer the problems in case of routing in a WMN platform are key points that can potentially increase the throughput of the network in different scenarios. The protocols introduced by IEEE 802.11s draft are divided into Proactive, Reactive or Hybrid...
This paper evaluates the applicability to WMNs of dynamic backpressure routing strategies, which theoretically maximize throughput but can result in high end-to-end delays. We present a distributed and (quasi-)stateless routing protocol called DiPUMP (forwarDIng of Packets for distribUted resource consuMPtion). Unlike the theoretical form of the backpressure algorithm, DiPUMP does not require a centralized...
The operation of Ad-hoc networks depends on the cooperation among nodes to provide connectivity and communication routes. However, such an ideal situation may not always be achievable in practice. Some nodes may behave maliciously, resulting in degradation of the performance of the network or even disruption of its operation altogether. To mitigate the effect of such nodes and to achieve higher levels...
Due to the limited energy-source and mostly unattended nature of the wireless sensor networks, efficient use of energy has a critical importance on the lifetime of the applications accomplished by such networks. Although in most of the cases sensor nodes are battery-powered, there are application scenarios in which battery- and mains-powered nodes coexist. In this paper, we present an approach and...
Various information delivery schemes based on store-carry-forward routing with extensions have been studied as part of efforts to support non-real-time communications in sparse or intermittent networks. However, communication service schemes that cover large areas based solely on store-carry-forward technology have previously been considered impractical because the delay time for message delivery...
DYMO as a routing protocol is newly intended for use by mobile nodes in wireless multihop network. It offers adaptation to changing network topology and determines unicast routes between nodes within the network on-demand. It is designed for MANET (Mobile Ad hoc Network) in small, medium, and large node populations. It handles all mobility ranges and various traffic patterns. It is simulated using...
To improve the poor locating performance of DV-Hop algorithm in calculating the distance of unknown nodes to beacon nodes, we present an improved DV-HOP localization algorithm on the basis of analyzing the error of beacon nodes' estimated distances and actual distances. This paper mainly focuses on two respects: Firstly, the average one-hop distance error of beacon nodes was modified. Secondly, considering...
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.