Content uploaded by Mamoun Mamoun
Author content
All content in this area was uploaded by Mamoun Mamoun
Content may be subject to copyright.
A preview of the PDF is not available
A Newly Routing Protocol for MANET.
Abstract
The dynamic topology of Mobile ad hoc Network {MANET) allows nodes to join and leave the network at any point of time. This dynamic property of MANET has rendered it vulnerable to passive and active attacks by malicious nodes. In this paper we propose a new trust based relationship among the nodes to combat the packet dropping attack. In our scheme we considered the Dynamic Source Routing (DSR) protocol for simulation due to its common usage and flexible nature. Simulation results are used to draw conclusions regarding to the proposed scheme and compared it with the standard DSR protocol. Conducted experiments showed that the proposed scheme outscores the traditional DSR protocol in all aspects. Furthermore, the proposed trust enhanced dynamic source routing protocol provides the solution for the possible packet dropping attack in an ad hoc network.
Petersen-Gaussian (PG) networks are a broad family of interconnection networks for multi processor systems proposed recently. In this paper, a special case of PG networks, called Petersen- Twisted-Torus (PTT) network, is considered. We analyze the diameter of PTT network, and find that PTT has smaller diameter and lower costing requirement than the well-known honeycomb mesh, diagonal mesh, torus, hexagonal torus, honeycomb torus and Petersen torus networks.
In a public mobile ad hoc network (MANET), users may be selfish and refuse to forward packets for other users. Therefore, an incentive mechanism must be in place. We adopt the "pay for service" model of cooperation, and propose an auction-based incentive scheme (called iPass) to enable cooperative packet forwarding behavior in MANET. Each flow pays the market price of packet forwarding service to the intermediate routers. The resource allocation mechanism in our scheme is based on the generalized Vickrey auction with reserve pricing. We prove that in our scheme, user's truthful bidding of utility remains a dominant strategy, users and routers have incentive to participate in the scheme, and packet forwarding always leads to higher social welfare for the whole network. We design a signaling protocol to implement the scheme, and show that it can serve as an explicit rate-based flow control mechanism for the network. Therefore, iPass is a joint solution of incentive engineering and flow control in a noncooperative MANET. Simulation results show that iPass is able to determine the auction outcome quickly, and at the same time achieve the goals of flow control.
In the near future, many personal electronic devices will be able to communicate with each other over a short range wireless channel. We investigate the principal security issues for such an environment. Our discussion is based on the concrete example of a thermometer that makes its readings available to other nodes over the air. Some lessons learned from this example appear to be quite general to ad-hoc networks, and rather different from what we have come to expect in more conventional systems: denial of service, the goals of authentication, and the problems of naming all need re-examination. We present the resurrecting duckling security policy model, which describes secure transient association of a device with multiple serialised owners.
Securing the operation of ad hoc networking protocols is a multifaceted and complex problem that poses new and unique challenges.
All network nodes constitute a self-organizing infrastructure, while operating in an inherently unreliable and insecure environment.
The boundaries of an ad hoc network are blurred, if not inexistent, and its membership may frequently change. Without security
measures, attackers have ample opportunity to control, disrupt, and degrade the services or even disable communications of
other users. As a result, applications based on the ad hoc networking technology cannot proliferate, unless such vulnerabilities
are eradicated. For example, search-and-rescue, law enforcement, or battlefield networks must guarantee secure and reliable
communication, even if a significant fraction of the network nodes are disabled or controlled by an adversary. Similarly,
users will not enable their portable devices to join and form ad hoc networks, unless access to the sought services is protected
from compromise. This talk discusses threats and security measures, focusing on a comprehensive solution for secure and fault-tolerant
communication in ad hoc networks. We discuss our design of a protocol suite that addresses the security of the route discovery
and the security of the data transmission in ad hoc networks. The presented material reflects on-going research, as well as
research conducted over the past four years at Cornell University under the supervision of Prof. Z. J.Haas.
Since devices used in wireless mobile ad hoc networks are generally supplied with limited autonomous resources, energy conservation is one of the most significant aspects in these networks. Recent studies show that the energy consumed for routing data-packets in mobile ad hoc networks can be significantly reduced compared with the min-hop full-power routing protocols. One of the promising mechanisms proposed in literature to reduce the energy consumption is the transmission power control. In this paper, we define new routing metrics to strike a balance between the required power minimisation and batteries freshness consideration. We also define a new technique which allows the distribution of the routing task over nodes. Using these metrics and techniques we derive from DSR [2] a new power-aware and power-efficient routing protocol, whose performance is analysed by simulation in different situations of mobility and network load.
Supervised by Dave Clark. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1988. Includes bibliographical references.