A contention-based wireless ad hoc medium access control (MAC) protocol, such as carrier sense multiple access with collision avoidance (CSMA/CA), has the excellence of simple and efficient when the system is light-loaded. The main drawback of such protocols is their inefficiency and unbounded delay when system load is heavy. On the other hand, a contention-free MAC protocol, such as token pass...

In this paper, we propose to apply Contention-Based Forwarding (CBF) to Vehicular Ad Hoc Networks (VANETs). CBF is a greedy positionbased forwarding algorithm that does not require proactive transmission of beacon messages. CBF performance is analyzed using realistic movement patterns of vehicles on a highway. We show by means of simulation that CBF as well as traditional position-based routing...

The focus of this thesis lies in investigating possible abuse of the standardized medium access protocol 802.11a within Wireless Local Area Networks (WLAN). By modifying the Contention Window (CW), a network can capture more traffic in expense of its rivals. The competing network scenarios are modeled by the use of Game Theory, applying simple and repeated form games. We argue that by modifying...

Location privacy protection in VANETs considers preserving two types of information: the locations and identifications of users. However, existing solutions which either replace identifications by pseudonyms or hide locations in areas cannot be directly applied to geographic routing protocols since they degrade network performance. To address this issue, we proposed a location-preserved content...

A contention-based wireless ad hoc medium access control (MAC) protocol, such as carrier sense multiple access with collision avoidance (CSMA/CA), has excellent efficiency when the system is light loaded. The main drawback of such protocols is their inefficiency and unbounded delay when the system load is heavy. On the other hand, a contention-free MAC protocol, such as token passing, has a bet...

Routing of VANETs is a challenging issue that has attracted many attentions of researchers recently. Contention based routing protocols have good congruity with high mobility of nodes in this kind of networks. Prevention from forwarding duplicate packets is an important challenge in such routing protocols. Indeed, such duplications can reduce scalability and efficiency of contention based routi...

In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture measurement to a measure of the probability that a constraint will be broken. We define three methods for the estimation of this probability and show that they perform as well or better than existing heuristics on job...

This paper studies the Ant-based packet contention resolution schemes for the singlestage shared FDL optical packet switches. A new Ant-based algorithm is proposed, namely delaybased FDL assignment and number–delay-based FDL assignment. The proposed algorithm can makes FDLs and output port reservation so as to improve the cell-loss rate under various traffic loads. The proposed contention resol...

In VANETs, vehicles as nodes are self-organized and inter-communicated without centralized authority. The topology formed by vehicles changes quickly, which makes routing become instability. Position-based routing, compared with traditional routing, is more scalable and feasible. Thus it has been proven stabler for VANETs than conventional routing. However, the frequently changed topology and n...

Routing the packets efficiently in mobile ad hoc network does not have end to end paths. Multiple copies are forwarded from the source to the destination. To deal with such networks, researches introduced flooding based routing schemes which leads to high probability of delivery. But the flooding based routing schemes suffered with contention and large delays. Here the proposed protocol “Spray ...