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.
Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pair-wise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix-based pairwise key establishment scheme for mesh clients. Our design is motivated by the fact that in WMNs, mesh routers are more...
In this paper we present a practical approach to relative positioning of heterogeneous mass market devices. We propose a user-centric solution exploiting measurements from on-the-fly fixed reference points detected during scanning procedures. The technique implemented on mobile devices is able to locate neighboring nodes, demonstrating to be a feasible and practical solution for sensing spatial social...
This paper discusses the price discrimination in wireless service allocation on the basis of game theory. The wireless service providers can supply the service with different prices. Two service price discrimination models are proposed. The first one is one wireless service provider with n types of wireless users. Each type has different preference parameter. The wireless users are proved to be individual...
Secure and efficient communication among a set of mobile node is one of the most important research subjects in ad hoc wireless networks. Due to the resource scarcity in ad hoc networks, traditional key management protocol cannot be effectively applied to such decentralized networks. After study different strategies, in this paper the trust evaluation based clustering technique is employed to propose...
To overcome the issue of limited information about unfamiliar nodes and to reduce the required memory space, a reputation-based trust management strategy for clustered ad hoc networks is proposed in this paper. Basically, our solution begin with gathering neighboring nodes as a cluster with a node selected as the cluster head who is responsible of issuing a trust certificate to every cluster member...
Hexagons are an ideal shape for clustering sensor networks, because clustered areas can be seamlessly divided by the hexagons. In addition, hexagons are the largest regular polygon (in terms of the number of sides) that has this property. In this paper, we propose a novel scheme for subdividing a hexagonal cluster where sensors are densely populated and distributed uniformly throughout the cluster...
There are some papers on secure or anonymous routing protocol in mobile ad-hoc networks. However, due to their original design goal, most of them are vulnerable to attacks and inefficient. In fact, providing security and anonymity are critical in wireless ad hoc networks. In this paper, we present an efficient secure anonymous routing protocol for clustered mobile ad-hoc networks, which not only solves...
This paper introduces a design for mobile node of sensor networks using robot. The robot is composed of micro processor module based on AT91RM9200, Bluetooth module, wireless network card (SISCO AIR-PCM350), GPS module, mobile base and motionless Bluetooth sensor node distributing module. Embedded arm-linux OS installed on micro processor module based on AT91RM9200 makes it have the ability of processing...
Topology control is an effective measure at network layer to implement power control for energy-saving, which is a critical issue in ad-hoc wireless networks. Topology control also affects other significant performances of network, such as packet delivery radio, end-to-end delay, and network capacity etc. Various techniques and algorithms have been proposed to achieve the optimal topology which can...
In wireless ad hoc networks, the route discovery process or the data forwarding process is vulnerable to attackers. In this paper, we address the data forwarding security problem and propose a light-weight secure data forwarding protocol, which utilizes one-way hash chains to achieve the message integrity, where the intermediate nodes can effectively detect the fault link and the source node of the...
Wireless ad hoc networks , especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is critical securing measure used to mitigate these problems. In this paper, we propose a novel secure anonymous routing scheme for clustered wireless ad hoc networks. In...
We introduce a game-theoretic setting for routing in mobile ad hoc networks in this paper. We implement the continuous double auction (CDA), a double auctioning mechanism in ad hoc networks and propose our routing protocols based on it. This mechanism can stimulate nodes to cooperate with each other and the aim to allocate routes in communication would be achieved. It is the first time that double...
MANET (mobile ad hoc network) is a collection of wireless mobile nodes forming a temporary communication network without the aid of any established infrastructure. Because mobile nodes are typically constrained by power and computing resources, a selfish node may not be willing to use its computing and energy resources to forward packets that are not directly beneficial to it, even though it expects...
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.