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.
In this paper, a study about wireless sensor network (WSN) deployment strategy is demonstrated and made workable for the use of multi-objective approach. The development of sensor nodes by considering multiple objectives and existence of fixed obstacles is an important optimization problem. There are two objectives in this study, connectivity and coverage as two fundamental issues in wireless sensor...
The evolution of the Internet has triggered a significant activity exploring new architectures among which the concept of Information-Centric-Networks (ICN) has emerged. Considering the various ICN solutions, Content-Centric Networking (CCN) is the one that received most attention. The design of CCN is progressing albeit many important issues still deserve a careful analysis and design. In this paper,...
In this paper, we propose an active node selection framework for compressive sleeping wireless sensor networks (WSNs) in order to improve the signal acquisition performance and network lifetime. The node selection can be seen as a specialized sensing matrix design problem where the sensing matrix consists of selected rows of an identity matrix. By capitalizing on a genie-aided reconstruction procedure,...
We study two approaches to distributed compressed sensing for in-network data compression and signal reconstruction at a sink. Communication to the sink is considered to be bandwidth-constrained due to the large number of devices. By using distributed compressed sensing for compression of the data in the network, the communication cost (bandwidth usage) to the sink can be decreased at the expense...
To meet the needs of innovative sensor network applications, sensor nodes have long evolved from underpowered single microcontroller designs into complex architectures that accommodate multiple processors and Field Programmable Gate Arrays (FPGAs). We address the problem of conceiving and implementing programs for such sensor node architectures. We rely on a universal, layered hardware/software interface...
The availability of location information is essential for context- and location-aware services, which are typically provided by a large number of applications. RFID systems are extensively utilized to provide localization service typically through a centralized and coordinated approach. In this paper, we propose a distributed location information dissemination scheme using heterogeneous uncoordinated...
Volunteer computing provides a practical and low cost solution to the increasing computational demands of many applications. Recent advancements in mobile device processing capabilities, combined with the energy efficiency of the mobile devices, make their inclusion in a distributed computing architecture particularly appealing. However, the intrinsic requirement of Internet connectivity to participate...
In this paper, we design and implement a new intrusion detection and prevention schema for vehicular networks. It has the ability to detect and predict with a high accuracy a future malicious behavior of an attacker. This is unlike the current detection schémas, where there is no prevention technique since they aim to detect only current attackers that occur in the network. We used game theory concept...
In this paper, we investigate the bottleneck traffic problems that are caused and/or amplified by path recommendation protocols in use. Distributed path recommendation protocols construct the path towards each destination in a hop-by-hop fashion. In some scenarios most of traveling vehicles, arriving the road intersection from several input road segments, are recommended to leave at the same output...
Position information of nodes in vehicular ad hoc networks (VANETs) plays a key role in geographic routing. A sender or intermediate node employs position information of its neighbors and destination node to make routing decision. Under a greedy forwarding algorithm, the neighboring node closest to the destination node is selected as the next hop. Hence, it is critical in geographic routing to ensure...
This paper develops an analytical model for analyzing the access performance of the IEEE 802.11p EDCA mechanism. A 2-D Markov chain is first constructed to describe the backoff procedure of an AC queue and establish a relationship between the transmission probability and collision probability of the AC queue. Then a 1-D infinite discrete-time Markov chain is constructed to describe the contention...
The data delivery in Vehicular Ad Hoc Networks (VANETs) depends on the mobility of the vehicles (e.g. with carry-and-forward). However, the mobility of the vehicles is not only affected by the nodes themselves, but also by some external means such as the traffic lights. The red light stops the vehicles at the intersection, which will increase the delivery delay of the messages carried by the vehicle...
Vehicular Ad-hoc networks (VANETs) provide a way for a vehicle to deliver various types of information to users or drivers in other vehicles. Distributing a large amount of information such as multimedia messages in a single control channel makes the control channel easily congested. Transmitting multimedia messages through multi-channel to avoid this congestion becomes a feasible solution. However,...
Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if the wireless network topologies contain voids, where a packet cannot be moved closer to destination. Since Yao graph and Theta graph are two types of geometric graphs exploited to construct wireless network topologies, this paper firstly studied whether these two types of graphs can contain...
Data routing has gained great intention since the appearance of Vehicular Networks (VANETs). However, in the presence of attackers, reliable and trustworthy operations in such networks become impossible without securing routing protocols. In this paper, we target to study and design a secure routing protocol S-GyTAR for vehicular environments. Several kinds of routing techniques are proposed in the...
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.